Sabine Wittevrongel
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.
- H. Bruneel. Performance of discrete-time queueing systems. Computers & Operations Research, 20(3):303--320, April 1993. Google Scholar
Digital Library
- S. De Clercq, B. Steyaert, and H. Bruneel. Delay analysis of a discrete-time multiclass slot-bound priority system. 4OR - A Quarterly Journal of Operations Research, 10(1):67--79, March 2012.Google Scholar
- S. De Clercq, B. Steyaert, S. Wittevrongel, and H. Bruneel. Analysis of a discrete-time queue with time-limited overtake priority. Annals of Operations Research, 238(1-2):69--97, March 2016.Google ScholarCross Ref
- S. De Vuyst, S. Wittevrongel, and H. Bruneel. Place reservation: Delay analysis of a novel scheduling mechanism. Computers & Operations Research, 35(8):2447--2462, August 2008. Google ScholarDigital Library
- B. Feyaerts, S. De Vuyst, H. Bruneel, and S. Wittevrongel. Delay analysis of a discrete-time GI-GI-1 queue with reservation-based priority scheduling. Stochastic Models, 32(2):179--205, 2016.Google ScholarCross Ref
- B. Feyaerts, S. De Vuyst, S. Wittevrongel, and H. Bruneel. Analysis of a discrete-time priority queue with place reservations and geometric service times. In Proceedings of the Summer Computer Simulation Conference, SCSC 2008/DASD (Edinburgh, June 16-18, 2008), pages 140--147, 2008.Google Scholar
- T. Maertens, J. Walraevens, and H. Bruneel. Performance comparison of several priority schemes with priority jumps. Annals of Operations Research, 162(1):109--125, September 2008.Google ScholarCross Ref
- A. Melikov, L. Ponomarenko, and C. Kim. Approximate method for analysis of queuing models with jump priorities. Automation and Remote Control, 74(1):62--75, January 2013. Google ScholarDigital Library
- S. Ndreca and B. Scoppola. Discrete time GI/Geom/1 queueing system with priority. European Journal of Operational Research, 189(3):1403--1408, September 2008.Google ScholarCross Ref
- C.-K. Tham, Q. Yao, and Y. Jiang. A multi-class probabilistic priority scheduling discipline for differentiated services networks. Computer Communications, 25(17):1487--1496, November 2002. Google ScholarDigital Library
- J. Walraevens, B. Steyaert, and H. Bruneel. Delay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing discipline. Performance Evaluation, 50(1):53--75, October 2002. Google ScholarDigital Library
- Delay Analysis of a Queue with Reservation-Based Scheduling and Class-Dependent Service Times
Recommendations
Performance Analysis of a Priority Queue with Place Reservation and General Transmission Times
EPEW '08: Proceedings of the 5th European Performance Engineering Workshop on Computer Performance EngineeringIn this paper, we analyze a discrete-time single-server queue with two classes of packet arrivals and a reservation-based scheduling discipline. The objective of this discipline is to give a certain priority to (delay-sensitive) packets of class 1 and ...
Delay Analysis for the Fixed-Cycle Traffic-Light Queue
We consider the fixed-cycle traffic-light (FCTL) queue, where vehicles arrive at an intersection controlled by a traffic light and form a queue. The traffic-light signal alternates between green and red periods, and delayed vehicles are assumed to ...
Delay analysis of a queue with re-sequencing buffer and Markov environment
There are simple service disciplines where the system time of a tagged customer depends only on the customers arriving in the system earlier (for example first-in-first-out (FIFO)) or later (for example LIFO) than the tagged one. In this paper we ...
Comments