DocumentCode
1850014
Title
Perturbation analysis for stochastic fluid queueing systems
Author
Liu, Yong ; Gong, Weibo
Author_Institution
Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA
Volume
5
fYear
1999
fDate
1999
Firstpage
4440
Abstract
Recent study for congestion control in high speed networks indicates that the derivative information for the congestion at the common buffer for multiple sources could be useful in achieving efficient and fair allocation of the bandwidth. In this paper we present an algorithm that efficiently estimates such derivatives for multiple on-off sources. The algorithm has its root in the infinitesimal perturbation analysis (IPA) for the classical queueing systems. Although the traditional IPA algorithm does not give unbiased derivative estimates for multi-class arrivals, we are able to prove the unbiaseness in the case of multi-class on-off sources. The algorithm is simple and leads to potentially realistic implementation for router-based congestion control
Keywords
queueing theory; telecommunication congestion control; telecommunication network routing; telecommunication traffic; bandwidth allocation; congestion control; high speed networks; infinitesimal perturbation analysis; stochastic fluid queueing systems; telecommunication network routing; unbiaseness; Algorithm design and analysis; Approximation algorithms; Bandwidth; Control systems; High-speed networks; Protocols; Queueing analysis; Resource management; Stochastic processes; Stochastic systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1999. Proceedings of the 38th IEEE Conference on
Conference_Location
Phoenix, AZ
ISSN
0191-2216
Print_ISBN
0-7803-5250-5
Type
conf
DOI
10.1109/CDC.1999.833240
Filename
833240
Link To Document