The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

A Global IPv6 Unicast Address Lookup Scheme Using Variable Multiple Hashing

가변적인 복수 해슁을 이용한 글로벌 IPv6 유니캐스트 주소 검색 구조

  • 박현태 (연세대학교 전기전자공학과 컴퓨터시스템 및 관련 SoC 연구실) ;
  • 문병인 (경북대학교 전자전기컴퓨터학부 시스템온칩 연구실) ;
  • 강성호 (연세대학교 전기전자공학과 컴퓨터시스템 및 관련 SoC 연구실)
  • Published : 2006.05.01
Download PDF
⟨ Previous Next ⟩

Abstract

An IP address lookup scheme has become a critical issue increasingly for high-speed networking techniques due to the advent of IPv6 based on 128bit. In this paper, a novel global IPv6 unicast address lookup scheme is proposed for next generation internet routers. The proposed scheme perform a variable multiple hashing based on prefix grouping. Accordingly, it should not only minimize overflows with the proper number of memory modules, but also reduce a memory size required to organize forwarding tables. It has the fast building and searching mechanisms for forwarding tables during only a single memory access. Besides, it is easy to update forwarding tables incrementally. In the simulation using CERNET routing data as a 6bone test phase, we compared the proposed scheme with a similar scheme using a uniform multiple hashing. As a result, we verified that the number of overflows is reduced by 50% and the size of memory for forwarding tables is shrunken by 15% with 8 tables.

IP 주소 검색 구조는 IPv6 주소체계의 도래와 함께 더욱 고속 네트워크 기술의 중요한 이슈가 되고 있다. 본 논문에서는 차세대 인터넷 라우터를 위한 새로운 글로벌 IPv6 유니캐스트 주소 검색 구조를 제안한다. 제안하는 구조는 적절한 프리픽스 그룹화를 수행하고 각 그룹별로 가변적으로 복수 해슁을 수행한다. 이를 통해 적절한 개수의 포워딩 테이블에서 해슁의 충돌(collision)을 효율적으로 분산함으로서 오버플로우를 최소화하였으며 포워딩 테이블 구성을 위해 필요한 메모리 크기를 줄였다. 또한 단 한 번의 메모리 접근만으로 포워딩 테이블 구성 및 검색이 가능한 고속 주소 검색 구조이며 추가적 업데이트가 용이한 구조이다. 실제 6bone 테스트 라우팅 CERNET 데이터를 이용하여 균일한 복수 해슁을 이용한 구조와 제안한 구조를 비교, 실험하였으며 동일한 8개의 테이블에서 약 15%의 포워딩 테이블을 위한 메모리 절약과 약 50%의 오버플로우 감소를 확인하였다.

Keywords

References

  1. X. Sun, and Y. Q. Zhao, 'An On-Cqip IP Address Lookup Algorithm,' IEEE Transactions on Computers, Vol.54, No.7, pp.873-885, July 2005 https://doi.org/10.1109/TC.2005.107
  2. D. Bemmann, ' IP Lookup on a Platform FPGA: a Comparative Study,' Proc. of IEEE International Parallel and Distributed Processing Symposium, p.166, April 2005
  3. H. Lim, J. Seo, and Y. lung, ' High Speed IP Address Lookup Architecture Using Hashing,' IEEE Communications Letters, Vol.7, No. 10, pp.502-504, Oct. 2003 https://doi.org/10.1109/LCOMM.2003.818885
  4. Y. Chu, P. Lin, J. Lin, H. Su, and M. Chen, 'ASIC Design of Fast IP Lookup for Next Generation IP Router,' Proc. of IEEE International Symposium on Circuits and Systems, pp.3825-3828, May 2005
  5. S. Deering, and R. Hinden, 'Internet Protocol, Version 6 (IPv6) Specification,' RFC 2460, Dec. 1998
  6. H. J. Chao, 'Next generation routers,' Proc. of the IEEE, Vo1.90, pp.15l8-l558, Sept. 2002
  7. S. Nilsson and G. Karlsson, 'IP-Address Lookup using LC-tries,' IEEE Journal on Selected Areas in Communication, VoL 17, pp.1083-l092, June 1999 https://doi.org/10.1109/49.772439
  8. M. Waldvogel, G. Varghese, l. Turner and B. Plattner, 'Scalable high speed IP routing lookups,' Proc. of ACM Special InterestGroup on Data Communications, pp.25-36, Sept. 1997
  9. B. Lampson, V. Srinivasan, and G. Varghese, 'IP Lookups Using Multiway and Multicolumn Search,' Proc. of IEEE International Conference on Computer Communications, pp.1248-1256, April 1998
  10. A. McAuley and P. Francis, 'Fast Routing Table Lookup Using CAMs,' Proc. of IEEE International Conference on Computer Communications, pp.1382-1391, March 1993
  11. A. Broder and M. Mitzenmacher, 'Using multiple hash functions to improve IP lookups,' Proc. of IEEE International Conference on Computer Communications, pp.1454-1463, 2001
  12. H. Lim and Y. Jung, 'A Parallel Multiple Hashing Architecture for IP Address Lookup,' Proc. of IEEE Workshop on High Performance Switching and Routing, pp. 91-95, 2004
  13. 김혜란 정여진 임창훈 임혜숙 '프리픽스 그룹화를 이용한 병령 복수애슁 IP주소검색구조 ' 한국통신학회 논문지.Vol.30, No.3B, pp.65-72, March 2005
  14. R. Hinden, 'Proposed TLA and NLA Assignment Rules,' RFC 2450, Dec. 1998
  15. B. AI-Khaffaf, E. Karuppiah, and R. Abdulah, 'Efficient partition based IPv6 lookup algorithm for packet forwarding,' Proc. of Asia-Pacific Conference on Communications, Vol.1, pp.238-242, Sept. 2003
  16. S. Yong, and H. Ewe, 'Robust routing table design for IPv6 lookup,' Proc. of International Conference on Information Technology and Applications, vol.1, pp.531-536, July 2005
  17. R. Fink and R. Hinden, '6bone (lPv6 Testing Address Allocation) Phaseout,' RFC 3701, Mar. 2004
  18. Regional Internet Registeries(APNIC, ARIN, RIPE NCC), 'IPv6 Address Allocation and Assignment Policy,' RIPE 267, http://www. ripe.net/ipv6/ipv6allocs.html, January 2003
  19. R. Jain, 'A Comparison of Hashing Schemes for Address Lookup in Computer Networks,' IEEE Transactions on Communications, Vol.40, No.3, pp.1570-1573, Oct. 1992 https://doi.org/10.1109/26.168785
  20. Internet Engineering Task Force(IETF), '6bone: testbed for deployment of IPv6,' http://www.6bone.net/
  21. M. Wang, S. Deering, T. Hain, and L. Dunn, 'Non-random generator for IPv6 tables,' Proc. of IEEE Symposium on High Performance Interconnects, pp.35-40, Aug. 2004