【摘要】 给出了利用Bloom filter识别长流的算法。提出了使用分层哈希的方法,减少了在哈希过程中的冲突。采用带有部分主机信息的哈希函数,利用哈希串的重叠和数量上的一致性,使在识别长流的过程中能够很方便地还原出主机的信息;给每个哈希函数独立的存储空间,也在很大程度上减少了哈希过程中所带来的内部冲突。更多还原

【Abstract】 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.更多还原