Abstract
We consider the joint distribution of successive sojourn times of customers traversing a path in Jackson network. It is shown in a general setting that sojourn times exhibit positive dependence. This especially applies to paths which admit overtaking due to the network topology as well as due to the internal node structure.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. Baskett, M. Chandy, R. Muntz and J. Palacios, Open, closed and mixed networks of queues with different classes of customers, J. Assoc. Comput. Mach. 22 (1975) 248–260.
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 of a queueing system, Oper. Res. 4 (1956) 699–704.
P.J. Burke, The output process of a stationary M / M / s queueing system, Ann. Math. Statist. 39 (1968) 1144–1152.
P.J. Burke, The dependence of sojourn times in tandem M/M/s queues, Oper. Res. 17 (1969) 754–755.
W.M. Chow, The cycle time distribution of exponential cyclic queues, J. Assoc. Comput. Mach. 27 (1980) 281–286.
E.G. Coffman, G. Fayolle and I. Mitrani, Sojourn times in a tandem queue with overtaking: Reduction to a boundary value problem, Comm. Statist. Stochastic Models 2 (1986) 43–65.
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, FL, 1997) chapter 7, pp. 197–224.
H. Daduna and R. Szekli, Dependencies in Markovian networks, Adv. in Appl. Probab. 25 (1995) 226–254.
R.R. Disney and P.C. Kiessler, Traffic Processes in Queueing Networks: A Markov Renewal Approach (Johns Hopkins Univ. Press, London, 1987).
G. Fayolle, R. Iasnogorodski and I. Mitrani, The distribution of sojourn times in a queueing network with overtaking: Reduction to a boundary problem, in: Performance Analysis, eds. A.K. Agrawala and S.K. Tripathi (North-Holland, Amsterdam, 1983) pp. 477–486.
R.D. Foley and P.C. Kiessler, Positve correlations in a three-node Jackson queueing network, Adv. in Appl. Probab. 21 (1989) 241–242.
J.R. Jackson, Networks of waiting lines, Oper. Res. 5 (1957) 518–521.
F.P. Kelly, Reversibility and Stochastic Networks (Wiley, Chichester/New York/Brisbane/Toronto, 1979).
F. Kelly and P. Pollett, Sojourn times in closed queueing networks, Adv. in Appl. Probab. 15 (1983) 638–653.
P.C. Kiessler, A simulation analysis of sojourn times in a Jackson network, Technical Report vtr 8016, Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University, Blacksburgh (1980).
P.C. Kiessler and R.L. Disney, The sojourn time in a three-node, acyclic, Jackson network, Technical Report vtr 8203, Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University, Blacksburgh (1982).
C. Knessl and J.A. Morrison, Heavy traffic analysis of the sojourn time in a three-node Jackson network with overtaking, Queueing Systems 8 (1991) 165–182.
C. Knessl and J.A. Morrison, Heavy traffic analysis of the sojourn time in tandem queues with overtaking, SIAM J. Appl. Math. 51 (1991) 1740–1763.
K.H. Kook and R.F. Serfozo, Travel and sojourn times in stochastic networks, Ann. Appl. Probab. 3 (1993) 228–252.
B. Melamed, Sojourn times in queueing networks, Math. Oper. Res. 7 (1982) 223–244.
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.
R. Schassberger and H. Daduna, The time for a roundtrip in a cycle of exponential queues, J. Assoc. Comput. Mach. 30 (1983) 146–150.
R. Schassberger and H. Daduna, Sojourn times in queueing networks with multiserver nodes, J. Appl. Probab. 24 (1987) 511–521.
B. Simon and R.D. Foley, Some results on sojourn times in acyclic Jackson networks, Managm. Sci. 25 (1979) 1027–1034.
R. Szekli, Stochastic Ordering and Dependence in Applied Probability, Lecture Notes in Statistics, Vol. 97 (Springer, New York, 1995).
J. Walrand and P. Varaiya, Sojourn times and the overtaking condition in Jacksonian networks, Adv. in Appl. Probab. 12 (1980) 1000–1018.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Daduna, H., Szekli, R. On the correlation of sojourn times in open networks of exponential multiserver queues. Queueing Systems 34, 169–181 (2000). https://doi.org/10.1023/A:1019105002817
Issue Date:
DOI: https://doi.org/10.1023/A:1019105002817