Skip to main content
SpringerLink
Log in

The cycle time distribution in a cycle of Bernoulli servers in discrete time

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

In a cycle of Bernoulli servers in discrete time the equilibrium distribution for a customer's round-trip time is shown to be of product-form and is given in explicit formulas. The results are used to obtain the equilibrium flow time distribution for an open tandem of queues.

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

  • Chow W-M (1980) The cycle time distribution of exponential cyclic queues. J. Ass. Comput. Mach. 27:281–286

    Google Scholar 

  • Daduna H, Schassberger R (1981) A discrete time round-robin queue with Bernoulli input and general arithmetic service time distribution. Acta Informatica 15:251–263

    Google Scholar 

  • Daduna H, Schassberger R (1983) Networks of queues in discrete time. Zeitschrift für Operations Research 27:159–175

    Google Scholar 

  • Gordon WJ, Newell GF (1967) Closed queueing systems with exponential servers. Oper. Res. 15:254–265

    Google Scholar 

  • Henderson W, Taylor PG (1990) Product from networks of queues with batch arrivals and batch services. Queueing Systems and Their Appl. 6:71–88

    Google Scholar 

  • Henderson W, Taylor PG (1991) Some new results on queueing networks with batch movement. J. Appl. Prob. 28:409–421

    Google Scholar 

  • Herrmann C (1993) A performance model for statistical multiplexing of correlated ATM traffic superpositions. In: Walke B, Spaniol O. Messung, Modellierung und Bewertung von Rechen- und Kommunikationssystemen. Springer, Berlin: 199–211

    Google Scholar 

  • Hsu J, Burke PJ (1976) Behaviour of tandem buffers with geometric input and Markovian output. IEEE Transactions on Communications 24:358–361

    Google Scholar 

  • Hunter JJ (1983) Mathematical techniques of applied probability, Volume II. Academic Press, New York

    Google Scholar 

  • Jackson JR (1957) Networks of waiting lines. Oper. Res. 5:518–521

    Google Scholar 

  • Kelly FP (1979) Reversibility and stochastic networks. Wiley, Chichester

    Google Scholar 

  • Kleinrock L (1964) Communication nets — Stochastic message flow and delay. McGraw-Hill, New York

    Google Scholar 

  • Kleinrock L (1964a) Analysis of a time-shared processor. Naval Res. Logist. Quarterly 11:59–73

    Google Scholar 

  • Kleinrock L (1975) Queueing systems, Vol. 1: Theory. Wiley, New York

    Google Scholar 

  • Kleinrock L (1976) Queueing systems, Vol. 2: Computer applications. Wiley, New York

    Google Scholar 

  • Kook KH, Serfozo RF (1993) Travel and sojourn times in stochastic networks. Ann. Appl. Prob. 3:228–252

    Google Scholar 

  • Lavenberg SS, Reiser M (1980) Stationary state probabilities at arrival instants for closed queueing networks with multiple tyes of customers. J. Appl. Prob. 17:1048–1061

    Google Scholar 

  • Lazowska ED, Zahorjan J, Graham GS, Sevcik KC (1984) Quantitative system performance. Computer system analysis using queueing network models. Prentice Hall, Englewood Cliffs

    Google Scholar 

  • Pestien V, Ramakrishnan S (1994) Features of some discrete-time cyclic queueing networks. Queueing Systems and Their Appl. 18:117–132

    Google Scholar 

  • Pestien V, Ramakrishnan S (1994a) Asymptotic behavior of large discrete-time cyclic queueing networks. Ann. Appl. Prob. 4:591–606

    Google Scholar 

  • Pujolle G, Claude JP, Seret D (1986) A discrete queueing system with a product form solution. In: Hasegava T, Takagi H, Takahashi Y (eds.) (1986) Computer networking and performance evaluation. North Holland, Amsterdam

    Google Scholar 

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

    Google Scholar 

  • Reich E (1963) Note on queues in tandem. Ann. Math. Statist. 34:338–341

    Google Scholar 

  • Schassberger R (1981) On the response time distribution in a discrete round-robin queue. Acta Informatica 16:57–62

    Google Scholar 

  • Schassberger R, Daduna H (1983) A discrete-time technique for solving closed queueing network models of computer systems. In: Kühn PJ, Schulz KM (Eds.). Messung, Modellierung und Bewertung von Rechensystemen. Informatik-Fachberichte 61, Springer, Berlin: 122–134

    Google Scholar 

  • Schassberger R, Daduna H (1983) The time for a round-trip in a cycle of exponential queues. J. Ass. Comp. Mach. 30:146–150

    Google Scholar 

  • Sevcik KC, Mitrani I (1981) The distribution of queueing network states at input and output instants. J. Assoc. Comput. Mach. 28:358–371

    Google Scholar 

  • Takagi H (Ed.) (1990) Stochastic analysis of computer and communication systems. North Holland, Amsterdam

    Google Scholar 

  • Takagi H (1993) Queueing analysis: Discrete time systems. North Holland

  • Walrand J (1988) An introduction to queueing networks. Prentice Hall, Englewood Cliffs

    Google Scholar 

  • Wolff RW (1982) Poisson arrivals see time averages. Oper. Res. 30:223–231

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematische Stochastik, Universität Hamburg, Bundesstrasse 55, 20146, Hamburg, Germany

    Hans Daduna

Authors
  1. Hans Daduna
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Daduna, H. The cycle time distribution in a cycle of Bernoulli servers in discrete time. Mathematical Methods of Operations Research 44, 295–332 (1996). https://doi.org/10.1007/BF01193934

Download citation

  • Received:

  • Issue Date:

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

Key words

Search

Navigation