The Transactions of The Korean Institute of Electrical Engineers (전기학회논문지)

The Korean Institute of Electrical Engineers (대한전기학회)
권호 표지
DOI QR코드

DOI QR Code

IP Address Lookup Algorithm Using a Vectored Bloom Filter

벡터 블룸 필터를 사용한 IP 주소 검색 알고리즘

  • Byun, Hayoung (Dept. of Electronic and Electrical Engineering, Ewha Womans University) ;
  • Lim, Hyesook (Dept. of Electronic and Electrical Engineering, Ewha Womans University)
  • Received : 2016.02.11
  • Accepted : 2016.11.07
  • Published : 2016.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

A Bloom filter is a space-efficient data structure popularly applied in many network algorithms. This paper proposes a vectored Bloom filter to provide a high-speed Internet protocol (IP) address lookup. While each hash index for a Bloom filter indicates one bit, which is used to identify the membership of the input, each index of the proposed vectored Bloom filter indicates a vector which is used to represent the membership and the output port for the input. Hence the proposed Bloom filter can complete the IP address lookup without accessing an off-chip hash table for most cases. Simulation results show that with a reasonable sized Bloom filter that can be stored using an on-chip memory, an IP address lookup can be performed with less than 0.0003 off-chip accesses on average in our proposed architecture.

Keywords

References

  1. H. J. Chao, "Next Generation Routers," Proc. IEEE, Vol. 90, No. 9, pp. 1518-1588, Sep. 2002. https://doi.org/10.1109/JPROC.2002.802001
  2. S. Fuller, T. Li, J. Yu, and K. Varadhan, "Classless Inter-Domain Routing(CIDR): An Address Assignment and Aggregation Strategy," RFC 1519, Sep.1993.
  3. M. A. Ruiz-Sanchez, E. M. Biersack and W. Dabbous, "Survey and Taxonomy of IP Lookup Algorithms", IEEE Networks, Vol. 15, No. 2, pp. 8-23, Mar./Apr. 2001.
  4. H. Lim and N. Lee, "Survey and Proposal on Binary Search Algorithms for Longest Prefix Match," IEEE Communications Surverys and Tutorials, Vol. 14, No. 3, pp. 681-697, Third Quarters, 2012.
  5. T. Yand, G. Xie, Y. Li, Q. Fu, A. Liu, Q. Li, and L. Mathy, "Guarantee IP Lookup Performance with FIB Explosion," ACM Sigcomm, pp. 39-50, 2014.
  6. P. Gupta, S. Lin, and N. Mckeown, "Routing Lookups in Hardware at Memory Access Speed." IEEE INFOCOM, pp.1240-1247, 1998.
  7. S. Dharmapurikar, P. Krishnamurthy, and D. Taylor, "Longest Prefix Matching Using Bloom Filters," IEEE/ACM Trans. Networking, Vol. 14, No. 2, pp. 397-409, Feb. 2006. https://doi.org/10.1109/TNET.2006.872576
  8. Y. Wang, T. Pan, Z. Mi, H. Dai, X. Guo, T. Zhang, B. Liu, and Q. Dong, "NameFilter: Achieving Fast Name Lookup with Low Memory Cost via Applying Two-Stage Bloom Filters," in Proceedings of the IEEE INFOCOM'13, pp. 93-99, 2013.
  9. H. Lim, K. Lim, N. Lee, and K. Park, "On Adding Bloom Filters to Longest Prefix Matching Algorithms," IEEE Trans. Computers, Vol. 63, No. 2, pp. 411-423, Feb. 2014. https://doi.org/10.1109/TC.2012.193
  10. P. Panda, N. Dutt, and A. Nicolau, "On-Chip vs. Off-Chip Memory: The Data Partitioning Problem in Embedded Processor-Based Systems," ACM Transactions on Design Automation of Electronics Systems, Vol. 5, No. 3, pp. 682-704, July 2000. https://doi.org/10.1145/348019.348570
  11. B. H. Bloom, "Space/Time Trade-offs in Hash Coding with Allowable Errors," Communications of the ACM, Vol. 13, No. 7, pp. 422-426, 1970. https://doi.org/10.1145/362686.362692
  12. S. Tarkoma, C. E. Rothenberg, and E. Lagerspetz, "Theory and Practice of Bloom Filters for Distributed Systems," IEEE Communications Surveys and Tutorials, Vol. 14, No. 1, pp. 131-155, First Quarter, 2012. https://doi.org/10.1109/SURV.2011.031611.00024
  13. M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable High Speed IP Routing Lookups," Proc. ACM SIGCOMM, pp. 25-35, 1997.
  14. J. Mun, H. Lim and C. Yim, "Binary Search on Prefix Lengths for IP Address Lookup," IEEE Communications Letters, Vol. 10, No. 6, pp. 492-494, June 2006. https://doi.org/10.1109/LCOMM.2006.1638626
  15. J. Mun, and H. Lim, "New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms," IEEE Trans. on Computers, Vol. 65, No. 5, pp. 1558-1565, May 2016. https://doi.org/10.1109/TC.2015.2444850

Cited by

  1. A New Bloom Filter Architecture for FIB Lookup in Named Data Networking vol.9, pp.2, 2019, https://doi.org/10.3390/app9020329