A Protocol for Anonymous and Accurate E-Polling

2007 ◽  
pp. 180-198
Author(s):  
Danilo Bruschi ◽  
Andrea Lanzi ◽  
Igor Naiq Fovino
Keyword(s):  
Security Requirements ◽  
Polling Systems ◽  
Polling System ◽  
Fundamental Component ◽  
Simple Protocol ◽  
Public Debates

E-polling systems are a fundamental component of any E-democracy system as they represent the most appropriate tool for fostering citizens participation to public debates. Contrarily to e-voting protocols, they are characterized by less stringent security requirements and they can also tolerate errors affecting a small percentage of votes, without compromising of the final result. Thus, their realization can be effectively pursued supporting the diffusion of e-democracy. In this paper we propose a simple protocol for an accurate and anonymous e-polling system. Such a protocol satisfies, among the others, the following properties: a vote cannot be altered, duplicated, or removed without being detected, votes remain anonymous. Moreover voters will be able to measure the level of trust of the process by verifying that their own votes have been correctly counted.

A Protocol for Anonymous and Accurate E-Polling

2011 ◽  
pp. 1255-1269
Author(s):  
Danilo Bruschi ◽  
Andrea Lanzi ◽  
Igor Nai Fovino
Keyword(s):  
Security Requirements ◽  
Polling Systems ◽  
Polling System ◽  
Fundamental Component ◽  
Simple Protocol ◽  
Public Debates

E-polling systems are a fundamental component of any E-democracy system as they represent the most appropriate tool for fostering citizens participation to public debates. Contrarily to e-voting protocols, they are characterized by less stringent security requirements and they can also tolerate errors affecting a small percentage of votes, without compromising of the final result. Thus, their realization can be effectively pursued supporting the diffusion of e-democracy. In this paper we propose a simple protocol for an accurate and anonymous e-polling system. Such a protocol satisfies, among the others, the following properties: a vote cannot be altered, duplicated, or removed without being detected, votes remain anonymous. Moreover voters will be able to measure the level of trust of the process by verifying that their own votes have been correctly counted.

scholarly journals M/G/∞ POLLING SYSTEMS WITH RANDOM VISIT TIMES

2007 ◽  
Vol 22 (1) ◽  
pp. 81-106 ◽  
Author(s):  
M. Vlasiou ◽  
U. Yechiali
Keyword(s):  
Service Time ◽  
Probability Generating Function ◽  
Expected Value ◽  
Polling Systems ◽  
Service Time Distribution ◽  
Polling System ◽  
Stieltjes Transform ◽  
Polling Model ◽  
Queue Lengths ◽  
Number Of Customers

We consider a polling system where a group of an infinite number of servers visits sequentially a set of queues. When visited, each queue is attended for a random time. Arrivals at each queue follow a Poisson process, and the service time of each individual customer is drawn from a general probability distribution function. Thus, each of the queues comprising the system is, in isolation, anM/G/∞-type queue. A job that is not completed during a visit will have a new service-time requirement sampled from the service-time distribution of the corresponding queue. To the best of our knowledge, this article is the first in which anM/G/∞-type polling system is analyzed. For this polling model, we derive the probability generating function and expected value of the queue lengths and the Laplace–Stieltjes transform and expected value of the sojourn time of a customer. Moreover, we identify the policy that maximizes the throughput of the system per cycle and conclude that under the Hamiltonian-tour approach, the optimal visiting order isindependentof the number of customers present at the various queues at the start of the cycle.

scholarly journals On stabilizability of fluid multi-server polling systems with setups

2018 ◽  
pp. 26-34
Author(s):  
Alexey Matveev
Keyword(s):  
Fluid Model ◽  
Round Robin ◽  
Time Measurement ◽  
Polling Systems ◽  
Polling System ◽  
Full Information ◽  
Time Invariant ◽  
Multi Server ◽  
Necessity Part ◽  
Service Protocol

A time-invariant fluid model of a polling system is considered. It consists of finitely many servers and buffers with unlimited sizes. The buffers receive inflows of work from the outside, work leaves the system after processing by a server. Every server works only with buffers from an associated zone of service, which may overlap for various servers, is able to serve at most one buffer at a time and so has to switch, from time to time, among buffers, the switch-over times are nonzero. We present a criterion for existence of a scheduling and service protocol that makes the system stable in the sense that the total amount of work in the buffers remains bounded as time progresses. The necessity part of this result is concerned with the widest class of protocols, including dynamic ones that are centralized and have access to the full information about the events in the system. Meanwhile, we show that every stabilizable system can be stabilized in a fully decentralized fashion via a simple static protocol, e.g., by a protocol that is based on independent round robin scheduling of the servers and for every server, employs only time measurement.

