DS-TE环境下LSP抢占算法

吉林大学学报(信息科学版)

• 论文 • 下一篇

DS-TE环境下LSP抢占算法

徐蕾¹, 于银辉², 李金明², 王君竹³

1. 中国移动通信集团吉林有限公司网管中心, 长春 130033; 2. 吉林大学通信工程学院,长春 130012； 3. 长春理工大学电子信息工程学院, 长春 130022

收稿日期:2012-10-08 出版日期:2013-05-27 发布日期:2013-06-07
作者简介:徐蕾(1986—), 女, 长春人, 硕士, 主要从事宽带通信研究, (Tel)86-18343120066(E-mail)497736163@qq.com; 于银辉(1964—), 女, 山东泰安人, 吉林大学教授, 硕士生导师, 主要从事宽带通信, 流量工程研究, (Tel)86-13604319589(E-mail)yuyh@jlu.edu.cn。
基金资助:
国家自然科学基金资助项目（U0935001)

New Preempting Algorithm of LSP for DS-TE Networks

XU Lei¹, YU Yin-hui², LI Jin-ming², WANG Jun-zhu³

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

Received:2012-10-08 Online:2013-05-27 Published:2013-06-07

摘要/Abstract

摘要：

原有V-PREPT(Versatile Preemption)算法关心的是抢占总代价最小化, 灵活性较好但带宽利用率不高。为此, 在研究DS-TE环境下的抢占机制及现行的抢占算法基础上, 提出了BH-PREPT(Bandwidth Preemption)算法。该算法能在最小化抢占总代价的条件下提高带宽的利用率, 在保证被抢占的总带宽满足需求带宽的前提下, 通过采取枚举法找出抢占总代价最小的LSP(Label Switching Path)组合, 且优先选择被抢占LSP数目最少的组合实施抢占。通过Matlab的仿真结果表明, BH-PREPT算法在提高带宽利用率方面比VPREPT算法更具有优势。

关键词: 区分服务, 流量工程, 抢占算法BH-PREPT算法, 标记交换路径

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.

Key words: diffServ, traffic engineering, preempting algorithm, bandwidth preemption(BH-PREPT)algorithm, label switching path(LSP)

中图分类号:

TN914

徐蕾, 于银辉, 李金明, 王君竹. DS-TE环境下LSP抢占算法[J]. 吉林大学学报(信息科学版), 2013, 31(3): 223-227.

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 Science Ed, 2013, 31(3): 223-227.

[1]	陈登昭, 于银辉, 黄金海, 李金明. 基于DS-TE 技术的VPN 的LSP 抢占算法[J]. 吉林大学学报(信息科学版), 2015, 33(6): 615-.
[2]	徐蕾\|于银辉\|董小刚\|郭蕊\|张汇川. DS-TE网络环境中的抢占算法[J]. J4, 2011, 29(03): 202-.
[3]	翟红艺. IP网络QoS策略管理工具设计[J]. J4, 2011, 29(03): 225-.

DS-TE环境下LSP抢占算法

New Preempting Algorithm of LSP for DS-TE Networks

PDF (PC)

赞

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 3

Metrics

本文评价

推荐阅读 0