Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
An efficient delay-constrained multicast routing algorithm
Journal of High Speed Networks
A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees
IEEE/ACM Transactions on Networking (TON)
A hybrid genetic algorithm for the point to multipoint routing problem with single split paths
Proceedings of the 2001 ACM symposium on Applied computing
Tabu Search
Genetic Algorithms
A Genetic Algorithm for Survivable Network Design
Proceedings of the 5th International Conference on Genetic Algorithms
Encoding Graphs for Genetic Algorithms: An Investigation Using the Minimum Spanning Tree Problem
AI '93/AI '94 Selected papers from the AI'93 and AI'94 Workshops on Evolutionary Computation, Process in Evolutionary Computation
QDMR: An Efficient QoS Dependent Multicast Routing Algorithm
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
A source-based algorithm for delay-constrained minimum-cost multicasting
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
TSDLMRA: an efficient multicast routing algorithm based on tabu search
Journal of Network and Computer Applications
Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem
Knowledge-Based Systems
Landscape analysis for multicast routing
Computer Communications
A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm
Expert Systems with Applications: An International Journal
Generating random spanning trees
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Harmony search for generalized orienteering problem: best touring in China
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
An orthogonal genetic algorithm for multimedia multicast routing
IEEE Transactions on Evolutionary Computation
Edge sets: an effective evolutionary coding of spanning trees
IEEE Transactions on Evolutionary Computation
GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm
Computer Communications
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
Multicast routing with end-to-end delay and delay variation constraints
IEEE Journal on Selected Areas in Communications
A harmony search algorithm with ensemble of parameter sets
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A novel global harmony search algorithm for task assignment problem
Journal of Systems and Software
Structural and Multidisciplinary Optimization
Engineering Applications of Artificial Intelligence
Generalized reconstruction algorithm for compressed sensing
Computers and Electrical Engineering
Review: Review of multicast routing mechanisms in mobile ad hoc networks
Journal of Network and Computer Applications
Computers and Operations Research
A novel grouping harmony search algorithm for the multiple-type access node location problem
Expert Systems with Applications: An International Journal
Circle Detection by Harmony Search Optimization
Journal of Intelligent and Robotic Systems
A hybrid harmony search algorithm for the spread spectrum radar polyphase codes design problem
Expert Systems with Applications: An International Journal
A multiobjective hybrid evolutionary algorithm for clustering in social networks
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Expert Systems with Applications: An International Journal
Hybrid harmony search and artificial bee colony algorithm for global optimization problems
Computers & Mathematics with Applications
Expert Systems with Applications: An International Journal
Engineering Applications of Artificial Intelligence
International Journal of Applied Metaheuristic Computing
Engineering Applications of Artificial Intelligence
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
A novel efficient algorithm for mobile robot localization
Robotics and Autonomous Systems
Hi-index | 0.25 |
The advent of various real-time multimedia applications in high-speed networks creates a need for quality of service (QoS) based multicast routing. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. The QoS based multicast routing problem is a known NP-complete problem that depends on (1) bounded end-to-end delay and link bandwidth along the paths from the source to each destination, and (2) minimum cost of the multicast tree. In this paper, we presents novel centralized algorithms to solve the bandwidth-delay-constrained least-cost multicast routing problem based on the harmony search (HS) algorithm. Our first algorithm uses modified Prufer number as Steiner tree representation that is called HSPR. Prufer number has poor locality and heritability in evolutionary search, so, we describe a new representation, node parent index (NPI) representation, for representing trees and describe harmony operations accord to this representation. Our second algorithm is based on NPI representation that is called HSNPI, an empirical study to determine the impacts of different parameters of the HSNPI algorithm on the solution quality and convergence behavior was performed. We evaluate the performance and efficiency of our proposed methods with a GA-based algorithm and a modified version of the bounded shortest multicast algorithm (BSMA). Simulation results on randomly generated networks and real topologies indicate that HSNPI algorithm that we proposed has overcome other three algorithms on a variety of random generated networks considering average tree cost.