中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
an identification method combining data streaming counting with probabilistic fading for heavy-hitter flows
Author: Li Zhen ; Yang Yahui ; Xie Gaogang ; Qin Guangcheng
Keyword: Data reduction ; Network management
Source: Jisuanji Yanjiu yu Fazhan/Computer Research and Development
Issued Date: 2011
Volume: 48, Issue:6, Pages:1010-1017
Indexed Type: EI
Department: (1) School of Software and Microelectronics Peking University Beijing 102600 China; (2) Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China; (3) Institute of Communication Engineering PLA University of Science and Technology Nanjing 210007 China
Abstract: Identifying heavy-hitter flows in the network is of tremendous importance for many network management activities. Heavy-hitter flows identification is essential for network monitoring, management, and charging, etc. Network administrators usually pay special attention to these Heavy-hitter flows. How to find these flows has been the concern of many studies in the past few years. Lossy counting and probabilistic lossy counting are among the most well-known algorithms for finding Heavy-hitters. But they have some limitations. The challenge is finding a way to reduce the memory consumption effectively while achieving better accuracy. In this work, a probabilistic fading method combining data streaming counting is proposed, which is called PFC(probabilistic fading counting). This method leverages the advantages of data streaming counting, and it manages to find the heavy-hitter by analyzing the power-low characteristic in the network flow. By using network's power-law and continuity, PFC accelerates the removal of non-active and aging flows in table records. So PFC reduces memory consumption, and decreases false positive ratio too. Comparisons with lossy counting and probabilistic lossy counting based on real Internet traces suggest that PFC is remarkably efficient and more accurate. Particularly, experiment results show that PFC has 60% lower memory consumption without increasing the false positive ratio.
English Abstract: Identifying heavy-hitter flows in the network is of tremendous importance for many network management activities. Heavy-hitter flows identification is essential for network monitoring, management, and charging, etc. Network administrators usually pay special attention to these Heavy-hitter flows. How to find these flows has been the concern of many studies in the past few years. Lossy counting and probabilistic lossy counting are among the most well-known algorithms for finding Heavy-hitters. But they have some limitations. The challenge is finding a way to reduce the memory consumption effectively while achieving better accuracy. In this work, a probabilistic fading method combining data streaming counting is proposed, which is called PFC(probabilistic fading counting). This method leverages the advantages of data streaming counting, and it manages to find the heavy-hitter by analyzing the power-low characteristic in the network flow. By using network's power-law and continuity, PFC accelerates the removal of non-active and aging flows in table records. So PFC reduces memory consumption, and decreases false positive ratio too. Comparisons with lossy counting and probabilistic lossy counting based on real Internet traces suggest that PFC is remarkably efficient and more accurate. Particularly, experiment results show that PFC has 60% lower memory consumption without increasing the false positive ratio.
Language: 中文
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16182
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Li Zhen,Yang Yahui,Xie Gaogang,et al. an identification method combining data streaming counting with probabilistic fading for heavy-hitter flows[J]. Jisuanji Yanjiu yu Fazhan/Computer Research and Development,2011-01-01,48(6):1010-1017.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Li Zhen]'s Articles
[Yang Yahui]'s Articles
[Xie Gaogang]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Li Zhen]‘s Articles
[Yang Yahui]‘s Articles
[Xie Gaogang]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2020  中国科学院软件研究所 - Feedback
Powered by CSpace