POLLING SYSTEMS WITH TWO-PHASE GATED SERVICE

2008 ◽  
Vol 22 (4) ◽  
pp. 623-651 ◽  
Author(s):  
R. D. van der Mei ◽  
J. A. C. Resing
Keyword(s):  
Waiting Time ◽  
Branching Processes ◽  
Heavy Traffic ◽  
Polling Systems ◽  
Polling System ◽  
Two Phase ◽  
General Parameter ◽  
Multitype Branching Processes ◽  
Poisson Arrivals ◽  
Gated Service

We study an asymmetric cyclic polling system with Poisson arrivals, general service-time and switch-over time distributions, and so-called two-phase gated service at each queue, an interleaving scheme that aims to enforce some level of “fairness” among the different customer classes. For this model, we use the classical theory of multitype branching processes to derive closed-form expressions for the Laplace–Stieltjes transform of the waiting-time distributions when the load tends to 1, in a general parameter setting and under proper heavy-traffic scalings. This result is strikingly simple and provides new insights in the behavior of two-phase polling systems. In particular, the result provides insight in the waiting-time performance and the trade-off between efficiency and fairness of two-phase gated polling compared to the classical one-phase gated service policy.

Sojourn times in vacation and polling systems with Bernoulli feedback

1991 ◽  
Vol 28 (2) ◽  
pp. 422-432 ◽  
Author(s):  
T. Takine ◽  
H. Takagi ◽  
T. Hasegawa
Keyword(s):  
Polling Systems ◽  
Polling System ◽  
Bernoulli Feedback ◽  
Sojourn Times ◽  
Multiple Vacation ◽  
Service Disciplines ◽  
Cyclic Service ◽  
The Mean ◽  
Sojourn Time Distributions ◽  
Stieltjes Transforms

We study sojourn times in M/G/1 multiple vacation systems and multiqueue cyclic-service (polling) systems with instantaneous Bernoulli feedback. Three service disciplines, exhaustive, gated, and 1-limited, are considered for both M/G/1 vacation and polling systems. The Laplace-Stieltjes transforms of the sojourn time distributions in the three vacation systems are derived. For polling systems, we provide explicit expressions for the mean sojourn times in symmetric cases. Furthermore a pseudo-conservation law with respect to the mean sojourn times is derived for a polling system with a mixture of the three service disciplines.

scholarly journals Polling Systems and Their Application to Telecommunication Networks

Mathematics ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 117
Author(s):  
Vladimir Vishnevsky ◽  
Olga Semenova
Keyword(s):  
System Analysis ◽  
Telecommunication Networks ◽  
Performance Characteristics ◽  
Transport Systems ◽  
Management Systems ◽  
Polling Systems ◽  
Polling System ◽  
Value Analysis ◽  
Polling Models ◽  
Poisson Arrivals

The paper presents a review of papers on stochastic polling systems published in 2007–2020. Due to the applicability of stochastic polling models, the researchers face new and more complicated polling models. Stochastic polling models are effectively used for performance evaluation, design and optimization of telecommunication systems and networks, transport systems and road management systems, traffic, production systems and inventory management systems. In the review, we separately discuss the results for two-queue systems as a special case of polling systems. Then we discuss new and already known methods for polling system analysis including the mean value analysis and its application to systems with heavy load to approximate the performance characteristics. We also present the results concerning the specifics in polling models: a polling order, service disciplines, methods to queue or to group arriving customers, and a feedback in polling systems. The new direction in the polling system models is an investigation of how the customer service order within a queue affects the performance characteristics. The results on polling systems with correlated arrivals (MAP, BMAP, and the group Poisson arrivals simultaneously to all queues) are also considered. We briefly discuss the results on multi-server, non-discrete polling systems and application of polling models in various fields.

Sojourn times in vacation and polling systems with Bernoulli feedback

1991 ◽  
Vol 28 (02) ◽  
pp. 422-432 ◽  
Author(s):  
T. Takine ◽  
H. Takagi ◽  
T. Hasegawa
Keyword(s):  
Polling Systems ◽  
Polling System ◽  
Bernoulli Feedback ◽  
Sojourn Times ◽  
Multiple Vacation ◽  
Service Disciplines ◽  
Cyclic Service ◽  
The Mean ◽  
Sojourn Time Distributions ◽  
Stieltjes Transforms

