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

Abstract

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 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.

Efficient Content Delivery in the Presence of Impatient Jobs

“…The models that we come across show interesting resemblances with a wide variety of models from very different application fields, including the shot-noise process (see, for example, [10]) and server routing in polling systems [11].…”

The Application of the Exhaustive Polling Theory in Intelligent Traffic System

“…In this system,the exhaustive service [3] be used in the two directions of the intersection.Means that the length of green light time in any road should conforms with the result which is calculated by the exhaustive service polling theory.On other word ,the length of red light time depend on anther direction's length of green light time.And there is one would never change over the traffic volume that is length of yellow light time.…”

The Application of The Double Queue Asymmetric Gated Service Polling Control Theory in Intelligent Traffic System

“…In this paper we apply the theory of double queues asymmetric gated service polling [2] we design a traffic light system which the light time can be adjusted intellectually according to the change of the vehicles arrive rate [3].…”