RSW Algorithm for TCP Dynamic Retransmission Timeout


(*) Corresponding author


Authors' affiliations


DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)

Abstract


TCP transmission is mostly governed by Re–Transmission Timeout (RTO) values of each segment sent across the network. It is found that the fairness in the RTO is more need on effective management of the TCP. Most of the model calculates the RTO based on the Round Trip Time (RTT), which is the critical parameter in determining the behaviors of TCP. The RTO lacks in reflecting network foot prints. This paper presents algorithm which improves RTO, considering the network foot print for each segment sent across the network. Algorithm uses 3–way connection establishments RTT of TCP as the primary value to fine-tune the RTO. Using this RTT as base value and Advertise Window value of the receiver it calculates the rate of change of throughput as function of time to fix the RTO. The experiment has being simulated through OPNET.
Copyright © 2013 Praise Worthy Prize - All rights reserved.

Keywords


TCP; Dynamic Retransmission Timeouts; Round Trip Time; Advertise Window Size; Outstanding Packet Rate; OPNET

Full Text:

PDF


References


Karn, Phil; Craig Partridge (11-13 August). "Improving Round-Trip Time Estimates in Reliable Transport Protocols" (PS). ACM SIGCOMM '87. pp.2–7. 2009.

V. Jacobson, “Congestion avoidance and control,” in Proc. ACM SIGCOMM, Stanford, CA, , pp. 314–329. Aug. 1988.

R. Ludwig, A. Gurtov, The Eifel Response Algorithm for TCP, Internet Draft_Work in progress, draft-ietf-tsvwg-tcp- eifel-response- 03.txt, March 2003.

Yujie Pei, Hongbo Wang, Shiduan Cheng, "A passive method to estimate TCP round trip time from nonsender-side," iccsit pp.43-47, 2009 ,2nd IEEE International Conference on Computer Science and Information Technology, 2009.

Tanenbaum, Andrew S. (2003-03-17) Computer Networks (Fourth ed.). Prentice Hall. ISBN 0–13 0661023.

OPNET (2006). OPNET network simulator. Retrieved February 21, 2006, from http://www.opnet.com.

Parvez K.N.,A simple TCP throughput model and analytic characterization of fairness ,IEEE Transactio ,ITSim,Vol 3.Page 1–6, 2008

Phillipa Sessini and Anirban Mahanti, Observations on Round-Trip Times of TCP Connections,Proc. of SPECTS 2006, Calgary, Canada, July 2006.

L.L.Lam,Kai Su,C.W. Chan,X.J. Liu, Modeling of round trip time over the internet, Proceedings in the 7 th Asian control conference, Hong Kong ,p 27–29, August 2009

Zhu Yingjie and Lillykutty Jacob, ``On Making TCP Robust Against Spurious Retransmissions’’, Computer Communications, Elsevier, Vol. 28, Issue 1, pp. 25-36, Jan 2005.

Ioannis Psaras , Vassilis Tsaoussidis, On the properties of an adaptive TCP Minimum RTO, Computer Communications, v.32 n.5, p.888-895, March, 2009 [doi:10.1016/j.comcom.2008.12.025]

Nandita Dukkipati , Tiziana Refice , Yuchung Cheng , Jerry Chu , Tom Herbert , Amit Agarwal, Arvind Jain , Natalia Sutin, An argument for increasing TCP's initial congestion window, ACM SIGCOMM Computer ccommunication Review, v.40 n.3,July 2010 10.1145 /1823844. 1823848]

A. Mellouk, S. Ziane, P. Lorenz, A Swarm Quality of Service Based Multi-Path Routing Algorithm (SAMRA) for Wireless Ad Hoc Networks, (2006) International Review on Computers and Software (IRECOS), 1 (1), pp. 11 – 19.

A. A. Moghanjoughi, S. Khatun, M. A. Borhanuddin, R. S. A. Raja Abdullah, Performance Analysis of Ant Colony's Algorithm: Load-Balancing in QoS-based for Wireless Mesh Networks Routing, (2008) International Review on Computers and Software (IRECOS), 3 (2), pp. 203 – 209.

F. R. Armaghani, S. Khatun, S. S. Jamuar, M. F. A. Rasid, TCP Throughput Optimization over 802.11 MAC Protocol in Multi-hop Ad-hoc Networks, (2008) International Review on Computers and Software (IRECOS), 4 (3), pp. 356 – 362.

Anuradha, S., Raghuram, G., Sreenivasa Murthy, K.E., Raghunatha Reddy, V., Sathyanarayana, B., Evolution of new searching technique in unicast routing algorithm of data networks, (2009) International Review on Computers and Software (IRECOS), 4 (3), pp. 321-330.

Qu, X., Hao, Z., Zhang, X., A novel adaptive sliding mode congestion control algorithm for TCP networks via T-S model approach, (2011) International Review on Computers and Software (IRECOS), 6 (5), pp. 840-847.

Priyadarsini, S., Umashankar, S., TSRD-RL algorithm based secured route discovery for MANET with improved route lifetime, (2012) International Review on Computers and Software (IRECOS), 7 (2), pp. 499-504.

Karn, Phil; Craig Partridge (11-13 August). "Improving Round-Trip Time Estimates in Reliable Transport Protocols" (PS). ACM SIGCOMM '87. pp.2–7. http://www.ka9q.net/papers/rtt.ps.gz.Retrieved 2009.

Jae-Hyun Hwang , Chuck Yoo, Formula-based TCP throughput prediction with available bandwidth, IEEE Communications Letters, v.14 n.4, p.363- 365, April 2010 i>10.1109 /LCOMM.210.04. 092309.

Ranadive, U. and Medhi, D. Some observations on the effect of route fluctuation and network link failure on TCP. In Proceedings of the 10th International Conference on Computer Communications and Networks , 460—467, 2001.

Liangping Ma , Kenneth E. Barner , Gonzalo R. Arce, Statistical analysis of TCP's retransmission timeout algorithm, IEEE/ACM Transactions on Networking (TON), v.14 n.2, p.383-396,April2006


Refbacks

  • There are currently no refbacks.


Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize