Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds

Authors:
P. Barta;F. NéMeth;R. Szabó;J. BıRó
Affiliations:
Department of Telecommunications and Telematics, Budapest University of Technology and Economics, H-1111, Stoczek 2, Budapest, Hungary;Department of Telecommunications and Telematics, Budapest University of Technology and Economics, H-1111, Stoczek 2, Budapest, Hungary;Department of Telecommunications and Telematics, Budapest University of Technology and Economics, H-1111, Stoczek 2, Budapest, Hungary;Department of Telecommunications and Telematics, Budapest University of Technology and Economics, H-1111, Stoczek 2, Budapest, Hungary
Venue:
Computer Communications
Year:
2003

Citing 9
Cited 5

Virtual clock: a new traffic control algorithm for packet switching networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Statistical analysis of generalized processor sharing scheduling discipline

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Worst-Case Deterministic Delay Bounds for Arbitrary Weighted Generalized Processor Sharing Schedulers

NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Call Admission Control Algorithms for Tandem Generalized Processor Sharing Networks

ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
End-to-End Delay Bound Calculation in Generalized Processor Sharing Networks

ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
Scheduling for quality of service guarantees via service curves

ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
A calculus for network delay. II. Network analysis

IEEE Transactions on Information Theory

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
A cost-effective critical path approach for service priority selections in grid computing economy

Decision Support Systems
QoS mechanisms for the MAC protocol of IEEE 802.11 WLANs

Wireless Networks
Analysis of virtual-time complexity in weighted fair queuing

Computer Communications
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.24

Visualization

Abstract

Generalized processor sharing (GPS) is reported as the most important ideal fluid scheduling discipline, which many practical packet scheduling algorithms (WFQ, WF^2Q) are built on. However, all of them bear the bandwidth-delay coupling property due to the commonly used rate-proportional weighting of sessions and offer too loose deterministic delay bounds. These deficiencies lead to poor network utilization and preclude the development of efficient call admission control (CAC) schemes. In this paper we address these problems by proposing an algorithm for tight individual session delay bound computation and several CAC algorithms for session resource assignment in a bandwidth-delay decoupled GPS system. Besides the analytical framework numerical examples as well as the complexity analysis of different CAC algorithms are also presented.