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.