• Journal of KIISE:Information Networking
• /
• v.36 no.1
• /
• pp.57-67
• /
• 2009

Packet forwarding in the Internet routers is to find out the longest prefix that matches the destination address of an input packet and to forward the input packet to the output port designated by the longest matched prefix. The IP address lookup is the key of the packet forwarding, and it is required to have efficient data structures and search algorithms to provide the high-speed lookup performance. In this paper, an efficient IP address lookup algorithm using binary search is investigated. Most of the existing binary search algorithms are not efficient in search performance since they do not provide a balanced search. The proposed binary search algorithm performs perfectly balanced binary search using switch pointers. The performance of the proposed algorithm is evaluated using actual backbone routing data and it is shown that the proposed algorithm provides very good search performance without increasing the memory amount storing the forwarding table. The proposed algorithm also provides very good scalability since it can be easily extended for multi-way search and for large forwarding tables

• Electronics and Telecommunications Trends
• /
• v.20 no.4 s.94
• /
• pp.189-197
• /
• 2005

앞으로의 인터넷은 무선 구간의 일반화와 더불어 디바이스들의 소형화, 지능화로 인해이동성이 무엇보다도 강조되는 시점이다. 또한 다양한 서비스의 제공 및 보안을 위한 QoS, security, 그리고 계속적인 서비스를 받기 위한 멀티호밍 환경 등 인터넷은 많은 새로운 기술들을 필요로 하고 있다. 이러한 기술들 중 이동성과 멀티호밍은 지원되어야 할 기본적인 프로토콜들이다. 그러나 인터넷의 핵심인 IP 아키텍처 중 IP 주소는 최종 단말의 식별자(identifier)와 단말의 위치 식별자(locator)의 의미를 함께 사용하고 있어, 이동성 및 멀티호밍으로 통신중인 단말의 IP 주소가 변경되면 통신중인 세션이 끊기는 문제가 발생한다. 본 논고는 이와 같은 IP 주소의 근본적인 중첩 문제를 해결하기 위해 제한된 identifier와 locator 분리에 관한 기술 동향 및 IETF의 표준화 동향을 소개한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.21-28
• /
• 2008

In this paper, we proposed an algorithm that reduces call setup time between the IP PBXs installed in the main office and several branch offices. In the IP PBXs installed in branch offices, we prepare some internal memory spaces, and they keep the frequently used extension numbers and the corresponding IP PBX's addresses. In order to call an extension number registered to the other remote IP PBX from an extension number registered to the local IP PBX, the local PBX searches for the destined extension from its internal memory first. If the extension is found, then the local PBX uses its corresponding IP PBX address stored along with the extension, instead of making a query to the main office's IP PBX. By this technique, we could shorten the average call setup time and verified it by an experiment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.161-164
• /
• 2000

이 논문은 TCP/IP 기반 지역 망 내에서 개인용 컴퓨터의 사용에 있어 인터넷 프로토콜의 주소 충돌 해결 방법에 대하여 연구하였다. 현재 컴퓨터의 수는 계속해서 늘고 있지만 사용자는 IP 주소에 대한 지식이 없음으로 인해 고의나 실수로 자신의 짓이 아닌 다른 사람의 IP 주소를 사용할 수 있고, 이로 인해 원래 사용자가 네트웍을 사용한 수 없게 된다. 본 논문은 사전에 지역 망 내의 관리 대상 컴퓨터들의 주소정보를 수집하여 현재 사용하는 주소 정보가 저장된 정보와 같은 지를 Web Browser를 통하여 검사하는 방법으로 IP 주소 충돌 검출 방법을 제시하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.545-547
• /
• 2004

Currently possibility of the change of seal computer it increases geometrical progression and the general individuals the knowledge which is special regarding the ip are using the flow child blood which it Provides without from the isp enterprise. But most of the case peon of the school which uses the fixation child blood or the company because is not the knowledge against a TCP/IP address is not oneself at deliberation or real income and it will use the TCP/IP address of the different user and the network whole it will paralyze, the original user will not be able to use the network and it makes. With information where address information where the network administrator present time after data base anger one uses address information of the civil official objective personal computers and network systems of the watch inside in the dictionary is stored will be same from the dissertation which it sees hereupon and the web which it will yell it leads and packet it detects, the use of the TCP/IP address which goes wrong in the user and it notifies the method which is the possibility of closing the paralysis of the network system which it follows in the IP address fringe land due to a deliberation or a real income to sleep it presents it does.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.598-600
• /
• 2004