We study sojourn times in M/G/1 multiple vacation systems and multiqueue cyclic-service (polling) systems with instantaneous Bernoulli feedback. Three service disciplines, exhaustive, gated, and 1-limited, are considered for both M/G/1 vacation and polling systems. The Laplace-Stieltjes transforms of the sojourn time distributions in the three vacation systems are derived. For polling systems, we provide explicit expressions for the mean sojourn times in symmetric cases. Furthermore a pseudo-conservation law with respect to the mean sojourn times is derived for a polling system with a mixture of the three service disciplines.

scholarly journals Strategic Behavior of Customers and Optimal Control for Batch Service Polling Systems with Priorities

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-19 ◽  
Author(s):  
Tao Jiang ◽  
Xingzheng Lu ◽  
Lu Liu ◽  
Jun Lv ◽  
Xudong Chai
Keyword(s):  
Strategic Behavior ◽  
Particle Swarm Optimization Algorithm ◽  
Polling Systems ◽  
Batch Service ◽  
Polling System ◽  
Swarm Optimization ◽  
Equilibrium Strategies ◽  
The Past ◽  
Optimal Service ◽  
Revenue Function

During the past few years, batch service systems have attracted considerable attention due to their wide area of applications. In this present paper, we study a special batch service polling system (the so-called Israeli queue) with priorities. Different from the previous papers which focus on the performance analysis, we aim to investigate the strategic behavior of customers and optimal design for the underlying queueing model. By considering two levels of information (observable and unobservable) provided upon customers’ arrival, we, respectively, derive the equilibrium strategies of high-priority and low-priority customers, regarding the joining or balking dilemma. We also present some numerical examples to reveal the impacts of several parameters on the equilibrium strategies, together with some intuitive explanations. Finally, we formulate the revenue function of the service provider and present the Particle Swarm Optimization algorithm to seek the optimal service prices for the high-priority and low-priority customers to maximize the service provider’s revenue under the two levels of information.

Optimal routeing in two-queue polling systems

2018 ◽  
Vol 55 (3) ◽  
pp. 944-967 ◽  
Author(s):  
I. J. B. F. Adan ◽  
V. G. Kulkarni ◽  
N. Lee ◽  
E. Lefeber
Keyword(s):  
Nash Equilibria ◽  
Control Policy ◽  
Complete Information ◽  
Polling Systems ◽  
Polling System ◽  
Switching Curve ◽  
Optimal Policies ◽  
Markov Decision ◽  
Switchover Times ◽  
Available Information

Abstract We consider a polling system with two queues, exhaustive service, no switchover times, and exponential service times with rate µ in each queue. The waiting cost depends on the position of the queue relative to the server: it costs a customer c per time unit to wait in the busy queue (where the server is) and d per time unit in the idle queue (where there is no server). Customers arrive according to a Poisson process with rate λ. We study the control problem of how arrivals should be routed to the two queues in order to minimize the expected waiting costs and characterize individually and socially optimal routeing policies under three scenarios of available information at decision epochs: no, partial, and complete information. In the complete information case, we develop a new iterative algorithm to determine individually optimal policies (which are symmetric Nash equilibria), and show that such policies can be described by a switching curve. We use Markov decision processes to compute the socially optimal policies. We observe numerically that the socially optimal policy is well approximated by a linear switching curve. We prove that the control policy described by this linear switching curve is indeed optimal for the fluid version of the two-queue polling system.

On the Stability of Greedy Polling Systems with General Service Policies

1998 ◽  
Vol 12 (1) ◽  
pp. 49-68 ◽  
Author(s):  
Serguei Foss ◽  
Günter Last
Keyword(s):  
Queue Length ◽  
Random Variable ◽  
Polling Systems ◽  
Service Time Distribution ◽  
Polling System ◽  
Poisson Arrival ◽  
Service Policies ◽  
The Stability ◽  
Random Level ◽  
General Service

We consider a polling system with a finite number of stations fed by compound Poisson arrival streams of customers asking for service. A server travels through the system. Upon arrival at a nonempty station i, say, with x > 0 waiting customers, the server tries to serve there a random number B of customers if the queue length has not reached a random level C < x before the server has completed the B services. The random variable B may also take the value ∞ so that the server has to provide service as long as the queue length has reached size C. The distribution Hi, x of the air (B, C) may depend on i and x while the service time distribution is allowed to depend on i. The station to be visited next is chosen among some neighbors according to a greedy policy. That is to say that the server always tries to walk to the fullest station in his well-defined neighborhood. Under appropriate independence assumptions two conditions are established that are sufficient for stability and sufficient for instability. Some examples will illustrate the relevance of our results.

Sign in / Sign up

Export Citation Format

Share Document