Sciweavers

244 search results - page 23 / 49
» Algorithmic Techniques for Maintaining Shortest Routes in Dy...
Sort
View
CORR
2010
Springer
160views Education» more  CORR 2010»
13 years 4 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
HPCC
2007
Springer
13 years 12 months ago
Power-Aware Fat-Tree Networks Using On/Off Links
Abstract. Nowadays, power consumption reduction techniques are being increasingly used in computer systems, and high-performance computing systems are not an exception. In particul...
Marina Alonso, Salvador Coll, Vicente Santonja, Ju...
ISCC
2003
IEEE
128views Communications» more  ISCC 2003»
14 years 1 months ago
A Load Balancing Scheme for Congestion Control in MPLS Networks
In this paper we develop a Load Balancing scheme for networks based on the MPLS framework. The proposed algorithm (DYLBA - Dynamic Load Balancing Algorithm) implements a local sea...
Elio Salvadori, Roberto Battiti
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
14 years 1 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
14 years 2 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner