TY - GEN

T1 - Multicast communications with varying bandwidth constraints

AU - Emek, Yuvak

AU - Kutten, Shay

AU - Shalom, Mordechai

AU - Zaks, Shmuel

PY - 2021/5/10

Y1 - 2021/5/10

N2 - To find a maximum number of communication requests that can be satisfied concurrently, is a fundamental network scheduling problem. In this work we investigate the problem of finding a maximum number of multicast requests that can be scheduled simultaneously in a tree network in which the edges and links have heterogeneous bandwidth limitations.This problem generalizes two problems studied in the literature: maximum k-colorable subgraph in chordal graphs, maximum multi-commodity flow in trees. The problem is NP-hard and admits a 1.585-approximation in the special case of homogeneous bandwidth limitations.We first show that the problem is harder to approximate when the bandwidth limitations are heterogeneous, i.e. vary from link to link and from node to node. We then generalize of a classical algorithm and obtain an M-approximation where M is the maximum number of leaves of the communication subtrees. Surprisingly, variants of the same algorithm, are used in the literature at least four times to solve related problems. There exists a polynomial-time algorithm for the special case of unicast requests and star topology. We generalize this result and relax the second requirement so that the set of unicast requests share a common vertex with no restriction on the tree topology.

AB - To find a maximum number of communication requests that can be satisfied concurrently, is a fundamental network scheduling problem. In this work we investigate the problem of finding a maximum number of multicast requests that can be scheduled simultaneously in a tree network in which the edges and links have heterogeneous bandwidth limitations.This problem generalizes two problems studied in the literature: maximum k-colorable subgraph in chordal graphs, maximum multi-commodity flow in trees. The problem is NP-hard and admits a 1.585-approximation in the special case of homogeneous bandwidth limitations.We first show that the problem is harder to approximate when the bandwidth limitations are heterogeneous, i.e. vary from link to link and from node to node. We then generalize of a classical algorithm and obtain an M-approximation where M is the maximum number of leaves of the communication subtrees. Surprisingly, variants of the same algorithm, are used in the literature at least four times to solve related problems. There exists a polynomial-time algorithm for the special case of unicast requests and star topology. We generalize this result and relax the second requirement so that the set of unicast requests share a common vertex with no restriction on the tree topology.

KW - Maximum k-colorable set

KW - Maximum multi-commodity flow

KW - Multicast communications

UR - http://www.scopus.com/inward/record.url?scp=85111928398&partnerID=8YFLogxK

U2 - 10.1109/infocom42981.2021.9488869

DO - 10.1109/infocom42981.2021.9488869

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85111928398

T3 - IEEE INFOCOM 2021 - IEEE Conference on Computer Communications

SP - 1

EP - 10

BT - INFOCOM 2021 - IEEE Conference on Computer Communications

T2 - 40th IEEE Conference on Computer Communications, INFOCOM 2021

Y2 - 10 May 2021 through 13 May 2021

ER -