Mobile Ad hoc Network (MANET)는 자율적으로 작동할 수 있는 멀티 홈 무선 네트워크로서 토폴로지 변화가 자주 일어나며 예측할 수 없는 특성을 갖는다. 특히 scale 이 큰 MANET 환경에서는 더욱더 예측할 수 없는 특성을 갖게 된다. 최근 MANET에서의 라우팅을 하기 위한 주소 할당에 관심이 모아지고 있는 상황에서 각 노드는 DHCP 같은 서버의 역할 없이 주소를 할당할 수 있는 기능을 가져야 하며, 이동 단말들이 모두 IP stack을 지원하는 것을 감안해서 IP주소를 사용해야할 것이다. 따라서 본 논문에서는 scale이 큰 MANET 환경에서 동적으로 IP 주소를 할당하는 방법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.88-90
• /
• 2003

라우터의 If 주소검색은 라우터에 도착한 If 패킷의 목적지 주소를 이용하여 적절한 다음-홉 주소를 검색하고 결정하는 것이다. IP 주소검색은 라우터 성능의 병목지정으로써 고속 백본망에 필요한 초고속 라우터 개발에 필수적인 부분이다. 현대적인 고속 라우터는 초당 수백 안개 이상의 IP 패킷을 처리할 수 있는 능력이 필요하다. 본 논문은 보통의 Pentium CPU에서 OC-48 링크 수준의 IP 주소검색을 실시할 수 있는 빠른 검색방법을 소개한다. 본 논문에서는 데이터 압축기법으로 사용되는 RLC(Run Length Coding)와 유사한 방법을 사용하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.240-249
• /
• 2004

For the effective IP-based service implementation in the wireless network environment, involvement of IP-related technologies in wireless networks is inevitable and globally unique IPv6 address allocation to the mobile node has become an important issue. In the 3GPP's address allocation mechanism, IPv6 address allocation procedure is performed by the GGSN, which is normally located far from the mobile nodes. This causes IPv6 address allocation time delay and traffics to be longer and increased in the core network, respectively. In this paper, we propose a new IPv6 address allocation mechanism that is performed by Node B located in RAN. The proposed IPv6 address allocation mechanism can provide IPv6 addresses to mobile nodes within a more reduced time than existing 3GPP's IPv6 address allocation mechanism, and co-operates with existing mechanism as an overlay model to improve reliability of wireless networks. And, for implementation of the proposed address allocation mechanism, it needs not to change the structure of current wireless networks except for the some functional addendum of Node B.

• The KIPS Transactions:PartA
• /
• v.10A no.5
• /
• pp.453-462
• /
• 2003

IP address lookup of router searches and decide proper output link using destination address of IP packet that arrie into router. The IP address lookup is essential part in te development of high-speed router needed to high-speed backbone network as one of bottleneck of router performance. This paper introduces DTC data structure that can support gigabit IP address lookup by dynamic trie compression technique that just uses small memory in conventional Pentium CPU. When make a forwarding table by trie compression, the DTC can dynamically select a size of data structure with considering correlation between table's size and searching speed. Also, when compress the prefix trie, DTC makes IP address lookup on the forwarding table of a search on the high speed SRAM cache by minimizing the size of data structure reflecting the structure of the trie. In the experiment result, the DTC data structure recorded performance of maximum $12.5{\times}10^5$ LPS (lookup per second) in conventional Pentium CPU through a dynamic building of most suitable compression over variety of routing tables.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.84-98
• /
• 2009

Various algorithms and architectures for IP address lookup have been studied to improve forwarding performance in the Internet routers. Previous IP address lookup architecture using Bloom filter requires a separate Bloom filter as well as a separate hash table in each prefix length, and hence it is not efficient in implementation complexity. To reduce the number of hash tables, it applies controlled prefix expansion, but prefix duplication is inevitable in the controlled prefix expansion. Previous parallel multiple-hashing architecture shows very good search performance since it performs parallel search on tables constructed in each prefix length. However, it also has high implementation complexity because of the parallel search structure. In this paper, we propose a new IP address lookup architecture using all-length Bloom filter and all-length multiple hash table, in which various length prefixes are accomodated in a single Bloom filter and a single multiple hash table. Hence the proposed architecture is very good in terms of implementation complexity as well as search performance. Simulation results using actual backbone routing tables which have $15000{\sim}220000$ prefixes show that the proposed architecture requires 1.04-1.17 memory accesses in average for an IP address lookup.