Sciweavers

346 search results - page 19 / 70
» Routing networks for distributed hash tables
Sort
View
IPTPS
2005
Springer
14 years 1 months ago
A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn
We present a dynamic distributed hash table where peers may join and leave at any time. Our system tolerates a powerful adversary which has complete visibility of the entire state ...
Fabian Kuhn, Stefan Schmid, Roger Wattenhofer
EUROPAR
2004
Springer
14 years 27 days ago
Improving the Scalability of Logarithmic-Degree DHT-Based Peer-to-Peer Networks
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...
Bruno Carton, Valentin Mesaros
IPTPS
2004
Springer
14 years 26 days ago
On the Cost of Participating in a Peer-to-Peer Network
In this paper, we model the cost incurred by each peer participating in a peer-to-peer network. Such a cost model allows to gauge potential disincentives for peers to collaborate,...
Nicolas Christin, John Chuang
IPSN
2007
Springer
14 years 1 months ago
Beacon location service: a location service for point-to-point routing in wireless sensor networks
In this paper we present Beacon Location Service (BLS): a location service for beacon-based routing algorithms like Beacon Vector Routing (BVR) [8] and S4 [19] . The role of a loc...
Jorge Ortiz, Chris R. Baker, Daekyeong Moon, Rodri...
WDAG
2009
Springer
114views Algorithms» more  WDAG 2009»
14 years 2 months ago
Virtual Ring Routing Trends
Virtual Ring Routing (VRR) schemes were introduced in the context of wireless ad hoc networks and Internet anycast overlays. They build a network-routing layer using ideas from dis...
Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renat...