Skip to main content

A Geo m /G/1/n Queueing System with LIFO Discipline, Service Interruptions and Repeat Again Service, and Restrictions on the Total Volume of Demands

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 6235))

Abstract

Consideration is given to a discrete-time queueing system with inverse discipline, service interruption and repeat again service, second-order geometrical demand arrival, arbitrary (discrete) distribution of demand length and finite storage. Each demand entering the queue has random volume besides its length. The total volume of the demands in the queue is limited by a certain number. Formulae for the stationary probabilities of states and the stationary waiting time distribution in the queuing system are obtained.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Romm, E.L., Skitovich, V.V.: On One Generalization of the Erlang Problem. Avtomatika i Telemekhanika 6, 164–167 (1971)

    Google Scholar 

  2. Alexandrov, A.M., Katz, B.A.: Serving heterogeneous customer flows. Izvestiya AN SSSR. Tekhnicheskaya Kibernetika 2, 47–53 (1973)

    Google Scholar 

  3. Tikhonenko, O.M.: Queueing models in data processing systems. Izdatel’stvo Universitetskoe, Minsk (1990)

    Google Scholar 

  4. Pechinkin, A.V., Pechinkina, O.A.: An M k /G/1/n system with LIFO discipline and constraints on the total number of customers. Vestnik Rossiyskogo Universiteta Druzhby Narodov. Ser. Prikladnaya Matematika i Informatika  1, 86–93 (1996)

    Google Scholar 

  5. Pechinkin, A.V.: Queueing system with LIFO discipline and constraints on the total number of customers. Vestnik Rossiyskogo Universiteta Druzhby Narodov, Ser. Prikladnaya Matematika i Informatika 2, 85–99 (1996)

    Google Scholar 

  6. Pechinkin, A.V.: M l /G/1/n system with LIFO discipline and constrained total amount of items. Automation and Remote Control 4, 545–553 (1998)

    MathSciNet  Google Scholar 

  7. Abramushkina, T.V., Aparina, S.V., Kuznetsova, E.N., Pechinkin, A.V.: Numerical techniques for calculating stationary probabilities of states of M/G/1/n system with LIFO PR discipline and constraints on the total number of customers. Vestnik Rossiyskogo Universiteta Druzhby Narodov, Ser. Prikladnaya Matematika i Informatika 1, 40–47 (1998)

    Google Scholar 

  8. Bocharov, P.P., D’Apice, C., Pechinkin, A.V., Salerno, S.: Queueing theory. Modern Probability and Statistics. VSP Publishing, Utrecht (2004)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pechinkin, A., Shorgin, S. (2010). A Geo m /G/1/n Queueing System with LIFO Discipline, Service Interruptions and Repeat Again Service, and Restrictions on the Total Volume of Demands. In: Vinel, A., Bellalta, B., Sacchi, C., Lyakhov, A., Telek, M., Oliver, M. (eds) Multiple Access Communications. MACOM 2010. Lecture Notes in Computer Science, vol 6235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15428-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15428-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15427-0

  • Online ISBN: 978-3-642-15428-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics