Effect of time delay in network traffic control

Author

Ramakrishnan, Sthanunathan ; Kalyanaraman, Shivkumar ; Wen, John ; Ozbay, Hitay

Author_Institution

Dept. of Electr. Comput. & Syst. Eng., Rensselaer Polytech. Inst., Troy, NY, USA

Volume

6

fYear

2001

fDate

2001

Firstpage

4656

Abstract

An additive-increase-multiplicative-decrease (AIMD) type of algorithm has been popular in network congestion control. The stability and performance of the algorithm has been analyzed for the single bottleneck network model. This paper considers the impact of time delay on the performance of the AIMD algorithm applied to the rate control of a single bottleneck, multiple-source network. An estimate of the worst case queue length is derived which can be used to allocate buffers at bottlenecks to avoid loss. This bound is nonconservative in the sense that there is an initial source rate distribution that can lead to this queue length

Keywords

delays; queueing theory; telecommunication congestion control; telecommunication traffic; additive-increase-multiplicative-decrease algorithm; buffers allocation; initial source rate distribution; network congestion control; single bottleneck network model; stability; time delay effect; worst case queue length; Algorithm design and analysis; Delay effects; Intelligent networks; Measurement; Microwave integrated circuits; Neck; Network topology; Performance analysis; Stability analysis; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

American Control Conference, 2001. Proceedings of the 2001

Conference_Location

Arlington, VA

ISSN

0743-1619

Print_ISBN

0-7803-6495-3

Type

conf

DOI

10.1109/ACC.2001.945714

Filename

945714