Sciweavers

1578 search results - page 72 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
ACSAC
2007
IEEE
14 years 3 months ago
Routing in the Dark: Pitch Black
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 ...
Nathan S. Evans, Chris GauthierDickey, Christian G...
NETWORKING
2007
13 years 10 months ago
PWave: A Multi-source Multi-sink Anycast Routing Framework for Wireless Sensor Networks
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...
Haiyang Liu, Zhi-Li Zhang, Jaideep Srivastava, Vic...
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
14 years 2 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
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...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
DAC
2003
ACM
14 years 9 months ago
Improved global routing through congestion estimation
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...
Raia Hadsell, Patrick H. Madden
GLOBECOM
2010
IEEE
13 years 6 months ago
Correlation-Resilient Path Selection in Multi-Path Routing
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...
Xin Zhang, Adrian Perrig