Sciweavers

323 search results - page 57 / 65
» Range-capable Distributed Hash Tables
Sort
View
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 8 months ago
Unmanaged Internet Protocol: Taming the Edge Network Management Crisis
Though appropriate for core Internet infrastructure, the Internet Protocol is unsuited to routing within and between emerging ad-hoc edge networks due to its dependence on hierarc...
Bryan Ford
IPL
2008
72views more  IPL 2008»
13 years 8 months ago
Reducing communication costs in robust peer-to-peer networks
Several recent research results describe how to design Distributed Hash Tables (DHTs) that are robust to adversarial attack via Byzantine faults. Unfortunately, all of these resul...
Jared Saia, Maxwell Young
WCW
2004
Springer
14 years 1 months ago
ShortCuts: Using Soft State to Improve DHT Routing
Distributed hash tables are increasingly being proposed as the core substrate for content delivery applications in the Internet, such as cooperative Web caches, Web index and sear...
Kiran Tati, Geoffrey M. Voelker
SPAA
2006
ACM
14 years 2 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
INFOCOM
2003
IEEE
14 years 1 months ago
Associative Search in Peer to Peer Networks: Harnessing Latent Semantics
— The success of a P2P file-sharing network highly depends on the scalability and versatility of its search mechanism. Two particularly desirable search features are scope (abil...
Edith Cohen, Amos Fiat, Haim Kaplan