Optimal call admission control under generalized processor sharing scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2092, Issue , 2001, Pages 419-434

  Panagakis, Antonis ^a   Stavrakakis, Ioannis ^a  

^a UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; SCHEDULING;

BAND-WIDTH UTILIZATION; BEST-EFFORT TRAFFIC; EFFECTIVE BANDWIDTH; GENERALIZED PROCESSOR SHARING SCHEDULERS; GENERALIZED PROCESSOR SHARING SCHEDULING; NUMERICAL RESULTS; OPTIMAL SOLUTIONS; SERVICE GUARANTEES;

QUALITY OF SERVICE;

EID: 23044526849     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45512-4_32     Document Type: Conference Paper

References (11)

1. A. Parekh and R. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Transactions on Networking, 1(3):344–357, June 1993.
2. A. Parekh and R. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. IEEE/ACM Transactions on Networking, 2(2):137–150, April 1994.
3. R. Szabó, P. Barta, F. Németh, and J. Biró. Call admission control in generalized processor sharing (gps) schedulers using non-rate proportional weighting of sessions. Proceedi ngs of IEEE I NFO CO M, 3:1243–1252, March 2000.
4. A. Elwalid and D. Mitra. Design of generalized processor sharing schedulers which statistically multiplex heterogeneous qos classes. In Proceedings of IEEE I NFO -COM, pages 1220–1230, March 1999.
5. Z. Zhang, D. Towsley, and J. Kurose. Statistical analysis of the generalized processor sharing scheduling discipline. Proc. of ACM SIGCOMM, September 1994.
6. Z. Zhang, Z. Liu, J. Kurose, D. Towsley. Call admission control schemes under the generalized processor sharing scheduling. The Journal of Telecommunication Systems, Modeling, Analysis, Design, and Management, 7(1), July 1997.
7. Z. Zhang, Z. Liu, and D. Towsley. Closed-form deterministic end-to-end performance bounds for the generalized processor sharing scheduling discipline. Journal of Combinatorial Optimization (Special Issue on Scheduling), 1(4), 1998.
8. R. Szabo, P. Barta, J. Biró, F. Németh, and C-G. Perntz. Non-rate proportional weighting of genaralized processor sharring schedulers. Proceedi ngs of GLOBE-COM, 2:1334–1339, December 1999.
9. J.-Y. Le Boudec. Application of networkcalculus to guaranteed service networks. IEEE Transactions on Information Theory, 44(3):1087–1096, May 1998.
10. L. Georgiadis, R. Guérin, V. Peris, and K. Sivarajan. Efficient networkqos provisioning based on per node traffic shaping. IEEE/ACM Transactions on Networking, 4(4):482–501, August 1996.
11. A. Panagakis and I. Stavrakakis. Optimal call admission control under generalized processor sharing scheduling. Technical report, available at http://www.di.uoa.gr/~istavrak/pub/gps.ps, 2001.