Efficient Visit Frequencies for Polling Tables: Minimization of Waiting Cost

@article{Boxma1991EfficientVF,
  title={Efficient Visit Frequencies for Polling Tables: Minimization of Waiting Cost},
  author={Onno J. Boxma and Hanoch Levy and Jan A. Weststrate},
  journal={Queueing Syst.},
  year={1991},
  volume={9},
  pages={133-162}
}
Polling systems have been used as a central model for the modeling and analysis of many communication systems. Examples include the Token Ring network and a communications switch. The common property of these systems is the need to efficiently share a single resource (server) among N entities (stations). In spite of the massive research effort in this area, very little work has been devoted to the issue of how to efficiently operate these systems. In the present paper we deal with this problem… CONTINUE READING
Highly Cited
This paper has 48 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 29 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Polling mechanism models in communication systems - some application examples

  • D. Grillo
  • in: Stochastic Analysis of Computer and…
  • 1990
1 Excerpt

The power-series algorithm applied to cyclic polling systems

  • J.P.C. Blanc
  • Report Tilburg University, FEW 445, Tilburg
  • 1990
2 Excerpts

Waiting time distributions for cyclic-service systems with probabilistically-limited service

  • K. K. Leung
  • Report AT&T Bell Laboratories, Holmdel, NJ
  • 1990
1 Excerpt

Similar Papers

Loading similar papers…