An efficient heuristic algorithm for constructing delay- and degree-bounded application-level multicast tree

  • Authors:
  • Feng Liu;Xicheng Lu;Yuxing Peng

  • Affiliations:
  • School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China

  • Venue:
  • GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we first investigate the problem of finding a delay- and degree-bounded maximum sum of nodes ALMT. We proved the problem is NP-hard, and testify its relationship with the well-studied degree-bounded minimum maximum-delay ALMT problem. We proposed a greedy algorithm FindOverlayTree with SRPF heuristic. The simulation results show that our design solution is a valid and cost-effective approach where compared to other three modified classic heuristics under several performance metrics.