首页> 中文期刊> 《通信学报》 >SDN中基于过程优化的交换机竞争迁移算法

SDN中基于过程优化的交换机竞争迁移算法

         

摘要

针对分布式软件定义网络中交换机迁移对象选取僵化和迁移冲突问题,提出一种基于过程优化的交换机竞争迁移(SCM,switch competing migration)算法.将原有的交换机迁移方案优化为迁移对象选取和交换机动态部署2个过程.首先,综合权衡网络中时延、流量和故障代价,灵活地选取迁移对象;然后,根据设定的存活期、迁移期和控制器负载动态门限值,交换机以竞争迭代的方式动态部署到目标控制器.仿真结果表明,与现有的算法相比,迁移对象的选取更加合理,避免交换机迁移冲突,控制器负载均衡率平均提升了25.6%.%In the distributed software defined network,switch selects rigid migration object and has coordinating migration problems.The prime switch migration scheme into two processes included selecting migration object and deploying switches dynamically was optimized,a switch competing migration algorithm was proposed based on process optimization.Firstly,it synthesized delay,traffic and failure cost,and selected migration object.Then,according to survival time,migration time and dynamic load threshold of controller,switches were migrated into object controller through iterative competition.Results show that compared with the existed migration algorithms the proposed algorithm selects more reasonable migration objects,avoiding migration conflict between switches,and controller load balancing rate has been promoted to 25.6% averagely.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号