Advertisement
Published in:
2009 | OriginalPaper | Chapter
Multicast Routing and Design of Sparse Connectors
Authors : Andreas Baltz, Anand Srivastav
Published in: Algorithmics of Large and Complex Networks
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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
).