浏览全部资源
扫码关注微信
1. 东南大学计算机科学与工程学院,江苏 南京 211189
2. 东南大学教育部计算机网络和信息集成重点实验室,江苏 南京 211189
[ "戴冕(1988-),男,江苏南京人,东南大学博士生,主要研究方向为软件定义网络、数据中心网络和网络测量技术等。" ]
[ "程光(1973-),男,安徽黄山人,东南大学教授、博士生导师,主要研究方向为网络测量、网络安全和网络管理等。" ]
网络出版日期:2017-10,
纸质出版日期:2017-10-25
移动端阅览
戴冕, 程光. 基于sketch的软件定义测量数据平面硬件模型[J]. 通信学报, 2017,38(10):113-121.
Mian DAI, Guang CHENG. Sketch-based data plane hardware model for software-defined measurement[J]. Journal on communications, 2017, 38(10): 113-121.
戴冕, 程光. 基于sketch的软件定义测量数据平面硬件模型[J]. 通信学报, 2017,38(10):113-121. DOI: 10.11959/j.issn.1000-436x.2017203.
Mian DAI, Guang CHENG. Sketch-based data plane hardware model for software-defined measurement[J]. Journal on communications, 2017, 38(10): 113-121. DOI: 10.11959/j.issn.1000-436x.2017203.
提出一种基于sketch数据结构的软件定义测量数据平面硬件模型,并在以现场可编程逻辑门阵列(FPGA)为核心的可编程网络设备NetMagic上进行了实现。利用部署在硬件FPGA高速SRAM中的通用sketch数据结构高效地采集数据平面流量数据,控制平面收集并缓存统计数据,提供给上层的测量应用使用。使用count-min sketch和2-universal散列函数实现了在高速流量下实时的分组处理和流量统计;使用Bloom filter在控制平面恢复流量的原始5元组信息,解决了sketch数据结构的不可逆问题。使用CERNET骨干网流量数据对原型系统进行的评估结果表明,该原型系统使用极其有限的硬件资源实现了对较大规模网络流量的实时测量,同时具备较好的测量精度。
A sketch-based data plane hardware model for software-defined measurement was introduced
and it was implemented in the programmable network device NetMagic.A generic sketch model for collecting flow-level data using high-speed memories on the FPGA was proposed
the control plane collected and cached the data for further process.Count-min sketch and 2-universal hash functions in the SRAM of FPGA for real-time traffic counting of high-speed traffic were implemented; Bloom filter was used to rebuild the original 5-tuple data which solved the irreversibility of sketch.The CERNET backbone trace to evaluate the prototype system was used
the result shows that it has the ability to use the limited hardware resource to measure a large amount of network traffic data with a proper measurement accuracy at the same time.
HOFSTEDE R,ČELEDA P , TRAMMELL B , et al . Flow monitoring explained:from packet capture to data analysis with NetFlow and IPFIX [J ] . IEEE Communications Surveys & Tutorials , 2014 , 16 ( 4 ): 2037 - 2064 .
S OMMER R , FELDMANN A . NetFlow:information loss or win? [C ] // The 2nd ACM SIGCOMM Workshop on Internet Measurment . 2002 : 173 - 174 .
MOSHREF M , YU M , GOVINDAN R , et al . SCREAM:sketch resource allocation for software-defined measurement [C ] // The 11th ACM Conference on Emerging Networking Experiments and Technologies . ACM , 2015 :14.
YU M , JOSE L , MIAO R . Software defined traffic measurement with OpenSketch [C ] // Presented as Part of the 10th USENIX Symposium on Networked Systems Design and Implementation (NSDI 13) . 2013 : 29 - 42 .
LIU Z , VORSANGER G , BRAVERMAN V , et al . Enabling a RISC approach for software-defined monitoring using universal streaming [C ] // The 14th ACM Workshop on Hot Topics in Networks . ACM , 2015 :21.
LIU Z , MANOUSIS A , VORSANGER G , et al . One sketch to rule them all:rethinking network flow monitoring with UnivMon [C ] // The 2016 Conference on ACM SIGCOMM 2016 Conference . 2016 : 101 - 114 .
CORMODE G , MUTHUKRISHNAN S . What's new:finding significant differences in network data streams [J ] . IEEE/ACM Transactions on Networking (TON) , 2005 , 13 ( 6 ): 1219 - 1232 .
LIU Y , CHEN W , GUAN Y . A fast sketch for aggregate queries over high-speed network traffic [C ] // INFOCOM . 2012 : 2741 - 2745 .
SCHWELLER R , GUPTA A , PARSONS E , et al . Reversible sketches for efficient and accurate change detection over network data streams [C ] // The 4th ACM SIGCOMM Conference on Internet Measurement . 2004 : 207 - 212 .
SCHWELLER R , LI Z , CHEN Y , et al . Reversible sketches:enabling monitoring and analysis over high-speed data streams [J ] . IEEE/ACM Transactions on Networking (ToN) , 2007 , 15 ( 5 ): 1059 - 1072 .
DAI M , CHENG G , WANG Y . Detecting network topology and packet trajectory with SDN-enabled FPGA platform [C ] // The 11th International Conference on Future Internet Technologies . 2016 : 7 - 13 .
LI T , SUN Z , JIA C , et al . Using NetMagic to observe fine-grained per-flow latency measurements [C ] // ACM SIGCOMM Computer Communication Review . 2011 , 41 ( 4 ): 466 - 467 .
BOSSHART P , DALY D , GIBB G , et al . P4:programming protocol-independent packet processors [J ] . ACM SIGCOMM Computer Communication Review , 2014 , 44 ( 3 ): 87 - 95 .
CORMODE G , MUTHUKRISHNAN S . An improved data stream summary:the count-min sketch and its applications [J ] . Journal of Algorithms , 2005 , 55 ( 1 ): 58 - 75 .
SONG H , DHARMAPURIKAR S , TURNER J , et al . Fast hash table lookup using extended Bloom filter:an aid to network processing [J ] . ACM SIGCOMM Computer Communication Review , 2005 , 35 ( 4 ): 181 - 192 .
CARTER J L , WEGMAN M N . Universal classes of hash functions [C ] // The Ninth Annual ACM Symposium on Theory of Computing . 1977 : 106 - 112 .
0
浏览量
958
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构