Sciweavers

QUESTA
2007
136views more  QUESTA 2007»
13 years 4 months ago
A resource allocation queueing fairness measure: properties and bounds
Fairness is an inherent and fundamental factor of queue service disciplines in a large variety of queueing applications, ranging from airport and supermarket waiting lines to comp...
Benjamin Avi-Itzhak, Hanoch Levy, David Raz
QUESTA
2007
72views more  QUESTA 2007»
13 years 4 months ago
A non-increasing Lindley-type equation
: In this paper we study the Lindley-type equation W = max{0, B − A − W}. Its main characteristic is that it is a non-increasing monotone function in its main argument W. Our m...
Maria Vlasiou
QUESTA
2007
111views more  QUESTA 2007»
13 years 4 months ago
Queues with system disasters and impatient customers when system is down
Consider a system (e.g. a computer farm or a call center) operating as a M/M/c queue, where c = 1, or 1 < c < ∞, or c = ∞. The system as a whole suffers disastrous break...
Uri Yechiali
QUESTA
2007
75views more  QUESTA 2007»
13 years 4 months ago
Equilibrium customer strategies in a single server Markovian queue with setup times
We consider a single server Markovian queue with setup times. Whenever this system becomes empty, the server is turned off. Whenever a customer arrives to an empty system, the ser...
Apostolos Burnetas, Antonis Economou
QUESTA
2007
88views more  QUESTA 2007»
13 years 4 months ago
A simple proof for the constructions of optical priority queues
Constructions of optical queues by optical Switches and fiber Delay Lines (SDL) have received a lot of attention lately. In this short paper, we provide a simple proof for the co...
Hsien-Chen Chiu, Cheng-Shang Chang, Jay Cheng, Dua...
QUESTA
2007
92views more  QUESTA 2007»
13 years 4 months ago
Estimation for queues from queue length data
We consider the estimation of arrival and service rates for queues based on queue length data collected at successive, not necessarily equally spaced, time points. In particular, ...
J. V. Ross, T. Taimre, Philip K. Pollett
QUESTA
2007
170views more  QUESTA 2007»
13 years 4 months ago
Priority queueing systems: from probability generating functions to tail probabilities
Obtaining (tail) probabilities from a transform function is an important topic in queueing theory. To obtain these probabilities in discrete-time queueing systems, we have to inve...
Tom Maertens, Joris Walraevens, Herwig Bruneel
QUESTA
2007
72views more  QUESTA 2007»
13 years 4 months ago
Equilibria of a class of transport equations arising in congestion control
François Baccelli, Ki Baek Kim, David R. Mc...