Distance Priority Based Multicast Routing in WDM Networks Considering Sparse Light Splitting

摘要：

As we know, the Member-Only algorithm in 1 provides the best links stress and wavelength usage for the construction of multicast light-trees in WDM networks with sparse splitting. However, the diameter of tree is too big and the average delay is also too large, which are intolerant for QoS required multimedia applications. In this paper, a distance priority based algorithm is proposed to build light-trees for multicast routing, where the Candidate Destinations and the Candidate Connectors are introduced. Simulations show the proposed algorithm is able to greatly reduce the diameter and average delay of the multicast tree (up to 51％ and 50％ respectively), while keep the same or get a slightly better link stress as well as the wavelength usage than the famous Member-Only algorithm.

关键词： Multicast Routing Sparse Light Splitting Distance Priority Light-Tree Computation WDM network

作者: Fen ZHOU Miklós MOLNáR Bernard COUSIN

作者单位: Department of Computer Science INSA de Rennes/IRISA Rennes,France University of Rennes I/IRISA Rennes,France

会议类型: 国际会议

会议名称: The 11th IEEE International Conference on Communications Systems(第11届电子和电气工程师协会国际通信系统会议)(IEEE ICCS 2008)

会议地点: 广州

会议语种:英文

在线出版日期: 2008-11-19（万方平台首次上网日期，不代表论文的发表时间）