Multicast Communications in Tree Networks with Heterogeneous Capacity Constraints
Yuval Emek, Shay Kutten, Mordechai Shalom, Shmuel Zaks

TL;DR
This paper investigates the complexity of scheduling maximum multicast requests in tree networks with heterogeneous capacities, providing approximation algorithms and polynomial solutions for special cases, thus advancing understanding of capacity-constrained multicast optimization.
Contribution
It extends existing multicast scheduling algorithms to heterogeneous capacities and identifies polynomial solutions for specific tree path cases, highlighting the problem's increased complexity.
Findings
The problem is harder to approximate with heterogeneous capacities.
An M-approximation algorithm based on leaf count is proposed.
Polynomial solutions exist for certain shared-vertex path sets.
Abstract
A widely studied problem in communication networks is that of finding the maximum number of communication requests that can be scheduled concurrently, subject to node and/or link capacity constraints. In this paper, we consider the problem of finding the largest number of multicast communication requests that can be serviced simultaneously by a network of tree topology, subject to heterogeneous capacity constraints. This problem generalizes the following two problems studied in the literature: a) the problem of finding a largest induced -colorable subgraph of a chordal graph, b) the maximum multi-commodity flow problem in tree networks. The problem is already known to be NP-hard and to admit a -approximation () in the case of homogeneous capacity constraints. We first show that the problem is much harder to approximate in the heterogeneous case. We then use a…
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9Peer 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.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Graph Theory Research · Optimization and Search Problems
