Advanced search
1 file | 303.29 KB

Frame-bound priority scheduling in discrete-time queueing systems

Sofian De Clercq (UGent) , Koen De Turck (UGent) , Bart Steyaert (UGent) and Herwig Bruneel (UGent)
Author
Organization
Abstract
A well-known problem with priority policies is starvation of delay-tolerant traffic. Additionally, insufficient control over delay differentiation (which is needed for modern network applications) has incited the development of sophisticated scheduling disciplines. The priority policy we present here has the benefit of being open to rigorous analysis. We study a discrete time queueing system with a single server and single queue, in which N types of customers enter pertaining to different priorities. A general i.i.d. arrival process is assumed and service times are generally distributed. We divide the time axis into 'frames' of fixed size (counted as a number of time-slots), and re-order the customers that enter the system during the same frame such that the high-priority customers are served first. This paper gives an analytic approach to studying such a system, and in particular focuses on the system content (meaning the customers of each type in the system at random slot marks)in stationary regime, and the delay distribution of a random customer. Clearly, in such a system the frame's size is the key factor in the delay differentiation between the N priority classes. The numerical results at the end of this paper illustrate this observation.
Keywords
priority, Queueing theory, discrete-time

Downloads

  • MultiClass DTQ FBP QCont.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 303.29 KB

Citation

Please use this url to cite or link to this publication:

Chicago
De Clercq, Sofian, Koen De Turck, Bart Steyaert, and Herwig Bruneel. 2011. “Frame-bound Priority Scheduling in Discrete-time Queueing Systems.” Journal of Industrial and Management Optimization 7 (3): 767–788.
APA
De Clercq, Sofian, De Turck, K., Steyaert, B., & Bruneel, H. (2011). Frame-bound priority scheduling in discrete-time queueing systems. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 7(3), 767–788.
Vancouver
1.
De Clercq S, De Turck K, Steyaert B, Bruneel H. Frame-bound priority scheduling in discrete-time queueing systems. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION. 2011;7(3):767–88.
MLA
De Clercq, Sofian, Koen De Turck, Bart Steyaert, et al. “Frame-bound Priority Scheduling in Discrete-time Queueing Systems.” JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 7.3 (2011): 767–788. Print.
@article{1848733,
  abstract     = {A well-known problem with priority policies is starvation of delay-tolerant traffic. Additionally, insufficient control over delay differentiation (which is needed for modern network applications) has incited the development of sophisticated scheduling disciplines. The priority policy we present here has the benefit of being open to rigorous analysis. We study a discrete time queueing system with a single server and single queue, in which N types of customers enter pertaining to different priorities. A general i.i.d. arrival process is assumed and service times are generally distributed. We divide the time axis into 'frames' of fixed size (counted as a number of time-slots), and re-order the customers that enter the system during the same frame such that the high-priority customers are served first. This paper gives an analytic approach to studying such a system, and in particular focuses on the system content (meaning the customers of each type in the system at random slot marks)in stationary regime, and the delay distribution of a random customer. Clearly, in such a system the frame's size is the key factor in the delay differentiation between the N priority classes. The numerical results at the end of this paper illustrate this observation.},
  author       = {De Clercq, Sofian and De Turck, Koen and Steyaert, Bart and Bruneel, Herwig},
  issn         = {1547-5816},
  journal      = {JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION},
  keyword      = {priority,Queueing theory,discrete-time},
  language     = {eng},
  number       = {3},
  pages        = {767--788},
  title        = {Frame-bound priority scheduling in discrete-time queueing systems},
  url          = {http://dx.doi.org/10.3934/jimo.2011.7.767},
  volume       = {7},
  year         = {2011},
}

Altmetric
View in Altmetric
Web of Science
Times cited: