[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Blocking probability, throughput and waiting time in finite capacity polling systems

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

Abstract

The exact description of the behavior of a queue is given for polling systems with finite capacity buffers, Poisson arrivals, and general independent service and switching times for exhaustive, gated and limited service disciplines. In each case the queue under study is modelled as a queue with server vacation. A previous analysis by H. Takagi, based on this model, implicitly uses the assumption that the busy period and the vacation time are independent. The contribution of this work lies in the elimination of this assumption.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. H. Takagi, Analysis of finite-capacity polling systems, Adv. Appl. Prob. 23 (1991) 373–387.

    Google Scholar 

  2. H. Takagi, Queueing analysis of polling models, ACM Comp. Surveys 20 (1988) 5–28.

    Google Scholar 

  3. H. Takagi, Queueing analysis of polling models: An update,Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (Elsevier, Amsterdam, 1990) pp. 267–318.

    Google Scholar 

  4. T.T. Lee, M/G/1/N queue with vacation time and limited service discipline, Performance Evaluation 9 (1989) 181–190.

    Google Scholar 

  5. T.T. Lee, M/G/1/N queue with vacation time and exhaustive service discipline, Oper. Res. 32 (1984)774–784.

    Google Scholar 

  6. B.T. Doshi, Queueing systems with vacations — a survey, Queueing Systems 1 (1986) 29–66.

    Google Scholar 

  7. B.T. Doshi, Single-server queues with vacation,Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (Elsevier, Amsterdam, 1990) pp. 217–265.

    Google Scholar 

  8. A. Ganz and I. Chlamtac, Queueing analysis of finite buffer token networks, Performance Evaluation Rev. 16 (1988) 30–36.

    Google Scholar 

  9. T. Takine, Y. Takahashi and T. Hasegawa, M/G/1/N queues with vacation and gated k-limited service, Technical report, Department of Appl. Math, and Phys. Kyoto University (1989).

  10. P. Tran-Gia and T. Raith, Performance analysis of finite capacity polling systems with nonexhaustive service, Performance Evaluation 9 (1988) 1–16.

    Google Scholar 

  11. B.W. Char, K.O. Geddes, G.H. Gonnet, M.B. Monagan and S.M. Watt,MAPLE Reference Manual, 5th ed., Symbolic Computation Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada (1988).

    Google Scholar 

  12. L. Kleinrock,Queueing Systems, Vol. 1 Theory (Wiley, New York, 1975) pp. 164–172.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Network Department, Ecole Nationale Supérieure des Télécommunications, 46 rue Barrault, 75634, Paris Cedex 13, France

    D. Kofman

Authors
  1. D. Kofman
    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

Kofman, D. Blocking probability, throughput and waiting time in finite capacity polling systems. Queueing Syst 14, 385–411 (1993). https://doi.org/10.1007/BF01158875

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation