A multicast routing algorithm based on tabu search

MaRDI QIDQ3170804zbMATH OpenFDO

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

Publication date 29 September 2011

zbMATH Keywords

delay constraintdelay variation constrainttabu search

Mathematics Subject Classification ID

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

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

Cited in

(11)

• Neural and delay based heuristics for the Steiner problem in networks
• A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a Steiner topology
• Applying tabu search to backup path planning for multicast networks
• Multicast routing based on the simulated annealing
• scientific article; zbMATH DE number 2088470 (Why is no real title available?)
• An Efficient Multicast Tree with Delay and Delay Variation Constraints
• A multicast routing algorithm based on searching in directed graph
• scientific article; zbMATH DE number 2166697 (Why is no real title available?)
• A hybrid metaheuristic for routing on multicast networks
• Computational Science – ICCS 2005
• Computational Science - ICCS 2004

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)