• Genomics & Informatics
• /
• v.7 no.4
• /
• pp.208-211
• /
• 2009

We developed an identifier mapping application for bioinformatics research in Java programming language. It is easy to use and provides many usability functionalities that are expected as essentials for a professional application. It supports three widely used mapping services and can convert many ids from one source database into many target databases at once. Id mapping across service providers is possible by remapping the resultant ids. Because it adheres to the NetBeans platform architecture, it can be incorporated into other NetBeans platform applications as an id mapping provider without adaption or modification.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.4
• /
• pp.695-707
• /
• 2013

DHT(Distributed Hash Table) networks such as Kademlia are vulnerable to the ID mapping attack caused by the voluntary DHT mapping structure where the location of a node is solely determined by itself on the network topology. This causes security problems such as eclipse, DRDoS and botnet C&C on DHT networks. To prevent ID mapping attacks, we propose a non-voluntary DHT mapping scheme and perform analysis on NAT compatibility, attack resistance, and network dynamicity. Analysis results show that our approach may have an equivalent level of attack resistance comparing with other defense mechanisms and overcome their limitations including NAT compatibility and network dynamicity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.11
• /
• pp.984-992
• /
• 2012

In this paper, we discuss a new architecture of future Internet for mobile-oriented environments, named Mobile-Oriented Future Internet (MOFI). The MOFI architecture is designed with Host Identifier and Local Locator (HILL) for identifier and locator separation. Based on the HILL separation architecture, we propose a Dynamic and Distributed Mapping System (DDMS) for identifier-locator mapping control. In DDMS, the mapping control function is distributed onto each access router in the domain, which is different from the centralized approach using a central anchor. For validation of the proposed MOFI-DDMS architecture, we implemented the data delivery and mapping control functions using Linux platform. From the testbed experimental results, we see that the DDMS architecture can give better performance than the existing Proxy Mobile IP (PMIP) protocol in terms of data transmission throughput.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.273-280
• /
• 2003

When an existing user authorization systems in Grid access many user to local system and subject DN (Distinguished Name) in a user-proxy authenticate and ID in local system is one-to-one mapping, they have difficulties in ID management, memory resource management and resource management. At this, a variety of subject DN is shared of one local ID in an existing Grid. But this faces many difficulties in applying all requirements for many Grid users. Thus, we suppose user authorization system based on a certificate not them based on ID in this paper. That is, we add user's access level to extension field in a certificate, and make a supposed authorization system decide access limitation level on resources instead of an existing ID mapping methods.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1050-1052
• /
• 2010

Locator and Identifier Split is considered as the solution to the scalability problem Internet is facing today. The separation approach of Locator and Identifier requires a third party called mapping system. The mapping system enables the inter-domain routing between two different edge networks. The design of this third party has generated many proposals, among them one approach use Border Gateway Protocol (BGP) for effective mapping information updates distribution. In this paper, we take advantage of this approach by considering the scalability in term of mapping information storage. Our goal is to provide scalability in term of mapping information storage as well as effective mapping information updates distribution.

• ETRI Journal
• /
• v.37 no.5
• /
• pp.833-844
• /
• 2015

Recently, new network systems have begun to emerge (for instance, 5G, IoT, and ICN) that require capabilities beyond that provided by existing IP networking. To fulfill the requirements, some new networking technologies are being proposed. The promising approach of the new networking technology is to try to overcome the architectural limitations of IP networking by adopting an identifier (ID)-based networking concept in which communication objects are identified independently from a specific location and mechanism. However, we note that existing ID-based networking proposals only partially meet the requirements of emerging and future networks. This paper proposes a new ID-based networking architecture and mechanisms, named IDNet, to meet all of the requirements of emerging and future networks. IDNet is designed with four major functional blocks-routing, forwarding, mapping system, and application interface. For the proof of concept, we develop numeric models for IDNet and implement a prototype of IDNet.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.236-239
• /
• 2021

With the growth of AI technology, the scale of Knowledge Graphs continues to be expanded. Knowledge Graphs are mainly expressed as RDF representations that consist of connected triples. Many RDF storages compress and transform RDF triples into the condensed IDs. However, if we try to transform a large scale of RDF triples, it occurs the high processing time and memory overhead because it needs to search the large ID mapping table. In this paper, we propose the method of converting RDF triples using Hash-based ID mapping tables with MapReduce, which is the software framework with a parallel, distributed algorithm. Our proposed method not only transforms RDF triples into Integer-based IDs, but also improves the conversion speed and memory overhead. As a result of our experiment with the proposed method for LUBM, the size of the dataset is reduced by about 3.8 times and the conversion time was spent about 106 seconds.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.19 no.6
• /
• pp.37-45
• /
• 2011

As vehicles become more intelligent, in-vehicle networking (IVN) systems such as controller area network (CAN) or FlexRay are essential for convenience and safety of drivers. To expand the applicability of IVN systems, attention is currently being focused on the communication between heterogeneous networks such as body networking and chassis networking systems. A gateway based on message mapping method was developed to interconnect FlexRay and CAN networks. However, this type of gateways has the following shortcomings. First, when a message ID was changed, the gateway must be reloaded with a new mapping table reflecting the change. Second, if the number of messages to be transferred between two networks increase, software complexity of gateway increases very rapidly. In order to overcome these disadvantages, this paper presents FlexRay-CAN gateway based on node mapping method. More specifically, this paper presents a node mapping based FlexRay-CAN gateway operation algorithm along with the experimental evaluation for ID change.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.550-552
• /
• 2004

분산 해시 테이블 (Distributed Hash Table) 을 사용한 P2P 시스템에서는 해시함수를 사용하며 파일과 노드의 ID를 정의하고 파일의 ID와 매핑 (mapping) 되는 ID를 가진 노드에 파일을 저장함으로써 시스템 전체에 파일을 완전히 분산시킨다. 이러한 시스템에서는 파일을 찾을 때 해시된 파일 ID로 찾기 때문에 정확한 매치 (exact match) 만 가능하다. 하지만 현재 P2P 파일 공유 시스템에서는 파일의 전체 이름을 정확히 알지 못하더라도 부분적인 키워드로 파일을 검색할 수 있도록 하는 키워드 검색 (keyword search) 이 요구된다. 본 논문에서는 분산 해시 테이블을 기반으로 하는 P2P 시스템에서 키워드 검색이 가능하도록 하는 방안을 제안한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.123-127
• /
• 2009

In this paper, we suggested new additional data transmission technology for T-DMB system using MOK-SS(Mary Orthogonal Keying- Spread Spectrum)mapping method. We applied revised watermarking method of TxID(Transmitter Identification) technology mainly had been used for conventional ATSC-DTV(Advanced Television Systems Committee - Digital TV). And proposed schemes enhanced additional data rate using MOK-SS mapping method. We certified availability of our proposed technology by using various simulation and error rate performance analysis.