Binghao Yan, Qinrang Liu, Jianliang Shen, Dong Liang, Xingyu Liu
{"title":"基于openflow的SDN高效准确的流量统计数据采集","authors":"Binghao Yan, Qinrang Liu, Jianliang Shen, Dong Liang, 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, Qinrang Liu, Jianliang Shen, Dong Liang, 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}
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.
期刊介绍:
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.