Analysis and improvement of fairness between TCP Reno and Vegas for deployment of TCP Vegas to the Internet

2002 ◽  
Author(s):  
G. Hasegawa ◽  
K. Kurata ◽  
M. Murata
Keyword(s):  
The Internet ◽  
Tcp Vegas ◽  
Tcp Reno

scholarly journals Fairness analysis of TCP variants in asymmetric network

2018 ◽  
Vol 7 (2.12) ◽  
pp. 231
Author(s):  
Sukantkishoro Bisoy ◽  
Pradeep Kumar Mallick ◽  
Anjana Mishra
Keyword(s):  
Simulation Experiment ◽  
Queue Management ◽  
Random Early Detection ◽  
Fair Share ◽  
Management Techniques ◽  
Tcp Vegas ◽  
Different Characteristics ◽  
Reverse Path ◽  
Tcp Reno ◽  
Fairness Analysis

Conservative nature of Vegas creates less opportunity to get fair share of bandwidth then Reno in wired network. On the other hand, aggressive nature of Reno helps to achieve more share of bandwidth. Both Reno and Vegas assumes that congestion occurs in the forward rather than in reverse path. In asymmetric network the path characteristics of forward and backward is different.In this work, we propose a network model and analyzed the Inter-protocol fairness between TCP Reno and TCP Vegas with some queue management techniques such as Droptail and random early detection (RED) in asymmetric network where the forward and backward path has different characteristics. The simulation experiment results using NS2 indicates that use of RED can achieve better fairness than Droptail in asymmetric network.  

TCP for High-Speed Networks

2008 ◽  
pp. 626-632
Author(s):  
Nelson Luís Saldanha da Fonseca ◽  
Neila Fernanda Michel
Keyword(s):  
Congestion Control ◽  
High Speed ◽  
Transmission Control Protocol ◽  
Window Size ◽  
Transport Layer ◽  
The Internet ◽  
Congestion Window ◽  
High Speed Networks ◽  
Congestion Control Mechanism ◽  
Tcp Reno

In response to a series of collapses due to congestion on the Internet in the mid-’80s, congestion control was added to the transmission control protocol (TCP) (Jacobson, 1988), thus allowing individual connections to control the amount of traffic they inject into the network. This control involves regulating the size of the congestion window (cwnd) to impose a limit on the size of the transmission window. In the most deployed TCP variant on the Internet, TCP Reno (Allman, Floyd, & Partridge, 2002), changes in congestion window size are driven by the loss of segments. Congestion window size is increased by 1/cwnd for each acknowledgement (ack) received, and reduced to half for the loss of a segment in a pattern known as additive increase multiplicative decrease (AIMD). Although this congestion control mechanism was derived at a time when the line speed was of the order of 56 kbs, it has performed remarkably well given that the speed, size, load, and connectivity of the Internet have increased by approximately six orders of magnitude in the past 15 years. However, the AIMD pattern of window growth seriously limits efficienct operation of TCP-Reno over high-capacity links, so that the transport layer is the network bottleneck. This text explains the major challenges involved in using TCP for high-speed networks and briefly describes some of the variations of TCP designed to overcome these challenges.

Throughput and Compatibility Analysis of TCP Variants in Heterogeneous Environment

2017 ◽  
pp. 254-287
Author(s):  
Sukant Kishoro Bisoy ◽  
Prasant Kumar Pattnaik ◽  
Narendra Kumar Kamila
Keyword(s):  
Wireless Network ◽  
Ad Hoc ◽  
Queue Management ◽  
Ad Hoc Routing ◽  
On Demand ◽  
Compatibility Analysis ◽  
Distance Vector ◽  
Simulation Results ◽  
Tcp Vegas ◽  
Tcp Reno

When TCP Reno and TCP Vegas connections share a link, TCP Reno generally steals more bandwidth and dominates TCP Vegas because of its aggressive nature. This is the major reason why TCP Vegas has not gained much popularity and deployment in the Internet despite its excellent standalone performance. This work systematically examines compatibility between Reno and Vegas in wired as well as in wireless networks. Popular Active Queue Management (AQM) technique named as Random Early Detection (RED) to minimize the incompatibility between Reno and Vegas in wired network. For wireless network two ad hoc routing protocols such as Ad Hoc On-Demand Distance Vector (AODV) and Destination-Sequenced Distance Vector (DSDV) are considered. Simulation results show that the incompatibility between Reno and Vegas in wired network is minimized using popular RED techniques. But in wireless ad hoc network environment Reno's aggressive behavior gets deteriorated while sharing with Vegas. Moreover, Reno and Vegas are more compatible in wireless network than wired network when both coexist in same time.

Modeling of TCP Reno with Packet-Loss and Long Delay Cycles

2012 ◽  
pp. 257-283
Author(s):  
Hussein Al-Bahadili ◽  
Haitham Y. Adarbah
Keyword(s):  
Packet Loss ◽  
Remote Access ◽  
Transport Layer ◽  
Analytical Models ◽  
The Internet ◽  
Network Simulator ◽  
Tcp Performance ◽  
File Transfer ◽  
Transport Control ◽  
Tcp Reno

The Transport Control Protocol (TCP) is the dominant transport layer protocol in the Internet Protocol (IP) suite, as it carries a significant amount of the Internet traffic, such as Web browsing, file transfer, e-mail, and remote access. Therefore, huge efforts have been devoted by researchers to develop suitable models that can help with evaluating its performance in various network environments. Some of these models are based on analytical or simulation approaches. This chapter presents a description, derivation, implementation, and comparison of two well-known analytical models, namely, the PFTK and PLLDC models. The first one is a relatively simple model for predicting the performance of the TCP protocol, while the second model is a comprehensive and realistic analytical model. The two models are based on the TCP Reno flavor, as it is one of the most popular implementations on the Internet. These two models were implemented in a user-friendly TCP Performance Evaluation Package (TCP-PEP). The TCP-PEP was used to investigate the effect of packet-loss and long delay cycles on the TCP performance, measured in terms of sending rate, throughput, and utilization factor. The results obtained from the PFTK and PLLDC models were compared with those obtained from equivalent simulations carried-out on the widely used NS-2 network simulator. The PLLDC model provides more accurate results (closer to the NS-2 results) than the PFTK model.

Performance comparison between TCP Reno and TCP Vegas

2002 ◽  
Vol 25 (18) ◽  
pp. 1765-1773 ◽  
Author(s):  
Yuan-Cheng Lai ◽  
Chang-Li Yao
Keyword(s):  
Performance Comparison ◽  
Tcp Vegas ◽  
Tcp Reno
Sign in / Sign up

Export Citation Format

Share Document