• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>2016 IFIP Networking Conference and Workshops >Arrange your network updates as you wish
【24h】

Arrange your network updates as you wish

机译：根据需要安排网络更新

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Updating network configurations responding to dynamic changes is still a tricky task in SDN. During the update process, in-flight packets might misuse different versions of rules, and ¿¿¿hot¿¿¿ links could be overloaded due to the unplanned update order. As for the problem of misusing rule, recently proposed suggestions like two-phase mechanism and Customizable Consistency Generator (CCG) have provided generic and customizable solutions. Yet, there does not exist an approach that is flexible to avoid the transient congestion on hot links respecting to diverse user requirements like guaranteeing update deadline, managing transient throughput loss, etc.; controllers urgently need one. In this paper, we propose CUP, Customizable Update Planner, to seek the solution. Different from prior approaches that adopt fixed designs for a single purpose like optimizing the update speed (e.g., Dionysus) or avoiding congestions (e.g., zUpdate, SWAN), CUP introduces generic linear programming models to formulate user-specified requirements and the update planning problem. By solving these customized models, CUP is able to plan network updates according to a large fraction of user requirements, such as guaranteeing deadlines, prioritizing operation orders, managing throughput loss, etc., while avoiding transient congestion. We prototype CUP on Ryu and employ it to arrange updates for networks built upon Mininet. Results confirm the flexibility of CUP while indicating that it always obtains the ¿¿¿best¿¿¿ update plans following the user's wish.
机译：在SDN中，更新网络配置以响应动态变化仍然是一项艰巨的任务。在更新过程中，传输中的数据包可能会滥用不同版本的规则，并且由于计划外的更新顺序，可能会超载“热”链接。对于滥用规则的问题，最近提出的建议如两阶段机制和可定制一致性生成器（CCG）提供了通用且可定制的解决方案。但是，还没有一种方法可以灵活地避免热链路上因各种用户要求而引起的瞬时拥塞，例如保证更新期限，管理瞬时吞吐量损失等。管制员迫切需要一个。在本文中，我们提出了CUP（可定制更新计划程序）以寻求解决方案。与先前为单一目的采用固定设计（例如优化更新速度（例如Dionysus）或避免拥塞）（例如zUpdate，SWAN）的现有方法不同，CUP引入了通用线性编程模型来制定用户指定的需求和更新计划问题。通过解决这些定制的模型，CUP能够根据用户的大部分需求计划网络更新，例如保证截止日期，确定操作顺序的优先级，管理吞吐量损失等，同时避免了短暂的拥塞。我们在Ryu上制作CUP原型，并使用它为基于Mininet的网络安排更新。结果证实了CUP的灵活性，同时表明它始终按照用户的意愿获得“最佳”更新计划。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号