Markovian polling systems with an application to wireless random-access networks

Motivated by an application in wireless random-access networks, we study a class of polling systems with Markovian routing, in which the server visits the queues in an order governed by a discrete-time Markov chain. Assuming that the service disciplines at each of the queues fall in the class of branching-type service disciplines, we derive a functional equation for (the probability generating function of) the joint queue length distribution conditioned on a point in time when the server visits a certain queue. From this functional equation, expressions for the (cross-)moments of the queue lengths follow. We also derive a pseudo-conservation law for this class of polling systems. Using these results, we compute expressions for certain system parameters that minimise the total expected amount of work in systems that arise from the wireless random-access network setting. In addition, we derive approximations for those same parameters that minimise a weighted sum of mean waiting times in these systems. Based on these expressions, we also present an adaptive control algorithm for finding the optimal parameter values in a distributed fashion, which is particularly relevant in the context of wireless random-access networks.

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

[2]  高木 英明,et al.  Analysis of polling systems , 1986 .

[3]  Mandyam M. Srinivasan,et al.  Nondeterministic polling systems , 1991 .

[4]  L. D. Servi,et al.  The Distributional Form of Little's Law and the Fuhrmann-Cooper Decomposition , 2015 .

[5]  K. M. Kosinski,et al.  Queue lengths and workloads in polling systems , 2011, Oper. Res. Lett..

[6]  Onno J. Boxma,et al.  Waiting Times in Polling Systems with Markovian Server Routing , 1989, MMB.

[7]  Eitan Altman,et al.  Gated polling with stationary ergodic walking times, Markovian routing and random feedback , 2012, Ann. Oper. Res..

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

[9]  Jan Adriaan Weststrate Analysis and optimization of polling models , 1992 .

[10]  Robert D. van der Mei,et al.  On two-queue Markovian polling systems with exhaustive service , 2014, Queueing Systems.

[11]  Chong Kwan Un,et al.  Performance Analysis of Markovian Polling Systems with Single Buffers , 1994, Perform. Evaluation.

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

[13]  V. M. Vishnevskii,et al.  Mathematical methods to study the polling systems , 2006 .

[14]  Robert D. van der Mei,et al.  Applications of polling systems , 2011, ArXiv.

[15]  Hanoch Levy,et al.  Optimization of Polling Systems , 1990, International Symposium on Computer Modeling, Measurement and Evaluation.

[16]  Steve W. Fuhrmann,et al.  A decomposition result for a class of polling models , 1992, Queueing Syst. Theory Appl..

[17]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[18]  Tetsuji Hirayama,et al.  Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms , 2012, Ann. Oper. Res..

[19]  Wei Feng,et al.  Large deviations of Markovian polling models with applications to admission control , 2006, Ann. Oper. Res..

[20]  R. Luchsinger,et al.  Zentrale Hörstörungen mit Paramusie nach Contusio cerebri , 1947 .

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

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

[23]  Tetsuji Hirayama Markovian Polling Systems: Functional Computation for Mean Waiting Times and its Computational Complexity , 2009 .

[24]  Leonard Kleinrock,et al.  The Analysis of Random Polling Systems , 1988, Oper. Res..

[25]  Onno Boxma,et al.  Pseudo-conservation laws in cyclic-service systems , 1986 .

[26]  K. Athreya,et al.  Multi-Type Branching Processes , 1972 .

[27]  Arnaud de La Fortelle,et al.  Large Deviations Rate Function for Polling Systems , 2002, Queueing Syst. Theory Appl..

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

[29]  P. Olver Nonlinear Systems , 2013 .

[30]  Christos Langaris Markovian polling systems with mixed service disciplines and retrial customers , 1999 .

[31]  Onno J. Boxma,et al.  Workloads and waiting times in single-server systems with multiple customer classes , 1989, Queueing Syst. Theory Appl..

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

[33]  H. Kushner,et al.  Stochastic Approximation and Recursive Algorithms and Applications , 2003 .

[34]  Jean-Marc Lasgouttes,et al.  A State-Dependent Polling Model with Markovian Routing , 1995 .

[35]  Donald F. Towsley,et al.  On optimal polling policies , 1992, Queueing Syst. Theory Appl..