一种QoS动态通信量疏导模式  

A QoS Dynamic Traffic Grooming Scheme

作　　者：王兴伟[1] 佟呈呈[1] 黄敏[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004

出　　处：《东北大学学报（自然科学版）》2009年第6期802-804,共3页Journal of Northeastern University(Natural Science)

基　　金：国家高技术研究发展计划项目(2006AA01Z214);国家自然科学基金资助项目(60673159;70671020);新世纪优秀人才支持计划项目;教育部科学技术研究重点项目(108040);教育部高等学校博士学科点专项科研基金资助项目(20060145012;20070145017);辽宁省自然科学基金资助项目(20062022)

摘　　要：考虑用户通信量请求的服务质量QoS(Quality of Service)约束和网络资源约束,提出了一种光Internet中的QoS动态通信量疏导模式.该模式以最小化网络费用为目标,基于分层图模型和Dijkstra第k最短路算法,引入亲和度,尽可能把新到达的通信量请求疏导到能满足其带宽和延迟要求的已有光路上.仿真结果表明,本文提出的模式是可行和有效的,不仅支持QoS,而且提高光路利用率,有实用性.With the constraints on both QoS（Quality of Service） and network resource considered for the traffic requested from users, a QoS dynamic traffic grooming scheme is proposed on optical Internet. It is based on a hierarchical graph model and the Dijkstra kth shortest path algorithm to minimize the network cost. With the concept of appetency introduced, the scheme tries to groom the newly arrived traffic requests and lead them to the existing lightpaths available to meet the requirements of bandwidth and delay as possible. Simulation results showed that the scheme proposed is feasible, practical and effective, since it not only support QoS but also improve the lightpath efficiency.

关 键 词：光INTERNET 通信量疏导 服务质量 通信量请求 亲和度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]