Design of a multicast routing algorithm

摘要

Multicast communication can support wide range of applications such as digital video distribution. In multicast communication, routing paths are established in terms of minimizing the total cost of the multicast tree or minimizing the distances of each connection from source to the destinations. In this paper, we are also concerned about the number of copies in one switching fabric and propose a new algorithm for multicast routing which: (1) it avoids concentration of copying at a specific exchange node and (2) it ensures the optimal path for longest connections among destinations. Time complexity and space complexity of the algorithm are discussed.