• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.635-645
• /
• 2003

One of very important features that are necessarily supported by clustered parallel computer systems is a single I/O system image in which users can access both the local and remote I/O resources transparently. In this paper, we propose an efficient disk sharing technique supporting a single disk I/O system image architecture. The design separates the I/O subsystem of a cluster into the file system and a set of virtual hard disk drivers. The virtual hard disk driver deals with a hard disk in the remote node as a local hard disk. All services provided by it are performed in the device driver level without any modification of file systems. Users can, therefore, access all the disks in the cluster regardless of their locations. Our virtual hard disk driver is implemented under the linux, and also tested in a linux cluster system. We find by experiments that it can successfully support a single disk I/O space, and at the same time it shows better performance than NFS. We are sure that this paper can be a guideline for single I/O space of other devices to be easily constructed.

• Journal of Korea Multimedia Society
• /
• v.7 no.10
• /
• pp.1400-1411
• /
• 2004

Recently, explosion of internet user requires fundamental changes on the architecture of Web service system, from single server system to clustered server system, in parallel with the effort for improving the scalability of the single internet server system. But current cluster-based server systems are dedicated to the single application, for example, One-IP server system. One-IP server system has a clustered computing node with the same function and tries to distribute each request based on the If to the clustered node evenly. In this paper, we implemented the more useful application service platform. It works on shared clustered server(back-end server) with an application server(front-end server) for a particular service. An application server provides a particular service at a low load by itself, but as the load increases, it reconfigures itself with one or more available server from the shared cluster and distributes the load on selected server evenly We used PVM for an effective management of the clustered server. We found the implemented application service platform provides more stable and scalable operation characteristics and has remarkable performance improvement on the dynamic load changes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10B
• /
• pp.630-637
• /
• 2007

In this paper, we propose an effective handoff mechanism using events at the layer 2 and a tunnel-based mechanism that is performed by sharing information of a mobile node and anticipated-based handoff. Also, we propose a novel anticipated-reservation mechanism using the events triggered at layer 2 to make easy a resource reservation procedure. Comparing with the existing mobile IPv6 handoff mechanism, our proposed handoff mechanism can reduce an amount of handoff latency and traffic volume between access routers where handoff is performed. In the anticipated-reservation mechanism, the amount of signaling traffics between an mobile node and the correspondent nodes can be reduced and then the allocation of resource can be accomplished. We present the performance of our proposed handoff mechanism in the wireless network environment by ns-2 simulation. Although the anticipated-reservation mechanism including a proxy agent is explained without performance evaluation, we can validate the operation of our proposed model only by the procedure of message flow.

• Journal of Internet of Things and Convergence
• /
• v.6 no.4
• /
• pp.81-87
• /
• 2020

This paper creates a standard node for acquiring sensor data from various industrial sensors (IoT/non-IoT) for the establishment of Smart Factory Digital Twin, and provides inter-compatible data by linking zones by group/process to secure data stability and to ensure the digital twin (Digital Twin) of Smart Factory. The process of the Zone Master platform contains interface specifications to define sensor objects and how sensor interactions between independent systems are performed and carries out individual policies for unique data exchange rules. The interface for execution control of the Zone Master Platform processor provides system management, declaration management for public-subscribe, object management for registering and communicating status information of sensor objects, ownership management for property ownership sharing, time management for data synchronization, and data distribution management for Route information on data exchange.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.3
• /
• pp.9-17
• /
• 2021

In this paper, an autonomous multi-agent path planning using reinforcement learning for monitoring of infrastructures and resources in a computationally distributed system was proposed. Reinforcement-learning-based multi-agent exploratory system in a distributed node enable to evaluate a cumulative reward every action and to provide the optimized knowledge for next available action repeatedly by learning process according to a learning policy. Here, the proposed methods were presented by (a) approach of dynamics-based motion constraints multi-agent path-planning to reduce smaller agent steps toward the given destination(goal), where these agents are able to geographically explore on the environment with initial random-trials versus optimal-trials, (b) approach using agent sub-goal selection to provide more efficient agent exploration(path-planning) to reach the final destination(goal), and (c) approach of reinforcement learning schemes by using the proposed autonomous and asynchronous triggering of agent exploratory phases.

• Journal of Industrial Convergence
• /
• v.20 no.10
• /
• pp.17-24
• /
• 2022

Lora, a non-band network technology of the long-distance wireless standard LPWAN standard, uses ABP and OTTA methods and AES-128-based encryption algorithm (shared key) for internal terminal authentication and integrity verification. Lora's recent firmware tampering vulnerability and shared-key encryption algorithm structure make it difficult to defend against MITM attacks. In this study, the consensus algorithm(PBFT) is applied to the Lora network to enhance safety. It performs authentication and PBFT block chain creation by searching for node groups using the GPS module. As a result of the performance analysis, we established a new Lora trust network and proved that the latency of the consensus algorithm was improved. This study is a 4th industry convergence study and is intended to help improve the security technology of Lora devices in the future.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12A
• /
• pp.971-981
• /
• 2009

The coordination of distributed entities and events requires time synchronization. Precision time synchronization enables a variety of extensions of applications and provides much accurate information. The IEEE 1588 precision time protocol (PTP) provides a standard method to synchronize devices in a network. This paper deals with the design and implementation of a PTP gateway to extend IEEE 1588 to Zigbee networks. The PTP gateway can not only extend IEEE 1588 to Zigbee networks but also share the same time reference using IEEE 1588 between two or more Zigbee networks. This paper also presents experiments and performance evaluation of time synchronization using the PTP gateway. Our result established a method for nodes in a network to maintain their clocks to within a 300 nanosecond offset from the reference clock of a master node via Ethernet.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.208-210
• /
• 2006

그리드 환경에서는 원격의 이질적인 자원들을 서로 공유하며 상호 접근이 가능하도록 하여 사용자의 작업을 처리 할 수 있는 메커니즘을 제공한다. 하지만 각 노드들은 그리드에 자유롭게 참여 및 탈퇴가 가능하다는 점에서 P2P 네트워크 구조와 매우 유사하기 때문에 기존의 병렬처리 컴퓨터에서의 부하 균형문제와는 다른 특징을 갖게 된다. 본 논문에서는 동적인 자원 구성의 특징을 갖는 그리드 컴퓨팅 환경에서 발생할 수 있는 부하 균형 문제를 정의하고 이를 해결하기 위해 조정 노드(coordinating node)라고 불리는 부하 탐지 모듈을 설계 및 구현한다. 본 논문에서 제안된 조정 노드는 동적으로 변화하는 그리드 자원들의 상태를 실시간으에 탐지하게 되며 각 노드들이 네트워크에 새롭게 참여/탈퇴하여 네트워크 위상이 변화하는 경우에도 부하 균형을 달성 하게 된다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.8
• /
• pp.445-455
• /
• 2002

In this paper, we present a new task scheduling scheme ior the efficient execution of the tasks of compound nodes of hierarchical task graph(HTG) on shared memory system. The proposed scheme for exploitation functional parallelism is autoscheduling that performs the role of scheduling by processor itself without any dedicated global scheduler. To adapt the proposed scheduling scheme for various platforms, Including a uni-processor systems, Java threads were used for implementation, and the performance is analyzed in comparison with a conventional bit vector method. The experimental results showed that the proposed method was found to be more efficient in its execution time and exhibited good load-balancing when using the experimental parameter values. Furthermore, the memory size could be reduced when using the proposed algorithm compared with a conventional scheme.

• The KIPS Transactions:PartD
• /
• v.18D no.3
• /
• pp.169-178
• /
• 2011

Recently, data sharing between enterprises or organizations is required matter for task cooperation. In this process, when the enterprise opens its database to the affiliates, it can be occurred to problem leaked sensitive information. To resolve this problem it is needed to hide sensitive information from the database. Previous research hiding sensitive information applied different heuristic algorithms to maintain quality of the database. But there have been few studies analyzing the effects on the items modified during the hiding process and trying to minimize the hided items. This paper suggests eFP-Tree(Extended Frequent Pattern Tree) based FP-Tree(Frequent Pattern Tree) to hide sensitive frequent itemsets. Node formation of eFP-Tree uses border to minimize impacts of non sensitive frequent itemsets in hiding process, by organizing all transaction, sensitive and border information differently to before. As a result to apply eFP-Tree to the example transaction database, the lost items were less than 10%, proving it is more effective than the existing algorithm and maintain the quality of database to the optimal.