Distributed multicast routing in point-to-point networks

DOI10.1016/S0305-0548(96)00074-3zbMath0882.90033OpenAlexW1965092553MaRDI QIDQ1362952

Sandi Klavžar, Jože Rugelj

Publication date: 10 March 1998

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(96)00074-3

zbMATH Keywords

simulationsourceroutinginsertion heuristicslarge point-to-point communication networksmultiple destinations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items (2)

A note on distributed multicast routing in point-to-point networks ⋮ A distributed dual ascent algorithm for Steiner problems in multicast routing

Cites Work

• Unnamed Item
• Unnamed Item
• A fast algorithm for Steiner trees
• A primal-dual approximation algorithm for the Steiner forest problem
• Distributed Multi-Destination Routing: The Constraints of Local Information
• Steiner problem in networks: A survey
• The computation of nearly minimal Steiner trees in graphs

This page was built for publication: Distributed multicast routing in point-to-point networks