Identifying elephant flows using Bloom filter
Baiying Lei
Abstract
Baiying Lei
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Bloom filter, Hash function, Computer science, Dynamic perfect hashing, SHA-2, Hash table, Host (biology), Hash tree