LIU Dongmei~1 KONG Lingbin~1 WANG Yahong~2. A Dynamic Multicast Routing Algorithm for WDM Grooming Networks[J]. 2007, (2): 78-80.DOI:
一种WDM疏导网络动态组播路由算法
摘要
对无波长变换能力的波分复用(WDM)疏导网络中的组播路由和波长分配(MRWA)问题进行了研究
提出了动态组播流量疏导算法(DMTGA)。这种算法根据当前网络资源使用情况
结合流量疏导和负载均衡
对链路权重进行动态配置
构建满足组播业务请求带宽需求的组播树。在不同的网络负载下对算法进行仿真
对比分析了DMTGA对业务请求接入率、平均网络资源利用率和全网负载分布的影响。
Abstract
This paper considers the problem of multicast routing and wavelength assignment in wavelength division multiplexing grooming networks without wavelength conversion capability and proposes the dynamic multicast traffic grooming algorithm.The algorithm based on the resources of current network
integrates traffic grooming and load balancing functionality simultaneously
reconfigures weight of each link dynamically
and constructs a minimum cost bandwidth guaranteed tree for multicast request.The simulation results in different network loads show the influence in terms of request acceptance ratio
average resource utilization efficiency
and distribution of loads in the network.
关键词
Keywords
references
A fast algorithm for Steiner trees [J] . L. Kou,G. Markowsky,L. Berman. Acta Informatica . 1981 (2)