Polling - analysis, optimization and control

Abstract : A polling model is a queueing model consisting of several queues, which are cyclically visited by a server. The server visits the queues according to some discipline, like $1$-limited (serve at most one customer in a visit) or exhaustive (serve a queue until it has become empty). Polling models find many applications in computer-communications, and also in other areas like maintenance, production-inventory systems, and signallized traffic intersections.
The first part of the talk contains a global introduction to polling systems, and a review of some of their key properties. In the second part of the talk I'd like to describe some recent and ongoing work with Kamil Kosi\'nski and Offer Kella (on joint queue length and joint workload distributions) and with Ivo Adan, Urtzi Ayesta, Josine Bruin, Brian Fralix, Vidyadhar Kulkarni, Maaike Verloop, Adam Wierman and Erik Winands (on various scheduling and optimization problems in polling systems).
Type de document :
Communication dans un congrès
Roberto Cominetti and Sylvain Sorin and Bruno Tuffin. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Oct 2011, Paris, France. IEEE, 2011
Liste complète des métadonnées

https://hal.inria.fr/hal-00646557
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mercredi 30 novembre 2011 - 11:30:52
Dernière modification le : mercredi 30 novembre 2011 - 11:30:52

Identifiants

  • HAL Id : hal-00646557, version 1

Collections

Citation

Onno Boxma. Polling - analysis, optimization and control. Roberto Cominetti and Sylvain Sorin and Bruno Tuffin. NetGCOOP 2011 : International conference on NETwork Games, COntrol and OPtimization, Oct 2011, Paris, France. IEEE, 2011. 〈hal-00646557〉

Partager

Métriques

Consultations de la notice

138