.png){kind=icon}
.png){kind=icon}
Return
Minimizing the Maximum Link Utilization in Multicast Multi-Commodity Flow Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2018.2833547.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we first formulate the network coded multicast multi-commodity flow model to minimize the maximum link utilization (MLU). Due to the effects of multipath and network coding, the obtained MLU can serve as a fundamental lower bound in traffic engineering. We then present a dual-dual decomposition approach whereby the original problem can be decomposed into a series of minimum-cost flow subproblems with only one centralized computation. The subproblems can be efficiently solved in a parallel or distributed manner. Numerical experiment is finally given to validate the effectiveness of the proposed approach.
Keywords:
Multicast
multi-commodity flow
traffic engineering
link utilization
software-defined networking (SDN)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W