2008Jisuanji yingyong yanjiuRequires access

Identifying elephant flows using Bloom filter

Baiying Lei

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Bloom filter, Hash function, Computer science, Dynamic perfect hashing, SHA-2, Hash table, Host (biology), Hash tree

Related papers

Back to paper searchBrowse research topicsOriginal source
Identifying elephant flows using Bloom filter — Research Paper | ScholarLens