• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computer Communication and Networks >Bandwidth Preemption for High-Priority Data Transfer on Dedicated Channels
【24h】

Bandwidth Preemption for High-Priority Data Transfer on Dedicated Channels

机译：带宽抢占专用频道上的高优先级数据传输

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Bandwidth reservation has been increasingly used to provide QoS for various network applications. To accommodate a high-priority bandwidth reservation request (BRR), the bandwidth scheduler sometimes needs to preempt existing bandwidth reservations that have been made for BRRs with a lower priority, which is traditionally known as connection preemption. When such preemption is unavoidable, one primary goal of bandwidth scheduling is to minimize the disruption to existing reservations. In this paper, we study the problem of bandwidth reservation preemption for two types of BRRs, bandwidth- and data transfer-oriented, respectively, on one given link of the scheduling network with two different objectives: (i) minimize the number and then the total bandwidth of existing bandwidth reservations to be preempted, and (ii) minimize the total bandwidth and then the number of existing bandwidth reservations to be preempted. We prove these four problems to be NP-complete and propose a heuristic algorithm for each. We also design baseline heuristic algorithms for performance comparison. Extensive simulation results show that the proposed heuristic algorithms outperform those in comparison.
机译：带宽预留越来越多地用于为各种网络应用提供QoS。为了适应高优先级的带宽预留请求（BRR），带宽调度程序有时需要抢占具有较低优先级的BRR的现有带宽保留，传统上称为连接抢占抢占。当这种抢占是不可避免的，带宽调度的一个主要目标是最小化对现有预留的中断。在本文中，我们研究了两个类型的BRR，带宽和数据转移到定向的带宽预留抢占的问题，其中包含两个不同的目标：（i）最小化数量，然后最小化要抢占的现有带宽保留的总带宽，（ii）最小化总带宽，然后最小化现有带宽保留的数量。我们证明这四个问题是NP-Tress，并为每个问题提出一种启发式算法。我们还设计了基线启发式算法进行性能比较。广泛的仿真结果表明，所提出的启发式算法优于相比之下的启发式算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号