|
|||||
|
|
| 基于流重复信息检测来估寻服务节点 | |
| 引用本文： | 周昌令,肖建国,崔建,张蓓,李峰.基于流重复信息检测来估寻服务节点[J].中国通信学报,2012,9(5):75-89. |
| 作者姓名： | 周昌令 肖建国 崔建 张蓓 李峰 |
| 摘 要： | |
| 收稿时间： | 2012-07-03; |
Approximate Discovery of Service Nodes by Duplicate Detection in Flows |
|
| Zhou Changling,Xiao Jianguo,Cui Jian,Zhang Bei,Li Feng.Approximate Discovery of Service Nodes by Duplicate Detection in Flows[J].China communications magazine,2012,9(5):75-89. | |
| Authors: | Zhou Changling Xiao Jianguo Cui Jian Zhang Bei Li Feng |
| Institution: | 1Computer Center, Peking University, Beijing 100871, P. R. China 2School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, P. R. China 3Institute of Computer Science & Technology, Peking University, Beijing 100871, P. R. China 4Shenyang Academy of Governance, Shenyang 110000, P. R. China |
| Abstract: | Discovery of service nodes in flows is a challenging task, especially in large ISPs or campus networks where the amount of traffic across network is massive. We propose an effective data structure called Round-robin Buddy Bloom Filters (RBBF) to detect duplicate elements in flows. A two-stage approximate algorithm based on RBBF which can be used for detecting service nodes from NetFlow data is also given and the performance of the algorithm is analyzed. In our case, the proposed algorithm uses about 1% memory of hash table with false positive error rate less than 5% . A prototype system, which is compatible with both IPv4 and IPv6, using the proposed data structure and algorithm is introduced. Some real world case studies based on the prototype system are discussed. |
| Keywords: | duplicate detection service nodes discovery buddy bloom filter round-robin schema NetFlow |
| 点击此处可从《中国通信学报》浏览原始摘要信息 | |
| 点击此处可从《中国通信学报》下载免费的PDF全文 | |