Sciweavers

360 search results - page 37 / 72
» Distributed Network Querying with Bounded Approximate Cachin...
Sort
View
INFOCOM
2007
IEEE
15 years 6 months ago
Routing, Anycast, and Multicast for Mesh and Sensor Networks
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
Roland Flury, Roger Wattenhofer
HOTOS
2007
IEEE
15 years 3 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
IPPS
2010
IEEE
14 years 9 months ago
Broadcasting on large scale heterogeneous platforms under the bounded multi-port model
We consider the problem of broadcasting a large message in a large scale distributed platform. The message must be sent from a source node, with the help of the receiving peers whi...
Olivier Beaumont, Lionel Eyraud-Dubois, Shailesh K...
DC
2010
14 years 11 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
CONEXT
2009
ACM
15 years 25 days ago
The age of impatience: optimal replication schemes for opportunistic networks
: We study mobile P2P content dissemination schemes which leverage the local dedicated caches provided by hand-held devices (e.g., smart-phones, PDAs) and opportunistic contacts be...
Joshua Reich, Augustin Chaintreau