1578 search results - page 72 / 316 » Direct Routing: Algorithms and Complexity |
119
Voted
ACSAC
2007
IEEE
15 years 9 months ago
2007
IEEE
In many networks, such as mobile ad-hoc networks and friend-to-friend overlay networks, direct communication between nodes is limited to specific neighbors. Often these networks ...
120
Voted
NETWORKING
2007
15 years 4 months ago
2007
We propose a novel routing framework called PWave that supports multi-source multi-sink anycast routing for wireless sensor networks. A distributed and scalable potential field es...
140
Voted
ISCA
2005
IEEE
15 years 8 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
103
Voted
DAC
2003
ACM
16 years 3 months ago
2003
ACM
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
115
Voted
GLOBECOM
2010
IEEE
15 years 21 days ago
2010
IEEE
Multi-path routing is effective to enhance network availability, by selecting multiple failure-independent paths for reaching one destination in the hope to survive individual pat...