• Title/Summary/Keyword: 주소 검색

Search Result 142, Processing Time 0.03 seconds

High-Speed Korean Address Searching System for Efficient Delivery Point Code Generation (효율적인 순로코드 발생을 위한 고속 한글 주소검색 시스템 개발)

  • Kim, Gyeong-Hwan;Lee, Seok-Goo;Shin, Mi-Young;Nam, Yun-Seok
    • The KIPS Transactions:PartD
    • /
    • v.8D no.3
    • /
    • pp.273-284
    • /
    • 2001
  • A systematic approach for interpreting Korean addresses based on postal code is presented in this paper. The implementation is focused on producing the final delivery point code from various types of address recognized. There are two stages in the address interpretation : 1) agreement verification between the recognized postal code and upper part of the address and 2) analysis of lower part of the address. In the agreement verification procedure, the recognized postal code is used as the key to the address dictionary and each of the retrieved addresses is compared with the words in the recognized address. As the result, the boundary between the upper part and the lower part is located. The confusion matrix, which is introduced to correct possible mis-recognized characters, is applied to improve the performance of the process. In the procedure for interpreting the lower part address, a delivery code is assigned using the house number and/or the building name. Several rules for the interpretation have been developed based on the real addresses collected. Experiments have been performed to evaluate the proposed approach using addresses collected from Kwangju and Pusan areas.

  • PDF

A Parallel Multiple Hashing Architecture for IP Address Lookup (복수의 해쉬 함수를 이용한 병렬 IP 어드레스 검색 구조)

  • 정여진;이보미;임혜숙
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2B
    • /
    • pp.158-166
    • /
    • 2004
  • Address lookup is one of the most essential functions of the Internet routers and a very important feature in evaluating router performance. Due to the facts that the Internet traffic keeps growing and the number of routing table entries is continuously growing, efficient address-lookup mechanism is indispensable. In recent years, various fast address-lookup schemes have been proposed, but most of those schemes are not practical in terms of the memory size required for routing table and the complexity required in table update In this paper, we have proposed a parallel IP address lookup architecture based on multiple hashing. The proposed scheme has advantages in required memory size, the number of memory accesses, and table update. We have evaluated the performance of the proposed scheme through simulation using data from MAE-WEST router. The simulation result shows that the proposed scheme requires a single memory access for the address lookup of each route when 203kbytes of memory and a few-hundred-entry TCAM are used.

Binary Search on Tree Levels for IP Address Lookup (IP 주소 검색을 위한 트리 레벨을 사용한 이진 검색 구조)

  • Mun, Ju-Hyoung;Lim, Hye-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2B
    • /
    • pp.71-79
    • /
    • 2006
  • Address lookup is an essential function in the Internet routers, and it determines overall router performance. In this paper, we have thoroughly investigated the binary-search-based address lookup algorithms and proposed a new algorithm based on binary search on prefix lengths. Most of the existing binary search schemes perform binary search on prefix values, and hence the lookup speed is proportional to the length of prefixes or the log function of the number of prefixes. The previous algorithm based on binary search on prefix lengths has superior lookup performance than others. However, the algorithm requires very complicated pre-computation of markers and best matching prefixes in internal nodes since naive binary search is not possible in their scheme. This complicated pre-computation makes the composition of the routing table and incremental update very difficult. By using leaf-pushing, the proposed algorithm in this paper removes the complicated pre-computation of the Previous work in performing the binary search on prefix lengths. The performance evaluation results show that the proposed scheme has very good performance in lookup speed compared with previous works.

