A novel graph model for dynamic multicast flow aggregation in optical networks

Authors:
Yi Zhu;Ankitkumar N. Patel;Jason P. Jue
Affiliations:
Dept. of Computer Science, The University of Texas at Dallas, Richardson, TX;Dept. of Computer Science, The University of Texas at Dallas, Richardson, TX;Dept. of Computer Science, The University of Texas at Dallas, Richardson, TX
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 5
Cited 0

Multicast routing and wavelength assignment in multihop optical networks

IEEE/ACM Transactions on Networking (TON)
Comprehensive performance modeling and analysis of multicasting in optical networks

IEEE Journal on Selected Areas in Communications
Design and provisioning of WDM networks with multicast traffic grooming

IEEE Journal on Selected Areas in Communications - Part Supplement
Multicast Flow Aggregation in IP over Optical Networks

IEEE Journal on Selected Areas in Communications
An architecture for scalable, efficient, and fast fault-tolerant multicast provisioning

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.