Heuristic Algorithm for Multicast Connections in Packet Networks

摘要

There have been many heuristic algorithms determining multicast connection trees proposed over the past few years. However, the proposed methods are only approximations of most favourable solutions and thus, a necessity for finding a better and more suitable algorithm is still topical and up-to-date. The present article aims at presenting the attempts of finding a two-criteria algorithm that would be more effective than those presented in relevant literature so far.