Sciweavers

445 search results - page 16 / 89
» Maximizable Routing Metrics
Sort
View
WEA
2009
Springer
103views Algorithms» more  WEA 2009»
14 years 2 months ago
Pareto Paths with SHARC
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
Daniel Delling, Dorothea Wagner
PERCOM
2005
ACM
14 years 7 months ago
When Does Opportunistic Routing Make Sense?
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
Adam Wolisz, Jan M. Rabaey, Rahul C. Shah, Sven Wi...
ICDCS
2006
IEEE
14 years 1 months ago
Routing in Networks with Low Doubling Dimension
This paper studies compact routing schemes for networks with low doubling dimension. Two variants are explored, name-independent routing and labeled routing. The key results obtai...
Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg,...
TELSYS
2002
73views more  TELSYS 2002»
13 years 7 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner
TVCG
2010
130views more  TVCG 2010»
13 years 5 months ago
Route Visualization Using Detail Lenses
—We present a method designed to address some limitations of typical route map displays of driving directions. The main goal of our system is to generate a printable version of a...
Pushpak Karnick, David Cline, Stefan Jeschke, Ansh...