Multicast Flow Aggregation in IP over Optical Networks

Multicast Flow Aggregation in IP over Optical Networks
复制标题

DOI:
10.1109/jsac.2007.070613
复制
发表时间:
2007-06
影响因子:
16.4
通讯作者:
Yan Zhu;Yaohui Jin;Weiqiang Sun;W. Guo;Weisheng Hu;W. Zhong;Minyou Wu
Yan Zhu;Yaohui Jin;Weiqiang Sun;W. Guo;Weisheng Hu;W. Zhong;Minyou Wu
中科院分区:
计算机科学1区
文献类型:
--
作者:
Yan Zhu;Yaohui Jin;Weiqiang Sun;W. Guo;Weisheng Hu;W. Zhong;Minyou Wu

文献摘要

相似文献

人们普遍认为,IP光网络将是下一代互联网的一个主要组成部分,但是,它是不是有效的映射到一个光树的一个多播IP流,因为IP流所需的带宽通常是远远小于光树。本文研究了覆盖模型下的IP over Optical双层网络中的组播流聚合问题。给定一组头端(即,光多播源),每个光多播源可以提供一组内容(即,多播IP流),以及在接入路由器处的一组所请求的内容(即,光多播目的地),找到光树的集合以及每个光树中的多播IP流的最佳聚合。我们模型MFA的三分图与多个标准,并表明该问题是NP-完全的。最优解的设计是利用MFA来制定一个整数线性规划(ILP),两个参数:多播接收指数α和冗余发送指数β。我们还提出了一个启发式算法。最后,我们通过实验比较了不同alpha和beta组合下MFA的性能,数值结果表明我们的启发式算法对大规模网络是有效的
It is widely believed that IP over optical networks will be a major component of the next generation Internet However, it is not efficient to map a single multicast IP flow into one light-tree, since the bandwidth of an IP flow required is usually much less than that of a light-tree. In this paper, we study the problem of multicast flow aggregation (MFA) in the IP over optical two-layered networks under the overlay model, which can be defined as follows: given a set of head ends (i.e. optical multicasting sources), each of which can provide a set of contents (i.e. multicast IP flows) with different required transmission bandwidth, and a set of requested content at the access routers (i.e. optical multicasting destinations), find a set of light-trees as well as the optimal aggregation of multicast IP flows in each light-tree. We model MFA by a tri-partite graph with multiple criteria and show that the problem is NP-complete. Optimal solutions are designed by exploiting MFA to formulate an integer linear programming (ILP), with two parameters: the multicast receiving index alpha and the redundant transmitting index beta. We also propose a heuristic algorithm. Finally, we compare the performance of MFA for different combination of alpha and beta via experiments and show our heuristic algorithm is effective for large-scale network in numerical results