Improved LC-trie for Efficient IP Address Lookup (효율적인 IP 주소 검색을 위한 개선된 LC-trie)

  • Kim, Jin-Soo;Kim, Jung-Hwan
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.3
    • /
    • pp.50-59
    • /
    • 2007
  • IP address lookup is one of the most important and complex functions in the router. In this paper, we propose an improved technique of LC-trie to increase the performance of IP address lookup in the high performance router. We effectively apply the prefix pruning method, which is used for the compression of the forwarding table in TCAM((Ternary Content Addressable Memory), to the LC-trie. This technique can decrease the number of memory accesses and upgrade the lookup speed. Moreover, through the real forwarding table and the real traffic distribution, we evaluate the performance of our scheme in terms of the lookup time and the number of memory access, comparing with that of the previous LC-trie.

인터넷 주소 한글화로 성공을 꿈꾼다

  • Park, Min-Sik
    • Digital Contents
    • /
    • no.2 s.69
    • /
    • pp.66-67
    • /
    • 1999
  • 인터넷 사용자라면 누구나 자기가 찾고자 하는 영문 주소를 몰라 검색엔진에 찾는 기관이나 업체의 이름을 적어놓은 경험이 있을 것이다. 또한 이런 경우에도 직접 원하는 곳의 주소가 나오지 않아 몇 번의 번거로운 단계를 거쳤을 것이다. 이런 네티즌의 어려움을 인터넷 주소의 한글화로 해결한 업체가 있어 찾아봤다.

  • PDF

A Parallel Multiple Hashing Architecture Using Prefix Grouping for IP Address Lookup (프리픽스 그룹화를 이용한 병렬 복수 해슁 IP 주소 검색 구조)

  • Kim Hye ran;Jung Yeo jin;Yim Chang boon;Lim Hye sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3B
    • /
    • pp.65-71
    • /
    • 2005
  • The primary function of the Internet routers is to forward incoming packets toward their final destinations. IP address lookup is one of the most important functions in evaluating router performance since IP address lookup should be performed in wire-speed for the hundred-millions of incoming packets per second. With CIDR, the IP prefixes of routing table have arbitrary lengths, and hence address lookup by exact match is no longer valid. As a result, when packets arrive, routers compare the destination IP addresses of input packets with all prefixes in its routing table and determine the most specific entry among matching entries, and this is called the longest prefix matching. In this paper, based on parallel multiple hashing and prefix grouping, we have proposed a hardware architecture which performs an address lookup with a single memory access.

Balanced Binary Search Using Prefix Vector for IP Address Lookup (프리픽스 벡터를 사용한 균형 이진 IP 주소 검색 구조)

  • Kim, Hyeong-Gee;Lim, Hye-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5B
    • /
    • pp.285-295
    • /
    • 2008
  • Internet routers perform packet forwarding which determines a next hop for each incoming packet using the packet's destination IP address. IP address lookup becomes one of the major challenges because it should be performed in wire-speed for every incoming packet under the circumstance of the advancement in link technologies and the growth of the number of the Internet users. Many binary search algorithms have been proposed for fast IP address lookup. However, tree-based binary search algorithms are usually unbalanced, and they do not provide very good search performance. Even for binary search algorithms providing balanced search, they have drawbacks requiring prefix duplication. In this paper, a new binary search algorithm which provides the balanced binary search and the number of its entries is much less than the number of original prefixes. This is possible because of composing the binary search tree only with disjoint prefixes of the prefix set. Each node has a prefix vector that has the prefix nesting information. The number of memory accesses of the proposed algorithm becomes much less than that of prior binary search algorithms, and hence its performance for IP address lookup is considerably improved.

Optimized Binary-Search-on- Range Architecture for IP Address Lookup (IP 주소 검색을 위한 최적화된 영역분할 이진검색 구조)

  • Park, Kyong-Hye;Lim, Hye-Sook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12B
    • /
    • pp.1103-1111
    • /
    • 2008
  • 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.

A novel method of Huffman decoding for MPEG-2 AAC (MPEG-2 AAC를 위한 허프만 디코더 구현기법에 관한 연구)

  • 정종훈;김병일;장태규
    • Proceedings of the IEEK Conference
    • /
    • 2001.09a
    • /
    • pp.477-480
    • /
    • 2001
  • 본 논문에서는 허프만 코딩의 기본 원리인 이진트리로부터 생성된 효율적인 일차원 검색테이블 구성과, 프로세싱 효율을 증가시키기 위한 수치연산 기법의 도입을 통하여 도출된 효율적인 허프만 디코딩 방법을 제시한다. 제안된 방법에서는 허프만 코드화 된 비트스트림으로부터 읽어 들인 비트 데이터를 직접 이진트리를 검색하기 위한 주소연산에 적용함으로써, 기존의 이진트리 검색을 위하여 수행되던 비교 및 분기문의 제거를 가능토록 하였다. 본 논문에서 제안하는 허프만 디코딩 기법은 기존의 비교 및 분기구분에 의하여 수행되던 허프만 디코딩 기법대비 30%이상의 검색속도 증가 및 이진트리 방식의 검색을 수행하기 위하여 필요로 하는 검색테이블에서 존재하던 데이터 및 노드간의 연결주소를 저장하기 위하여 사용되던 메모리 공간을 효율적으로 제거할 수 있는 일차원 검색테이블을 구성함으최써, 기존 방법대비 1/3의 메모리 공간만을 사용하도록 하였다. 제안된 허프만 디코딩 기법의 성능평가를 위하여 MPEG-2 AAC의 허프만 디코더에 적용한 결과 기존의 순차검색방법에 의한 디코딩 기법대비 198%의 성능향상 결과를 확인할 수 있었다.

  • PDF

Design of Postal Address File for Address Interpretation and Retrieval (주소해석 및 검색을 위한 우편주소파일 설계)

  • Chang, Tai-Woo;Kim, Ho-Yon;Lim, Kil-Taek
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.12 no.4
    • /
    • pp.74-88
    • /
    • 2007
  • In order to automate the process of mail sorting by delivery sequence, it is necessary to prepare a postal address database and to interpret written addresses on the mail-pieces with the database and OCR technology. The address database is a critical factor of automation and informatization of postal service since it could be used not only in address recognition but also in various mail processing. In this study, we design the schema of postal address database, design the postal address file based on it and explain the method of address interpretation and retrieval using it. We analyze infonnation requirements for transformation of postal address into the standardized format and consider them in the process of design. The postal address file can be used by address matching or retrieval system as well as by Hangul address recognition system for automation of delivery sequence mail-sorting.

  • PDF