Abstract
We investigate a cycle of Bernoulli servers in discrete time. We show that the joint distribution of a customer’s sojourn times at the nodes during a round trip is of product form and can explicitly be written down. The results are used to prove independence of sojourn times in an open series of Bernoulli servers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.J. Bae and T. Suda, Survey of traffic control schemes and protocols in ATM-networks, Proc. IEEE 79(2) (1991) 170–189.
O.J. Boxma and H. Daduna, Sojourn times in queueing networks, in: Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (IFIP, North-Holland, Amsterdam, 1990) pp. 401–450.
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.
P.J. Burke, The output process of a stationary M/M/s queueing system, Ann. Math. Statist. 39 (1968) 1144–1152.
W.M. Chow, The cycle time distribution of exponential cyclic queues, J. Assoc. Comput. Mach. 27 (1980) 281–286.
H. Daduna, The cycle time distribution in a cycle of Bernoulli servers in discrete time, Math. Methods Oper. Res. 44 (1996) 295–332.
H. Daduna, Sojourn time distributions in non-product form queueing networks, in: Frontiers in Queueing: Models and Applications in Science and Engineering, ed. J. Dshalalow (CRC Press, Boca Raton, 1996) pp. 197–224.
A. Gravey and G. Hebuterne, Simultaneity in discrete-time single server queues with Bernoulli inputs, Performance Evaluation 14 (1992) 123–131.
P.G. Harrison, Laplace transform inversion and passage time distributions in Markov processes, J. Appl. Probab. 27 (1980) 74–87.
C. Herrmann, A performance model for statistical multiplexing of correlated ATM traffic superpositions, in: Messung, Modellierung und Bewertung von Rechen-und Kommunikationssystemen, eds. B. Walke and O. Spaniol (Springer, Berlin, 1993) pp. 199–211.
J. Hsu and P.J. Burke, Behaviour of tandem buffers with geometric input and Markovian output, IEEE Trans. Commun. 24 (1976) 358–361.
F. Kelly and P. Pollett, Sojourn times in closed queueing networks, Adv. Appl. Probab. 15 (1983) 638–653.
F.P. Kelly, Reversibility and Stochastic Networks (Wiley, Chichester/New York/Brisbane/Toronto, 1979).
L. Kleinrock, Communication Nets – Stochastic Message Flow and Delay (McGraw-Hill, New York, 1964).
K.H. Kook and R.F. Serfozo, Travel and sojourn times in stochastic networks, Ann. Appl. Probab. 3 (1993) 228–252.
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.
V. Pestien and S. Ramakrishnan, Features of some discrete-time cyclic queueing networks, Queueing Systems 18 (1994) 117–132.
E. Reich, Waiting times when queues are in tandem, Ann. Math. Statist. 28 (1957) 768–773.
E. Reich, Note on queues in tandem, Ann. Math. Statist. 34 (1963) 338–341.
M. Reiser, A queueing network analysis of computer communication networks with window flow control, IEEE Trans. Commun. 27 (1979) 1199–1209.
M. Reiser, Performance evaluation of data communication systems, Proc. IEEE 70 (1982) 171–196.
R. Schassberger and H. Daduna, The time for a roundtrip in a cycle of exponential queues, J. Assoc. Comput. Mach. 30 (1983) 146–150.
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.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Daduna, H. The joint distribution of sojourn times for a customer traversing an overtake-free series of queues: The discrete time case. Queueing Systems 27, 297–323 (1997). https://doi.org/10.1023/A:1019174417470
Issue Date:
DOI: https://doi.org/10.1023/A:1019174417470