Abstract
In a multicast communication network, each sender communicates with multiple nodes which are in request of identical data. We summarize our studies of the minimum multicast congestion problem, which generalizes the well-known NP-hard multicommodity flow problem. Moreover, we describe efficient architectures for a network allowing n senders to connect to N receivers (n < N). © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Baltz, A., & Srivastav, A. (2009). Multicast routing and design of sparse connectors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5515 LNCS, pp. 247–265). https://doi.org/10.1007/978-3-642-02094-0_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
