Download Now Free registration required
In this paper, the authors study the problem of multicast flow aggregation with the objective of minimizing the total number of trees. Each established tree can choose a line rate from multiple available line rates. The destinations of each tree are guaranteed to receive data correctly from the source through the chosen line rate. They first use two auxiliary graphs to describe the problem and show that the problem is NP-hard. An Integer Linear Program (ILP) is given to solve small scale problems. They, then provide a heuristic approach, named Highest Rate First (HRF). Numerical results show that HRF achieves good results in both large and small scale problems.
- Format: PDF
- Size: 357.2 KB