• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>2016 Al-Sadiq International Conference on Multidisciplinary in IT and Communication Techniques Science and Applications >Routing algorithm optimization for software defined network WAN
【24h】

Routing algorithm optimization for software defined network WAN

机译：软件定义的网络WAN的路由算法优化

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

摘要

Software Defined Network (SDN) provides a new fine-grained interface enables the routing algorithm to have an a global view of the network throughputs, connectivity and flows at the data-path. This paper aims to provide a novel approach for dynamic routing algorithm for Software Defined Network in Wide Area Network (SDN-WAN); based on using a modified shortest-widest path algorithm with a fine-grained statistical method from the OpenFlow interface, called Shortest-Feasible OpenFlow Path (SFOP). This algorithm is designed to identify the optimal route from source to destination, providing efficient utilization of the SDN-WAN resources. It achieves this aim by considering both the flow requirements and the current state of the network. SFOP computes the optimal path which provides the feasible bandwidth with the lowest hop count (delay). That will present better stability in SDN communication, QoS, and usage of available resources. Moreover, this algorithm will be the base for an SDN controller because it extracts the widest available bandwidth from source to destination for a single path. It enables the controller to decide whether it is enough to use this simple algorithm only, or if a more complicated algorithm that provides larger bandwidth such as multiple-path algorithms is needed. Finally, a testbed has been implemented using MATLAB Simulator, Pox controller, and Mininet emulator will be discussed. The latency comparison of SFOP algorithm with three other algorithm's latencies shows that this algorithm finds better latency for an optimal path. Evidence will be shown that demonstrates that SFOP has good stability in dynamic changes of SDN-WAN.
机译：软件定义网络（SDN）提供了新的细粒度接口，使路由算法可以全局查看数据路径上的网络吞吐量，连接性和流量。本文旨在为广域网（SDN-WAN）中的软件定义网络提供一种动态路由算法的新方法。基于改进的最短最宽路径算法和来自OpenFlow界面的细粒度统计方法，称为最可行的开放流路径（SFOP）。该算法旨在识别从源到目的地的最佳路由，从而有效利用SDN-WAN资源。它通过考虑流量需求和网络的当前状态来实现此目标。 SFOP计算最佳路径，该路径以最小的跳数（延迟）提供可行的带宽。这将在SDN通信，QoS和可用资源使用方面提供更好的稳定性。而且，该算法将成为SDN控制器的基础，因为它为一条路径提取了从源到目标的最宽可用带宽。它使控制器能够决定仅使用此简单算法是否足够，或者是否需要提供更大带宽的更复杂的算法（例如多路径算法）。最后，将使用MATLAB Simulator，Pox控制器和Mininet仿真器来实现测试平台。 SFOP算法的延迟与其他三种算法的延迟比较表明，该算法为最佳路径找到了更好的延迟。将显示证据表明SFOP在SDN-WAN的动态变化中具有良好的稳定性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号