Skip to main content
SpringerLink
Log in

Travel times in queueing networks and network sojourns

  • Exact Analysis
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We first describe expected values of sojourn times for semi-stationary (or synchronous) networks. This includes sojourn times for units and sojourn times for the entire network. A typical sojourn time of a unit is the time it spends in a sector (set of nodes) while it travels through the network, and a typical network sojourn time is the busy period of a sector. Our results apply to a wide class of networks including Jackson networks with general service times, general Markov or regenerative networks, and networks with batch processing and concurrent movement of units. The results also shed more light on when Little's law for general systems, holds for expectations as well as for limiting averages. Next, we describe the expectation of a unit's travel time on a general route in a “basic” Markov network process (such as a Jackson process). Examples of travel times are the time it takes for a unit to travel from one sector to another, and the time between two successive entrances to a node by a unit. Finally, we characterize the distributions of the sojourn times at nodes on certain overtake-free routes and the travel times on such routes for Markov network processes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. Baccelli and P. Brémaud,Palm Probabilities and Stationary Queues, Lecture Notes in Statistics no. 41 (Springer, 1987).

  2. A.D. Barbour and R. Schassberger, Insensitive average residence times in generalized semi-Markovian processes, Adv. Appl. Prob. 13 (1981) 720–735.

    Google Scholar 

  3. F. Baskett, K. Chandy, R. Muntz and P. Palacios, Open, closed and mixed networks with different classes of customers, J. ACM 22 (1975) 248–260.

    Google Scholar 

  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, 1990) pp. 401–450.

  5. P.J. Burke, The output process of a stationaryM/M/s queueing system, Ann. Math. Statist. 39 (1968) 1144–1152.

    Google Scholar 

  6. H. Daduna, Passage times for overtake-free paths in Gordon-Newell networks, Adv. Appl. Prob. 14 (1982) 672–686.

    Google Scholar 

  7. H. Daduna, Cycle times in two-stage closed queueing networks: Applications to multiprogrammed computer systems with virtual memory, Oper. Res. 34 (1986) 281–288.

    Google Scholar 

  8. H. Daduna, Simultaneous busy periods for nodes in a stochastic network, Perf. Eval. 9 (1989) 103–109.

    Google Scholar 

  9. G. Fayolle, R. Iasnogorodski and I. Mitrani, The distribution of sojourn time in a queueing network with overtaking: Reduction to a boundary value problem, in:Performance '83, eds. A.K. Agrawala and S.K. Tripathi (North-Holland, Amsterdam, 1983).

    Google Scholar 

  10. P. Franken, D. Konig, V. Arndt and V. Schmidt,Queues and Point Processes (Wiley, 1982).

  11. W.J. Gordon and G.F. Newell, Cyclic queueing systems with restricted queue lengths, Oper. Res. 15 (1967) 266–278.

    Google Scholar 

  12. J. Hemker, A note on sojourn times in queueing networks with multiserver nodes, J. Appl. Prob. 27 (1990) 469–474.

    Google Scholar 

  13. A. Hordijk and N. van Dijk, Networks of queues, part I: job-local-balance and the adjoint process; part II: general routing and service characteristics, in:Proc. Int. Seminar on Modelling and Performance Evaluation Methodology, INRIA Vol. 1 (1983) pp. 79–135.

    Google Scholar 

  14. J.R. Jackson, Networks of waiting lines, Oper. Res. 5 (1957) 518–521.

    Google Scholar 

  15. F.P. Kelly,Reversibility and Stochastic Networks (Wiley, 1979).

  16. F.P. Kelly and P.K. Pollett, Sojourn times in closed queueing networks, Adv. Appl. Prob. 15 (1983) 638–656.

    Google Scholar 

  17. C. Knessl and J.A. Morrison, Heavy traffic analysis of the sojourn time in tandem queues with overtaking, Queueing Syst. 8 (1990) 165–182.

    Google Scholar 

  18. K. Kook and R.F. Serfozo, Travel and sojourn times in stochastic networks, Ann. Appl. Prob. (1993) 228–252.

  19. P.J. Kuehn, Approximate analysis of general queueing networks by decomposition, IEEE Trans. Commun. COM-27 (1979) 113–126.

    Google Scholar 

  20. A.J. Lemoine, On sojourn time in Jackson networks of queues, J. Appl. Prob. 24 (1987) 495–510.

    Google Scholar 

  21. J. McKenna, A generalization of Little's law to moments of queue lengths and waiting times in closed, product-form queueing networks, J. Appl. Prob. 26 (1989) 131–133.

    Google Scholar 

  22. B. Melamed, Sojourn times in queueing networks, Math. Oper. Res. 7 (1982) 223–244.

    Google Scholar 

  23. E. Reich, Waiting times when queues are in tandem, Ann. Math. Statist. 28 (1957) 768–773.

    Google Scholar 

  24. M.I. Reiman, The heavy traffic diffusion approximation for sojourn times in Jackson networks, in:Applied Probability — Computer Science, The Interface, eds. R.L. Disney and T.J. Ott (Birkhäuser, 1982) pp. 409–421.

  25. R. Schassberger and H. Daduna, The time for a round trip in a cycle of exponential queues, J. ACM 30 (1983) 146–150.

    Google Scholar 

  26. R. Schassberger and H. Daduna, Sojourn times in queueing networks with multiserver nodes, J. Appl. Prob. 24 (1987) 511–521.

    Google Scholar 

  27. R.F. Serfozo, Semi-stationary processes, Z. Wahrsch. Verw. Geb. 24 (1972) 125–132.

    Google Scholar 

  28. R.F. Serfozo, Markovian network processes: congestion-dependent routing and processing, Queueing Syst. 5 (1989) 5–36.

    Google Scholar 

  29. R.F. Serfozo, Applications of the key renewal theorem: crude regenerations, J. Appl. Prob. 29 (1992) 384–395.

    Google Scholar 

  30. R.F. Serfozo, Queueing network processes with dependent nodes and concurrent movements, Queueing Syst. 13 (1993) 143–182.

    Google Scholar 

  31. S. Stidham Jr. and M. El-Taha, Sample-path analysis of processes with imbedded point processes, Queueing Syst. 5 (1989) 131–166.

    Google Scholar 

  32. J. Walrand,An Introduction to Queueing Networks (Prentice-Hall, 1988).

  33. J. Walrand and P. Varaiya, Sojourn times and overtaking condition in Jacksonian networks, Adv. App. Prob. 12 (1980) 1000–1018.

    Google Scholar 

  34. W. Whitt, A review ofL = λW and extensions, Queueing Syst. 9 (1991) 235–268.

    Google Scholar 

  35. W. Whitt,H = λG and the Palm transformation, Adv. Appl. Prob. 24 (1992) 755–758.

    Google Scholar 

  36. P. Whittle,Systems in Stochastic Equilibrium (Wiley, 1986).

Download references

Author information

Authors and Affiliations

  1. School of Industrial and Systems Engineering, Georgia Institute of Technology, 30332-0205, Atlanta, GA, USA

    Richard F. Serfozo

Authors
  1. Richard F. Serfozo
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by the Air Force Office of Scientific Research under contract 89-0407 and NSF grant DDM-9007532.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Serfozo, R.F. Travel times in queueing networks and network sojourns. Ann Oper Res 48, 1–29 (1994). https://doi.org/10.1007/BF02023093

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02023093

Keywords

Search

Navigation