DocumentCode
302374
Title
Traffic rate and shape control with queue threshold congestion recognition
Author
Collier, Blair R. ; Kim, Hyong S.
Author_Institution
Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA
Volume
2
fYear
1996
fDate
23-27 Jun 1996
Firstpage
746
Abstract
This paper presents analysis of a congestion control scheme in which a multiplexer notifies upstream traffic flows when its buffer level crosses a preset threshold. Upon notification, the traffic streams feeding the buffer are reshaped to a form less likely to cause buffer overflow which can involve rate or burstiness restrictions, or a combination of the two. The traffic is modeled by two Markov modulated rate processes (MMRPs), one for above and one for below the threshold, and we use an iterative fluid approximation to determine the buffer occupancy distribution. Simulation results verify the approach, and the analysis is used to study the effect of varying the threshold and shaping function
Keywords
Markov processes; asynchronous transfer mode; buffer storage; channel capacity; iterative methods; queueing theory; telecommunication congestion control; telecommunication traffic; Markov modulated rate processes; buffer level; buffer occupancy distribution; buffer overflow; burstiness restrictions; congestion control; iterative fluid approximation; queue threshold congestion recognition; rate restrictions; shape control; traffic rate; traffic streams; upstream traffic flows; Analytical models; Asynchronous transfer mode; Boundary conditions; Buffer overflow; Communication system traffic control; Delay effects; Feeds; Multiplexing; Shape control; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 1996. ICC '96, Conference Record, Converging Technologies for Tomorrow's Applications. 1996 IEEE International Conference on
Conference_Location
Dallas, TX
Print_ISBN
0-7803-3250-4
Type
conf
DOI
10.1109/ICC.1996.541280
Filename
541280
Link To Document