Wuqin Lin
Abstract
We consider a queueing system with jobs having hard deadlines. This is motivated by recent emerging unified messaging service applications. The service time of a job is assumed to be known upon arrival. A job will be lost if not being served by its deadline. For the single-server system, we propose an on-line ED-Push algorithm that is easy to implement and can achieve near-optimal performance in terms of minimizing the loss probability. Performance analyses for the underlying M/M/l+D and G/D/1+D systems are then provided. We also give approximation on the loss probability for the system with multiple servers under least workload routing scheme. The numerical results show that ED-Push algorithm performs well.
- D. Baner. Queueing with impatient customers and ordered service. Operations Research, 5:650--656, 1957.Google Scholar
Cross Ref
- S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, and D. Shasha. On-line scheduling in the presence of overload. 1991 IEEE Symposium on Foundations of Computer Science, San Juan, Puerto Rico, October 1991. Google ScholarDigital Library
- S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang. On the competitiveness of on-line real-time task scheduling. Real-Time Systems 4(2):125--144, 1992. Google ScholarDigital Library
- J. Cohen. Single server queue with uniformly bounded virtual waiting time. J. Appl. Prob. 5:93--122, 1968.Google ScholarCross Ref
- B. Gavish and P. Schweitzer. The Markovian queue with bounded waiting time. Management Science, 23(12):1349--1357, 1977.Google ScholarDigital Library
- J. Hong, X. Tan, and D. Towsley. A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system. IEEE Transactions on Computers, 38(12):1736--1744, 1989. Google ScholarDigital Library
- H. Kise, T. Ibaraki and H. Mine. A solvable case of the one-machine scheduling problem with ready and due times. Operations Research, 26:121--126, 1978.Google ScholarDigital Library
- L. Kleinrock. Queueing Systems, vol 1. John Wiley & Son, 1975. Google ScholarDigital Library
- A. Kok and H. Tijms. A queueing system with impatient customers. J. Appl. Prob. 22:688--696, 1985.Google ScholarCross Ref
- G. Koren and D. Shasha. D° ver: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM J. Comput. 24(2):318--339, 1995. Google ScholarDigital Library
- C. Locke. Best-effort Decision Making for Real-Time Scheduling. PhD thesis, Computer Science Department, Carnegie-Mellon University, 1986. Google ScholarDigital Library
- A. Movaghar. On queueing with customer impatience until the beginning of service. Queueing Systems, 29:337--350, 1998. Google ScholarDigital Library
- A. Movaghar. On queueing with customer impatience until the end of service. Proceedings of the 4th IEEE International Computer Performance and Dependability Symposium, Chicago, IL, March 2000. Google ScholarDigital Library
- F. Wang and D. Mao. Worst case analysis for on-line scheduling in real-time systems. Technical Report 91-54, Department of Computer and Information Science, University of Massachusetts at Amherst, 1991. Google ScholarDigital Library
Recommendations
Retrial queuing system with Markovian arrival flow and phase-type service time distribution
We consider a multi-server queuing system with retrial customers to model a call center. The flow of customers is described by a Markovian arrival process (MAP). The servers are identical and independent of each other. A customer's service time has a ...
A study of a queueing system with three-phase service
In this paper we consider a single server that serves customers, each of which requires three phases of service. The server alternates between two queues, a batch queue and an individual queue, giving priority to customers in the latter queue. Customers ...
Comments