Dedicated protection of multicast sessions in mixed-graph sparse-splitting optical networks

DOI10.1002/NET.21781MaRDI QIDQ6496368zbMATH OpenFDO

Authors Teresa Gomes, Luís Raposo, Georgios Ellinas

Publication date 3 May 2024

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/NET.21781

zbMATH Keywords

heuristicsmixed-graphmulticastingoptical networkssparse splittingsurvivability

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A note on two problems in connexion with graphs
• Cross-sharing vs. self-sharing trees for protecting multicast sessions in mesh networks
• Distributed Computing - IWDC 2003
• Heuristics for the Steiner problem in graphs
• scientific article; zbMATH DE number 3677874 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Introduction to algorithms
• Path-distance heuristic for the Steiner problem in undirected networks

This page was built for publication: Dedicated protection of multicast sessions in mixed-graph sparse-splitting optical networks

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