Least cost multicast loop algorithm for local computer network

  • Authors:

  • Yong-Jin Lee

  • Affiliations:

  • Department of Technology Education, Korea National University of Education

  • Venue:
  • HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Minimal cost loop problem consists of finding a set of loops to minimize the total link cost of end-user nodes while satisfying the traffic constraints. This paper presents a heuristic algorithm using trade-off criterion based on the node exchange and node transfer among loops by the initial algorithms. Simulation results show that the proposed algorithm produces about ten percent better solution than previous algorithms in short execution time. Our algorithm can be applied to find multicast loops in local computer network.