Abstract
With the advent of high speed links, online flow measurement for, e.g., flow round trip time (RTT), becomes difficult due to the enormous amount of requirements on computational resources. We address this problem by proposing the double-deletion bloom filter (DDBF) scheme, which alleviates potential hash collisions of a standard bloom filter by explicitly deleting used records and implicitly deleting out-of-date records. As a result, it accurately estimates the current TCP flow RTT distribution with limited memory space, even with the appearance of multipath routing and Syn flooding attacks. Theoretical analysis indicates that the DDBF scheme exhibits desirable accuracy with a constant and small amount of memory. We further validate our scheme using real traces and demonstrate significant memory-saving without degrading accuracy.
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.
