A low-cost algorithm for multicast routing

MaRDI QIDQ2716521zbMATH OpenFDO

Authors Pingyan Tan

Publication date 16 May 2001

Published in Congressus Numerantium (Search for Journal in Brave)

zbMATH Keywords

Internet MOSPF protocolmulticast routing in computer networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• An algorithm of low-cost multicast based on delay and delay variation constraint
• scientific article; zbMATH DE number 1983238
• scientific article; zbMATH DE number 2090660
• Delay-constrained, low-cost multicast routing in multimedia networks
• scientific article; zbMATH DE number 2113995

Cited in

(6)

• Modified least load multicast routings for single rate fully-connected loss networks
• Multicast routing based on the simulated annealing
• Minimum cost multicast routing using ant colony optimization algorithm
• scientific article; zbMATH DE number 2090660 (Why is no real title available?)
• scientific article; zbMATH DE number 2113995 (Why is no real title available?)
• A low-latency and self-adapting application layer multicast

This page was built for publication: A low-cost algorithm for multicast routing

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