m (Scipediacontent moved page Draft Content 834174704 to Pinto Baran 2006a) |
|||
| Line 2: | Line 2: | ||
== Abstract == | == Abstract == | ||
| − | This work presents a multiobjective algorithm for multicast traffic engineering. The proposed algorithm is a new version of MultiObjective Ant Colony System (MOACS), based on Ant Colony Optimization (ACO). The proposed MOACS simultaneously optimizes the maximum link utilization, the cost of the multicast tree, the averages delay and the maximum | + | This work presents a multiobjective algorithm for multicast traffic engineering. The proposed algorithm is a new version of MultiObjective Ant Colony System (MOACS), based on Ant Colony Optimization (ACO). The proposed MOACS simultaneously optimizes the maximum link utilization, the cost of the multicast tree, the averages delay and the maximum end-to-end delay. In this way, a set of optimal solutions, known as Pareto set is calculated in only one run of the algorithm, without a priori restrictions. Experimental results obtained with the proposed MOACS were compared to a recently published Multiobjective Multicast Algorithm (MMA), showing a promising performance advantage for multicast traffic engineering. |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| Line 17: | Line 12: | ||
* [https://link.springer.com/content/pdf/10.1007%2F978-0-387-34827-8_9.pdf https://link.springer.com/content/pdf/10.1007%2F978-0-387-34827-8_9.pdf] | * [https://link.springer.com/content/pdf/10.1007%2F978-0-387-34827-8_9.pdf https://link.springer.com/content/pdf/10.1007%2F978-0-387-34827-8_9.pdf] | ||
| + | |||
| + | * [http://www.springerlink.com/index/pdf/10.1007/978-0-387-34827-8_9 http://www.springerlink.com/index/pdf/10.1007/978-0-387-34827-8_9], | ||
| + | : [http://dx.doi.org/10.1007/978-0-387-34827-8_9 http://dx.doi.org/10.1007/978-0-387-34827-8_9] | ||
| + | |||
| + | * [https://link.springer.com/chapter/10.1007/978-0-387-34827-8_9 https://link.springer.com/chapter/10.1007/978-0-387-34827-8_9], | ||
| + | : [https://dblp.uni-trier.de/db/conf/ifip6-2/ifip6-2-2006.html#PintoB06 https://dblp.uni-trier.de/db/conf/ifip6-2/ifip6-2-2006.html#PintoB06], | ||
| + | : [https://rd.springer.com/chapter/10.1007/978-0-387-34827-8_9 https://rd.springer.com/chapter/10.1007/978-0-387-34827-8_9], | ||
| + | : [https://academic.microsoft.com/#/detail/1862226204 https://academic.microsoft.com/#/detail/1862226204] | ||
Latest revision as of 16:58, 21 January 2021
Abstract
This work presents a multiobjective algorithm for multicast traffic engineering. The proposed algorithm is a new version of MultiObjective Ant Colony System (MOACS), based on Ant Colony Optimization (ACO). The proposed MOACS simultaneously optimizes the maximum link utilization, the cost of the multicast tree, the averages delay and the maximum end-to-end delay. In this way, a set of optimal solutions, known as Pareto set is calculated in only one run of the algorithm, without a priori restrictions. Experimental results obtained with the proposed MOACS were compared to a recently published Multiobjective Multicast Algorithm (MMA), showing a promising performance advantage for multicast traffic engineering.
Original document
The different versions of the original document can be found in:
Document information
Published on 01/01/2006
Volume 2007, 2006
DOI: 10.1007/978-0-387-34827-8_9
Licence: CC BY-NC-SA license
Share this document
Keywords
claim authorship
Are you one of the authors of this document?