%0 Journal Article
%T Identifying elephant flows using Bloom filter<br>利用Bloom filter实现长流识别*
%A LIU Wei-jiang
%A JING Quan
%A BAI Lei
%A <br>刘卫江
%A 景泉
%A 白磊
%J 计算机应用研究
%D 2008
%I 
%X An algorithm was given to identify elephant flows by using Bloom filter. Stratified hashing was proposed to reduce the confliction in hashing. In the process of identifying elephant flows, hash functions carrying the information of host computer were used. Using the overlapping and the consistent number of hash string, the information of host computer could be recovered easily. The independent hash space preserved for each different hash function reduced the internal confliction among hashing.
%K elephant flows
%K stratified hash
%K Bloom filter
%K threshold<br>长流
%K 分层哈希
%K Bloom滤波器
%K 阈值
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=8AFAC81C18DDB6B9CF9E467A9E72D37C&yid=67289AFF6305E306&vid=C5154311167311FE&iid=CA4FD0336C81A37A&sid=8575BEDA702C4B7C&eid=1B97AE5098AEB49C&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=13