loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
37th Annual Simulation Symposium (ANSS'04)
Markov Model Based Congestion Control for TCP
Arlington, Virginia
April 18-April 22
ISBN: 0-7695-2110-X
Shan Suthaharan, University of North Carolina at Greensboro, NC
The Random Early Detection (RED) scheme for congestion control in TCP is well known over a decade. Due to a number of control parameters in RED, it cannot make acceptable packet-dropping decision, especially, under heavy network load and high delay to provide high throughput and low packet loss rate. We propose a solution to this problem using Markov chain based decision rule. We modeled the oscillation of the average queue size as a homogeneous Markov chain with three states and simulated the system using the network simulator software NS-2. The simulations show that the proposed scheme successfully estimates the maximum packet dropping probability for Random Early Detection. It detects the congestion very early and adjusts the packet-dropping probability so that RED can make wise packet-dropping decisions. Simulation results show that the proposed scheme provides improved connection throughput and reduced packet loss rate.
Citation:
Shan Suthaharan, "Markov Model Based Congestion Control for TCP," anss, pp.285, 37th Annual Simulation Symposium (ANSS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.