A multicast routing algorithm based on tabu search

zbMATH Open1240.68002MaRDI QIDQ3170804FDOQ3170804

Authors: Lin Huang, Junfeng Lai, Jian Hou, Xuewu Du 

Publication date: 29 September 2011

Recommendations

• scientific article; zbMATH DE number 2166697
• Neural and delay based heuristics for the Steiner problem in networks
• An Efficient Multicast Tree with Delay and Delay Variation Constraints
• A multicast routing algorithm based on searching in directed graph
• An algorithm of low-cost multicast based on delay and delay variation constraint

zbMATH Keywords

delay constrainttabu searchdelay variation constraint

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Network design and communication in computer systems (68M10)

Cited In (10)

• Title not available (Why is that?)
• A hybrid metaheuristic for routing on multicast networks
• Applying tabu search to backup path planning for multicast networks
• A multicast routing algorithm based on searching in directed graph
• A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology
• Title not available (Why is that?)
• Computational Science – ICCS 2005
• Computational Science - ICCS 2004
• Multicast routing based on the simulated annealing
• An Efficient Multicast Tree with Delay and Delay Variation Constraints

This page was built for publication: A multicast routing algorithm based on tabu search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3170804)