• 한국통신학회논문지
• /
• 제34권4B호
• /
• pp.403-418
• /
• 2009

IPv6는 32 비트를 갖는 IPv4의 주소 공간 부족 문제를 해결하기 위하여 제안된 새로운 IP주소 체계로서 128비트를 갖는다. 그러므로 IPv6의 라우팅 테이블을 트라이 구조에 저장한다고 가정할 때, IPv4에 비해 매우 많은 레벨이 존재하게 된다. 따라서 IPv6 주소 검색을 위해서는 트라이 레벨에 따른 선형 검색보다 레벨에 따른 이진 검색 구조가 적합하며, 검색 성능이 더 우수하다는 장점이 있다. 본 논문에서는 IPv6를 위한 트라이 레벨에 따른 새로운 이진 검색 알고리즘을 제안한다 본 논문에서 제안하는 구조는 레벨에 따른 이진 검색의 수행 시 통합 블룸 필터를 사용하여 노드가 존재하지 않는 레벨을 미리 걸러주는 방법을 통하여 외부 메모리 접근 횟수를 줄인다. 실제 라우터에서 사용하는 IPv6 라우팅 데이터를 사용하여 시뮬레이션을 수행하였으며, 1096개의 엔트리를 갖는 라우팅 테이블에 대하여 평균 $1{\sim}3$의 메모리 접근을 통하여 IPv6 주소 검색이 가능함을 보았다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권3호
• /
• pp.266-284
• /
• 2009

The challenges of rapidly growing numbers of mobile nodes in IPv6-based networks are being faced by mobile computing researchers worldwide. Recently, IETF has standardized Mobile IPv6 and Fast Handover for Mobile IPv6(FMIPv6) for supporting IPv6 mobility. Even though existing literatures have asserted that FMIPv6 generally improves MIPv6 in terms of handover speed, they did not carefully consider the details of the whole handover procedures. Therefore, in conventional protocols, the handover process reveals numerous problems manifested by a time-consuming network layer based movement detection and latency in configuring a new care of address with confirmation. In this article, we study the impact of the address configuration and confirmation procedure on the IP handover latency. To mitigate such effects, we propose a new scheme which can reduce the latency taken by the movement detection, address configuration and confirmation from the whole handover latency. Furthermore, a mathematical analysis is provided to show the benefits of our scheme. In the analysis, various parameters are used to compare our scheme with the current procedures, while our approach is focused on the reduction of handover latency. Finally, we demonstrate total handover scenarios for the proposed techniques and discussed the major factors which contribute to the handover latency.

• 인터넷정보학회논문지
• /
• 제17권4호
• /
• pp.27-34
• /
• 2016

인터넷 주소가 웹 사이트를 지칭하던 때와는 달리 웹 사이트 안에 담겨진 개별 서비스/콘텐츠/상품 등으로 세분화하여 지칭할 수 있게 되는 개방형 도메인 서비스가 국제 인터넷 주소 관리기구(ICANN)에 의해 도입되고 있다. 개방형 도메인은 서비스/콘텐츠/상품 단위의 주소를 표현하는 데에 더 적합하다. 본 논문에서는 사용자의 차별적 상황과 무관하게 주소 표현에 대해서 일관된 매핑 결과를 반환하는 정적인 인터넷 주소 서비스에 대한 대안으로, 사용자의 특정 요구에 맞추어진 매핑 결과를 반환하는 동적 인터넷 주소 모델을 설계하고, 기존 도메인 프로토콜의 변경 없이 주소 서비스 구현이 가능한 방법을 제안한다. 사용자의 메타 정보 및 환경 정보를 인터넷 주소 표현에 인코딩하여 첨부하고, 네임 서버에 동적 매핑을 위한 모듈을 추가하여 동적 인터넷 주소의 구현이 가능하다. 이를 통해 인터넷 주소의 기능 확장을 도모하고, 인터넷 주소 자체만으로도 사용자에게 맞추어진 정보검색 서비스가 가능할 수 있을 것으로 기대된다.

• Journal of information and communication convergence engineering
• /
• 제12권3호
• /
• pp.154-160
• /
• 2014

The address resolution protocol (ARP) provides dynamic mapping between two different forms of addresses: the 32-bit Internet protocol (IP) address of the network layer and the 48-bit medium access control (MAC) address of the data link layer. A host computer finds the MAC address of the default gateway or the other hosts on the same subnet by using ARP and can then send IP packets. However, ARP can be used for network attacks, which are one of the most prevalent types of network attacks today. In this study, a new ARP algorithm that can prevent IP spoofing attacks is proposed. The proposed ARP algorithm is a broadcast ARP reply and an ARP notification. The broadcast ARP reply was used for checking whether the ARP information was forged. The broadcast ARP notification was used for preventing a normal host's ARP table from being poisoned. The proposed algorithm is backward compatible with the current ARP protocol and dynamically prevents any ARP spoofing attacks. In this study, the proposed ARP algorithm was implemented on the Linux operating system; here, we present the test results with respect to the prevention of ARP spoofing attacks.

• Journal of Communications and Networks
• /
• 제7권4호
• /
• pp.525-536
• /
• 2005

