Abstract
In this paper, we have analyzed a discrete-time GI — G — 1 queue with a preemptive resume priority scheduling and two priority classes. We have derived the joint generating function of the system contents of both classes and the generating functions of the delay of both classes. These pgf’s are not explicitly found, but we have proven that the moments of the distributions can be found explicitly in terms of the system parameters. We have shown the impact of priority scheduling on the performance characteristics by some numerical examples.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
H. Bruneel and B.G. Kim, Discrete-time models for communication systems including ATM, Kluwer Academic Publishers, Boston, 1993.
H. Bruneel, Performance of discrete-time queueing systems, Computers and Operations Research, pp. 303–320, 1993.
I. Cidon and R. Guérin, On protective buffer policies, Proceedings of Infocom’ 93 (San Francisco), pp. 1051–1058, 1993.
L. Kleinrock, Queueing systems volume II: Computer applications, John Wiley & Sons, 1976.
K. Liu, D.W. Petr, V.S. Frost, H. Zhu, C. Braun and W.L. Edwards, Design and analysis of a bandwidth management framework for ATM-based broadband ISDN, IEEE Communications Magazine, pp. 138–145, 1997.
F. Machihara, A bridge between preemptive and non-preemptive queueing models, Performance Evaluation 23, pp. 93–106, 1995.
R.G. Miller, Priority queues, Annals of Matematical. Statistics, pp. 86–103, 1960.
S.P. Morgan, Queueing disciplines and passive congestion control in byte-stream networks, IEEE Transactions on Communications 39(7), pp. 1097–1106, 1991.
H. Takagi, Queueing analysis A foundation of Performance Evaluation Volume 1: Vacation and priority systems, North-Holland, 1991.
T. Takine and T. Hasegawa, The workload in the MAP/G/1 queue with state-dependent services: its application to a queue with preemptive resume priority, Commun. Statist.-Stochastic Models 10(1), pp. 183–204, 1994.
J. Walraevens, B. Steyaert and H. Bruneel, Analysis of a preemptive resume priority buffer with general service times for the high priority class, Proceedings of the Africom 2001 Conference, Cape Town, May 28-30, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walraevens, J., Steyaert, B., Bruneel, H. (2002). Performance Analysis of a GI-G-1 Preemptiv Resume Priority Buffer. In: Gregori, E., Conti, M., Campbell, A.T., Omidyar, G., Zukerman, M. (eds) NETWORKING 2002: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications. NETWORKING 2002. Lecture Notes in Computer Science, vol 2345. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47906-6_60
Download citation
DOI: https://doi.org/10.1007/3-540-47906-6_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43709-3
Online ISBN: 978-3-540-47906-2
eBook Packages: Springer Book Archive