Sciweavers

456 search results - page 64 / 92
» On Routing in Distributed Hash Tables
Sort
View
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
15 years 6 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
INFOCOM
2009
IEEE
15 years 6 months ago
Scalable Routing Via Greedy Embedding
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
Cédric Westphal, Guanhong Pei
ICCS
2009
Springer
15 years 6 months ago
Improving the Scalability of SimGrid Using Dynamic Routing
Research into large-scale distributed systems often relies on the use of simulation frameworks in order to bypass the disadvantages of performing experiments on real testbeds. SimG...
Silas De Munck, Kurt Vanmechelen, Jan Broeckhove
ICCNMC
2005
Springer
15 years 5 months ago
Curve-Based Greedy Routing Algorithm for Sensor Networks
Routing packets along a specified curve is a new approach to forwarding packets in large-scale dense sensor networks. Forwarding packets along trajectories can be very effective in...
Jin Zhang, Yaping Lin, Mu Lin, Ping Li, Si-wang Zh...
JUCS
2010
125views more  JUCS 2010»
14 years 10 months ago
Position-based Routing Protocol for Low Power Wireless Sensor Networks
: We present a table-less position based routing scheme for low power data centric wireless sensor networks. Our proposed scheme is localized, uses greedy forwarding approach, and ...
Sajjad Ahmad Madani, Daniel Weber, Stefan Mahlknec...