Cooling schedules for optimal annealing
Mathematics of Operations Research
New performance-driven FPGA routing algorithms
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
An efficient multicast approach in an ATM switching network for multimedia applications
Journal of Network and Computer Applications
A new approximation algorithm for the Steiner tree problem with performance ratio 5/3
Journal of Algorithms
A hybrid genetic algorithm for the point to multipoint routing problem with single split paths
Proceedings of the 2001 ACM symposium on Applied computing
Theoretical Computer Science
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Efficient Internet Multicast Routing Using Anycast Path Selection
Journal of Network and Systems Management
SIAM Review
QoS Path Monitoring for Multicast Networks
Journal of Network and Systems Management
The Role Multimedia of Multicasting in ManagingInteractive Distance Learning Systems
Journal of Network and Systems Management
Fast parallel heuristics for the job shop scheduling problem
Computers and Operations Research
A performance study of multicast routing algorithms for ATM networks
LCN '96 Proceedings of the 21st Annual IEEE Conference on Local Computer Networks
A framework for multicast video streaming over IP networks
Journal of Network and Computer Applications
TSDLMRA: an efficient multicast routing algorithm based on tabu search
Journal of Network and Computer Applications
Applying tabu search to backup path planning for multicast networks
Computers and Operations Research
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning
Evolutionary Computation
Genetic local search for multicast routing
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Research challenges in QoS routing
Computer Communications
OMNI: An efficient overlay multicast infrastructure for real-time applications
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
A genetic algorithm for the multiple destination routing problems
IEEE Transactions on Evolutionary Computation
Short Survey: A survey of application level multicast techniques
Computer Communications
Multipoint communication: a survey of protocols, functions, and mechanisms
IEEE Journal on Selected Areas in Communications
Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
MOEAQ: A QoS-Aware Multicast Routing algorithm for MANET
Expert Systems with Applications: An International Journal
Hi-index | 0.25 |
In recent years, methods based on local search have been utilized in off-line algorithms for multicast routing in communication networks. In multicast routing, several point-to-multipoint requests have to be scheduled under constraints associated with each link of the underlying network such as capacity and transmission costs. We propose a landscape analysis technique to solve this problem, where each particular request is routed by a Steiner tree heuristic. The landscape analysis employs simulated annealing with a logarithmic cooling schedule, which has been proved to be an appropriate tool to tackle hard problems from Combinatorial Optimisation and Computational Biology. We present results from computational experiments performed on three instances from the OR library. Emphasis is placed on algorithmic aspects of off-line routing, in particular, on approximations of optimal parameter settings, rather than on implementations of fast online network protocols. Furthermore, we investigate the impact of capacity noise on parameter settings and we perform a comparison to genetic algorithms based upon PMX crossover.