Table of Contents
Fetching ...

Parsley's Group Size Study

João A. Silva, Hervé Paulino, João M. Lourenço

TL;DR

Parsley tackles the stability of a resilient group-based DHT by introducing preemptive peer relocation (PPR) and dynamic data sharding. Through a systematic overlay characterization study, it justifies the four group-size parameters $l$, $h$, $l'$, and $h'$ and evaluates their effects on topology operations and data transfers under varied churn using PeerSim. The findings indicate that a modest soft-to-hard gap ($\Delta$) and a small group size range (around $l$ to $h$ with $l=4$–$11$) offer the best balance between reducing merges and limiting relocation overhead, while larger groups tolerate churn but incur higher maintenance and state costs. The work provides grounded parameter choices and actionable insights into the trade-offs between stability, scalability, and overhead for churn-heavy DHT overlays.

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.

Parsley's Group Size Study

TL;DR

Parsley tackles the stability of a resilient group-based DHT by introducing preemptive peer relocation (PPR) and dynamic data sharding. Through a systematic overlay characterization study, it justifies the four group-size parameters , , , and and evaluates their effects on topology operations and data transfers under varied churn using PeerSim. The findings indicate that a modest soft-to-hard gap () and a small group size range (around to with ) offer the best balance between reducing merges and limiting relocation overhead, while larger groups tolerate churn but incur higher maintenance and state costs. The work provides grounded parameter choices and actionable insights into the trade-offs between stability, scalability, and overhead for churn-heavy DHT overlays.

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.
Paper Structure (11 sections, 32 figures, 2 tables)

This paper contains 11 sections, 32 figures, 2 tables.

Figures (32)

  • Figure 1: Exit-only topology operations with group size XS (4--8) in Parsley.
  • Figure 2: Exit-only data transfers with group size XS (4--8) in Parsley.
  • Figure 3: Enter-exit topology operations with group size XS (4--8) in Parsley.
  • Figure 4: Enter-exit data transfers with group size XS (4--8) in Parsley.
  • Figure 5: Exit-only topology operations with group size S (4--11) in Parsley.
  • ...and 27 more figures