By Topic

Dynamic thresholds for multiple loss priorities

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Choudhury, A.K. ; Bell Labs., Lucent Technol., Holmdel, NJ, USA ; Hahne, E.L.

Buffer management schemes are needed in shared-memory ATM switches to regulate the sharing of memory among different output port queues and among traffic classes with different loss priorities. Earlier we proposed a single-priority scheme called dynamic threshold, in which the maximum permissible queue length is proportional to the unused buffering in the switch. In this paper, we propose, analyze and simulate nine different ways of incorporating loss priorities into the dynamic threshold scheme. We determine how each scheme allocates buffers among the competing ports and loss priority classes, and we also note how this buffer allocation induces an allocation of bandwidth among the loss priority classes at each port. We find that minor variations in the dynamic threshold control law can produce dramatically different resource allocations

Published in:

IEEE ATM Workshop 1997. Proceedings

Date of Conference:

25-28 May 1997