Ítem
|
Pinto, Diego
Barán, Benjamín Fabregat Gesa, Ramon |
|
| This work presents a new multiobjective algorithm based on ant colonies, which is used in the construction of the multicast tree for data transmission in a computer network. The proposed algorithm simultaneously optimizes cost of the multicast tree, average delay and maximum end-to-end delay. In this way, a set of optimal solutions, know as Pareto set, is calculated in only one run of the algorithm, without a priori restrictions. The proposed algorithm was inspired in a Multi-objective Ant Colony System (MOACS). Experimental results prove the proposed algorithm outperforms a recently published Multiobjective Multicast Algorithm (MMA), specially designed for solving the multicast routing problem | |
| http://hdl.handle.net/2072/218104 | |
| eng | |
| Associació Catalana d’Intel·ligència Artificial | |
| Tots els drets reservats | |
|
Algorismes
Algorithms Telecomunicació -- Tràfic Telecommunication -- Traffic Protocols de xarxes d’ordinadors Computer network protocols Optimització matemàtica Mathematical optimization |
|
| Multi-Objective Multicast Routing based on Ant Colony Optimization | |
| info:eu-repo/semantics/article | |
| Recercat |
