T-MPLS网络中基于多等级业务的调度算法  

Scheduling Algorithm of Multi-Level Services Based on T-MPLS Network

作　　者：曹畅[1] 张永军[1] 李彬[1] 黄善国[1] 张杰[1] 顾畹仪[1] 

机构地区：[1]北京邮电大学光通信与光波技术教育部重点实验室,北京100876

出　　处：《北京邮电大学学报》2009年第2期119-122,共4页Journal of Beijing University of Posts and Telecommunications

基　　金：国家"863计划"项目(2007AA01Z2a4);国家自然科学基金项目(60877052);教育部新世纪优秀人才支持计划项目(NCET-05-0112)

摘　　要：为保证不同类型业务在传送多协议标记交换网络中的合理调度,并提高链路带宽资源利用率,提出了一种改进型的加权公平调度算法.为分析该算法性能,利用OPNET仿真软件搭建平台进行仿真.结果表明,相比于传统的加权公平算法,该算法在不增加算法复杂度的基础上能有效地节约链路带宽资源,并使高等级业务获得更好的时延特性.An algorithm is proposed for scheduling different types of services and for improving band- width utilization of links in transport multi-protocol label switching network. This algorithm is implemented in a simulation testbed based on OPNET modeler for performance evaluation. Simulation is shown that, compared with traditional scheduling algorithms, the complexity of this algorithm is not increased. And a better time-delay performance of the high class services is also verified.

关 键 词：传送多协议标签交换 调度算法 优先级排队 加权公平排队 等级加权公平排队 

分 类 号：TN929.11[电子电信—通信与信息系统]