Abstract
A flexible priority discipline with time-limited schedule of controllable parameters (T 1, T 2,..., T N ) is presented in this paper, which operates as follows: After the last visit of a single-server at queue n, the server serves messages in queue n, n = 1, 2,..., N until either queue n becomes empty or a timer with time-limit T n expires, whichever occurs first. In succession, the highest class message present in the system is next served according to the time-limited service. For two-class (N = 2), Markovian priority queues with time-limited schedule (T 1, T 2), we determine a generating function of a steady-state, joint queue-length distribution. In the case of (T 1 = T 2 = ∞), this model reduces to the alternating priority queues, while in the case of (T 1 = ∞, T 2 = 0), the ordinary preemptiveresume priority queues, where this priority model is also a limiting case of two queues with alternating service periods first studied by Coffman, Fayolle and Mitrani (1987). Through a generating function approach, we provide Laplace-Stieltjes transforms of distribution functions of the response time and the waiting time of each class, and present numerical examples for the mean performance measures and the mean completion time.
Chapter PDF
Similar content being viewed by others
Keywords
References
A.S. Alfa: “A discrete MAY/PH/1 queue with vacations and exhaustive time-lilmited service,” Oper. Res. Letters, 18 (1995) 31–40.
K.C. Chang and D. Sandhu: “Delay analysis of token-passing protocols with limited token holding times,” IEEE Trans, on Communications, COM-42 (1994) 2833–2842.
J. Chiarawongse, M.M. Srinivasan and T.J. Teorey: “The M/Gil queueing system with vacations and timer-controlled service,” IEEE Trans. on Communications, COM-42 (1994) 1846–1855.
On-Ching Yue and C.A. Brooks “Performance of the timed token scheme in MAP,” IEEE Trans. on Communications, COM-38 (1990) 1006–1012.
E.G. Coffman, Tr, G. Fayolle and I. Mitrani: “Two queues with alternating service periods,” Performance ‘87, P.-J. Courtois and G. Latouche, Eds. New York: Elsevier North-Holland (1987) 227–239.
R.B. Cooper: “Introduction to Queueing Theory,” Third edition (Washington, CEEPress Books, The George Washington University, 1990 ).
N.K. Jaiswal: “Priority Queues,” ( New York, Academic Press, 1968 ).
T. Katayama and Y. Takahashi: “Analysis of a two-class priority queue with Bernoulli schedules,” J. Oper Res. Soc. Japan, 35 (1992) 236–249.
M. Komatsu and Y. Hisamoto: “A composite priority queue with maximum limited of preemptive processing time,” Trans. of IEICE, J 72-A (1989) 1700–1703 (in Japanese).
M. Kuczma, B. Choczewski and R. Ger: “Iterative Functional Equations,” Encyclopedia of Mathematics and its Applications Vol. 32 (Cambridge University Press, 1990 ).
K.K. Leung and M. Eisenberg: “A single-server queue with vacations and gated time-limited service,” IEEE Trans. on Communications, COM-38 (1990) 1454–1462.
K.K. Leung and M. Eisenberg: “A single-server queue with vacations and non-gated time-limited service,” Performance Evaluation, 12 (1991) 115–125.
K.K. Leung: “Cyclic-service systems with nonpreemptive, time-limited service,” IEEE Trans. on Communications, COM-42 (1994) 2521–2524.
F. Machihara: “On the queue with PH-Markov renewal preemptions,” J. Oper. Res. Soc. Japan, 36 (1993) 13–28.
M. de Prycker: “Asynchronous Transfer Mode, Solution for Broadband ISDN,” Third edition (Prentice Hall, 1995).
B. Sengupta: “A queue with service interruptions in an alternating random environment,” Oper. Res., 38 (1990) 308–318.
L. Takics: “Introduction to the Theory of Queues,” ( New York, Oxford University Press, 1962 ).
H. Takagi, “Queueing Analysis: A Foundation ofPerforuuunce Evaluation Vol. 1, Vacation and Priority Systems, l’art 1,” ( Elsevier Science Publisher B.V., North-Holland, 1991 ).
H. Takagi mud K.K. Leung: “Analysis of a discrete-time queueing system with time-limited service,” Queueing Systems, 18 (1994) 183–197.
T. Takine and T. Hasegawa: “The workload in the MAP/Gil queue with state-dependent services: Its applications to a queue with preemptive resume priority,” Stochastic Models, 10 (1994) 183–204.
M. Tangemann and K. Sauer: “Performance analysis of the timed token protocol of FDDI and FDDI-II,” IEEE J. on Selected Areas in Communications, SAC-9 (1991) 271–278.
R.W. Wolff: “Stochastic Modeling and the Theory of Queues,” (Prentice-Hall International Editions, 1989).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Katayama, T. (1998). Two-Class Priority Queueing System with Time-Limited Schedule. In: Hasegawa, T., Takagi, H., Takahashi, Y. (eds) Performance and Management of Complex Communication Networks. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35360-9_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-35360-9_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6162-7
Online ISBN: 978-0-387-35360-9
eBook Packages: Springer Book Archive