Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing
Authors:
- R. ForsatiRFR. Forsati
- A.T. HaghighatAHA.T. Haghighat
- M. MahdaviMMM. Mahdavi
- 1 June 2008
- journal article
- Published by Elsevier in Computer Communications
- Vol. 31 (10) , 2505-2519
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Edge sets: an effective evolutionary coding of spanning treesIEEE Transactions on Evolutionary Computation, 2003
- Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithmComputer Communications, 2001
- A New Heuristic Optimization Algorithm: Harmony SearchSIMULATION, 2001
- An orthogonal genetic algorithm for multimedia multicast routingIEEE Transactions on Evolutionary Computation, 1999
- A rearrangeable algorithm for the construction of delay-constrained dynamic multicast treesIEEE/ACM Transactions on Networking, 1999
- Multicast routing with end-to-end delay and delay variation constraintsIEEE Journal on Selected Areas in Communications, 1997
- Evaluation of multicast routing algorithms for real-time communication on high-speed networksIEEE Journal on Selected Areas in Communications, 1997
- Quality-of-service routing for supporting multimedia applicationsIEEE Journal on Selected Areas in Communications, 1996
- Multicast routing for multimedia communicationIEEE/ACM Transactions on Networking, 1993
- Steiner's problem in graphs and its implicationsNetworks, 1971