Distributed delay constrained multicast routing algorithm with efficient fault recovery

DOI10.1002/NET.20090MaRDI QIDQ3376659zbMATH OpenOpenAlexFDO

Authors Hasan Ural, Keqin Zhu

Publication date 24 March 2006

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20090

zbMATH Keywords

constrained Steiner treefault recoverydelay constrained multicast treedistributed multicast routing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Recommendations

• A distributed multicast routing algorithm for real-time applications in wide area networks
• scientific article; zbMATH DE number 1983238
• An efficient algorithm for constructing delay bounded minimum cost multicast trees
• scientific article; zbMATH DE number 6264040
• An algorithm of low-cost multicast based on delay and delay variation constraint

Cited in

(2)

• Effective multicasting algorithm for dynamic membership with delay constraint
• Linear time distributed construction of colored trees for disjoint multipath routing

This page was built for publication: Distributed delay constrained multicast routing algorithm with efficient fault recovery

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