A multicast routing algorithm based on searching in directed graph

DOI10.1016/J.AMC.2011.09.017MaRDI QIDQ426417zbMATH OpenOpenAlexFDO

Authors Yuhua Xu, Jing Gong, Zhiguang Ren, Zhixin Sun

Publication date 11 June 2012

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2011.09.017

zbMATH Keywords

directed graphsimulated annealing algorithmant algorithmdelay and delay variation boundedmulticast routing algorithm

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A multicast routing algorithm based on tabu search
• scientific article; zbMATH DE number 5257271
• An algorithm of low-cost multicast based on delay and delay variation constraint
• A distributed multicast routing algorithm for real-time applications in wide area networks
• scientific article; zbMATH DE number 2242700

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• A note on two problems in connexion with graphs
• Optimization by simulated annealing

Cited in

(4)

• A multicast routing algorithm based on tabu search
• Globally hyperbolic moment model of arbitrary order for one-dimensional special relativistic Boltzmann equation
• scientific article; zbMATH DE number 1950512 (Why is no real title available?)
• Oriented multicast routing algorithm applied to network-level agent search

This page was built for publication: A multicast routing algorithm based on searching in directed graph

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