Abstract
An analysis is provided for an alternating priority queue with general decreasing service of a parameter (k 1 = ∞, k 2 = K) which operates as follows: Starting once a service of class-1 messages a single server serves all messages in queue 1 until it becomes empty. After service completion in queue 1, the server switches over to queue 2 and continues serving messages in queue 2 until either queue 2 becomes empty, or the number of messages decreases to K less than that found upon its arrival at queue 2, whichever occurs first, where 1 ≤ K ≤ ∞. Two modified models with server vacations are analyzed by a uniform method. We assume that arrival streams are Poissonian, message service times for each priorty class, setup times and vacation times are generally distributed, and switch-over times are zero. This paper analyzes joint queue-length distributions and message waiting time distributions. An explicit expression is obtained for the individual mean waiting times of two-class messages. This results are applicable to the performance analysis of the register insertion ring systems in LANs.
Chapter PDF
Similar content being viewed by others
References
D. Bertsekas and R.G. Gallager: “Data Networks,” Prentice-Hall (1987).
J.W. Cohen: “A two-queue model with semi-exhaustive alternating service,” Performance ‘87, Edited by P.-J. Courtois and G. Latouche, pp. 19–37, North-Holland (1988).
S.S. Fratini: “ Analysis of dynamic priority queue,” Commun. Statist-Stochastic Models, 6, 3, pp. 415 444 (1990).
M. Hofri and K.W. Ross: “On the optimal control of two queues with server set-up times and its analysis,” SIAM J. Comput., 16, 2, pp. 399–420 (1987).
D.E. Huber, W. Steinlin and P.J. Wild: “SILK: An implementation of a buffer insertion ring,” IEEE J. on Selected Areas in Communications, SAC-1, 5, pp. 766–774 (1983).
T. Katayama: “A cyclic-service tandem queueing model with semi-exhaustive service,” Performance of Distributed and Parallel Systems, Eds. T. Hasegawa, H. Takagi and Y. Takahashi, pp. 173–183, North-Holland (1989).
T. Katayama and Y. Takahashi: “Analysis of a two-class priority queue with Bernoulli schedules,” J. of the Operations Research Society of Japan, 35, 3, pp. 236–249 (1992).
T. Katayama: “ Performance analysis for a two-class priority queueing model with general decrementing service,” IEICE Trans. Commun., E75-B, 12, pp. 1301–1307 (1992).
B.G. Pittel’: “Optimal control in a mass service system with several flows of demands,” Engineering Cybernetics, 11, 6, pp. 1029–1044 (1972).
L. Tak’acs “Introduction to the Theory of Queues,” Oxford University Press, New York (1962).
Two queues attended by a single server,“ Oper. Res., 16, 3, pp. 639–650 (1968).
H. Takagi: “Mean message waiting time in a symmetric polling system,” Performance’84, Models of Computer System Performance, Edited by Gelenbe, pp. 293–302, North-Holland (1985).
“Queueing Analysis: A Foundation of Performance Evaluation Vol. 1, Vacation and Priority Systems, Part 1,” Elsevier Science Publisher B. V., North-Holland (1991).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Katayama, T. (1995). Analysis of an Alternating Priority Queue with General Decreasing Service and with Setup Times or Server Vacations. In: Hasegawa, T., Pujolle, G., Takagi, H., Takahashi, Y. (eds) Local and Metropolitan Communication Systems. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34884-1_26
Download citation
DOI: https://doi.org/10.1007/978-0-387-34884-1_26
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5672-2
Online ISBN: 978-0-387-34884-1
eBook Packages: Springer Book Archive