Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Measuring and analyzing the characteristics of Napster and Gnutella hosts
Multimedia Systems
One hop lookups for peer-to-peer overlays
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Failure recovery for structured P2P networks: protocol design and performance evaluation
Proceedings of the joint international conference on Measurement and modeling of computer systems
PeerStore: Better Performance by Relaxing in Peer-to-Peer Backup
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Latency Model of a Distributed Hash Table with Big Routing Table
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Availability, usage, and deployment characteristics of the domain name system
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Low traffic overlay networks with large routing tables
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Implementing declarative overlays
Proceedings of the twentieth ACM symposium on Operating systems principles
A churn and mobility resistant approach for DHTs
MobiShare '06 Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking
Failure recovery for structured p2p networks: protocol design and performance under churn
Computer Networks: The International Journal of Computer and Telecommunications Networking
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Debunking some myths about structured and unstructured overlays
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Ferry: A P2P-Based Architecture for Content-Based Publish/Subscribe Services
IEEE Transactions on Parallel and Distributed Systems
DGRID: a DHT-based resource indexing and discovery scheme for computational grids
ACSW '07 Proceedings of the fifth Australasian symposium on ACSW frontiers - Volume 68
Scalable blind search and broadcasting over Distributed Hash Tables
Computer Communications
Authentication in stealth distributed hash tables
Journal of Systems Architecture: the EUROMICRO Journal
Hi3: An efficient and secure networking architecture for mobile hosts
Computer Communications
A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Node isolation model and age-based neighbor selection in unstructured P2P networks
IEEE/ACM Transactions on Networking (TON)
An emulator for peer-to-peer distributed hash tables
Computer Communications
New routing update mechanisms of kademlia
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Performance evaluation of a Kademlia-based communication-oriented P2P system under churn
Computer Networks: The International Journal of Computer and Telecommunications Networking
Transactions for distributed wikis on structured overlays
DSOM'07 Proceedings of the Distributed systems: operations and management 18th IFIP/IEEE international conference on Managing virtualization of networks and services
Peer-to-peer single hop distributed hash tables
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A scalable algorithm to monitor chord-based P2P systems at runtime
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
An adaptive stabilization framework for distributed hash tables
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
D1HT: a distributed one hop hash table
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
In-degree dynamics of large-scale P2P systems
ACM SIGMETRICS Performance Evaluation Review
Super-peer-based coordinated service provision
Journal of Network and Computer Applications
Evaluation of p2p systems under different churn models: why we should bother
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
A Read-Only Distributed Hash Table
Journal of Grid Computing
Storing and locating mutable data in structured peer-to-peer overlay networks
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Survive under high churn in structured P2P systems: evaluation and strategy
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
A statistical theory of chord under churn
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
Semi-structured semantic overlay for information retrieval in self-organizing networks
Proceedings of the 21st international conference companion on World Wide Web
Self-adaptive approximate queries for large-scale information aggregation
International Journal of Web and Grid Services
P2P group management systems: A conceptual analysis
ACM Computing Surveys (CSUR)
Using the complementary nature of node joining and leaving to handle churn problem in P2P networks
Computers and Electrical Engineering
Peer-to-peer service provisioning in cloud computing environments
The Journal of Supercomputing
TAO: Facebook's distributed data store for the social graph
USENIX ATC'13 Proceedings of the 2013 USENIX conference on Annual Technical Conference
| Hi-index | 0.00 |
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 efficiently. This paper formulates a unified framework for evaluating cost and performance. Communication costs are combined into a single cost measure (bytes), and performance benefits are reduced to a single latency measure. This approach correctly accounts for background maintenance traffic and timeouts during lookup due to stale routing data, and also correctly leaves open the possibility of different preferences in the tradeoff of lookup time versus communication cost. Using the unified framework, this paper analyzes the effects of DHT parameters on the performance of four protocols under churn.