基于分解协调的SWCC-OBS网络路由选择研究  

A novel routing scheme based on decomposition coordination in SWCC-OBS networks

作　　者：刘暾东[1] 郑炳辉[1] 范天娥[1] 张华飞[1] 陶继平[1] 

机构地区：[1]厦门大学信息科学与技术学院,厦门大学云计算与大数据研究中心,福建厦门361005

出　　处：《光电子．激光》2013年第9期1720-1726,共7页Journal of Optoelectronics·Laser

基　　金：国家自然科学基金(11201391);福建省自然科学基金(2013J01103)资助项目

摘　　要：针对稀疏分布有限波长转换能力的光突发交换(SWCC-OBS)网络容易出现的高丢包率和负载不均衡问题,建立了稀疏分布OBS全网丢包率的数学模型。为了克服模型求解过程中多变量带来的非线性问题,对影响全网突发丢包率的参变量进行分解预估和反馈更新,求得全网对应业务流模型下的优化路由路径,获得了全网突发数据的近似最低丢包率。仿真实验表明,在SWCCOBS网络中,本文提出的路由选择模型及分解协调的路由选择算法,不仅能有效地避免突发数据包间的相互冲突、降低了全网丢包率,而且能很好地适应突发数据业务的动态变化,保证了网络的负载均衡和较低的丢包率。Optical burst switching （OBS） has been proposed as a promising switching technology for the next generation of optical transport networks. Particular attention is paid to the commercial OBS networks with sparse wavelength conversion capabilities （SWCC-OBS）. An overall burst packet loss probability, which adequately represents the congestion state of entire network, is the primary metric of interest in an SWCC-OBS network. With the overall loss probability as the optimization objective, a novel routing model is proposed based on integer non-linear programming formulation. In Order to overcome the computational complexity, a novel routing algorithm based on decomposition coordination is proposed to solve the problem by decomposing and pre-forecasting the variables. Also it updates the values according to the feekback. Finally, it will obtain an optimal routing path and the global approximate optimal path to minimize the burst loss probability. The simulation results show that the proposed model and algorithm can give a near-optimal routing that avoids the conflict of burst data effectively and decreases the overall burst loss probability. At the same time,it also performs well in balancing payloads throughout the whole network under different kinds of burst data patterns and network topologies.

关 键 词：稀疏分布有限波长能力的光突发（SWCC—OBS）网络 路由选择 丢包率 分解协调 反馈 预估 

分 类 号：TN929.11[电子电信—通信与信息系统]