Skip to main content
SpringerLink
Log in

Queueing Systems with Non-homogeneous Customers and Infinite Sectorized Memory Space

  • Conference paper
Computer Networks (CN 2019)

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

Included in the following conference series:

  • 847 Accesses

Abstract

In the paper, we investigate queueing systems with non-homogeneous customers. As non-homogenity, we mean that each customer is characterized by some random l-dimensional volume vector. The arriving customers appear according to a stationary Poisson process. Service time of a customer generally depends on his volume vector. Memory space is composed of l parts of infinity capacities in accordance with customers volume vectors components. As an example of such system, we consider Erlang-type M/G/n/0 system, for which we determine the joint distribution of l-dimensional random vector of total customers volumes and its marginal and mixed moments. An analysis of some special cases and some numerical examples are attached as well.

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

Access this chapter

Log in via an institution
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. Abell, M.L., Braselton, J.P.: The Mathematica Handbook. Elsevier, Amsterdam (1992)

    MATH  Google Scholar 

  2. Alexandrov, A.M., Katz, B.A.: Non-homogeneous demands flows service. Izvestiya AN SSSR. Tekhnicheskaya Kibernetika, no. 2, pp. 47–53 (1973). (in Russian)

    Google Scholar 

  3. Bocharov, P.P., D’Apice, C., Pechinkin, A.V., Salerno, S.: Queueing Theory. VSP, Utrecht, Boston (2004)

    MATH  Google Scholar 

  4. Chen, X., Stidwell, A.G., Harris, M.B.: Radio telecommunications apparatus and method for communications internet data packets containing different types of data. US Patent No. 7,558,240 B2 (2009). https://patents.google.com/patent/US7558240B2/en

  5. Kim, H.-K.: System and method for processing multimedia packets for a network. US Patent No. 7,236,481 B2 (2002). https://patents.google.com/patent/US7236481B2/en

  6. Morozov, E., Nekrasova, R., Potakhina, L., Tikhonenko, O.: Asymptotic analysis of queueing systems with finite buffer space. In: Kwiecień, A., Gaj, P., Stera, P. (eds.) CN 2014. CCIS, vol. 431, pp. 223–232. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-07941-7_23

    Chapter  Google Scholar 

  7. Schwartz, M.: Computer-communication Network Design and Analysis. Prentice-Hall, Englewood Cliffs, New York (1977)

    MATH  Google Scholar 

  8. Schwartz, M.: Telecommunication Networks: Protocols, Modeling and Analysis. Addison-Wesley Publishing Company, New York (1987)

    Google Scholar 

  9. Sengupta, B.: The spatial requirement of an M/G/1 queue, or: how to design for buffer space. In: Baccelli, F., Fayolle, G. (eds.) Modelling and Performance Evaluation Methodology. LNCIS, vol. 60, pp. 547–562. Springer, Heidelberg (1984). https://doi.org/10.1007/BFb0005191

    Chapter  Google Scholar 

  10. Tikhonenko, O.: Computer Systems Probability Analysis. Akademicka Oficyna Wydawnicza EXIT, Warsaw (2006). (in Polish)

    Google Scholar 

  11. Tikhonenko, O.M.: Destricted capacity queueing systems: determination of their characteristics. Autom. Remote Control 58(6), 969–972 (1997)

    MATH  Google Scholar 

  12. Tikhonenko, O.M.: Generalized Erlang problem for service systems with finite total capacity. Prob. Inf. Transm. 41(3), 243–253 (2005). https://doi.org/10.1007/s11122-005-0029-z

    Article  MATH  Google Scholar 

  13. Tikhonenko, O.M., Klimovich, K.G.: Queuing systems for random-length arrivals with limited cumulative volume. Prob. Inf. Transm. 37(1), 70–79 (2001). https://doi.org/10.1023/A:1010451827648

    Article  MATH  Google Scholar 

  14. 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). https://doi.org/10.1007/978-3-642-21771-5_8

    Chapter  Google Scholar 

  15. Tikhonenko, O.M.: Queuing systems with processor sharing and limited resources. Autom. Remote Control 71(5), 803–815 (2010). https://doi.org/10.1134/S0005117910050073

    Article  MathSciNet  MATH  Google Scholar 

  16. Tikhonenko, O., Ziółkowski, M.: Single-server queueing system with external and internal customers. Bull. Polish Acad. Sci. Tech. Sci. 66(4), 539–551 (2018). https://doi.org/10.24425/124270

    Article  Google Scholar 

  17. Ziółkowski, M.: M/G/n/0 Erlang queueing system with heterogeneous servers and non-homogeneous customers. Bull. Polish Acad. Sci. Tech. Sci. 66(1), 59–66 (2018). https://doi.org/10.24425/119059

    Article  Google Scholar 

  18. Ziółkowski, M.: Some practical applications of generating functions and LSTS. Sci. Issues. Mathematics 17, 97–110 (2012). Jan Długosz University in Czȩstochowa

    MathSciNet  MATH  Google Scholar 

  19. Ziółkowski, M., Tikhonenko, O.: Multiserver queueing system with non-homogeneous customers and sectorized memory space. In: Gaj, P., Sawicki, M., Suchacka, G., Kwiecień, A. (eds.) CN 2018. CCIS, vol. 860, pp. 272–285. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-92459-5_22

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Natural Sciences, College of Sciences, Cardinal Stefan Wyszyński University in Warsaw, Ul. Wóycickiego 1/3, 01-938, Warsaw, Poland

    Oleg Tikhonenko

  2. Faculty of Applied Informatics and Mathematics, Warsaw University of Life Sciences, Ul. Nowoursynowska 159, 02-787, Warsaw, Poland

    Marcin Ziółkowski

Authors
  1. Oleg Tikhonenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcin Ziółkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcin Ziółkowski .

Editor information

Editors and Affiliations

  1. Silesian University of Technology, Gliwice, Poland

    Piotr Gaj

  2. Silesian University of Technology, Gliwice, Poland

    Michał Sawicki

  3. Silesian University of Technology, Gliwice, Poland

    Andrzej Kwiecień

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Cite this paper

Tikhonenko, O., Ziółkowski, M. (2019). Queueing Systems with Non-homogeneous Customers and Infinite Sectorized Memory Space. In: Gaj, P., Sawicki, M., Kwiecień, A. (eds) Computer Networks. CN 2019. Communications in Computer and Information Science, vol 1039. Springer, Cham. https://doi.org/10.1007/978-3-030-21952-9_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-21952-9_24

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-21951-2

  • Online ISBN: 978-3-030-21952-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation