Multicast tree construction in bus-based networks
- 3 January 1990
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 33 (1), 29-42
- https://doi.org/10.1145/76372.76375
Abstract
Because of the multiple-access property of the media, the problem of constructing multicast trees in bus-based networks differs fundamentally from that in point-to-point networks. This article investigates the multicast tree construction for both general and specific network topologies.Keywords
This publication has 22 references indexed in Scilit:
- Decentralizing a global naming service for improved performance and fault toleranceACM Transactions on Computer Systems, 1989
- Distributed multi-destination routing in hypercube multiprocessorsPublished by Association for Computing Machinery (ACM) ,1988
- Performance evaluation of spanning multiaccess channel hypercube interconnection networkIEE Proceedings E Computers and Digital Techniques, 1987
- The integration of virtual memory management and interprocess communication in AccentACM Transactions on Computer Systems, 1986
- Flux, sorting, and supercomputer organization for AI applicationsJournal of Parallel and Distributed Computing, 1984
- The steiner problem in phylogeny is NP-completeAdvances in Applied Mathematics, 1982
- A linear-time approximation algorithm for the weighted vertex cover problemJournal of Algorithms, 1981
- A fast algorithm for Steiner treesActa Informatica, 1981
- The Rectilinear Steiner Tree Problem is $NP$-CompleteSIAM Journal on Applied Mathematics, 1977
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973