全光WDM网状网组播路由的次斯坦纳启发式算法
Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks
摘要：
在稀疏分光全光WDM网络中，光树能容纳的目的地越多，组播会话所需的光树和波长就越少。在这篇文章中，一个Hypo-Steiner光树算法（HHALTH）提出了构建一个HALTH光树，包括尽可能多的目的地。Hynthesis构造的光树的代价上限为N（N-1）/2，其中N是网络中的节点数。该分析模型证明，在相同条件下，更多的目的地可以保持在一个障碍比一个只有（张等人，J. Lightware Technol，18（12），1917-1927 2000.）光树大量的仿真不仅验证了证明，但也表明，所提出的启发式优于现有的组播路由算法的大幅度的链路压力，吞吐量和效率的波长使用。
英文摘要：
In sparse light splitting all-optical WDM networks, the more destinations a light-tree can accommodate, the fewer light-trees andwavelengths amulticast session will require. In this article, a Hypo-Steiner light-tree algorithm (HSLT) is proposed to construct a HSLT light-tree to include as many destinations as possible. The upper bound cost of the light-trees built by HSLT is given as N(N -1)/2, where N is the number of nodes in the network. The analytical model proves that, under the same condition, more destinations could be held in a HSLT than a Member-Only (Zhang et al., J. Lightware Technol, 18(12), 1917-1927 2000.) light-tree. Extensive simulations not only validate the proof but also show that the proposed heuristic outperforms the existing multicast routing algorithms by a large margin in terms of link stress, throughput, and efficiency ofwavelength usage.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
