基于分层PCE的多域最小代价路径启发式算法
Hierarchical PCE-based multi-domain minimum-cost path heuristic algorithm
摘要
智能光网络技术和P2MP(点对多点)技术的融合将能够极大地促进光组播业务的发展。文章针对多层多域光网络中的P2MP业务, 提出了一种MDMPH(基于分层PCE(路径计算元素)的多域最小代价路径启发式)算法, 并进行了仿真分析。与传统的PDB(基于逐域路径)算法、E-BRPC(基于扩展的反向回溯)算法以及CTB(基于核心树)算法相比, MDMPH算法能够计算出代价更小的P2MP路径树。
Abstract
The conversing of intelligent optical networks with P2MP technology will greatly promote the development of optical multicast services. This paper proposes a hierarchical Path Calculation Element (PCE)-based Multi-Domain Minimum-cost Path Heuristic (MDMPH) algorithm and conducts the related simulation and analysis. Compared with the traditional Per-Domain Based (PDB) algorithm, Extended-BRPC (E-BRPC)-based algorithm and Core Tree Based (CTB) algorithm, MDMPH algorithm can calculate a smaller cost P2MP path tree.
李炜, 金鑫, 杨波, 邓捷, 陈宝靖, 朱睿杰. 基于分层PCE的多域最小代价路径启发式算法[J]. 光通信研究, 2014, 40(6): 19. Li Wei, Jin Xin, Yang Bo, Deng Jie, Chen Baojing, Zhu Ruijie. Hierarchical PCE-based multi-domain minimum-cost path heuristic algorithm[J]. Study On Optical Communications, 2014, 40(6): 19.