Source-limited inclusive routing: A new paradigm for multicast communication

DOI10.1002/(SICI)1097-0037(200001)35:1%3C40::AID-NET4%3E3.0.CO;2-ZMaRDI QIDQ4944741zbMATH OpenOpenAlexFDO

Authors Barbara D. Gannod, Abdol-Hossein Esfahanian, Eric Torng

Publication date 7 June 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(200001)35:1%3C40::aid-net4%3E3.0.co;2-z

zbMATH Keywords

greedy algorithmoblivious routingdirected treeswormhole routingmulticast communicationcircuit routingnode-disjoint multicast

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• Scheduling time-constrained multicast messages in circuit-switched tree networks.
• Scheduling multicasts on unit-capacity trees and meshes.
• scientific article; zbMATH DE number 1305434
• scientific article; zbMATH DE number 1532270
• scientific article; zbMATH DE number 2038712

Cited in

(2)

• scientific article; zbMATH DE number 1950512 (Why is no real title available?)
• Toward a general theory of unicast-based multicast communication

This page was built for publication: Source-limited inclusive routing: A new paradigm for multicast communication

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