By Topic

Guaranteeing service rates for cell-based schedulers with a grouping architecture

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 $31
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

4 Author(s)
Wei, D. ; Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA ; Yang, J. ; Ansari, N. ; Papavassiliou, S.

Packet fair queueing (PFQ) algorithms are packetised versions of generalised processor sharing (GPS), which is an idealised fluid scheduling model with desirable properties in terms of delay bound and fairness. To support a large number of sessions with diverse bandwidth requirements, the grouping architecture, which is scalable, has been proposed to approximate PFQ algorithms. The authors analyse the relationship between the guaranteed service rates and utilisation for cell-based schedulers with the grouping architecture. Based on this analysis, call admission control (CAC) schemes are proposed to provide the guaranteed service rate for each session, and their performance is evaluated and compared in terms of computational complexity.

Published in:

Communications, IEE Proceedings-  (Volume:150 ,  Issue: 1 )