Paper
25 July 2001 Scalable resources management using shaped weighted round-robin scheduling
George Kesidis
Author Affiliations +
Proceedings Volume 4526, Scalability and Traffic Control in IP Networks; (2001) https://doi.org/10.1117/12.434404
Event: ITCom 2001: International Symposium on the Convergence of IT and Communications, 2001, Denver, CO, United States
Abstract
A framework for resource management of MPLS label-switched routes (LSRs) over a diffserv Internet domain is described. A `traffic management' problem is formulated in which the LSRs are not statically allocated an amount of bandwidth and buffers per node. A very limited amount of information is passed on to the diffserv nodes about the traffic characteristics and QoS requirements using the LSR. The diffserv node can use this information and on-line queue measurements for dynamic resources (bandwidth and buffer) management. In this general context, a suitable `shaped' weighted round-robin (SWRR) bandwidth scheduling mechanism is specified. Performance and implementation issues are explored for SWRR. Finally, how SWRR can approximate weighted fair queueing is discussed.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
George Kesidis "Scalable resources management using shaped weighted round-robin scheduling", Proc. SPIE 4526, Scalability and Traffic Control in IP Networks, (25 July 2001); https://doi.org/10.1117/12.434404
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Scalable video coding

Multiplexers

Internet

Terbium

Clouds

Head

Statistical multiplexing

RELATED CONTENT


Back to Top