首页 | 本学科首页   官方微博 | 高级检索  
     检索      

DS-TE环境下LSP抢占算法
引用本文:徐蕾,于银辉,李金明,王君竹.DS-TE环境下LSP抢占算法[J].吉林大学学报(信息科学版),2013,31(3):223-227.
作者姓名:徐蕾  于银辉  李金明  王君竹
作者单位:中国移动通信集团吉林有限公司网管中心,长春,130033;吉林大学通信工程学院,长春,130012;长春理工大学电子信息工程学院,长春,130022
基金项目:国家自然科学基金资助项目(U0935001)
摘    要:原有V-PREPT(Versatile Preemption)算法关心的是抢占总代价最小化, 灵活性较好但带宽利用率不高。为此, 在研究DS-TE环境下的抢占机制及现行的抢占算法基础上, 提出了BH-PREPT(Bandwidth Preemption)算法。该算法能在最小化抢占总代价的条件下提高带宽的利用率, 在保证被抢占的总带宽满足需求带宽的前提下, 通过采取枚举法找出抢占总代价最小的LSP(Label Switching Path)组合, 且优先选择被抢占LSP数目最少的组合实施抢占。通过Matlab的仿真结果表明, BH-PREPT算法在提高带宽利用率方面比V PREPT算法更具有优势。

关 键 词:区分服务  流量工程  抢占算法  BH-PREPT算法  标记交换路径
收稿时间:2012-10-08

New Preempting Algorithm of LSP for DS-TE Networks
XU Lei,YU Yin-hui,LI Jin-ming,WANG Jun-zhu.New Preempting Algorithm of LSP for DS-TE Networks[J].Journal of Jilin University:Information Sci Ed,2013,31(3):223-227.
Authors:XU Lei  YU Yin-hui  LI Jin-ming  WANG Jun-zhu
Institution:1. Network Management Center, China Mobile Communications Corporation Jilin Branch, Changchun 130033, China;2. College of Communication Engineering, Jilin University, Changchun 130012, China;3. College of Electronic and Information Engineering, Changchun University of Science and Technology, Changchun 130022, China
Abstract:The V-PREPT(Versatile Preemption) algorithm, which has better flexibility, but only concerns with minimizing the total cost of preemption. Its utilization of bandwidth is not good. Under the premise of minimizing the total cost of preemption an algorithm named BH-PREPT(Bandwidth Preemption) to improve the utilization of bandwidth is proposed. TheBH-PREPT algorithm ensures that the total bandwidth preempted meets the bandwidth demand finds out the minimum total cost of preempted LSP(Label Switching Path)by taking the enumeration method. And the combination with the minimum number of preempted LSP will have priority when preemption occurs. By Matlab simulation the BH-PREPT algorithm is proved to have better properties concerning with minimizing the totalcost of preemption than V-PREPT.
Keywords:diffServ  traffic engineering  preempting algorithm  bandwidth preemption(BH-PREPT)algorithm  label switching path(LSP)  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《吉林大学学报(信息科学版)》浏览原始摘要信息
点击此处可从《吉林大学学报(信息科学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号