检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王世成 陈晓静[1,2] 何荣希[1] Wang Shicheng;Chen Xiaojing;He Rongxi(College of Information Science and Technology,Dalian Maritime University,Dalian,Liaoning 116026,China;Dalian University of Science and Technology,Dalian,Liaoning 116052,China)
机构地区:[1]大连海事大学信息科学技术学院,辽宁大连116026 [2]大连科技学院,辽宁大连116052
出 处:《激光与光电子学进展》2022年第7期112-120,共9页Laser & Optoelectronics Progress
基 金:国家自然科学基金(61371091,61801074);大连市科技创新基金(2019J11CY015)。
摘 要:针对弹性光网络的频谱碎片问题,提出了一种最大化业务承载力的碎片感知路由与频谱分配算法。在路由阶段利用K最短路由算法为业务请求离线计算K条跳数最短的备选路径,在频谱分配阶段考虑到达业务请求以及已建立业务连接的持续时间等因素,对空闲频谱块(SB)的业务承载力进行评估,并从所选路径的可用SB中挑选建立光路后关联路径中空闲资源业务承载力最大的方案建立业务连接。仿真结果表明,该算法可以降低带宽阻塞率和链路平均碎片率,同时提高资源利用率。In order to solve the problem of the spectrum fragmentation in elastic optical networks,a fragmentationaware routing and spectrum allocation algorithm for maximizing service carrying capacity is proposed in this paper.In the routing stage,K-shortest path routing algorithm is utilized to calculate K alternative paths with the minimum hops offline for connection requests.In the spectrum allocation stage,the factors such as the duration of the arriving request and established connections are considered to evaluate the service carrying capacity of the free spectrum block(SB).From available SBs of the selected path,we select the scheme that is beneficial to maximize the service carrying capacity of the free resource in the relevant paths after the lightpath is established for the connection establishment.Simulation results show that the algorithm can reduce the bandwidth blocking probability and the link average fragmentation ratio and improve the resource utilization.
关 键 词:光通信 弹性光网络 频谱碎片 路由与频谱分配 持续时间
分 类 号:TN929.11[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7