Performance And Execution Time Evaluation For Multicast Routing Algorithms
Dan Mancas, Ileana Hamburg, Nicolae-Iulian Enescu · 2001
In this paper, an evaluation of the network routing algorithms is made. Problems that arise in routing are treated, each presented in different scenarios in order to obtain a result in comparing different topologies. The comparison analysis is pursuing obtaining a result over the performance of the network. In order to measure performance, the costs of a network and the delays are aimed. After that, the topology effect is presented. In matter of performance, topology and blocking problems are strongly related. So an analysis of the blocking probability is also presented. As conclusions, solutions for the presented scenarios and also for other important scenarios are given. In all these algorithms the time problem was not yet consider until now, so the average execution time is finally analyzed.