首页> 外文期刊>Advanced Science Letters >KLA-Based Partitioning Mechanism for Inter-Domain Cost Minimization in Software Defined Networks
【24h】

KLA-Based Partitioning Mechanism for Inter-Domain Cost Minimization in Software Defined Networks

机译:基于KLA的域间成本最小化的基于KLA的分区机制

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

摘要

Software Defined Networking (SDN) is a new emerging paradigm, yearning for a programmable network by increasing flexibility of today’s network. The fundamental idea behind this new architecture is to simplify the network complexity by decoupling network control logic from it’sdata-forwarding by centralizing the control logic. To increase the scalability and flexibility of controllers, the OpenFlow controllers are distributed into domains based on location and network types. However, most critical issue is minimizing the communication cost between the controllerdomains. This paper addresses the cost minimization issue by proposing Kernighan-Lin-based Partitioning (KLAP) mechanism applied to partition the network by distributing the workload between network devices. The implementation of the mechanism is under OMNeT++ simulation environment with INETframework and OpenFlow module. The evaluation has been carried out by comparing the performance through network throughput and delay for SDN along with the adapted graph theory. The results show that the proposed mechanism is faster and more stable than the existing solutions, as well as interms of minimizing the communication cost significantly.
机译:软件定义的网络(SDN)是一种新兴的范式,通过提高当今网络的灵活性来围绕可编程网络。这种新架构背后的基本想法是通过集中控制逻辑从IT'DATA转发解耦网络控制逻辑来简化网络复杂性。为了提高控制器的可扩展性和灵活性,开放流控制器将基于位置和网络类型分发到域中。但是,最关键的问题是最小化控制器域之间的通信成本。本文通过提出基于Kernighan-LIN-LING的分区(KLAP)机制来解决通过在网络设备之间分发工作负载来分区网络的基于基于Kernighan-LIN-LIN的分区(KLAP)机制来解决成本最小化问题。该机制的实现是具有inetframework和OpenFlow模块的OMNET ++仿真环境。通过将性能与网络吞吐量和SDN的延迟以及适应性的图论进行了比较来进行评估。结果表明,该机制比现有解决方案更快,更稳定,以及最小化通信成本的目的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号