• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.683-688
• /
• 2004

NAT is a very useful IP address translation technique that allows two connected networks using different and incompatible IP address schemes. But it is impractical to use NAT for an application which uses the encrypted IP packet, embedding IP addresses inside of data payloads, to guarantee End-to-End Security such as IPSec. In addition to rewriting the source/destination IP addresses in the packet, NAT must modify IP checksum every time, which could lead to considerable performance decrease of the overall system in the process of the address translation. RSIP is an alternative to solve these disadvantages of NAT and the address shortage problems. Both NAT and RSIP divide networks into inside and outside addressing realms. NAT translates addresses between internal network and external network, but RSIP uses a borrowed external address for outside communications. RSIP server assigns a routable public address to a RSIP client temporarily to communicate with public net-work outside of the private network. In this paper, RSIP gateway for intranet environment is designed and its performance is evaluated. From the results of performance evaluation, we knew that RSIP is operated less sensitive to the data traffic. Also, the experiment shows that RSIP performs better than NAT when the transmission data grows larger.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.1
• /
• pp.50-63
• /
• 2017

In the wireless sensor networks, a sensor node has limited resources such as battery or memory. Hence, the routing protocol used in the wireless sensor networks is required efficient use of resources. In this paper, the VAP(Virtual Address Protocol), ensures the shortest transmission path for data transmission between the sink node and sensor node, is proposed. The VAP is assigned each node virtual address and sub address related with its neighboring nodes. The shortest transmission path to the destination node will be choose by comparing to each other address of its neighboring node. The comparison with other existing routing protocol shows that transmission path and usage of memory resource are minimized. Also transmission delay time of data was reduced.

• 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:Computer Systems and Theory
• /
• v.28 no.11
• /
• pp.613-619
• /
• 2001

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 prefixes, our algorithm can do IP address in Ο(log n) time. It also handles the insertion and deletion of IP prefixes efficiently without rebuilding the total data structure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2850-2861
• /
• 1996

This paper describes the design of AATM switch LIS of shared buffer type with linked-list architecture to control memory access. The proposed switch LSI consists of the buffer memory, controller and FIFO memory blocks and two special circuits to avoid the cell blocking. One of the special circuit is a new address control scheme with linked-list architecture which maintains the address of buffer memory serially ordered from write address to read address. All of the address is linked as chain is operated like a FIFO. The other is slip-flag register it will be hold the address chain when readaddress missed the reading of data. The circuits control the buffer memory efficiently and reduce the cell loss rate. As a result the designed chip operates at 33ns and occupied on 2.7*2.8mm$^{2}$ using 0.8.mu.m CMOS technology.

• KIEE International Transactions on Electrophysics and Applications
• /
• v.5C no.5
• /
• pp.183-190
• /
• 2005

In order to drive the high-density plasma displays, a high-speed driving technology must be researched. In this experiment, the relationship between the width of the address electrode and high-speed driving is analyzed using the Vt close curve and the panel structure for high-speed driving is proposed. In addition we show that the wider the width of the address electrode is, the narrower the width of the scan pulse becomes. Therefore, we could achieve the minimum data voltage of 50.1V at a scan pulse width of $1.0/{\mu}s$ and a ramp voltage of 210V at an address electrode width of $180/{\mu}m$ for the high-speed driving 4-inch test PDP.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.3
• /
• pp.101-108
• /
• 2012

The construction of data connection is required due to the digital map do not have the new address data which is implemented by the Korea government and it cannot use between government and other agency. The manually matching of digital map and new address data is time and money consuming process due to the huge amount of data. In this research, new system is developed for data generation of attribute data by the data connection method of digital map and new address data using spatial matching and matching rate of data connection is analyses. The results of data matching rate in the research area are 84% in building case and 67% in road case in 1:1000 digital map at Suwon and 18% in building case and 21% in road at Seogwipo.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.397-404
• /
• 2006

Successful software attacks require both injecting malicious code into a program's address space and altering the program's flow control to the injected code. Code section can not be changed at program's runtime, so malicious code must be injected into data section. Detoured flow control into data section is a signal of software attack. We propose a new software attack detection method which verify the target address of CALL, JMP, RET instructions, which alter program's flow control, and detect a software attack when the address is not in code section. Proposed method can detect all change of flow control related data, not only program's return address but also function pointer, buffer of longjmp() function and old base pointer, so it can detect the more attacks.

• Spatial Information Research
• /
• v.14 no.4 s.39
• /
• pp.403-419
• /
• 2006

The well-blown address matching technology developed by the U.S. Census Bureau was applicable only for street addresses. However, many other addressing systems on the basis of a hierarchy of areas (hierarchical areal addressing system), such as Korean or Japanese addressing system, cannot be suitable for the existing address matching method. This paper, therefore, develops an areal address matching method, especially for Korean addressing system, in order to geocode 2D and 3D locational data of human activities. Thus, this study explains a new approach to dealing with 3D positioning method composed of two geocoding methods, which are a '2D Korean Address Matching' technique and a '3D Address Matching' technique.

• Journal of Internet Computing and Services
• /
• v.17 no.4
• /
• pp.27-34
• /
• 2016

The referents of internet addresses are no longer limited to web sites. A new address service by the international organization for the internet address (ICANN) introduces an open space for the TLD (Top Level Domain) strings so that each service, content, product, and other linguistic expressions may be allowed. The open TLD addresses are more suitable for representing the address of service units, contents, or products. In this paper, as an alternative to static Internet address service to return a consistent mapping result regardless of a user-specific different requirements, we design a dynamic internet address mapping model that returns mapping result to suit user particular requirements. In addition, we propose a method for implementing a internet address service without any changes in the existing domain protocols. It may implement a dynamic internet address by attaching to a encoded user's metadata and environment data within a internet address representation, and adding the module for dynamic mapping to the name servers. Through this proposal, trying to expand the functions of internet address, it is expected to be able to provide customized informaiton retrieval services for each user by using just internet address.