Overlay multicast routing algorithm with minimum overlay cost

DOI10.3724/SP.J.1087.2008.02569MaRDI QIDQ5188896zbMATH OpenFDO

Authors Longxin Lin, Jie Zhou, Ling Zhang, Zhao Ye

Publication date 6 March 2010

Published in Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/SP.J.1087.2008.02569

zbMATH Keywords

spanning treeoverlay multicastoverlay cost

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 2202244
• Analysis of bandwidth efficiency in overlay multicasting
• Path-aware overlay multicast
• scientific article; zbMATH DE number 2090660
• Delay constrained overlay multicast routing protocol and its optimization strategies

Cited in

(9)

• Multi-objective optimization of multicast overlays for collaborative applications
• Analysis of bandwidth efficiency in overlay multicasting
• Reliable overlay multicast trees for private internet broadcasting with multiple sessions
• Path-aware overlay multicast
• Half overlay multicast routing for hybrid networks
• Multicast tree rearrangement to recover node failures in overlay multicast networks
• A method for any-source capacity-constrained overlay multicast
• scientific article; zbMATH DE number 2202244 (Why is no real title available?)
• Delay constrained overlay multicast routing protocol and its optimization strategies

This page was built for publication: Overlay multicast routing algorithm with minimum overlay cost

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