최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기정보과학회논문지. Journal of KIISE. 시스템 및 이론, v.28 no.11, 2001년, pp.613 - 619
이인복 (서울대학교 컴퓨터공학부) , 박근수 (서울대학교 컴퓨터공학부) , 최양희 (서울대학교 컴퓨터공학부) , 정성권 (유비퀵스(주))
The IP address lookup problem is to find the longest matching IP prefix for a given IP address from the routing table and has been a central bottleneck in speeding up the Internet. In this paper, we propose a new algorithm for this problem based on the segment tree data structure. Given n IP prefixe...
V. Fuller. T. Li, J. Yu and K. Vardhan, Classless Inter-domain Routing(CIDR): An Address Assignment and Aggregation Strategy, RFC 1519, 1993
Internet Performance Measurement and Analysis Project(IPMA). http://unnuimerit.edu/ipma
S. Deering and R. Hinden. Internet Protocol, Version 6(IPv6), RFC 1883, 1996
R. Sedgewick. Algorithms in $C^{++}$ . Addison-Wesley, 1992
T. Pei and C. Zukowski. Putting Routing Tables in Silicon. IEEE Network magazine, January 1992
S. Nilsson and G. Karlsson. Fast Addresss Lookup for Internet Routers. IEEE Broadband Communications, 1998
P. Crescenzi, L. Dardini and R Grossi. IP Address Lookup Made Fast and Simple. ESA 99, 1999
F. P. Preparata and M. L Shames. Computational Geometry-An Introduction. Springer-Verlag, 1995
J. L. Bentley and D. Wood, An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles, IEEE Transactions on Computers, 29(7):571-576, July 1980
T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms. MIT Press, 1990
A. Anderson. General Balanced Trees. Journal of Algorithms, 30:1-18, 1999
I. Galperin and R. L. Rivest. Scapegoat Trees. Proceedings of the fourth Annual ACM-SIAM Symposium on Discrete Algorithms, p. 165-174, 1993
M. J. van Kreveld and M. H. Overmars, Union-Copy Structures and Dynamic Segment Trees. Journal of ACM, 40(3):635-652, July 1993
K. Melhorn. Data Structures and Efficient Algorithms Vol. III: Multi-dimensional Searcning and Computational Geometry. Springer-Verlag, 1984
※ AI-Helper는 부적절한 답변을 할 수 있습니다.