A Partition-Based Broadcast Algorithm over DHT for Large-Scale Computing Infrastructures

  • Authors:
  • Kun Huang;Dafang Zhang

  • Affiliations:
  • School of Computer and Communication,;School of Software, Hunan University, Changsha, P.R. China 410082

  • Venue:
  • GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Scalable and efficient broadcast is essential to the large-scale computing infrastructures such as PlanetLab and Grids. Existing DHT-based broadcast algorithms suffer from the limitations of scalability and load balancing, incurring high-overhead construction and maintenance of a distributed broadcast tree (DBT). This paper proposes a partition-based broadcast algorithm over DHT for the large-scale computing infrastructures, where each node hierarchically partitions its identifier space into two subspaces and selects the agent nodes in the subspaces as its children in a top-down approach. Our theoretical analysis and experimental results demonstrate that the partition-based broadcast algorithm can construct and maintain a balanced DBT with low overhead, where the branching factors of each node are at most two, and the tree height is O (log n ) in a Chord of n nodes, without any extra storage space for each node and explicit maintenance overhead for the parent-child membership in the DBT.