Sciweavers

108 search results - page 2 / 22
» Key-based consistency and availability in structured overlay...
Sort
View
INFOCOM
2003
IEEE
13 years 10 months ago
Turning Heterogeneity into an Advantage in Overlay Routing
Abstract— Distributed hash table (DHT)-based overlay networks, represented by Pastry, CAN, and Chord, offer an administration-free and fault-tolerant application-level overlay ne...
Zhichen Xu, Mallik Mahalingam, Magnus Karlsson
IPTPS
2003
Springer
13 years 10 months ago
Structured Peer-to-Peer Overlays Need Application-Driven Benchmarks
Considerable research effort has recently been devoted to the design of structured peer-to-peer overlays, a term we use to encompass Content-Addressable Networks (CANs), Distribut...
Sean C. Rhea, Timothy Roscoe, John Kubiatowicz
SEMWEB
2004
Springer
13 years 10 months ago
GridVine: Building Internet-Scale Semantic Overlay Networks
Abstract. This paper addresses the problem of building scalable semantic overlay networks. Our approach follows the principle of data independence by separating a logical layer, th...
Karl Aberer, Philippe Cudré-Mauroux, Manfre...
CN
2010
181views more  CN 2010»
13 years 5 months ago
Building a collaborative peer-to-peer wiki system on a structured overlay
The ever growing request for digital information raises the need for content distribution architectures providing high storage capacity, data availability and good performance. Wh...
Gérald Oster, Rubén Mondéjar,...
LCN
2005
IEEE
13 years 10 months ago
Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays
Algorithms by which peers join and leave structured overlay networks can be classified as passive or active. Passive topology maintenance relies on periodic background repair of n...
John Risson, Ken Robinson, Tim Moors