基于openflow的SDN高效准确的流量统计数据采集

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Binghao Yan, Qinrang Liu, Jianliang Shen, Dong Liang, Xingyu Liu
{"title":"基于openflow的SDN高效准确的流量统计数据采集","authors":"Binghao Yan,&nbsp;Qinrang Liu,&nbsp;Jianliang Shen,&nbsp;Dong Liang,&nbsp;Xingyu Liu","doi":"10.1002/nem.2197","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Network resource scheduling and optimization require the acquisition of status information as a basis. High-cost solutions lead to more resource consumption but only bring negligible benefits. To address this challenge, this paper proposes a novel statistics collection method adapted to OpenFlow-based SDN, which can reduce the measurement cost while ensuring the statistical accuracy. First, based on the complex network theory, we propose multi-path weighted closeness centrality (MWCC) to perform importance ranking on network switching nodes, which helps us select top-k key nodes for statistical collection to reduce the overhead. Second, we propose an adaptive flow rule timeout mechanism AFRT. AFRT continuously optimizes the rule timeout values based on statistical results, further balancing flow table overhead and statistical accuracy. A series of simulation results on real network topologies verify the superiority of the proposed method in terms of communication cost, statistical accuracy, and time consumption, compared with the existing representative methods.</p>\n </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"32 4","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2022-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Cost-effective and accurate flow statistics collection in OpenFlow-based SDN\",\"authors\":\"Binghao Yan,&nbsp;Qinrang Liu,&nbsp;Jianliang Shen,&nbsp;Dong Liang,&nbsp;Xingyu Liu\",\"doi\":\"10.1002/nem.2197\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>Network resource scheduling and optimization require the acquisition of status information as a basis. High-cost solutions lead to more resource consumption but only bring negligible benefits. To address this challenge, this paper proposes a novel statistics collection method adapted to OpenFlow-based SDN, which can reduce the measurement cost while ensuring the statistical accuracy. First, based on the complex network theory, we propose multi-path weighted closeness centrality (MWCC) to perform importance ranking on network switching nodes, which helps us select top-k key nodes for statistical collection to reduce the overhead. Second, we propose an adaptive flow rule timeout mechanism AFRT. AFRT continuously optimizes the rule timeout values based on statistical results, further balancing flow table overhead and statistical accuracy. A series of simulation results on real network topologies verify the superiority of the proposed method in terms of communication cost, statistical accuracy, and time consumption, compared with the existing representative methods.</p>\\n </div>\",\"PeriodicalId\":14154,\"journal\":{\"name\":\"International Journal of Network Management\",\"volume\":\"32 4\",\"pages\":\"\"},\"PeriodicalIF\":1.5000,\"publicationDate\":\"2022-02-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Network Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/nem.2197\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Network Management","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/nem.2197","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 1

摘要

网络资源的调度和优化需要状态信息的获取作为基础。高成本的解决方案会消耗更多的资源,但带来的效益却微不足道。针对这一挑战,本文提出了一种适合于基于openflow的SDN的新型统计采集方法,在保证统计准确性的同时降低了测量成本。首先,基于复杂网络理论,我们提出了多路径加权接近中心性(MWCC)对网络交换节点进行重要度排序,帮助我们选择top-k的关键节点进行统计收集,减少了开销。其次,提出了自适应流规则超时机制AFRT。AFRT根据统计结果不断优化规则超时值,进一步平衡流表开销和统计精度。在实际网络拓扑上的一系列仿真结果验证了该方法在通信成本、统计精度和时间消耗等方面优于现有代表性方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Cost-effective and accurate flow statistics collection in OpenFlow-based SDN

Cost-effective and accurate flow statistics collection in OpenFlow-based SDN

Network resource scheduling and optimization require the acquisition of status information as a basis. High-cost solutions lead to more resource consumption but only bring negligible benefits. To address this challenge, this paper proposes a novel statistics collection method adapted to OpenFlow-based SDN, which can reduce the measurement cost while ensuring the statistical accuracy. First, based on the complex network theory, we propose multi-path weighted closeness centrality (MWCC) to perform importance ranking on network switching nodes, which helps us select top-k key nodes for statistical collection to reduce the overhead. Second, we propose an adaptive flow rule timeout mechanism AFRT. AFRT continuously optimizes the rule timeout values based on statistical results, further balancing flow table overhead and statistical accuracy. A series of simulation results on real network topologies verify the superiority of the proposed method in terms of communication cost, statistical accuracy, and time consumption, compared with the existing representative methods.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Network Management
International Journal of Network Management COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
5.10
自引率
6.70%
发文量
25
审稿时长
>12 weeks
期刊介绍: Modern computer networks and communication systems are increasing in size, scope, and heterogeneity. The promise of a single end-to-end technology has not been realized and likely never will occur. The decreasing cost of bandwidth is increasing the possible applications of computer networks and communication systems to entirely new domains. Problems in integrating heterogeneous wired and wireless technologies, ensuring security and quality of service, and reliably operating large-scale systems including the inclusion of cloud computing have all emerged as important topics. The one constant is the need for network management. Challenges in network management have never been greater than they are today. The International Journal of Network Management is the forum for researchers, developers, and practitioners in network management to present their work to an international audience. The journal is dedicated to the dissemination of information, which will enable improved management, operation, and maintenance of computer networks and communication systems. The journal is peer reviewed and publishes original papers (both theoretical and experimental) by leading researchers, practitioners, and consultants from universities, research laboratories, and companies around the world. Issues with thematic or guest-edited special topics typically occur several times per year. Topic areas for the journal are largely defined by the taxonomy for network and service management developed by IFIP WG6.6, together with IEEE-CNOM, the IRTF-NMRG and the Emanics Network of Excellence.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信