z-logo
open-access-imgOpen Access
Controlling delay differentiation with priority jumps: Analytical study
Author(s) -
Tom Maertens,
Joris Walraevens,
Herwig Bruneel
Publication year - 2011
Publication title -
numerical algebra control and optimization
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.303
H-Index - 20
eISSN - 2155-3289
pISSN - 2155-3297
DOI - 10.3934/naco.2011.1.657
Subject(s) - priority ceiling protocol , priority inheritance , computer science , differentiated services , quality of service , scheduling (production processes) , deadline monotonic scheduling , queueing theory , network packet , priority inversion , earliest deadline first scheduling , priority queue , computer network , dynamic priority scheduling , rate monotonic scheduling , mathematical optimization , queue , mathematics
Supporting different services with different Quality of Service (QoS) requirements is not an easy task in modern telecommunication systems: an efficient priority scheduling discipline is of great importance. Fixed or static priority achieves maximal delay differentiation between different types of traffic, but may have a too severe impact on the performance of lower-priority traffic. In this paper, we propose a priority scheduling discipline with priority jumps to control the delay differentiation. In this scheduling discipline, packets can be promoted to a higher priority level in the course of time. We use probability generating functions to study the queueing system analytically. Some interesting mathematical challenges thereby arise. With some numerical examples, we finally show the impact of the priority jumps and of the system parameters

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom