Sciweavers

103 search results - page 5 / 21
» Oblivious routing on geometric networks
Sort
View
CAL
2004
13 years 10 months ago
Globally Adaptive Load-Balanced Routing on Tori
We introduce a new method of adaptive routing on k-ary n-cubes, Globally Adaptive Load-Balance (GAL). GAL makes global routing decisions using global information. In contrast, most...
Arjun Singh, William J. Dally, Brian Towles, Amit ...
FOCS
2002
IEEE
14 years 3 months ago
Minimizing Congestion in General Networks
A principle task in parallel and distributed systems is to reduce the communication load in the interconnection network, as this is usually the major bottleneck for the performanc...
Harald Räcke
MOBIHOC
2003
ACM
14 years 10 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
SEUS
2008
IEEE
14 years 5 months ago
M-Geocast: Robust and Energy-Efficient Geometric Routing for Mobile Sensor Networks
In this paper we investigate a practical routing solution for a new class of wireless sensor networks where any node can be mobile anytime. Assuming GPS-enabled sensor nodes we pro...
Lynn Choi, Jae Kyun Jung, Byong-Ha Cho, Hyohyun Ch...
CAL
2008
13 years 11 months ago
Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks
Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase thr...
Rohit Sunkam Ramanujam, Bill Lin