Throughput of a Network Shared by TCP Reno and TCP Vegas in Static Multi-hop Wireless Network

Previous study has shown the superiority of TCP Vegas over TCP Reno in wired and wireless network. However, when both Reno and Vegas co-exist on a wired link, protocol Vegas dominated by Reno due to its conservative nature. However, previous study does not include all the issues which might be arising during communication in the network. This paper finds the performance (throughput and fairness) of a network shared by Reno and Vegas in static multi hop wireless ad hoc network focusing on four issues. Here we introduced a new parameter called PST (Percentage Share of Throughput) which measures fairness among different connections shared by a common link. The issues are: (1) Both Reno and Vegas flows in forward direction, (2) Reno flows in forward and Vegas flows in reverse direction, (3) Both Reno and Vegas flows in forward direction along with bursty UDP traffic in background, (4) Both Reno and Vegas flows in forward direction where receiver is enabled with delayed acknowledgement (DelAck) schemes. Our result shows that Reno and Vegas are more compatible (or fairer) when DSDV protocol is used and their PST is much closer to each other (around 50 %). For increased hop length, DSDV is better routing protocol for all issues we have considered. However, use of DelAck techniques improves the throughput than others.

[1]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[2]  Ljiljana Trajkovic,et al.  RED with Dynamic Thresholds for improved fairness , 2004, SAC '04.

[3]  Larry Peterson,et al.  TCP Vegas: new techniques for congestion detection and avoidance , 1994, SIGCOMM 1994.

[4]  Carey L. Williamson,et al.  Providing fairness between TCP NewReno and TCP Vegas with RD network services , 2010, 2010 IEEE 18th International Workshop on Quality of Service (IWQoS).

[5]  Sukant Kishoro Bisoy,et al.  Interaction between Internet Based TCP Variants and Routing Protocols in MANET , 2013, FICTA.

[6]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[7]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[8]  Masayuki Murata,et al.  Analysis and improvement of fairness between TCP Reno and Vegas for deployment of TCP Vegas to the Internet , 2000, Proceedings 2000 International Conference on Network Protocols.

[9]  H. Balakrishnan,et al.  How network asymmetry affects TCP , 2001, IEEE Communications Magazine.

[10]  Mahesh Sooriyabandara,et al.  TCP Performance Implications of Network Path Asymmetry , 2002, RFC.

[11]  Robert Tappan Morris,et al.  Capacity of Ad Hoc wireless networks , 2001, MobiCom '01.

[12]  Wu-chun Feng,et al.  Enabling compatibility between TCP Reno and TCP Vegas , 2003, 2003 Symposium on Applications and the Internet, 2003. Proceedings..

[13]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[14]  Mario Gerla,et al.  Enhancing TCP fairness in ad hoc wireless networks using neighborhood RED , 2003, MobiCom '03.

[15]  Bogdan M. Wilamowski,et al.  The Transmission Control Protocol , 2005, The Industrial Information Technology Handbook.

[16]  Laura Marie Feeney,et al.  An Energy Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks , 2001, Mob. Networks Appl..

[17]  Yue Wang,et al.  Balancing Throughput and Fairness for TCP Flows in Multihop Ad-Hoc Networks , 2007, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.