Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Explicit allocation of best-effort packet delivery service
IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Impact of interference on multi-hop wireless network performance
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Equilibrium of heterogeneous congestion control: existence and uniqueness
IEEE/ACM Transactions on Networking (TON)
Improving Throughput and Fairness by Reducing Exposed and Hidden Nodes in 802.11 Networks
IEEE Transactions on Mobile Computing
Network optimization and control
Foundations and Trends® in Networking
Multimedia streaming using multiple TCP connections
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Capacity of large-scale CSMA wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Towards utility-optimal random access without message passing
Wireless Communications & Mobile Computing - Recent Advances in Wireless Communications and Networks
Implementing utility-optimal CSMA
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
INFOCOM'10 Proceedings of the 29th conference on Information communications
Markov approximation for combinatorial network optimization
INFOCOM'10 Proceedings of the 29th conference on Information communications
Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks
IEEE Transactions on Mobile Computing
Multiple TFRC Connections Based Rate Control for Wireless Networks
IEEE Transactions on Multimedia
Neighborhood-centric congestion control for multihop wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
An interesting distributed throughput-optimal CSMA MAC protocol, called adaptive CSMA, was proposed recently to schedule any strictly feasible rates inside the capacity region. Of particular interest is the fact that the adaptive CSMA can achieve a system utility arbitrarily close to that is achievable under a central scheduler. However, a specially designed transport-layer rate controller is needed for this result. An outstanding question is whether TCP Reno (one of the most mature versions of TCP) is compatible with adaptive CSMA and can achieve the same result. The answer to this question will determine how close to practical deployment adaptive CSMA is. Our answer is yes and no. First, we observe that running TCP Reno directly over adaptive CSMA results in severe starvation problems. Effectively, its performance is no better than that of TCP Reno over legacy CSMA (IEEE 802.11), and the potentials of adaptive CSMA cannot be realized. We then propose a multi-connection TCP solution with active queue management and prove that it can work with adaptive CSMA to achieve optimal utility. NS-2 simulations demonstrate that our solution can alleviate starvation and achieve fair and efficient rate allocation. We remark that multi-connection TCP can be implemented at either application or transport layer. Application-layer implementation requires no kernel modification, making the solution readily deployable in networks running adaptive CSMA. Our results show that adaptive CSMA can work well with only light-weight TCP modifications, bringing it a step closer to practicality.