Network Level Call Admission Control Algorithms for Generalized Processor Sharing Scheduling Discipline

Authors:
Affiliations:
Venue:
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Year:
2003

Citing 0
Cited 2

Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

Computer Networks: The International Journal of Computer and Telecommunications Networking
Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes network level Call Admission Control(CAC) algorithms for the most significant theoreticaltraffic scheduling algorithm, Generalized ProcessorSharing (GPS), and highlights important issues that arisewhen generalizing single node CAC results to the networklevel. The framework allows arbitrary network topology, inwhich competing leaky bucket controlled sessions are consideredto be arbitrary weighted. This weighting relaxesbandwidth-delay coupling and extends the usable weightspace of the admissible region, which make possible tobuild resource efficient CAC algorithms on the network levelwhen combined with the tight delay bounds of [1]. In orderto keep end-to-end delay bounds under control, networknodes apply traffic shaping to eliminate the effects of complextraffic interactions.