Individual customer's behaviour in networks with state-dependent arrival rates

Queueing Systems

Volumn 32, Issue 4, 1999, Pages 351-362

  Daduna, Hans ^a   Meyer, Stephan ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Admission control; Arrival theorem; End to end delay; Joint sojourn times vector; State dependent queues; Steady states

Indexed keywords

ACCESS CONTROL; MOBILE TELECOMMUNICATION SYSTEMS;

ARRIVAL THEOREM; END TO END DELAY; SOJOURN TIME; STATE-DEPENDENT QUEUES; STEADY STATE;

SALES;

EID: 0033235195     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/A:1019103507843     Document Type: Article

References (19)

1. F. Baccelli and P. Brémaud, Elements of Queueing Theory (Springer, Berlin, 1994).
2. F. Baskett, K.M. Chandy, R.R. Muntz and F.G. Palacios, Open, closed and mixed networks of queues with different classes of customers, J. Assoc. Comput. Mach. 22 (1975) 248-260.
3. G. Bolch, S. Greiner, H. de Meer and K.S. Trivedi, Queueing Networks and Markov Chains (Wiley, New York, 1998).
4. O.J. Boxma and H. Daduna, Sojourn times in queueing networks, in: Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (North-Holland, Amsterdam, 1990) pp. 401-450.
5. O.J. Boxma, F.P. Kelly and A.G. Konheim, The product form for sojourn time distributions in cyclic exponential queues, J. Assoc. Comput. Mach. 31 (1984) 128-133.
6. P.J. Burke, The output process of a stationary M/M/s queueing system, Ann. Math. Statist. 39 (1968) 1144-1152.
7. H. Daduna, Discrete time analysis of a state dependent tandem with different customer types, in: Foundations of Computer Science, Potential-Theory-Cognition, eds. C. Freksa, M. Jantzen, and R. Valk, Lecture Notes in Computer Science, Vol. 1337 (Springer, Berlin, 1997) pp. 287-296.
8. H. Daduna, Sojourn time distributions in non-product-form queueing networks, in: Frontiers in Queueing: Models and Applications in Science and Engineering, ed. J.H. Dshalalow (CRC Press, Boca Raton, FL, 1997) pp. 194-224.
9. H. Daduna, 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 30 (1997) 3-18.
10. P.G. Harrison, Laplace transform inversion and passage-time distributions in Markov processes, J. Appl. Probab. 27 (1990) 74-87.
11. F.P. Kelly, Reversibility and Stochastic Networks (Wiley, New York, 1979).
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. E. Reich, Waiting times when queues are in tandem, Ann. Math. Statist. 28 (1957) 768-773.
15. E. Reich, Note on queues in tandem, Ann. Math. Statist. 34 (1963) 338-341.
16. R. Schassberger and H. Daduna, Sojourn times in queuing networks with multiserver nodes, J. Appl. Probab. 24 (1987) 511-521.
17. K.C. Sevcik and I. Mitrani, The distribution of queueing network, states at input and output instants, J. Assoc. Comput. Mach. 28 (1981) 358-371.
18. H. Takagi, ed., Stochastic Analysis of Computer and Communication Systems (North-Holland, Amsterdam, 1990).
19. D.D. Yao, ed., Stochastic Modeling and Analysis of Manufacturing Systems, Springer Series in Operations Research (Springer, New York, 1994).