Opening book details…
Can I read Call Admission Control in Generalized Processor Sharing Schedulers with Tight Deterministic Delay Bounds on EtoBox?
Call Admission Control in Generalized Processor Sharing Schedulers with Tight Deterministic Delay Bounds by P. Barta; F. Németh; R. Szabó; J. Bı́ró is a Computer Science article available to read on EtoBox.
What is Call Admission Control in Generalized Processor Sharing Schedulers with Tight Deterministic Delay Bounds about?
Generalized processor sharing (GPS) is reported as the most important ideal fluid scheduling discipline, which many practical packet scheduling algorithms (WFQ, WF 2 Q) 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.
Who reads Call Admission Control in Generalized Processor Sharing Schedulers with Tight Deterministic Delay Bounds?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- P. Barta; F. Németh; R. Szabó; J. Bı́ró
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0140-3664)
- Published
- 2003
- Language
- EN
- Field
- Computer Science (Physical Sciences)