Parsley's Group Size Study

2025-10-24

AI Summary

Parsley, a group-based distributed hash table (DHT), suffers from limited stability and scalability in dynamic environments due to the absence of theoretical foundations for its group size parameters—specifically, the hard and soft limits. This work presents the first systematic modeling and analysis of how group size impacts overlay network performance. We propose a dual-bound mechanism comprising a soft target interval and a hard constraint, integrated with preemptive node relocation, dynamic data sharding, and formalized topology operation modeling. Extensive large-scale simulations validate the efficacy of our approach. Compared to state-of-the-art methods, our design significantly reduces group split/merge frequency under high churn, while improving load balancing and robustness. The framework provides both a theoretically grounded parameter configuration methodology and empirically validated guidelines—directly applicable to Parsley and other group-based DHTs.

Technology Category

• Search and Optimization: Distributed Search
• Data Mining & Knowledge Management: Scalability, Parallel & Distributed Systems
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization

Application Category

• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs
• Web Mining and Content Analysis: Models for Web evolution
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems

Abstract

Parsley is a resilient group-based Distributed Hash Table that incorporates a preemptive peer relocation technique and a dynamic data sharding mechanism to enhance robustness and balance. In addition to the hard limits on group size, defined by minimum and maximum thresholds, Parsley introduces two soft limits that define a target interval for maintaining stable group sizes. These soft boundaries allow the overlay to take proactive measures to prevent violations of the hard limits, improving system stability under churn. This work provides an in-depth analysis of the rationale behind the parameter values adopted for Parsley's evaluation. Unlike related systems, which specify group size limits without justification, we conduct a systematic overlay characterization study to understand the effects of these parameters on performance and scalability. The study examines topology operations, the behavior of large groups, and the overall trade-offs observed, offering a grounded explanation for the chosen configuration values.

Problem

• Optimizing group size parameters for resilient distributed hash tables
• Analyzing soft/hard group limits to enhance system stability under churn
• Systematically characterizing parameter effects on performance and scalability

Innovation

• Preemptive peer relocation technique enhances robustness
• Dynamic data sharding mechanism improves load balancing
• Soft group size limits prevent hard boundary violations