Identifying elephant flows through packet sampling and invertible Bloom Filter

With the high-speed network developing and the host information is difficult to recover among hashing when identifying el-ephant flows.An algorithm is proposed to identify elephant flows by using packet sampling and invertible bloom filter.Hash functions carrying the host information are used.The host information can be recovered easily through the overlapping and the consistent number of hash string.The independent hash space preserved for each different hash function reduces the internal confliction among hashing.The experiments show that the identification and length information of elephant flows can be obtained accurately by using this algorithm.