光子学报, 2014, 43 (8): 0806001, 网络出版: 2014-09-01
最小代价最大节点度数的稀疏光疏导方法
A Method of Sparse Optical Grooming with the Smallest Cost and Largest Degree
稀疏疏导网络 光疏导节点 节点共享度 节点代价 请求阻塞率 Sparse grooming network Optical grooming node Node shared degree Node cost Request blocking probability
摘要
疏导可以增加多播业务请求成功传输概率并提高光纤链路带宽利用率, 但波分复用光网络中所有节点具有疏导能力则会增加网络造价和复杂度.本文研究了稀疏疏导网络中疏导节点选择策略, 提出基于最小代价最大节点度数的疏导节点选择策略;根据疏导节点和非疏导节点功能差别, 改进了稀疏疏导网络中多播请求的疏导传输方法.结合最小代价最大度数疏导节点选择策略和多播业务稀疏疏导传输方法, 提出一种根据网络业务阻塞率限定值指标实现多播请求所需最少数目疏导节点的稀疏路由方法.仿真结果表明: 在网络给定波长数和光收发器端口数目情况下, 所提策略能够节约所需疏导节点数目并优化疏导节点位置, 降低网络节点构造造价.
Abstract
Grooming can increase multicast traffic request sucessful transmission probability and improve fiber link bandwidth utilization. But it certainly increases the network cost and complexity that all nodes are configured as grooming node in WDM network. Grooming node selection strategy was studied in the sparse grooming network. A grooming node selection strategy based on smallest cost largest degree was proposed. According to difference of grooming node function and non-grooming node function, the sparse grooming transmission method was improved to transmit the request for multicast request in the sparse grooming network. Lastly, according to the network′s blocking probability limit, a sparse routing method, integrated the node selection strategy with the smallest cost largest degree and multcast traffic grooming transmission method,was put forward to meet the multicat request with minimal grooming nodes. The simulation results show that the proposed strategy method can save number of grooming required nodes, optimize the location of grooming nodes and decrease the network node construction cost when network has given number of wavelengths per fiber and given transceivers of node in the sparse grooming network.
刘焕淋, 徐一帆, 方强, 陈勇. 最小代价最大节点度数的稀疏光疏导方法[J]. 光子学报, 2014, 43(8): 0806001. LIU Huan-lin, XU Yi-fan, FANG Qiang, CHEN Yong. A Method of Sparse Optical Grooming with the Smallest Cost and Largest Degree[J]. ACTA PHOTONICA SINICA, 2014, 43(8): 0806001.