IPv6 주소 검색을 위한 블룸 필터를 사용한 레벨에 따른 이진 검색 구조

목차 (Table of Contents)

• 요약
• ABSTRACT
• Ⅰ. 서론
• Ⅱ. 기존의 구조
• Ⅲ. 제안하는 구조
• Ⅳ. 제안하는 구조의 성능 평가
• Ⅴ. 결론
• 참고문헌

참고문헌 (Reference)

1 Andrei Broder, "Using multiple hash functions to improve IP lookups" 1454-1463, 2001

2 Rich Seifert, "The Switch book" Wiley 2000

3 M. A. Ruiz-Sanchex, "Survey and Taxonomy of IP Address Lookup Algorithms" IEEE Network 8-23, 2001

4 M. Waldvogel, "Scalable high speed IP routing lookups" 23-35, 1997

5 S. M. Yong, "Robust Routing Table Design for IPv6 Lookup" 2005

6 Alagukonar Ganapathy Alagupriya, "Packet Classification Algorithms Using Bloom Filters" 이화여자대학교 대학원 2008

7 H. J. Chao, "Next generation routers" 90 (90): 1518-1558, 2002

8 Priyank Warkhede, "Multiway range trees: scalable IP lookup with fast updates" Computer Networks 289-303, 2004

9 Sarang Dharmapurikar, "Longest prefix matching using bloom filters" 14 (14): 397-409, 2006

10 "IPv6 Operational Report"

11 박경혜, "IP 주소 검색에서 블룸 필터를 사용한 다중 해싱 구조" 한국정보과학회 36 (36): 84-98, 2009

12 Hyesook Lim, "High speed IP address lookup architecture using hashing" 7 (7): 502-504, 2003

13 N. Yazdani, "Fast and scalable schemes for the IP address lookup problem" 83-92, 2000

14 Raj Jain, "Comparison of Hashing Schemes for Address Lookup in Computer Networks" IEEE Transactions on Communications 1989

15 Yiu Keung Li, "Comparative Studies of Address Lookup Algorithms for IPv6" 285-290, 2006

16 Jahangir Hasan, "Chisel: A storage-efficient, collision-free hash-based network processing Architecture" 203-215, 2006

17 Hyesook Lim, "A parallel multiple hashing architecture for IP address lookup" 91-95, 2004