Effectiveness and issues of congestion control in 802.11g wireless LANs
Wireless Networks
| Hi-index | 0.00 |
Binomial congestion control was proposed by Bansal and Balakrishnan in [2]. However, the sending rate derivation in [2] is greatly simplified and does not consider the effect of timeouts. The motivation of this paper is to analyze the sending rate of binomial congestion window adjustment policy, considering both tripli-duplicate loss indications and timeout loss indications. We also consider the selection of "alpha" and "beta" for HAD and SQRT congestion control strategies [2] to be TCP-friendly. This paper suggests that the authors of Binomial should test their protocol under higher loss scenarios. The balance of this paper is as follows. In Section 2, we describe the Binomial congestion control and state the analysis assumptions. The detail of the derivations is put in the Appendix. In Section 3, we use the sending rate formula to derive conditions under which a Binomial flow is TCP-friendly.