Evaluating performance of different multicast routing algorithms

  • Authors:
  • Dan Mancas;Ecaterina - Irina Manole;Nicolae Enescu

  • Affiliations:
  • Computer and Communication Engineering Department, Faculty of Automation, Computers and Electronics, Craiova, Dolj, Romania;Computer and Communication Engineering Department, Faculty of Automation, Computers and Electronics, Craiova, Dolj, Romania;Computer and Communication Engineering Department, Faculty of Automation, Computers and Electronics, Craiova, Dolj, Romania

  • Venue:
  • AIC'08 Proceedings of the 8th conference on Applied informatics and communications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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. As conclusions, solutions for the presented scenarios and also for other important scenarios are given.