Skip to main content
SpringerLink
Log in

On the Remaining Service Time upon Reaching a Given Level in M/G/1 Queues

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

The ability of effectively finding the distribution of the remaining service time upon reaching a target level in M/G/1 queueing systems is of great practical importance. Among other things, it is necessary for the estimation of the Quality-of-Service (QoS) provided by Asynchronous Transfer Mode (ATM) networks. The previous papers on this subject did not give a comprehensive solution to the problem. In this paper an explicit formula for this distribution is given. This formula is general as it includes any initial level of the length of the queue, any type of service distribution (heavy tails) and any traffic intensity ρ. Moreover, it is easy to use and fast in computation. To show this several numerical examples are presented. In addition, a solution of the similar problem in G/M/1 queues (which is the distribution of the remaining interarrival time) is given.

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

  1. S. Asmussen, Equilibrium properties of the M/G/1 queue, Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 58 (1981) 267–281.

    Google Scholar 

  2. P.T. de Boer, V.F. Nicola and J.C.W. van Ommeren, The remaining service time upon reaching a high level in M/G/1 queues, Queueing Systems 39 (2001) 55–78.

    Google Scholar 

  3. A. Chydzinski, The M/G — G/1 oscillating queueing system, Queueing Systems 42(3) (2002) 255–268.

    Google Scholar 

  4. J.W. Cohen, The Single Server Queue, 2nd ed. (North-Holland, Amsterdam, 1982).

    Google Scholar 

  5. D. Fakinos, The expected remaining service time in a single server queue, Oper. Res. 30 (1982) 1014–1018.

    Google Scholar 

  6. W.S. Korolyuk, Boundary Problems for Compound Poisson Processes (Naukowa Dumka, Kiev, 1975) (in Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Sciences, Silesian University of Technology, Akademicka 16, 44-100, Gliwice, Poland

    Andrzej Chydzinski

Authors
  1. Andrzej Chydzinski
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chydzinski, A. On the Remaining Service Time upon Reaching a Given Level in M/G/1 Queues. Queueing Systems 47, 71–80 (2004). https://doi.org/10.1023/B:QUES.0000032801.90131.04

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:QUES.0000032801.90131.04

Search

Navigation