Ant-Based Alternate Routing in All-Optical WDM Networks
Ant-Based Alternate Routing in All-Optical WDM Networks
复制标题
DOI：
10.1093/ietcom/e89-b.3.748
复制
发表时间：
2006-03
期刊：
影响因子：
--
通讯作者：
Son-Hong Ngo;Xiaohong Jiang;S. Horiguchi
中科院分区：
文献类型：
--
作者：
Son-Hong Ngo;Xiaohong Jiang;S. Horiguchi
提出了一种基于蚁群算法的全光波分复用（WDM）网络中动态路由和波长分配（RWA）交替路由方案的改进算法。在我们的算法中，我们采用了一种新的双路由表结构，包括一个P路由表连接建立和蚂蚁的觅食信息素表。P-路由表包含源-目的地对之间的P个备用路由，其由基于蚂蚁的移动的代理基于当前网络拥塞信息动态更新。在ns-2网络仿真器上的大量仿真结果表明，通过在网络中保持适当数量的蚂蚁来主动地和不断地更新网络中的孪生路由表，我们的新的基于蚂蚁的交替路由算法可以导致一个小的建立时间，并实现了显着降低阻塞概率比有前途的交替最短路径（ASP）算法和固定路径最小拥塞（FPLC）算法的动态RWA，甚至与小值的P。
We propose an ant-based algorithm to improve the alternate routing scheme for dynamic Routing and Wavelength Assignment (RWA) in all-optical wavelength-division- multiplexing (WDM) networks. In our algorithm, we adopt a novel twin routing table structure that comprises both a P-route table for connection setup and a pheromone table for ants' foraging. The P-route table contains P alternate routes between a source-destination pair, which are dynamically updated by ant-based mobile agents based on current network congestion information. Extensive simulation results upon the ns-2 network simulator indicate that by keeping a suitable number of ants in a network to proactively and continually update the twin routing tables in the network, our new ant-based alternate routing algorithm can result in a small setup time and achieve a significantly lower blocking probability than the promising alternate shortest-path (ASP) algorithm and the fixed-paths least congestion (FPLC) algorithm for dynamic RWA even with a small value of P.