Extending greedy multicast routing to delay sensitive applications

DOI10.1007/S00453-001-0122-7MaRDI QIDQ1601025zbMATH OpenOpenAlexFDO

Authors R. Smith

Publication date 17 June 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0122-7

zbMATH Keywords

greedy algorithmmulticasting

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1983238
• A delay-constrained least-cost multicast routing heuristic for dynamic multicast groups
• scientific article; zbMATH DE number 2242700
• Effective multicasting algorithm for dynamic membership with delay constraint
• Delay-constrained, low-cost multicast routing in multimedia networks

Cited in

(3)

• scientific article; zbMATH DE number 1726637 (Why is no real title available?)
• THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM
• AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM

This page was built for publication: Extending greedy multicast routing to delay sensitive applications

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