Sciweavers

269 search results - page 34 / 54
» Online oblivious routing
Sort
View
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 1 months ago
Scalable Resilient Overlay Networks Using Destination-Guided Detouring
— Routing policies used in the Internet tend to be restrictive limiting communication between source-destination pairs to one route, when often better alternates exist. To avoid ...
Sameer Qazi, Tim Moors
INFOCOM
2007
IEEE
14 years 1 months ago
Understanding BGP Session Failures in a Large ISP
Abstract—The current global Internet routing frequently suffers from cascading routing changes and slow routing convergence. Such instability can significantly affect the perfor...
Lan Wang, Malleswari Saranu, Joel Gottlieb, Dan Pe...
IOR
2002
135views more  IOR 2002»
13 years 7 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss
GLOBECOM
2009
IEEE
13 years 5 months ago
Joint Scheduling and Instantaneously Decodable Network Coding
We consider a wireless multi-hop network and design an algorithm for jointly optimal scheduling of packet transmissions and network coding. We consider network coding across differ...
Danail Traskov, Muriel Médard, Parastoo Sad...
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
14 years 2 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak