Gated Polling Systems with Lévy Inflow and Inter-Dependent Switchover Times: A Dynamical-Systems Approach

Abstract We study asymmetric polling systems where: (i) the incoming workflow processes follow general Lévy-subordinator statistics; and, (ii) the server attends the channels according to the gated service regime, and incurs random inter-dependentswitchover times when moving from one channel to the other. The analysis follows a dynamical-systems approach: a stochastic Poincaré map, governing the one-cycle dynamics of the polling system is introduced, and its statistical characteristics are studied. Explicit formulae regarding the evolution of the mean, covariance, and Laplace transform of the Poincaré map are derived. The forward orbit of the map’s transform – a nonlinear deterministic dynamical system in Laplace space – fully characterizes the stochastic dynamics of the polling system. This enables us to explore the long-term behavior of the system: we prove convergence to a (unique) steady-state equilibrium, prove the equilibrium is stationary, and compute its statistical characteristics.

[1]  Robert B. Cooper,et al.  Queues served in cyclic order , 1969 .

[2]  Moshe Sidi,et al.  Polling systems: applications, modeling, and optimization , 1990, IEEE Trans. Commun..

[3]  Martin Eisenberg Two Queues with Changeover Times , 1971, Oper. Res..

[4]  Mandyam M. Srinivasan,et al.  A Decomposition Theorem for Polling Models: The Switchover Times are Effectively Additive , 1996, Oper. Res..

[5]  Michael C. Mackey,et al.  Chaos, Fractals, and Noise , 1994 .

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

[7]  Mandyam M. Srinivasan,et al.  Descendant set: an efficient approach for the analysis of polling systems , 1994, IEEE Trans. Commun..

[8]  Hideaki Takagi,et al.  Application of Polling Models to Computer Networks , 1991, Comput. Networks ISDN Syst..

[9]  Jacques Resing,et al.  Polling systems and multitype branching processes , 1993, Queueing Syst. Theory Appl..

[10]  Hideaki Takagi,et al.  Queueing analysis of polling models: progress in 1990-1994 , 1998 .

[11]  Mandyam M. Srinivasan,et al.  Exact Analysis of the State-Dependent Polling Model , 2002, Queueing Syst. Theory Appl..

[12]  Robert B. Cooper Queues served in cyclic order: Waiting times , 1970, Bell Syst. Tech. J..

[13]  Uri Yechiali Analysis and Control of Poling Systems , 1993, Performance/SIGMETRICS Tutorials.

[14]  Lajos Takács Two Queues Attended by a Single Server , 1968, Oper. Res..

[15]  Dimitris Bertsimas,et al.  Decomposition results for general polling systems and their applications , 1999, Queueing Syst. Theory Appl..

[16]  Onno Boxma Analysis and optimization of polling systems , 1991 .

[17]  Sem C. Borst,et al.  Polling Models With and Without Switchover Times , 1997, Oper. Res..

[18]  Mandyam M. Srinivasan,et al.  Relating polling models with zero and nonzero switchover times , 1995, Queueing Syst. Theory Appl..

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

[20]  Martin Eisenberg,et al.  Queues with Periodic Service and Changeover Time , 1972, Oper. Res..