Some results for steady-state and sojourn time distributions in open and closed linear networks of Bernoulli servers with state-dependent service and arrival rates

Performance Evaluation

Volumn 30, Issue 1-2, 1997, Pages 3-18

  Daduna, Hans ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Admission control; Arrival theorem; Cyclic queues; End to end delay; FCFS Bernoulli servers; Joint distribution of sojourn times; Loss networks; Open tandem network; Product form distribution

Indexed keywords

CASCADE CONNECTIONS; COMPUTER NETWORKS; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; LINEAR NETWORK ANALYSIS; NETWORK PROTOCOLS; PROBABILITY; QUEUEING THEORY; TELECOMMUNICATION TRAFFIC;

ARRIVAL THEOREM; BERNOULLI SERVERS; PERFORMANCE EVALUATION;

TELECOMMUNICATION NETWORKS;

EID: 0031185823     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0166-5316(96)00058-2     Document Type: Article

References (19)

1. R.J. Boucherie, Product form in queueing networks, Ph.D. Thesis, Vrije Universiteit Amsterdam, Thesis Publishers Amsterdam, 1992.
2. R.J. Boucherie and N.M. Van Dijk, Product forms for queueing networks with state-dependent multiple job transitions, Adv. Appl. Prob. 23 (1991) 152-187.
3. O.J. Boxma and H. Daduna, Sojourn times in queueing networks, in: H. Takagi (Ed.), Stochastic Analysis of Computer and Communication System, North-Holland, Amsterdam (1990) 401-450.
4. H. Daduna, The cycle time distribution in a cycle of Bernoulli servers in discrete time, Preprint No. 94-6, Inst. f. Math. Stochastik, Univ. Hamburg, 1994; (Math. Methods in OR, to appear).
5. H. Daduna, The joint distribution of sojourn times for a customer traversing a series of queues: The discrete time case, Preprint No. 95-3, Inst, für Math. Stochastik, Univ. Hamburg, 1995.
6. W. Henderson and P.G. Taylor, Product form in networks of queues with batch arrivals and batch services, Queueing Systems 6 (1990) 71-88.
7. W. Henderson and P.G. Taylor, Some new results on queueing networks with batch movement, J. Appl. Probab. 28 (1991) 409-421.
8. C. Herrmann, A performance model for statistical multiplexing of correlated ATM traffic superpositions in: B. Walke and O. Spaniol (Eds.), Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen, Springer, Berlin (1993) 199-211.
9. J. Hsu and P.J. Burke, Behaviour of tandem buffers with geometric input and Markovian output, IEEE Trans. Comm. 24 (1976) 358-361.
10. F.P. Kelly, Reversibility and Stochastic Networks, Wiley, Chichester (1979).
11. L. Kleinrock, Communication Nets - Stochastic Message Flow and Delay, McGraw-Hill, New York (1964).
12. K.H. Kook and R.F. Serfozo, Travel and sojourn times in stochastic networks, Ann. Appl. Probab. 3 (1993) 228-252.
13. S.S. Lavenberg and M. Reiser, Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers, J. Appl. Probab. 17 (1980) 1048-1061.
14. M. Miyazawa, On the characterization of the departure rules for discrete-time queueing networks with batch movements and its applications, Queueing Systems 18 (1994) 149-166.
15. H. Osawa, Quasireversibility of a discrete time queue and related models, Queueing Systems 18 (1994) 133-148.
16. V. Pestien and S. Ramakrishnan, Features of some discrete-time cyclic queueing networks, Queueing Systems 18 (1994) 117-132.
17. G. Pujolle, J.P. Claude and D. Seret, A discrete time queueing system with a product form solution, in: T. Hasegawa, H. Takagi and V. Takashashi (Eds.), Computer Networking and Performance Evaluation, Elsevier, Amsterdam (1986).
18. M. Reiser, Calculation of response-time distribution in cyclic exponential queues, Performance Evaluation 1 (1981) 331-333.
19. K.C. Sevcik and I. Mitrani, The distribution of queueing network states at input and output instants, J. ACM 28 (1981) 358-371.