Dynamic server assignment in a two-queue model

European Journal of Operational Research

Volumn 103, Issue 3, 1997, Pages 595-609

  Boxma, O J ^a,b   Down, D G ^a  

^a CWI   (Netherlands)

^b TILBURG UNIVERSITY   (Netherlands)

Author keywords

ATM; Polling; Queue length distribution; Queueing; Threshold service

Indexed keywords

APPROXIMATION THEORY; AUTOMATIC TELLER MACHINES; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION;

POLLING; QUEUE LENGTH DISTRIBUTION; QUEUEING MODEL;

QUEUEING THEORY;

EID: 0031372338     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)82089-9     Document Type: Article

References (26)

1. Abate, J., and Whitt, W. (1992), "Numerical inversion of probability generating functions", Operations Research Letters 12, 245-251.
2. Borst, S.C., "A pseudoconservation law for a polling system with a dormant server", in: Labetoulle, J., and Roberts J.W., eds., The Fundamental Role of Teletraffic in the Evolution of Telecommunications Networks, North-Holland Publ. Cy., Amsterdam, 729-742.
3. Boxma, O.J., and Groenendijk, W.P. (1987), "Pseudoconservation laws in cyclic service systems", Journal of Applied Probability 124, 949-964.
4. Boxma, O.J., Koole, G., and Mitrani, I. (1995), "A two-queue polling model with a threshold service policy", in: Dowd, P., and Gelenbe, E., eds., Proceedings MASCOTS '95, IEEE Computer Society Press, Los Alamitos, CA, 84-89.
5. Boxma, O.J., Koole, G., and Mitrani, I. (1995), "Polling models with threshold switching", in: Baccelli, F., Jean-Marie, A., and Mitrani, I., eds., Quantitative Methods in Parallel Systems, Springer Verlag, Berlin, 129-140.
6. Choudhury, G.L., and Lucantoni, D.M. (1996), "Numerical computation of the moments of a probability distribution from its transform", Operations Research 44, 368-381.
7. Cohen, J.W. (1982), The Single Server Queue, North-Holland Publ. Cy., Amsterdam.
8. Cohen, J.W., and Down, D.G. (1995), "On the role of Rouché's theorem in queueing theory analysis", CWI Report BS-R9523, to appear in Queueing Systems.
9. Dai, J.G. ( 1995), "On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models", Ann. Appl. Probab. 5, 49-77.
10. Down, D.G., and Boxma, O.J. (1995), "A two-queue polling model with threshold switching", in: Proceedings of the Nordic Teletraffic Seminar NTS-12, Espoo, Finland.
11. Duenyas, I., and Van Oyen, M.P. (1993), "Stochastic scheduling of parallel queues with set-up costs", Technical Report 93-09, Northwestern University.
12. Eisenberg, M. (1994), "The polling system with a stopping server", Queueing Systems 18, 387-431.
13. Gail, H.R., Hantler, S.L., and Taylor, B.A. (1996), "Spectral analysis of M/G/1 and G/M/1 type Markov chains", Advances in Applied Probability 28, 114-165.
14. Gelenbe, E., and Mitrani, I. (1980), Analysis and Synthesis of Computer Systems, Academic Press, London.
15. Haverkort, B., Idzenga, H.P., and Kim, B.G. (1994), "Performance evaluation of ATM cell scheduling policies using Stochastic Petri Nets", Report University of Twente, Tele-Informatics and Open Systems Group TIOS 94-19.
16. Hofri, M., and Ross, K.W. (1987), "On the optimal control of two queues with server setup times and its analysis", SIAM Journal on Computing 16, 399-420.
17. Koole, G.M. (1994), "Assigning a single server to inhomogeneous queues with switching costs", CWI Report BS-R9405, to appear in Theoretical Computer Science, 182 (1997).
18. Lee, D.-S. (1993), "A two-queue model with exhaustive and limited service disciplines", Report C & C Research Laboratories, NEC USA Inc.
19. Lee, D.-S., and Sengupta, B. (1993), "Queueing analysis of a threshold based priority scheme for ATM networks", IEEE/ACM Transactions on Networking 1, 709-717.
20. Meyn, S.P. (1995), "Transience of multiclass queueing networks via fluid limit models", Ann. Appl. Probab. 5, 946-957.
21. Mitrani, I., and Mitra, D. (1992), "A spectral expansion method for random walks on semi-infinite strips", in: Beauwens, R., de Groen, P., eds., Iterative Methods in Linear Algebra, Elsevier, Amsterdam.
22. Neuts, M.F. (1979), "Queues solvable without Rouché's theorem", Operations Research 27, 767-781.
23. Press, W.H., Flannery, B.P., and Teukolsky, S.A. (1988), Numerical Recipes in C: The Art of Scientific Computing, Cambridge.
24. Reiman, M.I., and Wein, L.M. (1994), "Dynamic scheduling of a two-class queue with setups", working paper.
25. Takács, L. (1968), "Two queues attended by a single server", Operations Research 16, 639-650.
26. Yadin, M. (1970), "Queueing with alternating priorities, treated as random walk on the lattice in the plane", Journal of Applied Probability 7, 196-218.