首页> 美国卫生研究院文献>PLoS Clinical Trials >A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks
【2h】

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks

机译:软件定义网络的流路由和轮询切换选择优化方案

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP) model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme.
机译:本文旨在最小化在软件定义网络(SDN)中收集流信息的通信成本。由于基于流的信息收集方法需要太多的通信成本,并且最近提出的基于开关的方法不能从控制流路由中受益,因此提出了共同优化流路由和轮询开关选择以降低通信成本。为此,首先将联合优化问题表述为整数线性规划(ILP)模型。由于ILP模型在大型网络中难以处理,因此我们还为多根树形拓扑设计了一种优化算法,为一般拓扑设计了一种有效的启发式算法。根据广泛的仿真,发现与基于开关的最新方案相比,我们的方法可以节省高达55.76%的通信成本。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号