A Survey of Hash Tables with Summaries for IP Lookup Applications
作者： Thomas Zink
DOI:
关键词:
摘要: Efficient IPv6 packet forwarding is still a major bottleneck in todays networks. Especially the internet core we are faced with very large routing tables and high number of high-speed links. In addition economical restrains exist terms manufacturing operation costs. So demand for efficient mechanisms. last few years lot work has been done on hash summaries that allow compact representations constant lookup time. The features sound attractive routing, thus survey evaluation these data structures seems appropriate.
uni-konstanz.de参考文章(9)
Thomas Zink, Packet forwarding using improved Bloom filters ,(2009)
Anna R. Karlin, Andrei Z. Broder, Multilevel adaptive hashing symposium on discrete algorithms. pp. 43- 53 ,(1990) , 10.5555/320176.320181
Berthold Vöcking, How asymmetry helps load balancing Journal of the ACM. ,vol. 50, pp. 568- 589 ,(2003) , 10.1145/792538.792546
D. Ficara, S. Giordano, G. Procissi, F. Vitucci, MultiLayer Compressed Counting Bloom Filters international conference on computer communications. pp. 311- 315 ,(2008) , 10.1109/INFOCOM.2008.71
A. Broder, M. Mitzenmacher, Using multiple hash functions to improve IP lookups international conference on computer communications. ,vol. 3, pp. 1454- 1463 ,(2001) , 10.1109/INFCOM.2001.916641
Burton H. Bloom, Space/time trade-offs in hash coding with allowable errors Communications of the ACM. ,vol. 13, pp. 422- 426 ,(1970) , 10.1145/362686.362692
Haoyu Song, Sarang Dharmapurikar, Jonathan Turner, John Lockwood, Fast hash table lookup using extended bloom filter: an aid to network processing acm special interest group on data communication. ,vol. 35, pp. 181- 192 ,(2005) , 10.1145/1080091.1080114
Li Fan, Pei Cao, Jussara Almeida, Andrei Z. Broder, Summary cache: a scalable wide-area Web cache sharing protocol acm special interest group on data communication. ,vol. 28, pp. 254- 265 ,(1998) , 10.1145/285237.285287
A. Kirsch, M. Mitzenmacher, Simple summaries for hashing with choices IEEE ACM Transactions on Networking. ,vol. 16, pp. 218- 231 ,(2008) , 10.1109/TNET.2007.899058