Abstract
Identifying elephant flows is very important in developing effective and efficient traffic engineering schemes. In addition, obtaining the statistics of these flows is also very useful for network operation and management. In this paper, we propose a novel method to identify elephant flows by introducing a Reversible Counting Bloom Filter (RCBF), a special Counting Bloom Filter. The RCBF consists of 6 Hash functions which projectively select some consecutive bits from original strings as function values. We obtain the information of elephant flow using the overlapping of hash bit strings of the RCBF and heavy-tailed feature of flow distribution. The theoretical analysis and experiment results show that this method can precisely and efficiently identify elephant flows.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
