The discrete-time preemptive repeat identical priority queue
- 107 Downloads
Priority queueing systems come natural when customers with diversified delay requirements have to wait to get service. The customers that cannot tolerate but small delays get service priority over customers which are less delay-sensitive. In this contribution, we analyze a discrete-time two-class preemptive repeat identical priority queue with infinite buffer space and generally distributed service times. Newly arriving high-priority customers interrupt the on-going service of a low-priority customer. After all high-priority customers have left the system, the interrupted service of the low-priority customer has to be repeated completely. By means of a probability generating functions approach, we analyze the system content and the delay of both types of customers. Performance measures (such as means and variances) are calculated and the impact of the priority scheduling is discussed by means of some numerical examples.
KeywordsPreemptive repeat priority Discrete-time queue
Unable to display preview. Download preview PDF.
- 1.J. Walraevens, B. Steyaert and H. Bruneel. Analysis of a preemptive repeat priority buffer with resampling. In Proceedings of the International Network Optimization Conference (INOC 2003), pages 581–586, Evry, October 2003.Google Scholar
- 2.H. White and L. Christie. Queuing with preemptive priorities or with breakdown. Operations Research, 6(1)(1958) 79–95.Google Scholar
- 3.R. Miller. Priority queues. Annals of Mathematical Statistics, 31(1960) 86–103.Google Scholar
- 4.L. Kleinrock. Queueing systems volume II: Computer applications. John Wiley & Sons (1976).Google Scholar
- 8.H. Castel and G. Hebuterne. Performance analysis of an optical MAN ring for asynchronous variable length packets, pages 214–220. LNCS 3124 (Proceedings of ICT 2004). Springer Verlag, 2004.Google Scholar
- 9.S. Mukherjee, D. Saha, and S. Tripathi. A preemptive protocol for voice-data integration in ring-based LAN: performance analysis and comparison. Performance Evaluation, 11(3)(1995) 339–354.Google Scholar
- 12.J. Walraevens, B. Steyaert, and H. Bruneel. Performance analysis of a GI-G-1 preemptive resume priority buffer, pages 745–756. LNCS 2345 (Proceedings of the Networking 2002 Conference, Pisa). Springer Verlag, 2002.Google Scholar
- 13.H. Bruneel and B. Kim. Discrete-time models for communication systems including ATM. Kluwer Academic Publisher, Boston, (1993).Google Scholar