Two examples for computationally tractable periodic queues

International Journal of Simulation: Systems, Science and Technology

Volumn 3, Issue 3-4, 2002, Pages 15-24

  Breuer, L ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

BMAP; Erlang loss formula; Markov jump processes; Matrix analytical methods; Periodic queues; SMAP; Spatial queues

Indexed keywords

COMPLEX NETWORKS; MARKOV PROCESSES;

ANALYTICAL METHOD; BMAP; ERLANG LOSS FORMULA; MARKOV JUMP PROCESS; PERIODIC QUEUES; SMAP; SPATIAL QUEUES;

QUEUEING THEORY;

EID: 84925158683     PISSN: 14738031     EISSN: 1473804X     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. Asmussen, S. and Thorisson, H. (1987). A Markov chain approach to periodic queues. J. Appl. Probab., 24:215–225.
2. Bambos, N. and Walrand, J. (1989). On queues with periodic inputs. J. Appl. Probab., 26(2):381–389.
3. Bellman, R. (1997). Introduction to matrix analysis. Philadelphia, PA: SIAM.
4. Breuer, L. (1999). Markovian Spatial Queues with Periodic Arrival and Service Rates. In Baum et al., editor, Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen. Kurzvorträge der 10.GI/ITG-Fachtagung MMB’99, pages 97–102. Research Report No.99-17, Dept. of Mathematics and Computer Science, University of Trier, Germany.
5. Breuer, L. (2000). Spatial Queues. PhD thesis, University of Trier, Germany.
6. Breuer, L. (2001). The Periodic BMAP/PH/c Queue. Queueing Systems, 38(1):67–76.
7. Breuer, L. (2002a). An EM Algorithm for Batch Markovian Arrival Processes and its Comparison to a Simpler Estimation Procedure. Annals of Operations Research, 112:123–138.
8. Breuer, L. (2002b). On Markov–Additive Jump Processes. Queueing Systems, 40(1):75–91.
9. Breuer, L. (2002c). Simple Solutions for a Class of Periodic Queues. In Amborski, K. and Meuth, H., editors, Modelling and Simulation 2002, pages 505–512, Ghent, Belgium. SCS Europe.
10. Breuer, L. (2003). From Markov Jump Processes to Spatial Queues. Kluwer, Dordrecht (Netherlands).
11. Falin, G. (1989). Periodic queues in heavy traffic. Adv. Appl. Probab., 21(2):485–487.
12. Gikhman, I. and Skorokhod, A. (1969). Introduction to the theory of random processes. Saunders.
13. Harrison, J. and Lemoine, A. J. (1977). Limit theorems for periodic queues. J. Appl. Probab., 14:566–576.
14. Hasofer, A. (1964). On the single-server queue with non-homogeneous Poisson input and general service time. J. Appl. Probab., 1:369–384.
15. Heyman, D. P. and Whitt, W. (1984). The asymptotic behavior of queues with time-varying arrival rates. J. Appl. Probab., 21:143–156.
16. Lemoine, A. J. (1981). On queues with periodic Poisson input. J. Appl. Probab., 18:889–900.
17. Lemoine, A. J. (1989). Waiting time and workload in queues with periodic Poisson input. J. Appl. Probab., 26(2):390–397.
18. Lucantoni, D. M. (1991). New results on the single server queue with a batch Markovian arrival process. Commun. Stat., Stochastic Models, 7(1):1–46.
19. Massey, W. (1981). Non–Stationary Queues. PhD thesis, Stanford University.
20. Neuts, M. F. (1979). A versatile Markovian point process. J. Appl. Probab., 16:764–774.
21. Rolski, T. (1987). Approximation of periodic queues. Adv. Appl. Probab., 19:691–707.
22. Rolski, T. (1989). Queues with nonstationary inputs. Queueing Syst., 5(1-3):113–129.
23. Willie, H. (1998). Periodic steady state of loss systems with periodic inputs. Adv. Appl. Probab., 30(1):152–166.