Skip to main content

Average Message Delay of an Asymmetric Single-Buffer Polling System with Round-Robin Scheduling of Services

  • Chapter
Modeling Techniques and Tools for Computer Performance Evaluation

Abstract

An asymmetric polling system with single-message buffers is considered. Each message consists of multiple packets and only one packet is transmitted when polled. For a symmetric system with constant length of a packet and switchover time, the average performance measures, including the average message delay, have been explicitly derived in the recent paper [Taka87c]. The main result of this paper is the exact derivation of the average message delay for an asymmetric system, where transmission time of a packet and switchover time are assumed to be distributed according to general probability distribution functions which are different among stations.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. O.C. Ibe and X. Cheng, “Analysis of Polling Systems with Single-Message Buffers,” Proceedings of IEEE GLOBECOM ‘86, pp.939–943, Houston, TX, 1986.

    Google Scholar 

  2. A.R. Kaye, “Analysis of a Distributed Control Loop for Data Transmission,” Proceedings of 22nd International Symposium on Computer-Communication Networks and Teletraffic, pp.47–58, Polytechnic Institute of Brooklyn, NY, 1972.

    Google Scholar 

  3. C. Mack, T. Murphy and N.L. Webb, “The Efficiency of N Machines Uni-Directionally Patrolled by One Operative when Walking Time and Repair Times are Constant,” Journal of the Royal Statistical Society, Series B, Vol.19, No.1, pp.166–172, 1957.

    Google Scholar 

  4. C. Mack, “The Efficiency of N Machines Uni-Directionally Patrolled by One Operative when Walking Time and Repair Times are Variable,” Journal of the Royal Statistical Society, Series B, Vol.19, No.1, pp. 173–178, 1957.

    Google Scholar 

  5. H. Takagi, “On the Analysis of a Symmetric Polling System with Single-Message Buffers,” Performance Evaluation, Vol.5, No.3, pp. 149–157, 1985.

    Article  Google Scholar 

  6. H. Takagi, Analysis of Polling Systems, The MIT Press, Cambridge, MA, 1986.

    Google Scholar 

  7. H. Takagi, “Analysis and Applications of a Multiqueue Cyclic Service System with Feedback,” IEEE Transactions on Communications, Vol.COM-35, No.2, pp.248–250, 1987.

    Article  Google Scholar 

  8. H. Takagi, “A Survey of Queueing Analysis of Polling Models,” Proceedings of 3rd International Conference on Data Communication Systems and Their Performance, pp.277–296, Rio de Janeiro, Brazil, 1987.

    Google Scholar 

  9. H. Takagi, “Exact Analysis of Round-Robin Scheduling of Services,” IBM Journal of Research and Development, Vol. 31, No. 4, pp.484–488, 1987.

    Article  Google Scholar 

  10. T. Takine, Y. Takahashi and T. Hasegawa, “Performance Analysis of a Polling System with Single Buffers and Its Application to Interconnected Networks,” IEEE Journal on Selected Areas in Communications, Vol.SAC-4, No.6, pp.802–812, 1986.

    Article  Google Scholar 

  11. T. Takine, Y. Takahashi and T. Hasegawa, “Analysis of an Asymmetric Polling System with Single Buffers,” Performance ‘87, P.-J. Courtois and G. Latouche (eds.), pp.241–251, North-Holland, Amsterdam, 1988.

    Google Scholar 

  12. T. Takine, Y. Takahashi and T. Hasegawa, “Exact Analysis of Asymmetric Polling Systems with Single Buffers,” IEEE Transactions on Communications, Vol.COM-36, No.10, pp.1119–1127, 1988.

    Article  Google Scholar 

  13. R.M. Wu and Y-B. Chen, “Analysis of a Loop Transmission System with Round-Robin Scheduling of Services,” IBM Journal of Research and Development, Vol.19, No.5, pp.486–493, 1975.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Plenum Press, New York

About this chapter

Cite this chapter

Takine, T., Takahashi, Y., Hasegawa, T. (1989). Average Message Delay of an Asymmetric Single-Buffer Polling System with Round-Robin Scheduling of Services. In: Puigjaner, R., Potier, D. (eds) Modeling Techniques and Tools for Computer Performance Evaluation. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0533-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0533-0_12

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-7853-5

  • Online ISBN: 978-1-4613-0533-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics