Light-traffic analysis for queues with spatially distributed arrivals

Mathematics of Operations Research

Volumn 21, Issue 1, 1996, Pages 135-157

  Kroese, Dirk P ^a   Schmidt, Volker ^b  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

Continuous polling system; General stationary input; Greedy server; Light traffic derivative; Poisson arrivals; Queue length; Queueing theory; Taylor expansion; Workload

Indexed keywords

COMPUTATIONAL METHODS; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; OPERATIONS RESEARCH; PROBABILITY DENSITY FUNCTION; RANDOM PROCESSES;

CONTINUOUS POLLING SYSTEM; GENERAL STATIONARY INPUT; GREEDY SERVER; LIGHT TRAFFIC ANALYSIS; LIGHT TRAFFIC DERIVATIVES; POISSON ARRIVALS; QUEUE LENGTH; SPATIALLY DISTRIBUTED ARRIVALS; TAYLOR EXPANSION; WORKLOAD;

QUEUEING THEORY;

EID: 0030085186     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.21.1.135     Document Type: Article

References (42)

1. Altman, E., H. Levy (1993). Queueing in space. Preprint 4-93, Rutgers University, New Brunswick, New Jersey.
2. _, U. Yechiali (1993). Cyclic Bernoulli polling. Z. Oper. Res. 38 55-76.
3. Baccelli, F., P. Brémaud (1993). Virtual customers in sensitivity and light traffic analysis via Campbell's formula for point processes. Adv. Appl. Probab. 25, 221-234.
4. _, _ (1994). Elements of Queueing Theory. Springer, Berlin.
5. Bertsimas, D. J., G. van Ryzin (1991). A stochastic and dynamic vehicle routing problem in the Euclidean plane. Oper. Res. 39 601-615.
6. J. P. C. Blanc, J. P. C., R. D. van der Mei (1995). Optimization of polling systems with Bernoulli schedules. Performance Evaluation 22 139-158.
7. Blaszczyszyn, B. (1995). Factorial moment expansion for stochastic systems. Stock. Proc. Appl. 56 321-335.
8. _, A. Frey, V. Schmidt (1995). Light-traffic approximations for Markov-modulated multi-server queues. Stochastic Models 11 423-445.
9. _, T. Rolski, V. Schmidt (1995). Light-traffic approximations in queues and other stochastic models. Dshalalow, J. H., ed., Advances in Queueing: Theory, Methods and Open Problems. CRC Press, Boca Raton, FL, 225-242.
10. Borovkov, A., R. Schassberger (1994). Ergodicity of a polling network. Stochastic Process Appl. 50 253-262.
11. Boxma, O. J. (1989). Workloads and waiting times in single-server systems with multiple customer classes. Queueing Systems Theory Appl. 5 185-214.
12. _, W. P. Groenendijk (1987). Pseudo-conservation laws in cyclic service systems. J. Appl. Probab. 24 949-964.
13. _, J. A. Weststrate (1989). Waiting times in polling systems with Markovian server routing. Stiege, G. and Lie, J. S., eds., Messung, Modellierung und Bewertung von Rechnersystemen und Netzen. Springer, Berlin, 89-104.
14. Coffman, E. G. Jr., E. N. Gilbert (1986). A continuons polling system with constant service times. IEEE Trans. Inf. Th. IT-32 584-591.
15. _, _ (1987). Polling and greedy servers on a line. Queueing Systems Theory Appl. 2 115-145.
16. _, A. Stolyar (1993). Continuous polling on graphs. Probab. Engin. Inf. Sci. 7 209-226.
17. Daley, D., T. Rolski (1992). Finiteness of waiting-time moments in general stationary single-server queues. Ann. Appl. Probab. 2 987-1008.
18. _, _ (1994). Light traffic approximations in general stationary single-server queues. Stochastic Process Appl. 49 141-158.
19. Doshi, B. T. (1990a). Conditional and unconditional distributions for M/G/1 type queues with server vacations. Queueing Systems Theory Appl. 7 229-252.
20. _ (1990b). Generalization of the stochastic decomposition for single-server queues with vacations. Stochastic Models 6 307-333.
21. Fendick, K. W., W. Whitt (1989). Measurements and approximations to describe the offered traffic and predict the average workload in a single-server queue. Proc. IEEE 77 171-194.
22. Franken, P., D. König, U. Arndt, V. Schmidt (1982). Queues and Point Processes. J. Wiley & Sons, Chichester.
23. Fuhrmann, S. W., R. B. Cooper (1985a). Stochastic decomposition in the M/G/1 queue with generalized vacations. Oper. Res. 33 1117-1129.
24. _, _ (1985b). Application of decomposition principle in M/G/1 vacation model to two continuum cyclic queueing models - especially token-ring LANs. AT&T Techn. J. 64 1091-1098.
25. Keilson, J., L. D. Servi (1986). Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules. J. Appl. Probab. 23 790-802.
26. Kleinrock, L., H. Levy (1988). The analysis of random polling systems. Oper. Res. 36 716-732.
27. König, D., V. Schmidt (1992). Random Point Processes. Teubner, Stuttgart, Germany.
28. Kroese, D. P., V. Schmidt (1992). A continuous polling system with general service times. Ann. Appl. Probab. 2 906-927.
29. _, _ (1993). Queueing systems on a circle. Z. Oper. Res. 37 303-331.
30. _, _ (1994). Single-server queues with spatially distributed arrivals. Queueing Systems Theory Appl. 17 317-345.
31. Lucantoni, D. M., K. S. Meier-Hellstern, M. F. Neuts (1990). A single-server queue with server vacations and a class of nonrenewal arrival processes. Adv. Appl. Probab. 22 676-705.
32. Miyazawa, M. (1994). Decomposition formulas for single server queues with vacations: A unified approach by the rate conservation law. Stochastic Models 10 389-413.
33. Nahimas, S., M. H. Rothkopf (1984). Stochastic models of internal mail delivery systems. Management Sci. 30 1113-1120.
34. Reiman, M. I., B. Simon (1988a). An interpolation approximation for queueing systems with Poisson input. Oper. Res. 36 454-469.
35. _, _ (1988b). Light traffic limits of sojourn time distributions in Markovian queueing networks. Stochastic Models 4 191-233.
36. _, _ (1989). Open queueing systems in light traffic. Math. Oper. Res. 14 26-59.
37. Schassberger, R. (1993). Stability of polling networks with state-dependent server routing. Preprint. Techn. University of Braunschweig.
38. Sigman, K. (1992). Light traffic for workload in queues. Queueing Systems Theory Appl. 11 429-442.
39. Simon, B. (1993). Calculating light traffic limits for sojourn times in open Markovian queueing systems. Stochastic Models 9 213-231.
40. Takagi, H. (1986). Analysis of Polling Systems. MIT Press, Cambridge, MA.
41. Whitt, W. (1988). A light-traffic approximation for single-class departure processes from multi-class queues. Management Sci. 34 1333-1346.
42. _ (1989). An interpolation approximation for the mean workload in a GI/G/1 queue. Oper. Res. 37 936-952.