Skip to main content

Tandem Queueing System with Correlated Input and Cross-Traffic

  • Conference paper
Computer Networks (CN 2013)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 370))

Included in the following conference series:

Abstract

In this paper, we analyze a tandem queueing system consisting of R multi-server stations without buffers. The input flow at the first station is a MAP (Markovian arrival process). The customers from this flow aim to be served at all R stations of the tandem. For any r-th station, besides transit customers proceeding from the (r − 1)-th station, an additional MAP flow of new customers arrives at the r-th station directly, not entering the previous stations of the tandem. Customers from this flow aim to be served at the r-th station and all subsequent stations of the tandem. The service time of any customer arriving at the r-th station is exponentially distributed with the service rate depending of r. We present the recursive scheme for calculating the stationary distributions and the loss probabilities associated with the tandem.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balsamo, S., Persone, V.D.N., Inverardi, P.: A review on queueing network models with finite capacity queues for software architectures performance prediction. Performance Evaluation 51, 269–288 (2003)

    Article  Google Scholar 

  2. Heindl, A.: Decomposition of general tandem networks with MMPP input. Performance Evaluation 44, 5–23 (2001)

    Article  MATH  Google Scholar 

  3. Gnedenko, B.W., Konig, D.: Handbuch der Bedienungstheorie. Akademie Verlag, Berlin (1983)

    MATH  Google Scholar 

  4. Perros, H.G.: A bibliography of papers on queueing networks with finite capacity queues. Performance Evaluation 10, 255–260 (1989)

    Article  MathSciNet  Google Scholar 

  5. Breuer, L., Dudin, A.N., Klimenok, V.I., Tsarenkov, G.V.: A two-phase BMAP/G/1/N → PH/1/M − 1 system with blocking. Automation and Remote Control 65, 117–130 (2004)

    Article  MathSciNet  Google Scholar 

  6. Gomez-Corral, A.: A tandem queue with blocking and Markovian arrival process. Queueing Systems 41, 343–370 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gomez-Corral, A.: On a tandem G-network with blocking. Advances in Applied Probability 34, 626–661 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gomez-Corral, A., Martos, M.E.: Performance of two-station tandem queues with blocking: The impact of several flows of signals. Performance Evaluation 63, 910–938 (2006)

    Article  Google Scholar 

  9. Klimenok, V.I., Breuer, L., Tsarenkov, G.V., Dudin, A.N.: The BMAP/G/1/N → ·PH/1/M − 1 tandem queue with losses. Performance Evaluation 61, 17–40 (2005)

    Article  Google Scholar 

  10. Klimenok, V., Kim, C.S., Tsarenkov, G.V., Breuer, L., Dudin, A.N.: The BMAP/G/1 → ·/PH/1/M tandem queue with feedback and losses. Performance Evaluation 64, 802–818 (2007)

    Article  Google Scholar 

  11. Kim, C.S., Klimenok, V., Taramin, O.: A tandem retrial queueing system with two Markovian flows and reservation of channels. Computers and Operations Research 37, 1238–1246 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kim, C.S., Park, S.H., Dudin, A., Klimenok, V., Tsarenkov, G.: Investigaton of the BMAP/G/1 → ·/PH/1/M tandem queue with retrials and losses. Applied Mathematical Modelling 34, 2926–2940 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kim, C.S., Klimenok, V.I., Taramin, O.S., Dudin, A.N.: Tandem MAP/G/1 → ·/M/N/0 queue with heterogeneous customers. Mathematical Problems in Engineering. Article ID 324604, 26 (2012), doi:10.1155/2012

    Google Scholar 

  14. Kim, C.S., Dudin, S.: Priority tandem queueing model with admission control. Computers and Industrial Engineering 60, 131–140 (2011)

    Article  Google Scholar 

  15. Lucantoni, D.M.: New results on the single server queue with a batch Markovian arrival process. Communications in Statistics-Stochastic Models 7, 1–46 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  16. Chakravarthy, S.R.: The batch Markovian arrival process: a review and future work. In: Krishnamoorthy, A., et al. (eds.) Advances in Probability Theory and Stochastic Processes, pp. 21–49. Notable Publications, NJ (2001)

    Google Scholar 

  17. Klimenok, V., Dudin, A., Vishnevsky, V.: On the stationary distribution of tandem queue consisting of a finite number of stations. In: Kwiecień, A., Gaj, P., Stera, P. (eds.) CN 2012. CCIS, vol. 291, pp. 383–392. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  18. Klimenok, V., Kim, C.S., Orlovsky, D., Dudin, A.: Lack of invariant property of Erlang loss model in case of the MAP input. Queueing Systems 49, 187–213 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  19. Skorokhod, A.: Probability theory and random processes. High School, Kiev (1980)

    Google Scholar 

  20. Neuts, M.: Matrix-geometric Solutions in Stochastic Models – An Algorithmic Approach. Johns Hopkins University Press, USA (1981)

    MATH  Google Scholar 

  21. Alfa, A.S., Diamond, J.E.: On approximating higher order MAPs with MAPs of order two. Queueing Systems 34, 269–288 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  22. Heindl, A., Mitchell, K., van de Liefvoort, A.: Correlation bounds for second order MAPs with application to queueing network decomposition. Performance Evaluation 63, 553–577 (2006)

    Article  Google Scholar 

  23. Heindl, A., Telek, M.: Output models of MAP/PH/1(/K) queues for an efficient network decomposition. Performance Evaluation 49, 321–339 (2002)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klimenok, V., Dudin, A., Vishnevsky, V. (2013). Tandem Queueing System with Correlated Input and Cross-Traffic. In: Kwiecień, A., Gaj, P., Stera, P. (eds) Computer Networks. CN 2013. Communications in Computer and Information Science, vol 370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38865-1_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38865-1_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38864-4

  • Online ISBN: 978-3-642-38865-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics