Skip to main content
SpringerLink
Log in

Statistical Analysis of Single-server Loss Queueing Systems

  • Published:
Methodology and Computing in Applied Probability Aims and scope Submit manuscript

Abstract

In this article statistical bounds for certain output characteristics of the M/GI/1/n and GI/M/1/n loss queueing systems are derived on the basis of large samples of an input characteristic of these systems, such as service time in the M/GI/1/n queueing system or interarrival time in the GI/M/1/n queueing system. The analysis in this article is based on application of Kolmogorov’s statistics for empirical probability distribution functions.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Abramov VM (1991) Investigation of a queueing system with service depending on queue-length. Donish Inc., Dushanbe (Russian)

    Google Scholar 

  • Abramov VM (1997) On a property of a refusals stream. J Appl Probab 34:800–805

    Article  MathSciNet  MATH  Google Scholar 

  • Abramov VM (2002) Asymptotic analysis of the GI/M/1/n loss system as n increases to infinity. Ann Oper Res 112:35–41

    Article  MathSciNet  MATH  Google Scholar 

  • Abramov VM (2004) Asymptotic behaviour of the number of lost messages. SIAM J Appl Math 64:746–761

    Article  MathSciNet  MATH  Google Scholar 

  • Abramov VM (2007) Optimal control of a large dam. J Appl Probab 44:249–258

    Article  MathSciNet  MATH  Google Scholar 

  • Abramov VM (2008a) Bounds for loss probabilities in large loss queueing systems. arXiv/0804.2310

  • Abramov VM (2008b) Continuity theorems for the M/M/1/n queueing systems. Queueing Syst 59:63–86

    Article  MathSciNet  MATH  Google Scholar 

  • Abramov VM (2009a) Continuity of large closed queueing networks with bottlenecks. arXiv/0903.3259

  • Abramov VM (2009b) Queueing systems, networks and telecommunication systems: asymptotic methods for queueing systems and networks with application to telecommunications. Lambert Acad. Publ., Koeln

    Google Scholar 

  • Abramov VM (2010) Takács’ asymptotic theorem and its applications. A survey. Acta Appl Math 109:609–651

    Article  MathSciNet  MATH  Google Scholar 

  • Acharya SK (1999) On normal approximation for maximum likelihood estimation from single server queues. Queueing Syst 31:207–216

    Article  MathSciNet  MATH  Google Scholar 

  • Basawa IV, Bhat UN, Lund R (1996) Maximum likelihood estimation for single-server queues from waiting time data. Queueing Syst 24:155–167

    Article  MathSciNet  MATH  Google Scholar 

  • Bhat NU, Rao SS (1987) Statistical analysis of queueing systems. Queueing Syst 1:217–247

    Article  MATH  Google Scholar 

  • Daley DJ (1976) Queueing output processes. Adv Appl Probab 8:395–415

    Article  MathSciNet  MATH  Google Scholar 

  • David HA, Nagaraja, HN (2003) Order statistics, 3rd edn. Wiley, New Jersey

    Book  MATH  Google Scholar 

  • Hansen MB, Pitts SM (2006) Non-parametric inference from M/G/1 workload. Bernoulli 17:737–759

    Article  MathSciNet  Google Scholar 

  • Ivchenko GI, Kashtanov VA, Kovalenko IN (1982) Queueing theory. Vysshaya Shkola (Russian)

  • Karlin S (1966) A first course in stochastic processes. Academic, New York/London

    Google Scholar 

  • Karlin S, Novikoff A (1963) Generalized convex inequalities. Pac J Math 13:1251–1279

    MathSciNet  MATH  Google Scholar 

  • Kolmogoroff AN (1933) Sulla determinazione empirica di una legge di distribuzione. Giornalle dell’Instituto Italiano degli Attuari 4:83–91

    Google Scholar 

  • Mandelbaum A, Zeltyn S (1998) Estimating characteristics of queueing systems using transactional data. Queueing Syst 29:75–127

    Article  MathSciNet  MATH  Google Scholar 

  • Miyazawa M (1990) Complementary generating functions for the M X/GI/1/k and GI/M Y/1/k queues and their application for the comparison for loss probabilities. J Appl Probab 27:682–692

    Google Scholar 

  • Novak A, Watson R (2009) Determining an adequate probe separation for estimating the arrival rate in an M/D/1 queue using single-packet probing. Queueing Syst 61:255–272

    Article  MathSciNet  MATH  Google Scholar 

  • Stoyan D (1983) Comparison methods for queues and other stochastic models. Wiley, Chichester

    MATH  Google Scholar 

  • Takács (1967) Combinatorial methods in the theory of stochastic processes. Wiley, New York

    MATH  Google Scholar 

  • Tomko J (1967) One limit theorem in queueing problem as the rate of input flow increases indefinitely. Stud Sci Math Hung 2:447–454 (Russian)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Monash University, Clayton Campus, Building 28, Level 4, Wellington Rd, VIC-3800, Victoria, Australia

    Vyacheslav M. Abramov

Authors
  1. Vyacheslav M. Abramov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vyacheslav M. Abramov.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abramov, V.M. Statistical Analysis of Single-server Loss Queueing Systems. Methodol Comput Appl Probab 13, 763–781 (2011). https://doi.org/10.1007/s11009-010-9187-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11009-010-9187-6

Keywords

AMS 2000 Subject Classifications

Search

Navigation