The synchronization of poisson processes and queueing networks with service and synchronization nodes

Advances in Applied Probability

Volumn 32, Issue 3, 2000, Pages 824-843

  Prabhakar, Balaji ^a   Bambos, Nicholas ^b   Mountford, T S ^c  

^a STANFORD UNIVERSITY   (United States)

^b Stanford University   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Poisson processes; Queueing networks; Synchronization

Indexed keywords

QUEUEING NETWORKS; RANDOM PROCESSES; SYNCHRONIZATION; TELECOMMUNICATION TRAFFIC;

BERNOULLI SAMPLING; POISSON PROCESSES; SYNCHRONIZATION NODES;

PROBABILITY;

EID: 0034269215     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1013540246     Document Type: Article

References (20)

1. Anantharam, V. (1988). Modelling the flow of coalescing data streams through a processor. J. Appl. Prob. 25, 184-193.
2. Asmussen, S. (1987). Applied Probability and Queues. John Wiley, New York.
3. Baccelli, f., Cohen, G., Oldser, G. J. and Quadrat, J.-P. (1992). Synchronization and Linearity—an Algebra for Discrete Event Systems. John Wiley, New York.
4. Baccelli, F. and Makowski, A. M. (1989). Queueing models for systems with synchronization constraints. Proc. IEEE 77, 138-161.
5. Baccelli, f., Massey, W. A. and Towsley, D. (1989). Acyclic fork-join queueing networks. J. Assoc. Comput. Mach. 36, 615-642.
6. Baskett, f., Chandy, K., Muntz, r. R. and Palacios, F. G. (1975). Open, closed and mixed networks of queues with different classes of customers. J. Assoc. Comput. Mach. 22, 248-260.
7. BrEmaud, P (1981). Point Processes and Queues: Martingale Dynamics. Springer, New York.
8. Chung, K. L. (1974). A Course in Probability Theory, 2nd edn. Academic Press, New York.
9. Commoner, F. (1972). Deadlocks in Petri Nets. Res. Rept CA-7606-2311, Applied Data Research Inc.
10. Daley, D. J. and Vere-Jones, D. (1988). An Introduction to the Theory of Point Processes. Springer, NewYork.
11. Florin, G. and Natkin, S. (1985). On open synchronized queueing networks. In Proc. Int. Workshop on Timed Petri Nets, Torino, Italy.
12. Harrison, J. M. (1973). Assembly-like queues. J. Appl. Prob. 10, 354-367.
13. Jackson, J. R. (1957). Networks of waiting lines. Operat. Res. 15, 254-265
14. Jacod, J. and Shiryaev, A. N. (1987). Limit Theorems for Stochastic Processes. Springer, Heidelberg.
15. Kelly, F. (1979). Reversibility and Stochastic Networks. John Wiley, London.
16. Loynes, R. M. (1962). The stability of a queue with non-independent inter-arrival and service times. Proc. Camb. Philos. Soc. 58, 497-520.
17. Matthes, K., Kerstan, J. and Mecke, J. (1978). Infinitely Divisible Point Processes. Akademie Verlag, Berlin.
18. Walrand, J. (1988). An Introduction to Queueing Networks. Prentice Hall, Englewood Cliffs.
19. Walrand, J. (1989) Proc. 3rd Int. Workshop on Petri nets and performance models, Kyoto, Japan. IEEE Computer Society Press, Los Alamitos, California.
20. Walrand, J. (1991) Proc. 4th Int. Workshop on Petri nets and performance models, Melbourne, Australia. IEEE Computer Society Press, Los Alamitos, California.