#### DMCA

## Modeling the Effect of Transmission Errors on TCP Controlled Transfers over Infrastructure 802.11 Wireless

### Citations

1868 | Performance analysis of the IEEE 802.11 distributed coordination function - Bianchi - 2000 |

894 |
Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach
- Neuts
- 1981
(Show Context)
Citation Context ...S2 0 A2 . . . ... ... ... ... . . . (14) where Ax and Sx, x > 0 are non-negative matrices of order C. It can be observed that the DTMC is a level dependent Quasi-Birth-and-Death (LDQBD) process =-=[22]-=-, where the number of active STAs represents the level and the class of the HOL packet represents the phase. Since pa(x, i) ∈ (0, 1), the right-hand side of 11 and 12 are positive if ηj > 0, for all j... |

464 | The performance of TCP/IP for networks with high bandwidth-delay products and Random loss
- Lakshman, Madhow
- 1997
(Show Context)
Citation Context ...ch station with saturated queues is considered in [12, 20]. On the other hand, there have been many models which analyze the performance of TCP over wireless links by considering random packet losses =-=[18, 14]-=-. However, these papers consider point-to-point wireless links. Mare et al. [21] analyze the effect of channel errors in an IEEE 802.11 WLAN for the simple case of single TCP long file transfer. To th... |

370 | Modeling TCP Reno performance: a simple model and its empirical validation
- Padhye, Firoiu, et al.
(Show Context)
Citation Context ... AP buffer size is large enough to avoid buffer overflows. Later, in Section 5, we extend the analysis to finite buffer size. To analyze the window evolution, the concept of rounds similar to that in =-=[23]-=- is used. A round ends when all the packets present in the AP buffer at the beginning of the round have been either transmitted successfully or discarded. The end of a round is the beginning of the ne... |

280 |
Modeling and analysis of stochastic systems
- Kulkarni
- 1995
(Show Context)
Citation Context ...ty of the number of active STAs exceeding M is very small for this DTMC (see Approximation A2). Also, since Gk+1 −Gk depends only on (Xk, Hk), {((Xk, Hk), Gk) , k ≥ 0} forms a Markov renewal sequence =-=[13]-=-. The DTMC, {(Xk, Hk), k ≥ 0} has the following transition probabilities, Pr{(Xk+1, Hk+1) = (x+1, j)|(Xk, Hk) = (x, i)} = pa(x, i)ηj (11) Pr{(Xk+1, Hk+1) = (x−1, i)|(Xk, Hk) = (x, i)} = 1−pa(x, i) (12... |

210 | Bit-rate Selection in Wireless Networks,
- Bicket
- 2005
(Show Context)
Citation Context ...el conditions. Some recent rate adaptation algorithms ([2, 17]) estimate the packet error rate periodically and adjust the transmission rates by comparing the error rate with some thresholds. Others (=-=[6, 1]-=-) use a combination of factors such as estimates of the throughput and, the probability of success, to adapt the rates. A model that predicts the throughputs obtained at different data transmission ra... |

195 | Comparative performance analysis of versions of TCP in a local network with a lossy link.
- Kumar
- 1998
(Show Context)
Citation Context ...ch station with saturated queues is considered in [12, 20]. On the other hand, there have been many models which analyze the performance of TCP over wireless links by considering random packet losses =-=[18, 14]-=-. However, these papers consider point-to-point wireless links. Mare et al. [21] analyze the effect of channel errors in an IEEE 802.11 WLAN for the simple case of single TCP long file transfer. To th... |

186 |
Introduction to Matrix-Analytic Methods
- Latouche, Ramaswami
- 1999
(Show Context)
Citation Context ...onary probabilities for the states in level x, i.e., pix(i) which is the ith element of pix is the stationary probability that the process, {(Xk, Hk), k ≥ 0} takes the value (x, i). Theorem 12.1.1 in =-=[19]-=- proves that when the process is irreducible and positive recurrent, the stationary distribution has the matrix-product form, pix+1 = pixRx, x ≥ 0 where Rx, (x ≥ 0) are square matrices of order C. Rx ... |

174 |
11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specification,
- Part
- 1999
(Show Context)
Citation Context ...umber of attempts is called the dot11LongRetryLimit, denoted by Kl. After the number of attempts for a frame reaches its maximum (Ks or Kl according to the size of the frame), the packet is discarded =-=[3]-=-. Table 1 shows the various parameters used in the analysis and simulation. 2.1 System Model Let M be the total number of STAs indexed by 1 ≤ j ≤ M . Each STA can be associated with the AP at a differ... |

146 | T.: IEEE 802.11 rate adaptation: a practical approach. In:
- Lacage, Manshaei, et al.
- 2004
(Show Context)
Citation Context ... at the PHY layer. The aim of rate adaptation algorithms is to exploit this multirate capability to obtain the best throughput in different channel conditions. Some recent rate adaptation algorithms (=-=[2, 17]-=-) estimate the packet error rate periodically and adjust the transmission rates by comparing the error rate with some thresholds. Others ([6, 1]) use a combination of factors such as estimates of the ... |

125 | CUBIC: A new TCP-friendly high-speed TCP variant. - Ha, Rhee, et al. - 2008 |

69 | New insights from a fixed-point analysis of single cell ieee 802.11 wlans,”
- Kumar, Altman, et al.
- 2007
(Show Context)
Citation Context ...to be downlink in nature. Related Literature. There is a vast literature on performance modeling of the MAC protocol in IEEE 802.11 WLANs under various traffic scenarios. There have been many models (=-=[25, 15]-=-) which use Bianchi’s fixed point analysis [5] of saturated nodes in a single-cell network. Bruno et al. [8] studied TCP file downloads by modeling the interaction of TCP with a p-persistent IEEE 802.... |

51 |
Equilibrium distributions for level-dependent quasi-birth-anddeath processes
- Bright, Taylor
- 1997
(Show Context)
Citation Context ...n, therefore, be obtained by solving the following system of equations for pi0: pi0 = pi0R0S1 and pi0( ∑∞ x=0 ∏x−1 n=0 Ri)e = 1. To compute the matrices, Rx, we use the algorithm by Bright and Taylor =-=[7]-=- in which the transition probability matrix is truncated at some large level, N . Having obtained the stationary distribution, we can find, 1) the TCP throughput, Θ (TCP ) i obtained by a STA belongin... |

