Skip to main content
SpringerLink
Log in

Recent Advances in the Analysis of Polling Systems

  • Chapter
Advances in Combinatorial Methods and Applications to Probability and Statistics

Part of the book series: Statistics for Industry and Technology ((SIT))

Abstract

This article summarizes some recent advances in the analysis of polling models in which the server uses system-state information to affect its behavior. Literature dealing with a special class of such models in which the server lies dormant upon finding the system empty, and reactivates only when the system is populated by a critical number of customers, is closely examined. Rather than provide a broad review of literature, the focus of this article is on providing insights, on building bridges with earlier literature, and on identifying common underlying principles.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Altman, E., Konstantopoulos, P. and Liu, Z. (1992). Stability, monotonicity and invariant quantities in general polling systems, Queueing Systems, 11, 35–57.

    Article  MathSciNet  MATH  Google Scholar 

  2. Benjaafar, S. and Gupta, D. (1996a). Workload allocation in multi-product, multi-facility production systems with setup times, IIE Transactions (submitted for publication).

    Google Scholar 

  3. Benjaafar, S. and Gupta, D. (1996b). Scope versus focus: Issues of flexibility, capacity, and number of production facilities, IIE Transactions (submitted for publication).

    Google Scholar 

  4. Borst, S. C. (1995). A globally gated polling system with a dormant server, Probability in the Engineering and Information Sciences, 9, 239–254.

    Article  MathSciNet  Google Scholar 

  5. Boxma, O. J. and Groenendijk, W. P. (1987). Pseudo-conservation laws in cyclic-service systems, Journal of Applied Probability, 24, 949–964.

    Article  MathSciNet  MATH  Google Scholar 

  6. Boxma, O. J., Weststrate, J. A. and Yechiali, U. (1993). A globally gated polling system with server interruptions, and applications to the repairman problem, Probability in the Engineering and Information Sciences, 7, 187–208.

    Article  Google Scholar 

  7. Bozer, Y. and Srinivasan, M. M. (1991). Tandem configurations for automated guided vehicle systems and the analysis of single vehicle loops, IIE Transactions, 23, 72–82.

    Article  Google Scholar 

  8. Bradlow, H. S. and Byrd, H. F. (1987). Mean waiting time evaluation of packet switches for centrally controlled PBX’s, Performance Evaluation, 7, 309–327.

    Article  Google Scholar 

  9. Coffman, E. G., Jr., Puhalskii, A. A. and Reiman M. I. (1995a) Polling Systems with Zero Switchover Times: A Heavy Traffic Averaging Principle, Annals of Applied Probability, 5, 681–719.

    Article  MathSciNet  MATH  Google Scholar 

  10. Coffman, E. G., Jr., Puhalskii, A. A. and Reiman M. I. (1995b) Polling Systems in Heavy-Traffic: A Bessel Process Limit, Working Paper, AT&T Bell Labs.

    Google Scholar 

  11. Cooper, R. B. (1970). Queues served in cyclic order: Waiting times, The Bell System Technical Journal, 49, 399–413.

    MathSciNet  MATH  Google Scholar 

  12. Cooper, R. B. (1981). Introduction to Queueing Theory, Second edition, Amsterdam: North-Holland. Reprinted by CEE Press of The George Washington University, 1990.

    Google Scholar 

  13. Duenyas, I., Gupta, D. and Lennon, T. (1996). Control of a single-server tandem queueing system with setups, Operations Research (to appear).

    Google Scholar 

  14. Duenyas, I. and Van Oyen, M. P. (1996). Heuristic scheduling of parallel heterogeneous queues with set-ups, Management Science, 42, 814–829.

    Article  MATH  Google Scholar 

  15. Eisenberg, M. (1971). Two queues with changeover times, Operations Research, 19, 386–401.

    Article  MATH  Google Scholar 

  16. Eisenberg, M. (1994). The polling system with a stopping server, QUESTA, 18, 387–431

    MathSciNet  MATH  Google Scholar 

  17. Federgruen, A. and Katalan, Z. (1996). The stochastic economic lot scheduling problem: Cyclical base-stock policies with idle times, Management Science, 42, 783–796.

    Article  MATH  Google Scholar 

  18. Ferguson, M. J. (1986). Mean waiting time for a token ring with station dependent overheads, In Local Area and Multiple Access Networks (Ed., R. L. Pickholtz), pp. 43–67, Computer Science Press.

    Google Scholar 

  19. Fuhrmann, S. W. and Cooper, R. B. (1985). Stochastic decompositions in the M/G/l queue with generalized vacations, Operations Research, 33, 1117–1129.

    Article  MathSciNet  MATH  Google Scholar 

  20. Fuhrmann, S. W. and Moon, A. (1990). Queues served in cyclic order with an arbitrary start-up distribution, Naval Research Logistics, 37, 123–133.

    Article  MathSciNet  MATH  Google Scholar 

  21. Günalay, Y. (1996). State dependent server scheduling rules in polling systems, Ph.D. Thesis, Master University, Hamilton, Ontario, Canada.

    Google Scholar 

  22. Günalay, Y. and Gupta, D. (1996a). Threshold startup control policy for polling systems, Management Science (submitted for publication).

    Google Scholar 

  23. Günalay, Y. and Gupta, D. (1996b). Polling systems with a patient server and state dependent setup times, IIE Transactions (to appear).

    Google Scholar 

  24. Gupta, D. and Srinivasan, M. M. (1996a). The variance paradox and its implications for Japanese production theory, Interfaces, 26, 69–77.

    Article  Google Scholar 

  25. Gupta, D. and Srinivasan, M. M. (1996b). Polling systems with state-dependent setup times, Queueing Systems (to appear).

    Google Scholar 

  26. Heyman, D. P. and Sobel, M. J. (1982). Stochastic Models in Operations Research, Volume I: Stochastic Processes and Operating Characteristics, New York: McGraw-Hill.

    MATH  Google Scholar 

  27. Heyman, D. P. and Sobel, M. J. (1984). Stochastic Models in Operations Research, Volume II: Stochastic Optimization, New York: McGraw-Hill.

    MATH  Google Scholar 

  28. Hofri, M. and Ross, K. W. (1987) On the Optimal Control of Two Queues with Server Setup Times and Its Analysis, SIAM Journal on Computing, 16, 399–420.

    Article  MathSciNet  MATH  Google Scholar 

  29. Konheim, A. G., Levi, H. and Srinivasan, M. M. (1994). Descendant set: An efficient approach for the analysis of polling systems, IEEE Transactions on Communications, 42, 1245–1253.

    Article  Google Scholar 

  30. Levi, H. and Sidi, M. (1990). Polling systems: Applications, modelling and optimization, IEEE Transactions on Communications, 38, 1750–1760.

    Article  Google Scholar 

  31. Liu, Z., Nain, P. and Towsley, D. (1992). On optimal polling policies, QUESTA, 11, 59–83.

    MathSciNet  MATH  Google Scholar 

  32. Sarkar, D. and Zangwill, W. I. (1991). Variance effects in cyclic production systems, Management Science, 37, 444–453.

    Article  Google Scholar 

  33. Sidi, M., Levi, H. and Fuhrmann, S. W. (1992). A queueing network with a single cyclically roving server, Queueing Systems, 11, 121–144.

    Article  MATH  Google Scholar 

  34. Srinivasan, M. M. and Gupta, D. (1996). When should a server be patient?, Management Science, 42, 437–451.

    Article  MATH  Google Scholar 

  35. Takagi, H. (1986). Analysis of Polling Systems, Cambridge, MA: The MIT Press.

    Google Scholar 

  36. Takagi, H. (1990). Queueing analysis of polling models: An update, In Stochastic Analysis of Computer and Communication Systems (Ed., H. Takagi), pp. 267–318, Amsterdam: North-Holland.

    Google Scholar 

  37. Takagi, H. (1994). Queueing Analysis of Polling Models: Progress in 1990–93, Institute of Socio-Economic Planning, University of Tsukuba, Japan.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Master University, Hamilton, Ontario, Canada

    Diwakar Gupta & Yavuz Günalay

Authors
  1. Diwakar Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yavuz Günalay
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, McMaster University, L8S 4Kl, Hamilton, Ontario, Canada

    N. Balakrishnan

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Birkhäuser Boston

About this chapter

Cite this chapter

Gupta, D., Günalay, Y. (1997). Recent Advances in the Analysis of Polling Systems. In: Balakrishnan, N. (eds) Advances in Combinatorial Methods and Applications to Probability and Statistics. Statistics for Industry and Technology. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-4140-9_20

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4140-9_20

  • Publisher Name: Birkhäuser Boston

  • Print ISBN: 978-1-4612-8671-4

  • Online ISBN: 978-1-4612-4140-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation