A note on distributed multicast routing in point-to-point networks

DOI10.1016/S0305-0548(00)00029-0zbMath1017.90090OpenAlexW1981026530MaRDI QIDQ5945321

Roman Novak, Gorazd Kandus, Jože Rugelj

Publication date: 2001

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(00)00029-0

zbMATH Keywords

Steiner tree problemdistributed algorithmmulticast communicationmulticast connection set-upmulticast routingpoint-to-point networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (9)

Directed Steiner trees with diffusion costs ⋮ A practical greedy approximation for the directed Steiner tree problem ⋮ A Practical Greedy Approximation for the Directed Steiner Tree Problem ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes ⋮ Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing ⋮ A distributed dual ascent algorithm for Steiner problems in multicast routing ⋮ Applying tabu search to backup path planning for multicast networks ⋮ DELAY GUARANTEE BACKUP ROUTE PLANNING FOR MULTICAST NETWORKS

Cites Work

• Unnamed Item
• Steiner's problem in graphs: Heuristic methods
• Worst-case performance of some heuristics for Steiner's problem in directed graphs
• Distributed multicast routing in point-to-point networks
• Distributed Multi-Destination Routing: The Constraints of Local Information
• Steiner problem in networks: A survey
• Reducibility among Combinatorial Problems
• Steiner tree problems

This page was built for publication: A note on distributed multicast routing in point-to-point networks