Sciweavers

2076 search results - page 125 / 416
» Universal Routing in Distributed Networks
Sort
View
SPAA
2003
ACM
14 years 3 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 11 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
PERCOM
2006
ACM
14 years 4 months ago
DHT-based Unicast for Mobile Ad Hoc Networks
As mobile ad hoc networks (MANETs) become ever more popular, it also becomes more and more interesting to build distributed network applications (e.g. data storage, etc.) that hav...
Thomas Zahn, Jochen H. Schiller
INFOCOM
2005
IEEE
14 years 3 months ago
Spatial energy balancing in large-scale wireless multihop networks
— In this paper we investigate the use of proactive multipath routing to achieve energy efficient operation of ad hoc wireless networks. The focus is on optimizing trade-offs be...
Seung Jun Baek, Gustavo de Veciana
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 4 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