Effective multicasting algorithm for dynamic membership with delay constraint

DOI10.1631/JZUS.2006.A0156MaRDI QIDQ2508107zbMATH OpenFDO

Authors Lin Chen, Zhengquan Xu

Publication date 9 October 2006

Published in Journal of Zhejiang University. Science A (Search for Journal in Brave)

zbMATH Keywords

delay constraintroutingquality of service (QoS)multicast

Mathematics Subject Classification ID

Communication theory (94A05) Stochastic network models in operations research (90B15) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1983238
• An Efficient Multicast Tree with Delay and Delay Variation Constraints
• Distributed delay constrained multicast routing algorithm with efficient fault recovery

Cites work

• Dynamic Steiner Tree Problem
• Steiner problem in networks: A survey
• Steiner tree problems

Cited in

(8)

• A delay-constrained least-cost multicast routing heuristic for dynamic multicast groups
• A unitary dynamic application layer multicast protocol based on genetic algorithms
• Extending greedy multicast routing to delay sensitive applications
• Dynamic group multicast routing with bandwidth reservations
• scientific article; zbMATH DE number 2112464 (Why is no real title available?)
• A distance-heuristic tree building approach in application layer multicast
• Delay constrained overlay multicast routing protocol and its optimization strategies
• Two-stage evolutionary algorithm for dynamic multicast routing in mesh network

This page was built for publication: Effective multicasting algorithm for dynamic membership with delay constraint

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