• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Network Management >Power-efficient routing for SDN with discrete link rates and size-limited flow tables: A tree-based particle swarm optimization approach
【24h】

Power-efficient routing for SDN with discrete link rates and size-limited flow tables: A tree-based particle swarm optimization approach

机译：具有离散链接速率和受大小限制的流表的SDN的高效节能路由：基于树的粒子群优化方法

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

摘要

Software-defined networking is a promising networking paradigm for achieving programmability and centralized control in communication networks. These features simplify network management and enable innovation in network applications and services such as routing, virtual machine migration, load balancing, security, access control, and traffic engineering. The routing application can be optimized for power efficiency by routing flows and coalescing them such that the least number of links is activated with the lowest link rates. However, in practice, flow coalescing can generally overflow the flow tables, which are implemented in a size-limited and power-hungry ternary content addressable memory (TCAM). In this paper, a set of practical constraints is imposed to the software-defined networking routing problem, namely, size-limited flow table and discrete link rate constraints, to ensure applicability in real networks. Because the problem is NP-hard and difficult to approximate, a low-complexity particle swarm optimization-based and power-efficient routing (PSOPR) heuristic is proposed. Performance evaluation results revealed that PSOPR achieves more than 90% of the optimal network power consumption while requiring only 0.0045% to 0.9% of the optimal computation time in real-network topologies. In addition, PSOPR generates shorter routes than the optimal routes generated by CPLEX.
机译：软件定义网络是实现通信网络中的可编程性和集中控制的有前途的网络范例。这些功能简化了网络管理，并实现了网络应用程序和服务的创新，例如路由，虚拟机迁移，负载平衡，安全性，访问控制和流量工程。可以通过路由流并合并流来优化路由应用程序的电源效率，从而以最低的链路速率激活最少数量的链路。但是，实际上，流合并通常会使流表溢出，流表在大小受限且耗电的三元内容可寻址存储器（TCAM）中实现。在本文中，对软件定义的网络路由问题施加了一组实际约束，即大小限制流表和离散链路速率约束，以确保在实际网络中的适用性。由于该问题是NP难题，难以估计，因此提出了一种基于低复杂度粒子群优化和高能效路由（PSOPR）的启发式算法。性能评估结果表明，在实际网络拓扑中，PSOPR可以达到最佳网络功耗的90％以上，而所需的最佳计算时间仅为0.0045％至0.9％。此外，PSOPR生成的路由比CPLEX生成的最佳路由短。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号