Fast hash table lookup using extended Bloom filter: an aid to network processing (2005)

by Haoyu Song , Sarang Dharmapurikar , Jonathan Turner , John Lockwood
Venue:In ACM SIGCOMM
Citations:71 - 6 self

Documents Related by Co-Citation

1597 Space/Time Trade-offs in Hash Coding with Allowable Errors – Burton H. Bloom - 1970
762 Summary cache: A scalable wide-area web cache sharing protocol – Li Fan, Pei Cao, Jussara Almeida, Andrei Z. Broder - 1998
390 Network Applications of Bloom Filters: A Survey – Andrei Broder, Michael Mitzenmacher - 2002
208 Compressed Bloom Filters – Michael Mitzenmacher - 2001
4208 Artificial Intelligence: A Modern approach (2 nd Edition – S J Russell, P Norvig - 2002
946 The click modular router – Eddie Kohler - 2001
1242 Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes – Mark E. Crovella, Azer Bestavros - 1996
659 Self-Similarity Through High-Variability: Statistical Analysis of Ethernet LAN Traffic at the Source Level – Walter Willinger, Murad S. Taqqu, Robert Sherman, Daniel V. Wilson - 1997
1574 Wide-Area Traffic: The Failure of Poisson Modeling – Vern Paxson, Sally Floyd - 1995