Summary
We consider a model of two M/M/1 queues, served by a single server. The service policy for this polling model is of threshold type: the server serves queue 1 exhaustively, and does not remain at an empty queue if the other one is non-empty. It switches from queue 2 to queue 1 when the size of the latter queue reaches some level T, either preemptively or non-preemptively. All switches are instantaneous.
We determine the joint queue length distribution, both using analytic techniques and using the power series algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.P.C. Blanc, “Performance analysis and optimization with the power-series algorithm”, in: Performance Evaluation of Computer and Communication Systems (eds. L. Donatiello and R.D. Nelson), Springer, New York, pp. 53–80, 1993.
O.J. Boxma and D.G. Down, “A two-queue polling model with threshold switching”, in preparation.
O.J. Boxma, G.M. Koole and I. Mitrani, “A two-queue polling model with a threshold service policy”, in: Proceedings MASCOTS’ 95 (eds. P. Dowd and E. Gelenbe), IEEE Computer Society Press, Los Alamitos (CA), pp. 84–89, 1995.
I. Duenyas and M.P. Van Oyen, “Stochastic scheduling of parallel queues with set-up costs”, Technical Report 93–09, Northwestern University, 1993.
E. Gelenbe, I. Mitrani, “Analysis and Synthesis of Computer Systems”, Academic Press, London 1980.
M. Hofri, K.W. Ross, “On the optimal control of two queues with server setup times and its analysis”, SIAM Journal on Computing, 16, pp. 399–420, 1987.
N.K. Jaiswa. “Priority Queues”, Academic Press, New York, 1968.
G.M. Koole, “Assigning a single server to inhomogeneous queues with switching costs”, CWI Report BS-R9405, 1994.
G.M. Koole, “On the power series algorithm”, in: Performance Evaluation of Parallel and Distributed Systems, Part 1 (eds. O.J. Boxma and G.M. Koole), CWI Tract 105, Amsterdam, pp. 139-155, 1994.
Z. Liu, P. Nain, D. Towsley, “On optimal polling policies”, Queueing Systems, 11, pp. 59–83, 1992.
D-S. Lee, “A two-queue model with exhaustive and limited service disciplines”, Report C & C Research Laboratories, NEC USA Inc., 1993.
D-S. Lee, B. Sengupta, “Queueing analysis of a threshold based priority scheme for ATM networks”, IEEE/ACM Transactions on Networking, 1, pp. 709–717, 1993.
R.G. Miller, “Priority queues”, Ann. Math. Statistics, 31, pp. 86–103, 1960.
M.I. Reiman, L.M. Wein, “Dynamic scheduling of a two-class queue with setups”, Working paper, 1994.
L. Takács, “Introduction to the Theory of Queues”, Oxford University Press, New York, 1962.
L. Takács, “Two queues attended by a single server”, Operations Research, 16, pp. 639–650, 1968.
M. Yadin, “Queueing with alternating priorities, treated as random walk on the lattice in the plane”, Journal of Applied Probability, 7, pp. 196–218, 1970.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 ECSC-EC-EAEC, Brussels-Luxembourg
About this chapter
Cite this chapter
Boxma, O.J., Koole, G.M., Mitrani, I. (1995). Polling Models with Threshold Switching. In: Baccelli, F., Jean-Marie, A., Mitrani, I. (eds) Quantitative Methods in Parallel Systems. Esprit Basic Research Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79917-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-79917-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-79919-8
Online ISBN: 978-3-642-79917-4
eBook Packages: Springer Book Archive