The article investigates representative heuristic algorithms finding the cheapest spanning trees between a source node and the group of destination nodes (multicast connections). Reliable comparison and analysis of the efficiency of algorithms require the usage of network structures reflecting real Internet topology. This article also presents method for generation that topologies. The key part of the article includes the efficiency analysis and the influence of the parameters of a given structure (network model generated by BRITE tool) upon the efficiency of the algorithms under scrutiny.
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ć.