• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.734-745
• /
• 2006

This paper presents a PC cluster-based distributed VOD server that minimizes the load of an interconnection network by adopting the VIA communication protocol and the interval cache algorithm. Video data is distributed to the disks of the distributed VOD server and each server node receives the data through the interconnection network and sends it to clients. The load of the interconnection network increases because of the large amount of video data transferred. This paper developed a distributed VOD file system, which is based on VIA, to minimize cost using interconnection network when accessing remote disks. VIA is a user-level communication protocol removing the overhead of TCP/IP. This papers also improved the performance of the interconnection network by expanding the maximum transfer size of VIA. In addition, the interval cache reduces traffic on the interconnection network by caching, in main memory, the video data transferred from disks of remote server nodes. Experiments using the distributed VOD server of this paper showed a maximum performance improvement of 21.3% compared with a distributed VOD server without VIA and the interval cache, when used with a four-node PC cluster.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.16 no.3
• /
• pp.99-105
• /
• 2021

The cloud computing evolution has brought us increasing necessity to manage virtual resources. For this reason, Kubernetes has developed to realize autonomous resource management in a large scale. It provides cloud computing infrastructure to handle cluster creations and deletions in a secure virtual computing environment. In the paper, we provide a monitoring scheme in which users can observe securely encrypted protocols while each Kubernetes component exchanges their packets. Eventually, users can utilize the proposed scheme for debugging as well as monitoring.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.607-614
• /
• 2006

The checkpointing schemes should reduce the process delay through managing the checkpoints of each node to fit the network load to enhance the performance of the process running on the cluster system that write the checkpoints into its global stable storage. For this reason, a cluster system with single IO space on a distributed RAID chooses a suitable checkpointng scheme to get the maximum IO performance and the best rollback recovery efficiency. In this paper, we improved the striped checkpointing scheme with dynamic stripe group size by adapting to the network bandwidth variation at the point of checkpointing. To analyze the performance of the multi striped checkpointing scheme, we applied Linpack HPC benchmark with MPI on our own cluster system with maximum 512 virtual nodes. The benchmark results showed that the multistriped checkpointing scheme has better performance than the striped checkpointing scheme on the checkpoint writing efficiency and rollback recovery at heavy system load.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.301-303
• /
• 2001

본 연구는 저가의 가상현실 시스템을 구현하기 위하여 LAN에 연결된 다수의 PC들로 구성된 가상현실 시스템을 제시한다. 이때, PC들은 고유 기능에 따라 3차원 그래픽을 실시간으로 랜더링 하는 VR 서버, 가상공간의 운영을 위하여 GUI 인터페이스를 지원하는 제어 서버, 상호작용을 위하여 입출력 장치가 연결된 장치 서버로 분류한다. 제안하는 시스템의 핵심 기능은 분산된 서버들을 단일 가상공간에 통합하는 것이다. 우리는 서로 다른 특징을 가지는 서버들을 통합하기 위하여 동기 마스터/슬레이브, 이벤트 관리자, 상호 작용 관리자를 설계하고 이를 구현하였다.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.10a
• /
• pp.210-210
• /
• 2006

IT technologies(Chips, Grid and e-Science) are rapidly changed from 1965. In 1965, Intel co-founder Gordon Mooresaq the future. His prediction popularly known as Moore's law, state that the computer chips double in power every 18 months Grid computing offers a model for solving massive computational problems by making use of the unused resources of large numbers of disparate, often desktop, computers treated as a virtual cluster embedded in a distributed telecommunications infrastructure. In this paper, I will discuss current status of supercomputing technology and haw we can use these on CFD. Functionally, one can classify Grids into several types:

• The Journal of Korean Association of Computer Education
• /
• v.9 no.4
• /
• pp.63-74
• /
• 2006

A molecular docking is thc process of reducing an unmanageable number of compounds to a limited number of compounds for the target of interest by means of computational simulation. And it is one of a large scale scientific application that requires large computing power and data storage capability. Previous applications or software for molecular docking were developed to be run on a supercomputer, a workstation, or a cluster computer. However the virtual screening using a supercomputer has a problem that a supercomputer is very expensive and the virtual screening using a workstation or a cluster-computer requires a long execution time. Thus we propose Grid service based molecular docking application. We designed a resource broker and a data broker for supporting efficient molecular docking service and developed various services for molecular docking.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1034-1042
• /
• 2008

It is very hard, but important to sustain path stability for a reliable communication in mobile ad hoc networks. We propose a novel source routing protocol that establishes a group path with virtual multiple paths to enable a robust communication. The entire mobile nodes form a disjoint set of clusters: Each has its clusterhead as a cluster leader and a unique cluster label to identify itself from other clusters. A group path is a sequence of cluster labels instead of nodes and the nodes with the same label collaborate to deliver packets to a node with next label on the group path. We prove by resorting to simulation that our proposed protocol outperforms the existing key routing protocols, even for a network with a high node mobility and a high traffic.

• Convergence Security Journal
• /
• v.16 no.7
• /
• pp.21-29
• /
• 2016

Our society is currently exposed to environment of various information that is exchanged real time through networks. Especially regarding medical policy, the government rushes to practice remote medical treatment to improve the quality of medical services for citizens. The remote medical practice requires establishment of medical information based on big data for customized treatment regardless of where patients are. This study suggests establishment of regional medical cluster along with defense and protection cooperation models that in case service availability is harmed, and attacks occur, the attacks can be detected, and proper measures can be taken. For this, the study suggested forming networks with nationwide local government hospitals as regional virtual medical cluster bases by the same medical information system. The study also designed a mutual cooperation security model that can real time cope with IP Spoofing attack that can occur in the medical cluster and DDoS attacks accordingly, so that the limit that sole system and sole security policy have can be overcome.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.287-295
• /
• 2010

In wireless sensor networks(WSNs), the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) which considers one-hop clusters and a backbone-based tree. Since the clusters of a sink and a source node are connected via flooding into the infrastructure, it causes high routing cost. Although the network could reduce the number of clusters via multi-level clusters, if the source nodes exist at nearest clusters from the cluster attached by the sink and they are in different branches of the tree, the data should be delivered via detour paths on the tree. Therefore, to reduce the number of clusters, we propose a novel multi-hop cluster based communication protocol supporting sink mobility without global position information. We exploit a rendezvous cluster head for sink location service and data dissemination but the proposed protocol effectively reduces data detour via comparing cluster hops from the source. Simulation shows that the proposed protocol is superior to the existing protocols in terms of the data delivery hop counts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.433-441
• /
• 2003

We propose a new resource reservation scheme called MC-HMRSVP(Mobile clustering based-Hierarchical mobile ReSource reserVation Protcol) that is an extension of HMRSVP[3,4]. MC-HMRSVP always establishes a virtual cluster called Mobile Cluster, which includes its immediately adjacent MA(Mobile Agent) for passive reservation as well as the current MA for active reservation to which MH(Mobile Host) belongs. Our scheme also establishes the MC regardless of intra/inter region movement by GMA(Gateway Mobile Agent) function when a MH moves. To provide a general formulation on analyzing the performance in terms of reservation cost, we also model the resource reservation cost by using a simple recursive equation. Then, we show that our scheme decreases the reservation cost in comparison with the existing HMRSVP extentions.