Sciweavers

QUESTA
2006
87views more  QUESTA 2006»
13 years 3 months ago
Mean value analysis for polling systems
The present paper deals with the problem of calculating mean delays in polling systems with either exhaustive or gated service. We develop a mean value analysis (MVA) to compute t...
Erik M. M. Winands, Ivo J. B. F. Adan, G. J. van H...
QUESTA
2006
115views more  QUESTA 2006»
13 years 3 months ago
Analyzing priority queues with 3 classes using tree-like processes
In this paper we demonstrate how tree-like processes can be used to analyze a general class of priority queues with three service classes, creating a new methodology to study prio...
Benny Van Houdt, Chris Blondia
QUESTA
2006
73views more  QUESTA 2006»
13 years 3 months ago
Handling load with less stress
Abstract We study how the average performance of a system degrades as the load nears its peak capacity. We restrict our attention to the performance measures of average sojourn tim...
Nikhil Bansal, David Gamarnik
QUESTA
2006
101views more  QUESTA 2006»
13 years 3 months ago
Insensitive versus efficient dynamic load balancing in networks without blocking
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...
Matthieu Jonckheere
QUESTA
2006
94views more  QUESTA 2006»
13 years 3 months ago
Modeling teletraffic arrivals by a Poisson cluster process
In this paper we consider a Poisson cluster process N as a generating process for the arrivals of packets to a server. This process generalizes in a more realistic way the infinite...
Gilles Faÿ, Bárbara González-Ar...
QUESTA
2006
119views more  QUESTA 2006»
13 years 3 months ago
Single-Server Queue with Markov-Dependent Inter-Arrival and Service Times
In this paper we study a single-server queue where the inter-arrival times and the service times depend on a common discrete time Markov Chain. This model generalizes the well-kno...
Ivo J. B. F. Adan, Vidyadhar G. Kulkarni