期刊文献+

基于图非均衡划分的软件定义网络异构控制器负载优化部署 被引量:4

Load-aware optimal placement for heterogeneous controllers in software-defined networking based on unbalanced graph partitioning
在线阅读 下载PDF
导出
摘要 大规模软件定义网络(SDN)往往需要逻辑上集中的控制器在物理上分布式部署。针对控制器部署中控制器负载不均衡的问题,提出一种基于图非均衡划分的SDN异构控制器负载优化部署方法。首先,分析控制器部署要求以及部署带来的控制器负载均衡和时延问题;其次,利用图论和余弦相似度,量化描述和计算异构控制器情况下的控制器负载均衡和时延,并运用图划分理论将控制器负载优化部署问题转化为一个具体的图划分问题;最后,基于多级划分的图划分思想,提出控制器负载优化部署方法。对实际网络拓扑的模拟实验结果表明,提出的部署方法可以有效实现接近最优的控制器负载分布。 In wide-area Software Defined Networking( SDN) deployments,logically centralized controllers are usually physically placed in a distributed manner. To address the unbalanced controller load problem in controller placement,a loadaware optimal placement for heterogeneous controllers based on unbalanced graph partitioning was proposed. First,the controller placement problem and related metrics,controller load balance and latency,were analyzed. Secondly,controller load balance and latency caused by controller placement were quantified and computed using graph theory and cosine similarity. Moreover,based on graph partitioning theory,the load-aware controller placement problem was transformed into a specified graph partitioning problem. Finally,a load-aware optimal controller placement scheme was presented based on multilevel graph partitioning. Simulation experiments conducted on real network topologies indicate that the proposed scheme can effectively achieve nearly optimal controller load balance.
出处 《计算机应用》 CSCD 北大核心 2016年第4期883-888,893,共7页 journal of Computer Applications
基金 国家自然科学基金资助项目(61272107 61202173 61103068) 高效能服务器和存储技术国家重点实验室开放基金资助项目(2014HSSA10) 上海市优秀学科带头人计划项目(10XD1404400) 华为创新研究计划项目(IRP-2013-12-03)~~
关键词 软件定义网络 控制器 优化部署 图划分 负载均衡 Software-Defined Networking(SDN) controller optimal placement graph partitioning load balance
  • 相关文献

参考文献3

二级参考文献56

  • 1Freund R F, Siegel H J. Heterogeneous processing. Computer, 1993,26(6):18~27
  • 2Karypis G, Kumar V, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J Sci Comput, 1998,20 (1) : 359-392
  • 3Karypis G, Kumar Vo Multilevel k-way Partitioning Scheme for Irregular Graphs, J Parallel Distrib Comput,1998,48(1) :96~129
  • 4Hendrickson B, Leland tL An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J Sci Comput,1995,16(2) : 452~469
  • 5Miller G L, Teng Shang-Hua, Vavasis S A. A unified geometric approach to graph separators. In: Proceedings of 31st Annual Symposium on Foundations of Computer Science, 1991. 538~547
  • 6Hendrickson B, Leland R. A multilevel algorithm for partitioning graphs: [Technical Report]. SAND93-1301, Sandia National Laboratories, 1993
  • 7Kernighan B W, Lin S. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 1970,49(2) :291~307
  • 8http://staffweb.cms. gre ac. uk/-c. walshaw/partition
  • 9GREENBERG A, HJALMTYSSON G, MALTZ A D, et al. A clean slate 4D approach to network control and management[J]. SIGCOMM Com- puter Communication Review, 2005, 35(5): 41- 54.
  • 10CAESAR M, CALDWELL D, FEAMSTER N, et al. Design and implementation of a routing control platform[C]// Proceedings of the 2nd conference on Symposium on Networked Sys- tems Design and Implementation (NSDI 2005) Volume 2: May 2-4, 2005, Boston, MA, USA. USENIX Association, 2005:15-28.

共引文献43

同被引文献53

引证文献4

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部