On the performance of TCP over throughput-optimal CSMA

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.

[1]  Thinh Nguyen,et al.  Multimedia streaming using multiple TCP connections , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..

[2]  Feng Jiang,et al.  Congestion Control in Multihop Wireless Networks , 2007, IEEE Transactions on Vehicular Technology.

[3]  Minghua Chen,et al.  Multiple TFRC Connections Based Rate Control for Wireless Networks , 2006, IEEE Transactions on Multimedia.

[4]  R. Srikant,et al.  Network Optimization and Control , 2008, Found. Trends Netw..

[5]  Lijun Chen,et al.  Joint congestion control and media access control design for ad hoc wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[7]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[8]  Minghua Chen,et al.  Flow Control Over Wireless Network and Application Layer Implementation , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Soung Chang Liew,et al.  Improving Throughput and Fairness by Reducing Exposed and Hidden Nodes in 802.11 Networks , 2008, IEEE Transactions on Mobile Computing.

[10]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2005, Wirel. Networks.

[11]  Devavrat Shah,et al.  Distributed algorithm and reversible network , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[12]  Koushik Kar,et al.  Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[13]  David D. Clark,et al.  Explicit allocation of best-effort packet delivery service , 1998, TNET.

[14]  Xiaojun Lin,et al.  Joint rate control and scheduling in multihop wireless networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[15]  Mung Chiang,et al.  Equilibrium of heterogeneous congestion control: existence and uniqueness , 2007, TNET.

[16]  Jinsung Lee,et al.  Implementing utility-optimal CSMA , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[17]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[18]  Soung Chang Liew,et al.  TCP over Adaptive CSMA , 2010 .

[19]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[20]  Ramesh Govindan,et al.  Neighborhood-Centric Congestion Control for Multihop Wireless Mesh Networks , 2011, IEEE/ACM Transactions on Networking.

[21]  Sen-Ching S. Cheung,et al.  Multimedia streaming using multiple TCP connections , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..

[22]  H. Vincent Poor,et al.  Towards utility-optimal random access without message passing , 2010, Wirel. Commun. Mob. Comput..

[23]  Basil S. Maglaris,et al.  Throughput Analysis in Multihop CSMA Packet Radio Networks , 1987, IEEE Trans. Commun..

[24]  Jean C. Walrand,et al.  A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[25]  Jian Ni,et al.  Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2010, INFOCOM 2010.

[26]  Minghua Chen,et al.  Markov Approximation for Combinatorial Network Optimization , 2013, IEEE Transactions on Information Theory.