Source-Coded Online Algorithm for Multicast Subgraph Construction
Tomas Lestayo Martinez, Manuel Fernandez Veiega Veiga

TL;DR
This paper presents a source-coded multicast framework that constructs efficient, loop-free multicast subgraphs using maximum-flow decomposition, achieving high throughput with lower complexity than network coding.
Contribution
It introduces a novel source-coded multicast scheme with path redirection and overlap management, improving efficiency and scalability over traditional multicast and network coding methods.
Findings
Approaches throughput close to network coding with lower complexity
Outperforms traditional multicast in fairness and robustness
Effective in diverse network topologies
Abstract
Multicast remains a fundamental mechanism for scalable content distribution, yet existing approaches face critical limitations. Traditional multicast trees suffer from path redundancy and inefficient utilization of network resources, while network coding, although capacity-achieving, incurs significant computational overhead and deployment challenges. In this paper, we introduce a source-coded multicast framework that exploits maximum-flow decomposition to construct multiple disjoint or partially overlapping paths from the source to all receivers. Our scheme incorporates a novel path redirection mechanism: when multiple overlaps occur between receiver flows, downstream paths are realigned at the first intersection, ensuring loop-free delivery while maximizing overall throughput. We develop algorithms for path construction, overlap detection, and iterative refinement of multicast…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
