检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郑巍[1] 刘三阳[2] 齐小刚[2] 陈晓辉[3]
机构地区:[1]西安电子科技大学计算机学院,陕西西安710071 [2]西安电子科技大学理学院,陕西西安710071 [3]武汉邮电科学研究院,湖北武汉430074
出 处:《西安电子科技大学学报》2010年第6期1119-1124,共6页Journal of Xidian University
基 金:"863"计划资助项目(2009AA01Z254);中央高校基本科研业务费专项基金资助项目(JY10000970013);国家自然科学基金资助项目(60974082)
摘 要:针对动态多层光网络(IP over WDM)的实时选路问题,提出了一种基于蚁群优化的区分综合选路算法.首先利用分层图模型,将传统的动态RWA问题转换为路由问题.然后,对该路由问题进行选路,通过将寻路蚂蚁放置在控制平面中,可以使控制平面的选路和数据平面的业务传输同步进行,从而为每一个动态到达的业务实时地进行选路;并能综合考虑到路径的跳数和路径上链路的拥塞情况,有效降低业务阻塞率.最后,利用多类不同的蚂蚁对应不同粒度请求的业务,为不同的业务进行有区分的选路,使得高粒度请求的业务能绕开关键链路,从而在关键链路上承载更多的业务,进一步降低阻塞率.仿真实验表明,与其他算法相比,该算法具有更低的业务阻塞率和更好的业务阻塞公平性.An ACO-based differentiated integrated routing (ADIR) algorithm is presented for solving the problem of real-time routing. First, the algorithm simplifies the RWA problem into a routing problem with a layered-graph model. Then, we search for routes for the routing problem. The ants used in our algorithm are transported in a control plane, so we can search for routes in the control plane and transport traffic in the data plane synchronously. And the route for a connection request can be determined in real-time. The hops and congestion of routes are also considered in our algorithm, so the blocking probability is reduced. Finally, we use different kinds of ants with the motivation of bandwidth differentiation so that the low bandwidth request traffic can use the key link and the high bandwidth request traffic selects a detour path, and therefore the blocking probability can also he reduced. Simulation results show that ADIR performs better than other routing approaches in terms of traffic blocking probability and traffic blocking fairness.
分 类 号:TP301[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222