Skip to main content

Infinite–Server Tandem Queue with Renewal Arrivals and Random Capacity of Customers

  • Conference paper
  • First Online:
Distributed Computer and Communication Networks (DCCN 2017)

Abstract

A tandem of two queues with infinite number of servers is considered. Customers arrive at the first stage of the tandem according to a renewal process, and, after the completion of their services, go to the second stage. Each customer carries a random quantity of work (capacity of the customer). In this study service time does not depend on the customer capacities; the latter are used just to fix some additional features of the system evolution. It is shown that the two-dimensional probability distribution of the total capacities at the stages of the system is two-dimensional Gaussian under the asymptotic condition of a high arrival rate. Numerical experiments and simulations allow us to determine the applicability area for the asymptotic result.

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. Fedorova, E.: The second order asymptotic analysis under heavy load condition for retrial queueing system MMPP/M/1. In: Dudin, A., Nazarov, A., Yakupov, R. (eds.) ITMM 2015. CCIS, vol. 564, pp. 344–357. Springer, Cham (2015). doi:10.1007/978-3-319-25861-4_29

    Chapter  Google Scholar 

  2. Lisovskaya, E., Moiseeva, S.: Study of the queuing systems \(M|GI|N|\infty \). In: Dudin, A., Nazarov, A., Yakupov, R. (eds.) ITMM 2015. CCIS, vol. 564, pp. 175–184. Springer, Cham (2015). doi:10.1007/978-3-319-25861-4_15

    Chapter  Google Scholar 

  3. Moiseev, A., Moiseeva, S., Sinyakova, I.: Modeling of insurance company as infinite-servers queueing system. In: Proceeding International Conference on Application of Information and Communication Technology and Statistics in Economy and Education (ICAICTSEE-2012), pp. 161–163 (2012)

    Google Scholar 

  4. Moiseev, A., Nazarov, A.: Asymptotic analysis of the infinite-server queueing system with high-rate semi-Markov arrivals. In: 2014 6th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), pp. 507–513, October 2014

    Google Scholar 

  5. Moiseev, A., Nazarov, A.: Queueing network with high-rate arrivals. Eur. J. Oper. Res. 254(1), 161–168 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  6. Moiseev, A., Nazarov, A.: Tandem of infinite-server queues with Markovian arrival process. In: Vishnevsky, V., Kozyrev, D. (eds.) DCCN 2015. CCIS, vol. 601, pp. 323–333. Springer, Cham (2016). doi:10.1007/978-3-319-30843-2_34

    Chapter  Google Scholar 

  7. Nazarov, A., Chernikova, Y.: The accuracy of Gaussian approximations of probabilities distribution of states of the retrial queueing system with priority of new customers. In: Dudin, A., Nazarov, A., Yakupov, R., Gortsev, A. (eds.) ITMM 2014. CCIS, vol. 487, pp. 325–333. Springer, Cham (2014). doi:10.1007/978-3-319-13671-4_37

    Google Scholar 

  8. Tikhonenko, O.: Queueing systems with common buffer: a theoretical treatment. In: Kwiecień, A., Gaj, P., Stera, P. (eds.) CN 2011. CCIS, vol. 160, pp. 61–69. Springer, Heidelberg (2011). doi:10.1007/978-3-642-21771-5_8

    Chapter  Google Scholar 

  9. Tikhonenko, O., Kempa, W.M.: Performance evaluation of an M/G/N-type queue with bounded capacity and packet dropping. Int. J. Appl. Math. Comput. Sci. 26(4), 841–854 (2016)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ekaterina Lisovskaya .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Lisovskaya, E., Moiseeva, S., Pagano, M. (2017). Infinite–Server Tandem Queue with Renewal Arrivals and Random Capacity of Customers. In: Vishnevskiy, V., Samouylov, K., Kozyrev, D. (eds) Distributed Computer and Communication Networks. DCCN 2017. Communications in Computer and Information Science, vol 700. Springer, Cham. https://doi.org/10.1007/978-3-319-66836-9_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66836-9_17

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics