检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郭爱煌[1,2] 冯圣毅[1] 薛琳[1] 张剑[1]
机构地区:[1]同济大学电子与信息工程学院,上海201804 [2]北京大学区域光纤通信网与新型光通信系统国家重点实验室,北京100871
出 处:《光学学报》2012年第4期63-69,共7页Acta Optica Sinica
基 金:北京大学区域光纤通信网与新型光通信系统国家重点实验开放课题
摘 要:在传统的网络路由算法中,一般采用最短路径算法进行路由选路,最短路径算法以节点间的距离为权重,计算一条由源节点至目的节点的权重最小的路径以完成路由。最短路径算法虽然最小化了距离长度代价,却没有考虑能耗问题,所以使用最短路径算法所得出路径的能耗并不一定是最小的。针对这一问题,提出一种新型的综合性绿色路由算法,设定能耗作为节点间的权重,融合光旁路及业务量疏导,同时考虑路由和波长分配(RWA)问题,将完成每个业务所需要的能耗最小化,实现节能。仿真结果表明,与最短路径算法相比,绿色路由算法在较大规模网络中能够节省约40%的能耗,节能效果相当显著。In traditional routing algorithms,shortest-path algorithm(SPA) is often used.The distance between two nodes is defined as weight,and a path from the source node is selected to the destination node which has the minimum weight to finish routing.Although SPA minimizes the distance cost,it doesn′t consider the issue of energy consumption.So the routing path generated by SPA may not have the minimum energy cost.To solve this problem,a new integrated green routing algorithm is proposed.This algorithm defines energy consumption as the weight of each link.It combines optical bypass and traffic grooming and also considers routing and wavelength assignment(RWA) problem in order to minimize the energy cost of every routing process,which leads to energy-saving.The result of simulation shows that compared with SPA,green routing algorithm can save about 40% energy consumption in large-scale networks.Its energy-saving effect is considerable.
关 键 词:光通信 绿色路由算法 光因特网网络 光旁路 业务量疏导
分 类 号:TN915[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49