Sciweavers

17 search results - page 2 / 4
» Evaluation of Unstructured Overlay Maintenance Protocols und...
Sort
View
INFOCOM
2005
IEEE
13 years 11 months ago
A performance vs. cost framework for evaluating DHT design tradeoffs under churn
Abstract— Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. The...
Jinyang Li, Jeremy Stribling, Robert Morris, M. Fr...
IPTPS
2004
Springer
13 years 10 months ago
Comparing the Performance of Distributed Hash Tables Under Churn
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn—changes in membership—in order to maintain its ability to route lookups efficie...
Jinyang Li, Jeremy Stribling, Thomer M. Gil, Rober...
ICNP
2005
IEEE
13 years 11 months ago
Z-Ring: Fast Prefix Routing via a Low Maintenance Membership Protocol
In this paper, we introduce Z-Ring, a fast prefix routing protocol for peer-to-peer overlay networks. Z-Ring incorporates cost-efficient membership protocol to achieve fast routin...
Qiao Lian, Wei Chen, Zheng Zhang, Shaomei Wu, Ben ...
P2P
2005
IEEE
106views Communications» more  P2P 2005»
13 years 11 months ago
Chord on Demand
Structured peer-to-peer overlay networks are now an established paradigm for implementing a wide range of distributed services. While the problem of maintaining these networks in ...
Alberto Montresor, Márk Jelasity, Özal...
P2P
2006
IEEE
101views Communications» more  P2P 2006»
13 years 11 months ago
Reinforcement Learning for Query-Oriented Routing Indices in Unstructured Peer-to-Peer Networks
The idea of building query-oriented routing indices has changed the way of improving routing efficiency from the basis as it can learn the content distribution during the query r...
Cong Shi, Shicong Meng, Yuanjie Liu, Dingyi Han, Y...