吉林大学学报（信息科学版）2013，Vol.31Issue(3)：223-227,5.
DS-TE环境下LSP抢占算法
New Preempting Algorithm of LSP for DS-TE Networks
摘要
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.The BH-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 total cost of preemption than V-PREPT.关键词
区分服务/流量工程/抢占算法/BH-PREPT算法/标记交换路径Key words
diffServ/ traffic engineering/ preempting algorithm/ bandwidth preemption(BH-PREPT) algorithm/label switching path (LSP)分类
信息技术与安全科学引用本文复制引用
徐蕾,于银辉,李金明,王君竹..DS-TE环境下LSP抢占算法[J].吉林大学学报（信息科学版）,2013,31(3):223-227,5.基金项目
国家自然科学基金资助项目(U0935001) （U0935001）
