Skip to Main content Skip to Navigation
Conference papers

Polling systems: exact results and approximations

Abstract : Polling systems typically consist of a number of queues, attended by a single server in a fi xed cyclic order. They have become a powerful tool for the performance analysis of a wide variety of important applications, e.g., in computer-communication, production, transportation and maintenance systems. In this talk we discuss exact results for polling systems satisfying the so-called branching property, as well as approximate results for a broader class of polling systems.
Document type :
Conference papers
Complete list of metadata
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Wednesday, June 1, 2011 - 2:34:41 PM
Last modification on : Wednesday, June 1, 2011 - 2:47:48 PM


  • HAL Id : inria-00597611, version 1



Ivo Adan. Polling systems: exact results and approximations. NET-COOP 2010 - 4th Workshop on Network Control and Optimization, Nov 2010, Ghent, Belgium. ⟨inria-00597611⟩



Record views