We consider a class of two-queue polling systems with exhaustive service, where the order in which the server visits the queues is governed by a discrete-time Markov chain. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we obtain explicit expressions for the Laplace-Stieltjes trans...

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

Web feeds are a popular way to access updates for content in the World Wide Web. Unfortunately, the technology behind web feeds is based on polling. Thus, clients ask the feed server regularly for updates. There are two concurrent problems with this approach. First, many times a client asks for updates, there is no new item and second, if the client’s update interval is too large it might be no...

Dynamic load balancing is crucial for the performance of many parallel algorithms. Random Polling, a simple randomized algorithm, has proved to be very eecient in practice for applications like parallel depth rst search. This paper derives tight bounds for the scalability of Random Polling which are for the rst time able to explain its superior performance analytically. In some cases, Random Po...

Public voting in polling stations is believed to have a socioculturallyintegrative effect, conveyed through the symbolic and ritualistic character of the election process. Remote internet voting is believed to not be able to provide this effect, because it omits the corporeal appearance at the polling station. The following contribution aims at indicating how such a sociocultural effect could b...

This paper presents a Network of Cyclic Polling Systems that consists of two cyclic polling systems with two queues each when transfer of users from one system to the other is imposed. This system is modelled in discrete time. It is assumed that each system has exponential inter-arrival times and the servers apply an exhaustive policy. Closed form expressions are obtained for the first and seco...

Round robin (RR) arbitration is commonly used for scheduling of cells in high-speed packet switches. In this paper, we present an overlapped RR (ORR) arbiter design that fully overlaps RR polling and cell scheduling. The ORR arbiter achieves 100% throughput even when a cell transfer time is less than a worst case polling, or scheduling, cycle. This is done by scheduling blocks of cells during a...

Compensational voting refers to when voters cast a vote for more extreme party than they prefer, in order push policies closer an ideal point. This article develops the idea of compensational regard pre-electoral coalition signals and polling trends. The argument is that significant share consider relative strength parties their preferred coalition, adjust choice accordingly. elaborated by cond...