首页> 外文期刊>Future generation computer systems >Fast congestion-free consistent flow forwarding rules update in software defined networking
【24h】

Fast congestion-free consistent flow forwarding rules update in software defined networking

机译:软房拥塞一致的流转发规则在软件定义网络中更新

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

摘要

In software defined networking (SDN), flow migration will be required when topology changes to improve network performance such as load balancing. However, black holes, loops and transient congestion may occur during flow migration due to the asynchronous update of switches on the data plane. Therefore, in this paper, we propose a novel segmented update method to shorten the time of rules update, and a novel transient congestion avoidance algorithm to minimize the number of delayed updating flows, which can both reduce update time of flows. Specifically, we construct three novel models to guarantee no black holes, no loops and no transient congestion, respectively. The first two models to avoid black holes and loops can update multiple nodes in each segment instead of updating the nodes one by one like Cupid. The third model to avoid transient congestion minimizes the number of delayed updating flows. Subsequently, three novel black holes avoidance algorithm, loops avoidance algorithm and congestion avoidance algorithm are respectively proposed. Furthermore, we propose a novel rules update (RU) algorithm which combines these three algorithms to update the rules to avoid black holes, loops and transient congestion simultaneously. Simulation results show that our scheme can increase the number of directly updated flows by 75% on a single congestion link and reduce the rules update time of the flows by 34% compared with the existing work. (C) 2019 Elsevier B.V. All rights reserved.
机译:在软件定义的网络(SDN)中,将在拓扑改变以提高负载平衡之类的网络性能时,将需要流迁移。然而,由于数据平面上的开关的异步更新,在流动迁移期间可能发生黑洞,环路和瞬态充血。因此,在本文中,我们提出了一种新的分段更新方法来缩短规则更新的时间,以及一种新的瞬态拥塞避免算法,以最小化延迟更新流的数量,这可以减少流动的更新时间。具体而言,我们构建了三种新颖的模型,以保证没有黑洞,没有环,没有循环,没有瞬态充血。避免黑洞和循环的前两个模型可以更新每个段中的多个节点,而不是像丘比特一样更新节点。第三种模型以避免瞬态充血最小化延迟更新流的数量。随后,提出了三种新型黑洞避免算法,回避算法和拥塞避免算法。此外,我们提出了一种新的规则更新(Ru)算法,它结合了这三种算法来更新规则,以避免同时的黑洞,环路和瞬态拥塞。仿真结果表明,与现有工作相比,我们的方案可以将直接更新流量的数量增加75%,并减少流量的规则更新时间为34%。 (c)2019 Elsevier B.v.保留所有权利。

著录项

  • 来源
    《Future generation computer systems》 |2019年第8期|743-754|共12页
  • 作者单位

    Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China;

    Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China|Chongiqng Univ Coll Comp Sci Chongqing 400044 Peoples R China;

    Dalian Univ Coll Informat Engn Dalian 116622 Peoples R China;

    Dalian Univ Coll Informat Engn Dalian 116622 Peoples R China;

    Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China;

    Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Flow migration; Transient congestion; Update consistency; Dependency graph; Software defined networking (SDN);

    机译:流动迁移;暂时拥塞;更新一致性;依赖图;软件定义网络(SDN);

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号