30 | capacity analysis for the ieee 802.11 mac protocol - Tay, Chua - 2001 |

18 | Analytical models for capacity estimation of IEEE 802.11 WLANs using DCF for Internet applications,” Wireless Networks
- Kuriakose, Harsha, et al.
- 2006
(Show Context)
Citation Context ...er the case when there are M STAs that are downloading large files from the local server. Taking the assumptions in Section 2 into consideration, we can develop a stochastic model akin to the ones in =-=[16, 4]-=-. Consider the aggregate process of channel contention and activity (see Fig. 2). Since we have long file transfers and no external arrivals, the states of the AP and the STA queues can change only at... |

11 |
Performance modelling and measurements of TCP transfer throughput
- Bruno, Conti, et al.
- 2006
(Show Context)
Citation Context ...col in IEEE 802.11 WLANs under various traffic scenarios. There have been many models ([25, 15]) which use Bianchi’s fixed point analysis [5] of saturated nodes in a single-cell network. Bruno et al. =-=[8]-=- studied TCP file downloads by modeling the interaction of TCP with a p-persistent IEEE 802.11 MAC protocol by using Markov chain analysis for the number of stations that are contending for the wirele... |

6 |
An exploration of random processes for engineers
- Hajek
- 2011
(Show Context)
Citation Context ...x, i) ∈ (0, 1), the right-hand side of 11 and 12 are positive if ηj > 0, for all j and therefore, P is irreducible if ηj > 0, for all j. It can be proved using the Foster-Lyapunov stability criterion =-=[11]-=- that the process is positive recurrent. Theorem 1. The LDQBD {(Xk, Hk), k ≥ 0} is positive recurrent. Proof. Let V (x, i) = x and B = {(x, i) : 0 ≤ x ≤ 1, 1 ≤ pa(x, i) = βa(x, i)(1− βs(x, i))x(1− εi)... |

5 | Modeling finite buffer effects on tcp traffic over an ieee 802.11 infrastructure wlan
- Bhardwaj, Sharma, et al.
- 2009
(Show Context)
Citation Context ...rom the AP, it is assumed that it immediately generates an ACK to be queued for transmission. From the above arguments we make the approximation that an STA can have at most one TCP ACK in its buffer =-=[8, 16, 4]-=-. A3 Since the server is connected to the AP on a high speed Ethernet, it is assumed (as in [16, 8, 4]) that the AP is the bottleneck for the TCP transfers and it always has packets in its buffer to c... |

3 | Experimental validation of analytical performance models for IEEE 802.11 networks
- Mare, Kotz, et al.
- 2010
(Show Context)
Citation Context ... have been many models which analyze the performance of TCP over wireless links by considering random packet losses [18, 14]. However, these papers consider point-to-point wireless links. Mare et al. =-=[21]-=- analyze the effect of channel errors in an IEEE 802.11 WLAN for the simple case of single TCP long file transfer. To the best of our knowledge, the interaction between packet losses, CSMA/CA random a... |

2 |
Towards the Centralized Control of Channel Allocation and Scheduling
- Subhashini
- 2011
(Show Context)
Citation Context ...hanism to transmit its packets while the STAs transmit in the Basic Access mode. It can be shown that, in both the cases the fixed point equations have a unique solution for βa and βs for any ε and n =-=[24]-=-. 3.1 RTS-CTS Disabled In this case, the data frames are retransmitted until the number of attempts reaches dot11ShortRetryLimit, Ks. With αa and αs as defined above, the attempt probabilities of the ... |

1 |
Performance improvement of error-prone multi-rate wlans through adjustment of access/frame parameters
- Jung, Kim, et al.
- 2009
(Show Context)
Citation Context ...uthors assume ideal channel conditions and that frames can be received in error only due to collision. Some researchers have recently extended the 802.11 saturation analysis to include channel errors =-=[9, 12, 20]-=-. Chatzimisios et al. [9] perform saturation analysis assuming that all stations are associated at the same rate and experience the same BER. Multi-rate and different BER for each station with saturat... |

1 |
A study on the influence of transmission errors on wlan ieee 802.11 mac performance
- Lopez-Aguilera, Casademont, et al.
- 2010
(Show Context)
Citation Context ...uthors assume ideal channel conditions and that frames can be received in error only due to collision. Some researchers have recently extended the 802.11 saturation analysis to include channel errors =-=[9, 12, 20]-=-. Chatzimisios et al. [9] perform saturation analysis assuming that all stations are associated at the same rate and experience the same BER. Multi-rate and different BER for each station with saturat... |