On the performance of TCP over throughput-optimal CSMA
Wei Chen,Yue Wang,Minghua Chen,Soung Chang Liew +3 more
- pp 1-9
Reads0
Chats0
TLDR
The results show that adaptive CSMA can work well with only light-weight TCP modifications, bringing it a step closer to practicality, and proposes a multi-connection TCP solution with active queue management that can work with adaptiveCSMA to achieve optimal utility.Abstract:
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.read more
Citations
More filters
Proceedings ArticleDOI
Optimal CSMA: A survey
TL;DR: This survey paper summarizes the recent research efforts in this area with main focus on the key intuitions and rationales, and concludes by presenting some open problems.
Journal ArticleDOI
Making 802.11 DCF near-optimal: design, implementation, and evaluation
TL;DR: The performance of O-DCF is evaluated and it is shown that it achieves near-optimality in terms of throughput and fairness and outperforms other competitive ones, such as 802.11 DCF, optimal CSMA, and DiffQ for various scenarios.
Journal ArticleDOI
Improving TCP Performance over Optimal CSMA in Wireless Multi-Hop Networks
TL;DR: This letter shows that just a simple, additional virtual queue at the MAC layer can significantly improve TCP performance when oCSMA is used as the underlying MAC, and achieves near-optimal throughput performance in various scenarios.
Posted Content
Making 802.11 DCF Optimal: Design, Implementation, and Evaluation
TL;DR: This paper proposes a new protocol called Optimal DCF, which modifies the rule of adapting CSMA parameters, such as backoff time and transmission length, based on a function of the demand-supply differential of link capacity captured by the local queue length, and shows that it achieves near-optimality, and outperforms other competitive ones.
Proceedings ArticleDOI
A-DCF: Design and implementation of delay and queue length based wireless MAC
Hojin Lee,Sangwoo Moon,Yung Yi +2 more
TL;DR: This paper proposes a new wireless MAC protocol, called A-DCF, that inherits the basic framework and rationale of Optimal CSMA and O-DCf, but are largely redesigned to make A- DCF work well with TCP.
References
More filters
Journal ArticleDOI
Random early detection gateways for congestion avoidance
Sally Floyd,Van Jacobson +1 more
TL;DR: Red gateways are designed to accompany a transport-layer congestion control protocol such as TCP and have no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time.
Journal ArticleDOI
Fair end-to-end window-based congestion control
Jeonghoon Mo,Jean Walrand +1 more
TL;DR: The existence of fair end-to-end window-based congestion control protocols for packet-switched networks with first come-first served routers is demonstrated using a Lyapunov function.
Proceedings ArticleDOI
Impact of interference on multi-hop wireless network performance
TL;DR: It is shown that the routes derived from the analysis often yield noticeably better throughput than the default shortest path routes even in the presence of uncoordinated packet transmissions and MAC contention, suggesting that there is opportunity for achieving throughput gains by employing an interference-aware routing protocol.
Journal ArticleDOI
Approximation algorithms for NP-complete problems on planar graphs
TL;DR: A general technique that can be used to obtain approximation algorithms for various NP-complete problems on planar graphs, which includes maximum independent set, maximum tile salvage, partition into triangles, maximum H-matching, minimum vertex cover, minimum dominating set, and minimum edge dominating set.
Journal ArticleDOI
Explicit allocation of best-effort packet delivery service
David D. Clark,Wenjia Fang +1 more
TL;DR: This paper focuses on algorithms for essential components of the "allocated-capacity" framework: a differential dropping algorithm for network routers and a tagging algorithm for profile meters at the edge of the network for bulk-data transfers.