Sciweavers

8 search results - page 1 / 2
» Optimal Routing in Two Parallel Queues with Exponential Serv...
Sort
View
DEDS
2006
66views more  DEDS 2006»
13 years 5 months ago
Optimal Routing in Two Parallel Queues with Exponential Service Times
Bruno Gaujal, Emmanuel Hyon, Alain Jean-Marie
ORL
2007
84views more  ORL 2007»
13 years 5 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
SPDP
1991
IEEE
13 years 9 months ago
Optimal randomized algorithms for multipacket and cut through routing on the mesh
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
Sanguthevar Rajasekaran, Mukund Raghavachari
SPAA
1996
ACM
13 years 9 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
PPSN
2010
Springer
13 years 4 months ago
Optimizing Delivery Time in Multi-Objective Vehicle Routing Problems with Time Windows
The Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous ...
Abel Garcia-Najera, John A. Bullinaria