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.

翻译：Parsley 是一种基于群组的弹性分布式哈希表，它结合了抢占式节点重定位技术与动态数据分片机制，以增强系统的鲁棒性与负载均衡能力。除了通过最小与最大阈值定义的群组规模硬性限制外，Parsley 还引入了两个软性限制，用以定义维持稳定群组规模的目标区间。这些软性边界允许覆盖网络采取主动措施，防止违反硬性限制，从而在节点频繁加入/退出的动态环境下提升系统稳定性。本文深入分析了 Parsley 评估中所采用参数值的设计依据。与相关系统仅规定群组规模限制而未提供理由的做法不同，我们通过系统的覆盖网络特性研究来理解这些参数对性能与可扩展性的影响。该研究考察了拓扑操作、大规模群组的行为以及观察到的整体权衡关系，为所选配置值提供了基于实证的解释。