Abstract
Point-to-Multipoint (P2MP) services in optical networks are more and more important for high-capacity applications. Steiner tree algorithms have been investigated to compute minimum-cost multicast tree. However, it is difficult to compute an optimal P2MP tree in multi-domain networks because of isolation of each domain. There are several algorithms based on Path Computation Element (PCE) for computing multi-domain Point-to-point path, but computing P2MP Traffic Engineering Label Switched Path (TE-LSP) in a multi-domain networks is still a challenge. In this paper, three PCE-based schemes for P2MP inter-domain LSP computation are compared in full splitting capability networks, and a novel Multi-Domain Minimum-cost Path Heuristic (MDMPH) algorithm is proposed. Simulation results proved that the MDMPH algorithm computes P2MP tree with less cost than the other three schemes.
© 2011 Optical Society of America
PDF ArticleMore Like This
Jianchao Xing, Jie Zhang, Yongli Zhao, Xuping Cao, Dajiang Wang, and Wanyi Gu
831010 Asia Communications and Photonics Conference and Exhibition (ACP) 2011
Wang Zongwei, Peng Yunfeng, and Wang Yin
83101J Asia Communications and Photonics Conference and Exhibition (ACP) 2011
Panke Qin and Xue Chen
AF2G.29 Asia Communications and Photonics Conference (ACP) 2013