Skip to main content

A Random Tandem Network with Queues Modeled as Birth-Death Processes

  • Conference paper
  • First Online:
Book cover Computer Aided Systems Theory – EUROCAST 2017 (EUROCAST 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10672))

Included in the following conference series:

  • 1290 Accesses

Abstract

We consider a tandem network consisting of an arbitrary but finite number \(R_m\) of queueing systems, where \(R_m\) is a discrete random variable with a suitable probability distribution. Each queueing system of the tandem network is modeled via a birth-death process and consists of an infinite buffer space and of a service center with a single server.

This paper is partially supported by G.N.C.S.- INdAM.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Dover, New York (1992)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Bose, S.K.: An Introduction to Queueing Systems. Springer Science+Business Media, New York (2002)

    Book  Google Scholar 

  4. Burke, P.J.: The output of a queueing system. Oper. Res. 4(6), 699–704 (1956)

    Article  Google Scholar 

  5. Di Crescenzo, A., Giorno, V., Nobile, A.G.: Constructing transient birth-death processes by means of suitable transformations. Appl. Math. Comput. 281, 152–171 (2016)

    MathSciNet  Google Scholar 

  6. Giorno, V., Nobile, A.G., Spina, S.: On some time non-homogeneous queueing systems with catastrophes. Appl. Math. Comput. 245, 220–234 (2014)

    MathSciNet  MATH  Google Scholar 

  7. Giorno, V., Nobile, A.G., Pirozzi, E.: A state-dependent queueing system with asymptotic logarithmic distribution. J. Math. Anal. Appl. 458, 949–966 (2018)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. Lemoine, A.J.: State-of-the-art - Networks of queues - a survey of equilibrium analysis. Manag. Sci. 24(4), 464–481 (1997)

    Article  Google Scholar 

  10. Reich, E.: Waiting times when queues are in tandem. Ann. Math. Stat. 28(3), 768–773 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  11. Serfozo, R.: Introduction to Stochastic Networks. Springer Science+Business Media, New York (1999)

    Book  MATH  Google Scholar 

  12. Williams, R.J.: Stochastic processing networks. Annu. Rev. Stat. Appl. 3, 323–345 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Amelia G. Nobile .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Giorno, V., Nobile, A.G. (2018). A Random Tandem Network with Queues Modeled as Birth-Death Processes. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2017. EUROCAST 2017. Lecture Notes in Computer Science(), vol 10672. Springer, Cham. https://doi.org/10.1007/978-3-319-74727-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-74727-9_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-74726-2

  • Online ISBN: 978-3-319-74727-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics