基于遗传算法的WDM星型和树型网络动态业务疏导
Grooming of Dynamic Traffic in WDM Star and Tree Networks Using Genetic Algorithm
摘要：
WDM技术的发展引起了人们对业务疏导问题的极大兴趣。由于业务量经常变化，动态业务疏导问题具有重要的实用价值。在本文中，我们讨论了动态疏导的流量在星形和树形网络。提出了一种基于遗传算法（GA）的方法来支持任意的动态业务模式，该方法最小化了ADM和波长的数量。为了评估该算法，更严格的界限。计算机模拟结果表明，在树形和星形网络中，该算法能有效地减少ADM的数目和波长。
英文摘要：
The advances in WDM technology lead to the great interest in traffic grooming problems. As traffic often changes from time to time, the problem of grooming dynamic traffic is of great practical value. In this paper, we discuss dynamic grooming of traffic in star and tree networks. A genetic algorithm (GA) based approach is proposed to support arbitrary dynamic traffic patterns, which minimizes the number of ADM's and wavelengths. To evaluate the algorithm, tighter bounds are derived. Computer simulation results show that our algorithm is efficient in reducing both the numbers of ADM's and wavelengths in tree and star networks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
