There have been many heuristic algorithms determining multicast connection trees proposed over the past few years. However, the proposed methods are only approximations of the most favourable solutions and thus, a necessity of 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 constrain algorithm that would be more effective than those presented in relevant literature so far.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.