In an IP-based network, automated dynamic assignment of IP addresses is preferable. In most wired networks, a node relies on a centralized server by using dynamic host configuration protocol (DHCP) to obtain a dynamic IP address. However, the DHCP­based approach cannot be employed in a mobile ad hoc network (MANET) due to the uncertainty of any centralized DHCP server. That is, a MANET may become partitioned due to host mobility. Therefore, there is no guarantee to access a DHCP server. A general approach to address this issue is to allow a mobile host to pick a tentative address randomly, and then use duplicate address resolution (DAR) protocol to resolve any duplicate addresses. In this paper, an innovative distributed dynamic host configuration protocol designed to configure nodes in MANET is presented. The proposed protocol not only can detect the duplicate address, but also can resolve the problem caused by duplicate address. It shows that the proposed protocol works correctly and is more universal than earlier approaches. An enhanced version of DAR scheme is also proposed in this paper to solve the situation of duplicate MAC address. The new and innovative approach proposed in this paper can make the nodes in MANET provide services to other networks and avoid packets from being delivered to incorrect destinations.

• 한국공간정보시스템학회 논문지
• /
• 제5권1호
• /
• pp.75-81
• /
• 2003

인터넷을 기반으로 하는 정보방송 서비스가 널리 확대되고 있으나, 인터넷 프로토콜 고유의 한계로 인해 사용상에 제한이 있다. 본 논문에서는 기지국에 IP 주소변환 기능을 도입한 억세스망에서의 인터넷방송 기술과 이를 이용한 위치기반서비스가 제안되었다. 수신기에 IP 주소가 할당되지 않아도 되며, 사전에 서버의 주소를 몰라도 정보를 수신할 수 있으며, 서버의 부하나 통신망 트래픽이 대폭 감소되는 장점이 있다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 하계종합학술대회 논문집(1)
• /
• pp.175-178
• /
• 2004

This paper describes a new IP address lookup algorithm using a binary search on multiple balanced trees stored in one memory. The proposed scheme has 3 different tables; a range table, a main table, and multiple sub-tables. The range table includes $2^8$ entries of 22 bits wide. Each of the main table and sub-table entries is composed of fields for a prefix, a prefix length, the number of sub-table entries, a sub-table pointer, and a forwarding RAM pointer. Binary searches are performed in the main table and the multiple sub-tables in sequence. Address lookups in our proposed scheme are achieved by memory access times of 11 in average, 1 in minimum, and 24 in maximum using 267 Kbytes of memory for 38.000 prefixes. Hence the forwarding table of the proposed scheme is stored into L2 cache, and the address lookup algorithm is implemented in software running on general purpose processor. Since the proposed scheme only depends on the number of prefixes not the length of prefixes, it is easily scaled to IPv6.

• 한국컴퓨터정보학회논문지
• /
• 제23권9호
• /
• pp.57-64
• /
• 2018

In recent years, a new approach to cyber security, called the moving target defense, has emerged as a potential solution to the challenge of static systems. In this paper, we design a protected server network with a large number of decoys to anonymize the protected servers that dynamically mutate their IP address and port numbers according to Hidden Tunnel Networking, which is a network-based moving target defense scheme. In the network, a protected server is one-to-one mapped to a decoy-bed that generates a number of decoys, and the decoys share the same IP address pool with the protected server. First, the protected server network supports mutating the IP address and port numbers of the protected server very frequently regardless of the number of decoys. Second, it provides independence of the decoy-bed configuration. Third, it allows the protected servers to freely change their IP address pool. Lastly, it can reduce the possibility that an attacker will reuse the discovered attributes of a protected server in previous scanning. We believe that applying Hidden Tunnel Networking to protected servers in the proposed network can significantly reduce the probability of the protected servers being identified and compromised by attackers through deploying a large number of decoys.

• 지적과 국토정보
• /
• 제52권1호
• /
• pp.57-68
• /
• 2022

본 연구는 주소의 국제표준화 동향과 ISO/CD 19160-2-N5652 표준문서에 수록된 국가별 대응 현황을 분석하였다. 이를 통해 현재까지 작성된 ISO/CD 19160-2-N5652 표준문서 중 한국의 대응 현황에 대한 문제점을 도출하고 개선 방안을 제시하였다. ISO 19160-2는 2023년 7월을 목표로 국제표준 수립 일정을 수행 중이다. 국제표준 제정을 위해서는 지속적인 모니터링 및 대응이 필요하며, 그 가운데 한국 주소체계의 우수성을 반영하기 위해 노력해야 한다.

• Journal of information and communication convergence engineering
• /
• 제7권1호
• /
• pp.35-40
• /
• 2009

Many researchers strive to research on ways on how to improve the performance of RFID system and many papers were written to solve one of the major drawbacks of potent technology related with data management. As RFID system captures billions of data, problems arising from dirty data and large volume of data causes uproar in the RFID community those researchers are finding ways on how to address this issue. Especially, effective data management is important to manage large volume of data. Data reduction techniques in attempts to address the issues on data are also presented in this paper. This paper introduces readers to a new data reduction algorithm that might be an alternative to reduce data in RFID Systems. A process on how to extract data from the reduced database is also presented. Performance study is conducted to analyze the new data reduction algorithm. Our performance analysis shows the utility and feasibility of our categorization reduction algorithms.