Call Admission Control Algorithms for Tandem Generalized Processor Sharing Networks

Authors:
P. Barta;F. Németh;R. Szabó;J. Bíró
Affiliations:
-;-;-;-
Venue:
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Year:
2002

Citing 0
Cited 3

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
Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes several Call Admission Control (CAC) algorithms for tandem networks that employ the Generalized Processor Sharing (GPS) scheduling discipline, and also points out important network issues that are crucial in the design of network level CAC algorithms for GPS. Sessions are considered to be leaky bucket constrained and are regulated by traffic shapers at each network node. The end-to-end service curve approach of [2] is used to carry out the analytical framework of our algorithms. Different CAC algorithms are developed to support different session treatment strategies and diverse server capacities. The proposed algorithms follow different end-to-end delay provisioning strategies whose performances arecompared through numerical examples.