In a multirate WLAN with a single access point (AP) and several stations (STAs), we obtain analytical expressions for TCP-controlled long file transfer throughputs allowing nonzero propagation delays between the file server and STAs. We extend our earlier work in [3] to obtain AP and STA throughputs in a multirate WLAN, and use these in a closed BCMP queueing network model to obtain TCP throughputs. Simulation show that our approach is able to predict observed throughputs with a high degree of accuracy.
@cite_16 provides an analysis for a given number of STAs and maximum TCP receive window size by using the well known @math persistent model proposed in @cite_11 . However both @cite_16 and @cite_11 do not consider the effect of RTT on the performance. In @cite_0 , a queueing model is proposed to compute the mean session delay of HTTP sessions in the presence of short-lived TCP flows and the impact of TCP maximum congestion window size on this delay is studied.
@cite_0 @cite_16 @cite_11
2100166367 2120535412 1986442642 2117068155
High-speed networks with large delays present a unique environment where TCP may have a problem utilizing the full bandwidth. Several congestion control proposals have been suggested to remedy this problem. The existing protocols consider mainly two properties: TCP friendliness and bandwidth scalability. That is, a protocol should not take away too much bandwidth from standard TCP flows while utilizing the full bandwidth of high-speed networks. This work presents another important constraint, namely, RTT (round trip time) unfairness where competing flows with different RTTs may consume vastly unfair bandwidth shares. Existing schemes have a severe RTT unfairness problem because the congestion window increase rate gets larger as the window grows ironically the very reason that makes them more scalable. RTT unfairness for high-speed networks occurs distinctly with drop tail routers for flows with large congestion windows where packet loss can be highly synchronized. After identifying the RTT unfairness problem of existing protocols, This work presents a new congestion control scheme that alleviates RTT unfairness while supporting TCP friendliness and bandwidth scalability. The proposed congestion control algorithm uses two window size control policies called additive increase and binary search increase. When the congestion window is large, additive increase with a large increment ensures square RTT unfairness as well as good scalability. Under small congestion windows, binary search increase supports TCP friendliness. The simulation results confirm these properties of the protocol. We consider an IEEE 802.11 based wireless LAN where an access point is used to connect a fixed number of users to the Web or to a shared file system. Users alternate between activity periods (corresponding to the download of a file) and idle periods (corresponding to think times). We first consider the interaction of TCP with the IEEE 802.11 MAC protocol, and get approximate expressions for the TCP throughput in the presence of n"c competing persistent connections. This result is then used to develop a queueing model, which provides the mean session delay in the presence of short-lived flows. The analysis also accounts for the TCP delayed ACK option. Comparison with simulation outcomes is provided, validating the model and providing guidelines for network designers. A particular emphasis is devoted to the impact of the TCP's advertised window size; in particular, it is proved that setting it to a small value leads to insensitivity of mean file transfer times to the file size distribution. Several high-speed TCP variants are adopted by end users and therefore, heterogeneous congestion control has become the characteristic of newly emerging high-speed optical networks. In contrast to homogeneous TCP flows, fairness among heterogeneous TCP flows now depends on router parameters such as queue management scheme and buffer size. To the best of our knowledge, this is the first study of fairness performance among heterogeneous TCP variants over a 10 Gbps high-speed optical network environment. Our evaluation scenarios for heterogeneous TCP flows consist of TCP variants with substantial presence in current Internet; therefore, TCP-SACK, CUBIC TCP (CUBIC) and HighSpeed TCP (HSTCP) compete for bottleneck bandwidth. Experimental results for fairness are presented for different queue management schemes, such as Drop-tail, Random Early Detection (RED), CHOose and Keep for responsive flows CHOose and Kill for unresponsive flows (CHOKe), and Approximate Fair Dropping (AFD), with varying degree of buffer sizes. We observe heterogeneous TCP flows induce more unfairness than homogeneous ones. Active queue management (AQM) schemes, RED, CHOKe, and AFD, improve fairness for large buffer sizes as compared to Drop-tail, whereas AQM schemes lose the fairness advantage for small buffer sizes. This study provides preliminary results for fairness challenges to deploy all-optical routers with limited buffer size. We consider a discrete-time stochastic model of an ECN RED gateway where competing TCP sources share the link capacity. As the number of competing flows becomes large, the asymptotic queue behavior (normalized by the number of flows) at the gateway can be described by a simple recursion and the throughput behavior of individual TCP flows becomes asymptotically independent. A Central Limit Theorem complement is also presented, yielding a more accurate characterization of the asymptotic queue size. These results suggest a scalable yet accurate model of this complex large-scale stochastic feedback system, and crisply reveal the sources of queue fluctuations.