Conditional job-observer property for multitype closed queueing networks

Journal of Applied Probability

Volumn 39, Issue 4, 2002, Pages 865-881

  Daduna, Hans ^a   Szekli, Ryszard ^b  

^a UNIVERSITY OF HAMBURG   (Germany)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

Cyclic queues; Gordon Newell network; Job observer property; Palm measure; Papangelou formula; Point process; Product form; Stochastic intensity

Indexed keywords

EID: 0037003221     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1037816025     Document Type: Article

References (19)

1. BACCELLI, F. AND BRÉMAUD, P. (1994). Elements of Queueing Theory. Springer, Berlin.
2. BOXMA, O. J. (1984). Analysis of successive cycles in a cyclic queue. In Performance of Computer Communication Systems, eds H. Rudin and W. Bux, North Holland, Amsterdam, pp. 293-306.
3. BOXMA, O. J. AND DONK, P. (1982). On the response time and cycle time distributions in a two stage cyclic queue. Performance Evaluation 2, 181-194.
4. BOXMA, O. J., KELLY, F. P. AND KONHEIM, A. G. (1984). The product form for sojourn time distributions in cyclic exponential queues. J. Assoc. Comput. Mach. 31, 128-133.
5. BRÉMAUD, P., KANNURPATTI, R. AND MAZUMDAR, R. (1992). Event and time averages: a review. Adv. Appl. Prob. 24, 377-411.
6. DADUNA, H. (1997). Sojourn time distributions in non-product-form queueing networks. In Frontiers in Queueing, ed. J. H. Dshalalow, CRC, Boca Raton, FL, pp. 197-224.
7. DADUNA, H. AND SZEKLI, R. (2000a). Conditional job-observer properties in multitype closed queueing networks. Preprint, Mathematical Institute, University of Wrocław.
8. DADUNA, H. AND SZEKLI, R. (2000b). Monotonicity and dependence properties of sojourn and cycle times in closed networks. Preprint, Schwerpunkt Mathematische Statistik und Stochastische Prozesse, Fachbereich Mathematik, Universität Hamburg.
9. JACOD, J. (1975). Multivariate point processes: predictable projection, Radon-Nikodym derivatives, representation of martingales. Z Wahrscheinlichkeitsth. 31, 235-253.
10. KELLY, F. P. (1979). Reversibility and Stochastic Networks. John Wiley, New York.
11. KELLY, F. P. AND POLLET, P. K. (1983). Sojourn times in closed queueing networks. Adv. Appl. Prob. 15, 638-653.
12. KOOK, K. H. AND SERFOZO, R. F. (1993). Travel and sojourn times in stochastic networks. Ann. Appl Prob. 3, 228-252.
13. LAVENBERG, S. S. AND REISER, M. (1980). Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers. J. Appl Prob. 17, 1048-1061.
14. MITRANI, I. (1987). Modelling of Computer and Communications Systems. Cambridge University Press.
15. SCHASSBERGER, R. AND DADUNA, H. (1987). Sojourn times in queueing networks with multiserver nodes. J. Appl. Prob. 24, 511-521.
16. SERFOZO, R. F. (1999). Introduction to Stochastic Networks. Springer, New York.
17. SEVCIK, K. C. AND MITRANI, I. (1981). The distribution of queueing network states at input and output instants. J. Assoc. Comput. Mach. 28, 358-371.
18. WALRAND, J. (1988). An Introduction to Queueing Networks. Prentice Hall, Englewood Cliffs, NJ.
19. ZAZANIS, M. (1997). Formulas and representations for cyclic Markovian networks via Palm calculus. Queueing Systems 26, 151-167.