181 research outputs found
Wait-and-see strategies in polling models
We consider a general polling model with stations. The stations are
served exhaustively and in cyclic order. Once a station queue falls empty, the
server does not immediately switch to the next station. Rather, it waits at the
station for the possible arrival of new work ("wait-and-see") and, in the case
of this happening, it restarts service in an exhaustive fashion. The total time
the server waits idly is set to be a fixed, deterministic parameter for each
station. Switchover times and service times are allowed to follow some general
distribution, respectively. In some cases, which can be characterised, this
strategy yields strictly lower average queueing delay than for the exhaustive
strategy, which corresponds to setting the "wait-and-see credit" equal to zero
for all stations. This extends results of Pek\"oz (Probability in the
Engineering and Informational Sciences 13 (1999)) and of Boxma et al. (Annals
of Operations Research 112 (2002)). Furthermore, we give a lower bound for the
delay for {\it all} strategies that allow the server to wait at the stations
even though no work is present.Comment: 24p, submitte
Upstream traffic capacity of a WDM EPON under online GATE-driven scheduling
Passive optical networks are increasingly used for access to the Internet and
it is important to understand the performance of future long-reach,
multi-channel variants. In this paper we discuss requirements on the dynamic
bandwidth allocation (DBA) algorithm used to manage the upstream resource in a
WDM EPON and propose a simple novel DBA algorithm that is considerably more
efficient than classical approaches. We demonstrate that the algorithm emulates
a multi-server polling system and derive capacity formulas that are valid for
general traffic processes. We evaluate delay performance by simulation
demonstrating the superiority of the proposed scheduler. The proposed scheduler
offers considerable flexibility and is particularly efficient in long-reach
access networks where propagation times are high
Random Fluid Limit of an Overloaded Polling Model
In the present paper, we study the evolution of an overloaded cyclic polling
model that starts empty. Exploiting a connection with multitype branching
processes, we derive fluid asymptotics for the joint queue length process.
Under passage to the fluid dynamics, the server switches between the queues
infinitely many times in any finite time interval causing frequent oscillatory
behavior of the fluid limit in the neighborhood of zero. Moreover, the fluid
limit is random. Additionally, we suggest a method that establishes finiteness
of moments of the busy period in an M/G/1 queue.Comment: 36 pages, 2 picture
Queue-length balance equations in multiclass multiserver queues and their generalizations
A classical result for the steady-state queue-length distribution of
single-class queueing systems is the following: the distribution of the queue
length just before an arrival epoch equals the distribution of the queue length
just after a departure epoch. The constraint for this result to be valid is
that arrivals, and also service completions, with probability one occur
individually, i.e., not in batches. We show that it is easy to write down
somewhat similar balance equations for {\em multidimensional} queue-length
processes for a quite general network of multiclass multiserver queues. We
formally derive those balance equations under a general framework. They are
called distributional relationships, and are obtained for any external arrival
process and state dependent routing as long as certain stationarity conditions
are satisfied and external arrivals and service completions do not
simultaneously occur. We demonstrate the use of these balance equations, in
combination with PASTA, by (i) providing very simple derivations of some known
results for polling systems, and (ii) obtaining new results for some queueing
systems with priorities. We also extend the distributional relationships for a
non-stationary framework
Polling systems with regularly varying service and/or switchover times
We consider a polling system consisting of K queues and a single server S who visits the queues in a cyclic order. The polling discipline in each queue is the gated or exhaustive service discipline. We investigate the tail behaviour of the waiting time distributions at the various queues in the case that at least one of the service time or switchover time distributions has a regularly varying tail
Workloads and waiting times in single-server systems with multiple customer classes
One of the most fundamental properties that single-server multi-class service systems may possess is the property of work conservation. Under certain restrictions, the work conservation property gives rise to a conservation law for mean waiting times, i.e., a linear relation between the mean waiting times of the various classes of customers. This paper is devoted to single-server multi-class service systems in which work conservation is violated in the sense that the server's activities may be interrupted although work is still present. For a large class of such systems with interruptions, a decomposition of the amount of work into two independent components is obtained; one of these components is the amount of work in the corresponding systemwithout interruptions. The work decomposition gives rise to a (pseudo)conservation law for mean waiting times, just as work conservation did for the system without interruptions
- …