Multicast routing algorithm for nodal load balancing

The authors propose two multicast routing algorithms which distribute copy operation of packets over all nodes along the multicast path: a link-added type algorithm and a loop-constructed type algorithm. Both algorithms, at first, derive an approximate solution for minimum cast path, and then improve the solution to prevent concentration of packet copy operation at one switching node at a little sacrifice of total cost along the path. Computer simulation results show that too much copy operation per node can be avoided by these algorithms. Compared to the minimum cost solution of the tree-shaped multicast path, the solution of the proposed algorithms makes the average distance connecting a source-destination pair longer, but the sacrifice of total cost is verb small. These algorithms can be applied not only to packet networks but also asynchronous transfer mode (ATM) networks