【24h】

A NEW TOPOLOGY-AWARE LSP PREEMPTION POLICY FOR DIFFSERV-BASED MPLS NETWORKS

机译:基于区分服务的MPLS网络的一种新的拓扑算法LSP优先策略

获取原文
获取原文并翻译 | 示例

摘要

In this paper, a new topology-aware preemption policy (PREPATH) is proposed in order to search for preemptable LSPs and free bandwidth for a new high priority LSP setup request. PREPATH combines the three main preemption optimization criteria: number of LSPs to be preempted, priority of LSPs to be preempted, and amount of bandwidth to be preempted. Enhancing our previously proposed preemption policy, which searches for preemptable LSPs on a link by link basis, our new policy searches for preemptable candidates along a physical path. An heuristic for PREPATH was derived, and simulation results show its accuracy. Performance comparisons of a non-preemptive approach, PREPATH, and the policy in use by commercial routers are included.
机译:本文提出了一种新的可感知拓扑的抢占策略(PREPATH),以便为新的高优先级LSP建立请求搜索可抢占LSP和可用带宽。 PREPATH结合了三个主要的抢占优化标准:要抢占的LSP数量,要抢占的LSP优先级和要抢占的带宽量。增强了我们先前提出的抢占策略(该策略在逐个链接的基础上搜索可抢占的LSP),我们的新策略沿物理路径搜索了可抢占的候选对象。推导了PREPATH的启发式算法,仿真结果表明了其准确性。包括非抢占式方法PREPATH的性能比较,以及商用路由器使用的策略。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号