Summary
This chapter presents the operation of roll-call and hub pollings. A polling network may be considered as a multiple-queue with a cyclic server. Because of polling, the channel time for each station is comprised of a polling interval and a data transmission interval. For performance analysis, we obtain expressions for the mean waiting time of exhaustive, partially gated, and fully gated polling networks. From these mean waiting times, the corresponding average transfer delays are also obtained.
Furthermore, we derive an expression for the average cycle time. It should be pointed out that the queueing model for the analysis of polling networks can also be used for the analysis of ring networks, as will be discussed with modifications in the next chapter.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hammond, J.L. and O’Reilly, P.J.P., Performance Analysis of Local Computer Networks, Reading, Mass.: Addison-Wesley, 1986.
Bertsekas, D. and Gallager, R., Data Networks, 2nd ed., Englewood Cliffs, N.J.: Prentice Hall, 1992.
Schwartz, M., Telecommunication Networks: Protocols, Modeling and Analysis, Reading, Mass.: Addison-Wesley, 1987.
Takagi, H., Analysis of Polling Systems, Cambridge, Mass.: MIT Press, 1986.
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
(2002). Polling Networks. In: Performance Analysis of Telecommunications and Local Area Networks. The International Series in Engineering and Computer Science, vol 533. Springer, Boston, MA. https://doi.org/10.1007/0-306-47312-7_8
Download citation
DOI: https://doi.org/10.1007/0-306-47312-7_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-7701-6
Online ISBN: 978-0-306-47312-8
eBook Packages: Springer Book Archive