A Novel Graph Model for Dynamic Multicast Flow Aggregation in Optical Networks

In this paper, we address the dynamic multicast flow aggregation problem and propose a novel graph model with different aggregation policies. We first give the network model with an auxiliary graph for the aggregation. We then discuss an aggregation algorithm using the auxiliary graph and propose three policies for aggregating multicast flows. Numerical results show that aggregation can tremendously reduce the total trees in the network while the three policies can achieve good performance for various scenarios.