Call Admission Control Algorithms for Tandem Generalized Processor Sharing Networks

I
ISCC
2002
Seventh IEEE Symposium on Computers and Communications (ISCC'02)
Abstract - Call Admission Control Algorithms for Tandem Generalized Processor Sharing Networks

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by P. Barta Articles by F. Németh Articles by R. Szabó Articles by J. Bíró

Seventh IEEE Symposium on Computers and Communications (ISCC'02)

Ramada Hotel, Taormina-Giardini Naxos, Italy

July 01-July 04

ISBN: 0-7695-1671-8

	ASCII Text	x
	P. Barta, F. Németh, R. Szabó, J. Bíró, "Call Admission Control Algorithms for Tandem Generalized Processor Sharing Networks," Computers and Communications, IEEE Symposium on, pp. 789, Seventh IEEE Symposium on Computers and Communications (ISCC'02), 2002.

	BibTex	x
	@article{ 10.1109/ISCC.2002.1021763, author = {P. Barta and F. Németh and R. Szabó and J. Bíró}, title = {Call Admission Control Algorithms for Tandem Generalized Processor Sharing Networks}, journal ={Computers and Communications, IEEE Symposium on}, volume = {0}, year = {2002}, issn = {1530-1346}, pages = {789}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISCC.2002.1021763}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computers and Communications, IEEE Symposium on TI - Call Admission Control Algorithms for Tandem Generalized Processor Sharing Networks SN - 1530-1346 SP EP A1 - P. Barta, A1 - F. Németh, A1 - R. Szabó, A1 - J. Bíró, PY - 2002 KW - null VL - 0 JA - Computers and Communications, IEEE Symposium on ER -

P. Barta, Budapest University of Technology and Economics

F. Németh, Budapest University of Technology and Economics

R. Szabó, Budapest University of Technology and Economics

J. Bíró, Budapest University of Technology and Economics

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCC.2002.1021763

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 are compared through numerical examples.

Citation:

P. Barta, F. Németh, R. Szabó, J. Bíró, "Call Admission Control Algorithms for Tandem Generalized Processor Sharing Networks," iscc, pp.789, Seventh IEEE Symposium on Computers and Communications (ISCC'02), 2002

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.