ON THE OPTIMAL OPEN-LOOP CONTROL POLICY FOR DETERMINISTIC AND EXPONENTIAL POLLING SYSTEMS

In this article, we consider deterministic (both fluid and discrete) polling systems with N queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, we show that the best polling sequence is always periodic when the system is stable and forms a regular sequence. The fraction of time spent by the server in the first queue is highly noncontinuous in the parameters of the system (arrival rate and service rate) and shows a fractal behavior. Moreover, convexity properties are shown and are used in a generalization of the computation of the optimal control policy (in open loop) for the stochastic exponential case.

[1]  Arie Hordijk,et al.  On the Average Waiting Time for Regular Routing to Deterministic Queues , 2005, Math. Oper. Res..

[2]  P. Walters.  Introduction to Ergodic Theory , 1977 .

[3]  Hideaki Takagi,et al.  Analysis of polling systems , 1986 .

[4]  C. Mack,et al.  The Efficiency of N Machines Uni‐Directionally Patrolled by One Operative When Walking Time is Constant and Repair Times are Variable , 1957 .

[5]  C. Mack,et al.  THE EFFICIENCY OF N MACHINES UNI-DIRECTIONALLY PATROLLED BY ONE OPERATIVE WHEN WALKING TIME AND REPAIR TIMES ARE CONSTANTS , 1957 .

[6]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[7]  Arie Hordijk,et al.  NOTE ON THE CONVEXITY OF THE STATIONARY WAITING TIME AS A FUNCTION OF THE DENSITY , 2003, Probability in the Engineering and Informational Sciences.

[8]  Robert Tijdeman.  Fraenkel's conjecture for six sequences , 2000, Discret. Math..

[9]  M. Lothaire.  Algebraic Combinatorics on Words , 2002 .

[10]  Yair Arian,et al.  Algorithms for generalized round robin routing , 1992, Oper. Res. Lett..

[11]  Joseph B. Kruskal.  Work-scheduling algorithms: A nonprobabilistic queuing study (with possible application to no. 1 ESS) , 1969 .

[12]  Marcel F. Neuts,et al.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .

[13]  Bruno Gaujal,et al.  Optimal Routing Policy in Two Deterministic Queues , 2000 .

[14]  Eitan Altman,et al.  Optimal Open-Loop Control of Vacations, Polling and Service Assignment , 2000, Queueing Syst. Theory Appl..

[15]  Arie Hordijk,et al.  Optimal noncyclic server allocation in a polling model , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[16]  Hanoch Levy,et al.  Efficient visit frequencies for polling tables: minimization of waiting cost , 1991, Queueing Syst. Theory Appl..

[17]  Eitan Altman,et al.  Discrete-Event Control of Stochastic Networks - Multimodularity and Regularity , 2004, Lecture notes in mathematics.

[18]  M. Reiman,et al.  Polling Systems with Zero Switchover Times: A Heavy-Traffic Averaging Principle , 1995 .

[19]  Onno J. Boxma,et al.  Optimization of Static Traffic Allocation Policies , 1994, Theor. Comput. Sci..