Sciweavers

101 search results - page 6 / 21
» Queues with waiting time dependent service
Sort
View
QUESTA
2011
12 years 10 months ago
Uniform approximations for the M/G/1 queue with subexponential processing times
: This paper studies the asymptotic behavior of the steady-state waiting time, W∞, of the M/G/1 queue with subexponenential processing times for different combinations of traffi...
Mariana Olvera-Cravioto, Peter W. Glynn
GLOBECOM
2010
IEEE
13 years 5 months ago
Online Network Coding for Time-Division Duplexing
We study an online random linear network coding approach for time division duplexing (TDD) channels under Poisson arrivals. We model the system as a bulk-service queue with variabl...
Daniel Enrique Lucani, Muriel Médard, Milic...
ORL
2007
84views more  ORL 2007»
13 years 7 months ago
The price of anarchy in an exponential multi-server
We consider a single multi-server memoryless service station. Servers have heterogeneous service rates. Arrivals are routed to one of the servers, and the routing decisions are no...
Moshe Haviv, Tim Roughgarden
PRDC
2005
IEEE
14 years 1 months ago
Optimal Choice of Checkpointing Interval for High Availability
Supporting high availability by checkpointing and switching to a backup upon failure of a primary has a cost. Trade-off studies help system architects to decide whether higher ava...
Diana Szentiványi, Simin Nadjm-Tehrani, Joh...
EOR
2008
119views more  EOR 2008»
13 years 7 months ago
Market sharing dynamics between two service providers
We study the market partition between two distinct firms that deliver services to waiting time sensitive customers. In our model, the incoming customers select a firm on the basis...
Olivier Gallay, Max-Olivier Hongler