Editorial polling systems

نویسندگان

  • Ivo J. B. F. Adan
  • Erik M. M. Winands
چکیده

This special volume of the Annals of Operations Research contains frontier research papers on polling systems. A typical polling system consists of a number of queues, attended by a single server who visits the queues in some order to render service to the customers waiting at the queues. Polling systems naturally arise in a large number of application areas such as maintenance, manufacturing, computer-communication systems and road traffic. In 2000 Hideaki Takagi (2000)—one of the fathers of the success of polling models—wrote the following: The analysis of polling models gained momentum as queueing systems that are easy to understand, analyze, and extend. The study has been accelerated largely by applications to the modeling of communication, manufacturing and transportation systems. I believe that it is one of the few successful theoretical performance evaluation models developed in the last decades. In 1992 a special issue was published on polling systems in Queueing Systems, edited by Onno Boxma and Hideaki Takagi. At that time they indicated queueing theory for polling systems to be a presently maturing field. One could wonder whether, almost twenty years since its adolescence phase, the area of polling systems might be going through a mid-life crisis, suffering the well-known symptoms of such a period. Fortunately, nothing is less true! Nowadays, papers on polling systems keep appearing in an unremitting pace. This special volume identifies the current state-of-the-art in the performance analysis of polling systems and envisages future opportunities and challenges in this research area.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis and Optimization of Polling Systems

The basic polling system is a system of multiple queues, attended to by a single server in a cyclic order. Polling systems arise naturally in the modelling of many communication, computer and production networks where several users compete for access to a common resource. Such applications also give rise to several variants of the basic polling system, like periodic polling; here the server vis...

متن کامل

Scheduling in polling systems

We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework leads not only to unification but also to extension of the literature studying scheduling in polling system...

متن کامل

Evaluation and optimization of polling systems

Throughout this internship report, polling systems play a central role. Polling systems are queueing systems consisting of multiple queues, attended by a single server. The server can only serve one queue at a time. Whenever the server moves from one queue to another, a stochastic, non-zero switch-over time is incurred. The server never idles; even when there are no customers waiting in the who...

متن کامل

On polling systems with large setups

Polling systems with large deterministic setup times find many applications in production environments. The present note studies the delay distribution in exhaustive polling systems when the setup times tend to infinity. Based on the recently proposed mean value analysis (MVA) for polling systems, a novel simple approach is developed to show that the scaled delay distribution converges to a uni...

متن کامل

Decomposition results for general polling systems and their applications

In this paper we derive decomposition results for the number of customers in polling systems under arbitrary (dynamic) polling order and service policies. Furthermore, we obtain sharper decomposition results for both the number of customers in the system and the waiting times under static polling policies. Our analysis, which is based on distributional laws, relaxes the Poisson assumption that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Annals OR

دوره 198  شماره 

صفحات  -

تاریخ انتشار 2012