Congestion avoidance using adaptive random marking

Author

Borrego, Marissa ; Li, Na ; De Veciana, Gustavo ; Li, San-qi

Author_Institution

Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA

fYear

2001

fDate

2001

Firstpage

63

Lastpage

67

Abstract

Recent work on congestion control in TCP/IP networks combines improved end-user transmission mechanisms with active queue management schemes. In this paper we propose MARS (Marking based on Adaptive Random Scheme), an adaptive early packet marking active queue management mechanism. Unlike previous proposals, MARS adapts the marking probability to drive the average queue length towards a target size. By doing so, MARS implicitly reacts to changes in the network dynamics without requiring per-flow state or estimates thereof. Our simulations confirm MARS´s flexibility and effectiveness in reducing packet loss, controlling queuing delay, and improving utilization and flow throughput

Keywords

queueing theory; telecommunication congestion control; transport protocols; MARS; TCP/IP networks; active queue management schemes; adaptive early packet marking active queue management; adaptive random marking; average queue length; congestion avoidance; congestion control; end-user transmission mechanisms; marking probability; packet loss reduction; queuing delay control; Algorithm design and analysis; Computer network management; Delay effects; Engineering management; IP networks; Internet; Mars; Proposals; State estimation; TCPIP;

fLanguage

English

Publisher

ieee

Conference_Titel

High Performance Switching and Routing, 2001 IEEE Workshop on

Conference_Location

Dallas, TX

Print_ISBN

0-7803-6711-1

Type

conf

DOI

10.1109/HPSR.2001.923605

Filename

923605