蚁群算法在OBSWA中的应用.docVIP

蚁群算法在 OBS RWA中的应用 光突发交换（OBS）以一步占用方式为突发建立端到端的全光连接。现有的RWA算法通常以源宿结点对间最短路径作为突发的路由，沿路逐跳进行波长分配。在非对称的网络中，或网络业务流量非均匀分布时，会造成链路负载不均衡，加大突发冲突概率。本文基于蚁群思想，提出了一种OBS网络中分布式RWA算法。对于每一个成功接收的突发，宿结点向源结点发送一个ACK，ACK按原路返回。结点利用ACK统计途经其输出链路到达某一宿结点的发送成功概率，并以此作为经过该链路到此宿结点的“气味权值”，当新的突发到达时，按照输出链路上的气味权值，实时为突发选择输出链路和波长。仿真表明，与现有的RWA算法相比，本文算法可以自适应的发现最佳路由，平衡链路负载，减小突发阻塞概率。 光突发交换 蚁群算法 路由波长分配 Ant algorithm in OBS RWA Ting-Jin Yu, Shi Zhang, Bing Zhang (State Key Lab of ISN, XiDian University Xi’an OBS uses one-way reservation protocol to set up end-to-end all-optical connections. The current RWA algorithms usually use the shortest path between source-destination pair as the route, and wavelengths are assigned hop-by-hop. In an unsymmetrical or load with unbalanced distribution network, this algorithm will result larger probability of loss. In this paper, we propose a dynamic distributed OBS RWA algorithm enlightened by ant colony. The destination nodes feed ACKs back for each successfully received burst control packet (BCP) used for resource reservation. The ACKs are feed back along the same path as the one through which BCPs are forwarded. In each node, the success sending probability for each source-destination pair is calculated by recording the number of ACKs The probabilities are regarded as the “pheromone” of the output links. For the incoming BCPs, the node will choose the output link based on the “pheromone”. Numerical results obtained from simulation show that our RWA algorithm can find the optimal routes adaptively and get a better burst block probability performance compared with current RWA algorithms. OBS Ant Algorithm RWA于挺进 (1979-) 男 吉林乾安 西安电子科技大学ISN国家重点实验室 2002级硕士 于挺进 (1979-) 男 吉林乾安 西安电子科技大学ISN国家重点实验室 2002级硕士 引言 随着全球范围内IP业务的迅猛增长，对传送网带宽和交换系统容量的需求正以前所未有的速度增加。现有的DWDM技术可以使一根光纤上可利用的带宽达到10Tbit/s左右,可以满足较长时期内对传送网带宽的要求 [1]。 光分组交换（Optical Packet Switching，OPS）是全光网络的发展方向。但OPS存在着两个主要问题：一是没有合适的光缓存器。目前的实验系统中采用的光纤延迟线（Fiber Delay Line ,FDL）往往比较笨重，不灵活。1km光纤只能对光信号延迟5us,存储深度有限；二是在OPS交换节点处的多输入分组精确同步难以实