메뉴 건너뛰기
Library Notice
Institutional Access
If you certify, you can access the articles for free.
Check out your institutions.
ex)Hankuk University, Nuri Motors
Log in Register Help KOR
Subject

Optimized Binary-Search-on-Range Architecture for IP Address Lookup
Recommendations
Search
Questions

IP 주소 검색을 위한 최적화된 영역분할 이진검색 구조

논문 기본 정보

Type
Academic journal
Author
Journal
Korea Institute Of Communication Sciences The Journal of Korean Institute of Communications and Information Sciences Vol.33 No.12 KCI Accredited Journals SCOPUS
Published
2008.12
Pages
1,103 - 1,111 (9page)

Usage

cover
📌
Topic
📖
Background
🔬
Method
🏆
Result
Optimized Binary-Search-on-Range Architecture for IP Address Lookup
Ask AI
Recommendations
Search
Questions

Research history (5)

  • Are you curious about the follow-up research of this article?
  • You can check more advanced research results through related academic papers or academic presentations.
  • Check the research history of this article

Abstract· Keywords

Report Errors
Internet routers forward an incoming packet to an output port toward its final destination through IP address lookup. Since each incoming packet should be forwarded in wire-speed, it is essential to provide the high-speed search performance. In this paper, IP address lookup algorithms using binary search are studied. Most of the binary search algorithms do not provide a balanced search, and hence the required number of memory access is excessive so that the search performance is poor. On the other hand, binary-search-on-range algorithm provides high-speed search performance, but it requires a large amount of memory. This paper shows an optimized binary-search-on-range structure which reduces the memory requirement by deleting unnecessary entries and an entry field. By this optimization, it is shown that the binary-search-on-range can be performed in a routing table with a similar or lesser number of entries than the number of prefixes. Using real backbone routing data, the optimized structure is compared with the original binary-search-on-range algorithm in terms of search performance. The performance comparison with various binary search algorithms is also provided.

Contents

요약
ABSTRACT
Ⅰ. 서론
Ⅱ. 기존의 이진 검색 알고리즘
Ⅲ. 영역분할 이진 검색 알고리즘의 최적화 구조
Ⅳ. 영역분할 이진 검색 알고리즘의 최적화 구조의 성능 평가
Ⅴ. 결론
참고문헌

References (11)

Add References

Recommendations

It is an article recommended by DBpia according to the article similarity. Check out the related articles!

Related Authors

Frequently Viewed Together

Recently viewed articles

Comments(0)

0

Write first comments.