Advanced search
1 file | 225.55 KB Add to list

Delay analysis of a queue with reservation-based scheduling and class-dependent service times

Sabine Wittevrongel (UGent) , Bart Feyaerts (UGent) , Herwig Bruneel (UGent) and Stijn De Vuyst (UGent)
Author
Organization
Abstract
In this paper, we study the delay characteristics of a discrete-time queue with a reservation-based scheduling mechanism. The objective is to provide a better quality of service to delay-sensitive packets at the cost of allowing higher delays for the best-effort packets. We consider a single-server infinite-capacity queue with general independent packet arrivals of class 1 (delay-sensitive) and class 2 (best-effort). The service times of the packets are independent and have a general distribution that depends on the class of the packet. The scheduling mechanism makes use of an in-queue reserved place for future class-1 packet arrivals. A class-1 arrival takes the place of the reservation in the queue, after which a new reservation is created at the tail of the queue. Class-2 arrivals always take place at the tail of the queue. Closed-form expressions are obtained for the probability generating functions and the mean values of the packet delays of both classes.
Keywords
Discrete-time queue, priority scheduling, place reservation, delay analysis

Downloads

  • (...).pdf
    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 225.55 KB

Citation

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

MLA
Wittevrongel, Sabine, et al. “Delay Analysis of a Queue with Reservation-Based Scheduling and Class-Dependent Service Times.” Proceedings of the 11th International Conference on Queueing Theory and Network Applications, QTNA 2016, ACM Press, 2016, doi:10.1145/3016032.3016042.
APA
Wittevrongel, S., Feyaerts, B., Bruneel, H., & De Vuyst, S. (2016). Delay analysis of a queue with reservation-based scheduling and class-dependent service times. Proceedings of the 11th International Conference on Queueing Theory and Network Applications, QTNA 2016. Presented at the 11th International Conference on Queueing Theory and Network Applications, QTNA 2016, Wellington. https://doi.org/10.1145/3016032.3016042
Chicago author-date
Wittevrongel, Sabine, Bart Feyaerts, Herwig Bruneel, and Stijn De Vuyst. 2016. “Delay Analysis of a Queue with Reservation-Based Scheduling and Class-Dependent Service Times.” In Proceedings of the 11th International Conference on Queueing Theory and Network Applications, QTNA 2016. ACM Press. https://doi.org/10.1145/3016032.3016042.
Chicago author-date (all authors)
Wittevrongel, Sabine, Bart Feyaerts, Herwig Bruneel, and Stijn De Vuyst. 2016. “Delay Analysis of a Queue with Reservation-Based Scheduling and Class-Dependent Service Times.” In Proceedings of the 11th International Conference on Queueing Theory and Network Applications, QTNA 2016. ACM Press. doi:10.1145/3016032.3016042.
Vancouver
1.
Wittevrongel S, Feyaerts B, Bruneel H, De Vuyst S. Delay analysis of a queue with reservation-based scheduling and class-dependent service times. In: Proceedings of the 11th International Conference on Queueing Theory and Network Applications, QTNA 2016. ACM Press; 2016.
IEEE
[1]
S. Wittevrongel, B. Feyaerts, H. Bruneel, and S. De Vuyst, “Delay analysis of a queue with reservation-based scheduling and class-dependent service times,” in Proceedings of the 11th International Conference on Queueing Theory and Network Applications, QTNA 2016, Wellington, 2016.
@inproceedings{8538575,
  abstract     = {{In this paper, we study the delay characteristics of a discrete-time queue with a reservation-based scheduling mechanism. The objective is to provide a better quality of service to delay-sensitive packets at the cost of allowing higher delays for the best-effort packets. We consider a single-server infinite-capacity queue with general independent packet arrivals of class 1 (delay-sensitive) and class 2 (best-effort). The service times of the packets are independent and have a general distribution that depends on the class of the packet. The scheduling mechanism makes use of an in-queue reserved place for future class-1 packet arrivals. A class-1 arrival takes the place of the reservation in the queue, after which a new reservation is created at the tail of the queue. Class-2 arrivals always take place at the tail of the queue. Closed-form expressions are obtained for the probability generating functions and the mean values of the packet delays of both classes.}},
  articleno    = {{3}},
  author       = {{Wittevrongel, Sabine and Feyaerts, Bart and Bruneel, Herwig and De Vuyst, Stijn}},
  booktitle    = {{Proceedings of the 11th International Conference on Queueing Theory and Network Applications, QTNA 2016}},
  isbn         = {{9781450348423}},
  keywords     = {{Discrete-time queue,priority scheduling,place reservation,delay analysis}},
  language     = {{eng}},
  location     = {{Wellington}},
  pages        = {{7}},
  publisher    = {{ACM Press}},
  title        = {{Delay analysis of a queue with reservation-based scheduling and class-dependent service times}},
  url          = {{http://doi.org/10.1145/3016032.3016042}},
  year         = {{2016}},
}

Altmetric
View in Altmetric