Skip to main content
Log in

Application of the method of collective marks to someM/G/1 vacation models with exhaustive service

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We use the Method of Collective Marks to analyze some time-dependent processes in theM/G/1 queue with single and multiple vacations. With the server state specified at a fixed timet>0, the Laplace transforms with respect tot of mixed transforms for the joint distribution of the number of departures by timet, the queue length, the virtual waiting time, the elapsed and remaining service/vacation times at timet are derived by means of probabilistic interpretations. The Laplace-Stieltjes transform of the virtual waiting time at timet is also given. Some well known results are special cases.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A.R. Bloemena, On queueing processes with a certain type of bulk service, Bull. Inst. Int. Statist. 37 (1958) 219–227.

    Google Scholar 

  2. E.A. Danieljan,M/G/1/∞-queueing model with unit traffic-intensity in continuous time, Rostock Math. Kolloq. 32 (1987) 67–86.

    Google Scholar 

  3. E.A. Danieljan and F. Liese, Mr/Gr/l/∞ model with time dependent priorities, Rostock Math. Kolloq. 43 (1991) 39–54.

    Google Scholar 

  4. D. van Dantzig, Sur la méthode des fonctions génératrices, Colloques internationaux du CNRS 13 (1949) 29–45.

    Google Scholar 

  5. D. van Dantzig, Chaines de Markof dans les ensembles abstraits et applications aux processus avec régions absorbantes et au problème des boucles, Ann. Inst. H. Poincaré 14 (1955) 145–199 (English version exists).

    Google Scholar 

  6. B.V. Gnedenko, E.A. Danieljan, B.N. Dimitrov, G.P. Klimov and W.F. Matvejev,Service Systems with Priorities (Moscow University, Moscow, 1973) (in Russian).

    Google Scholar 

  7. H. Kesten and J.Th. Runnenburg, Priority in waiting-line problems I and II, Indag. Math. 19 (1957) 312–336.

    Google Scholar 

  8. Y. Levy and U. Yechiali, Utilization of idle time in anM/G/1 queueing system, Manag. Sci. 22 (1975)202–211.

    Google Scholar 

  9. J.Th. Runnenburg, Probabilistic interpretation of some formulae in queueing theory, Bull. Inst. Int. Statist. 37 (1958) 405–414.

    Google Scholar 

  10. J.Th. Runnenburg, On the use of the Method of Collective Marks in queueing theory, in:Congestion Theory, eds. W.L. Smith and W.E. Wilkinson (Chapel Hill, 1965).

  11. J.Th. Runnenburg, Van Dantzig's Collective Marks revisited, in:Proc. Bicentennial Congress Wiskundig Genootschap, eds. P.C. Baayen, D. van Dulst and J. Oosterhoff (Mathematisch Centrum, Amsterdam, 1979).

    Google Scholar 

  12. D. Sikkel, Joint distributions in one-server queues, with the Method of Collective Marks, final exam paper, University of Amsterdam (1975) (in Dutch).

  13. L. Takâcs,Introduction to the Theory of Queues (Oxford University Press, New York, 1962).

    Google Scholar 

  14. H. Takagi, Time-dependent analysis ofM/G/1 vacation models with exhaustive service, Queueing Syst. 6 (1990) 369–390.

    Google Scholar 

  15. H. Takagi, Time-dependent process ofM/G/1 vacations with exhaustive service, J. Appl. Prob. 29 (1992) 418–429.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was supported by the University of Amsterdam.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cong, T.D. Application of the method of collective marks to someM/G/1 vacation models with exhaustive service. Queueing Syst 16, 67–81 (1994). https://doi.org/10.1007/BF01158949

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01158949

Keywords

Navigation