Distributed multicast routing in point-to-point networks
DOI10.1016/S0305-0548(96)00074-3zbMATH Open0882.90033OpenAlexW1965092553MaRDI QIDQ1362952FDOQ1362952
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
Recommendations
- A note on distributed multicast routing in point-to-point networks
- A distributed dual ascent algorithm for Steiner problems in multicast routing
- scientific article; zbMATH DE number 1304096
- A Distributed Primal-Dual Heuristic for Steiner Problems in Networks
- scientific article; zbMATH DE number 2090660
simulationroutingsourceinsertion heuristicslarge point-to-point communication networksmultiple destinations
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Steiner problem in networks: A survey
- A primal-dual approximation algorithm for the Steiner forest problem
- A fast algorithm for Steiner trees
- Title not available (Why is that?)
- The computation of nearly minimal Steiner trees in graphs
- Distributed Multi-Destination Routing: The Constraints of Local Information
Cited In (5)
- DMT of Multihop Networks: End Points and Computational Tools
- Title not available (Why is that?)
- Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks
- A distributed dual ascent algorithm for Steiner problems in multicast routing
- A note on distributed multicast routing in point-to-point networks
This page was built for publication: Distributed multicast routing in point-to-point networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362952)