• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2158-2170
• /
• 1999

It has been required more reliable communication on processes and improvement of system performance as distributed systems using multicast protocol became widespread. In distributed environment maintaining data consistency through asynchronous execution of processes and coordinating the activities of them would occurs. This paper proposes a total ordering algorithm, TORMP, in order to resolve these problems. TORMP takes advantage of multicast protocol and uses an effective token passing method. It reduces a process delaying time before transmitting its message by multicasting a token simultaneously to every process that initiates the request of the message. Moreover, the processes receiving the token start multicasting the message at the same time, which causes to cut down the overall transmission dely. In case that one process sends a message, TORMP hardly uses the procedure of controlling for ordering. It gives fairly the right of sending messages to all processes in a group with utilizing vector clock. In TORMP, unlike other algorithms, the number of packets generated during ordering process does not depend on the number of processes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.283-286
• /
• 2001

전통의 자기 디스크 형태 저장 장치로의 접근 지연 시간을 줄이고자, 최근에 서로 네트워크로 연결된 컴퓨터간의 메모리 자원들을 파일을 저장하는 장치로써 활용해 볼 수 있는 가상 장치(Network RamDisk)가 개발되었다. 이 시스템은 메모리 공간을 제공해 주는 서버의 노드들이 패리티 그룹(parity group)을 이루는 일종의 software RAID 시스템으로 한 서버의 노드 crash 에 대해 대응하는 것을 고려하지 않아 제 이의 서버가 노드 crash, 프로세스 crash 혹은 데이터 손실을 발생시키면 완전히 데이터를 잃어버리는, 신뢰성이 낮은 문제점이 있다. 본 논문은 클라이언트가 서버측의 노드 crash를 적절히 감지하고 새로운 서버로 fail over 할 수 있는 여러 가지 기법들을 설계하고 구현하였다. 또한 서버 풀(server pool)이라는 가상의 공간을 따로 관리하여 서버들에 대한 메모리 자원 요구 부하를 균등히 분산 시키는 효과도 얻도록 하였다.

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.1012-1021
• /
• 2005

This paper describes the design and implementation of an efficient multi-point multimedia conference system using IP grouping. Existing multi-point multimedia conference systems are difficult for multi-user to perform efficient cooperation due to bandwidth limitation for data transmission of video, audio and documentation. In the case that multi-user uses limited bandwidth, smooth cooperation does not accomplish due to transmission delay for the real-time transmission of image and speech data. A hybrid transfer method which is mixed with distributed and centralized methods is used for smooth cooperation, and the network bandwidth is reduced by forming multi-user conference systems of IP grouping in this paper. Also, adaptive image frame variations are used to solve bottleneck effect according to the number of users. An efficient multi-user conference system is designed to support audio quality.

• Journal of Convergence for Information Technology
• /
• v.9 no.7
• /
• pp.1-7
• /
• 2019

With the recent commercialization of the next generation of wireless 5G in everyday life, many changes have been made to organizations, industries and businesses of various sizes in various fields. However, although the improved speed and latency of 5G has improved, improvements in encryption, authentication and privacy are still required. In this paper, multiple groups of information management techniques are proposed to efficiently protect users' privacy in the heterogeneous environment of 5G. The proposed technique aims to allow distributed management of users' privacy links by clouding the privacy information generated by different heterogeneous devices to efficiently interface with different groups. Suggestion techniques process user-specific privacy information independently in a virtual space so that users can periodically synchronize their privacy information.

• Journal of Korea Game Society
• /
• v.4 no.4
• /
• pp.3-9
• /
• 2004

Expansion of internet and construction of high speed network which require multimedia services like MMORPG are exceeding the infra-structure. In this work, CBT is analyzed by focusing on the multicast routing protoco and the algorithm which is transformable to Anycast scheme from CBT scheme is suggested to adapt game traffic. Anycast routing scheme is suitable to distribute high density traffic. Simulation model was set per a number of group and group member, which enabled to reflect real environments. Performance evaluation of routing based on the characteristics of end-to-end delay of CBT and Anycast was mainly focused, The result showed that Anycast method was improved up 8.7%, 25.5%, 34.0%, 38.6% and 51.8%, 56.6% comparing with PIM-DM and CBT routing when packet site was 128, 512 and 1K byte respectively. From the simulation, CBT/Anycast routing scheme can be presented as a flexible and solid solution for the MMORPG traffic to improve the delay characteristics of game packets.

• Journal of Platform Technology
• /
• v.8 no.2
• /
• pp.22-31
• /
• 2020

The construction and operation of industrial automation has been actively taking place from manufacturing plan to production for improving operational efficiency of production line and flexibility of equipment. ISO/TC184 is standardizing on operating methods that can share information of programmable device controllers such as PLC and IoT that are geographically distributed in the production line. In this study, the design of the cell controller consists of PLC group and IoT group that perform signals such as temperature sensors, gas sensors, and pressure sensors for thermal processes and corresponding motors or valves. The operation and analysis of the cell controller were performed using SDN(Software Defined Network) and the three types of process services performed in thermal processes are real-time transmission service, loss-sensitive large-capacity transmission service, and normal transmission service. The simulation result showed that the average loss rate improved by about 17% when the traffic increased before and after the application of the SDN route technique, and the delay in the real-time service was as low as 1 ms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2037-2043
• /
• 2015

Proposed algorithm in this thesis introduced cells, units of router group, to conduct distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. Also, through this experiment, in case of a network was damaged in existing optimal path algorithm, Dijkstra algorithm, the proposed algorithm was designed to route an alternative path and also as it has a 2nd shortest path in cells of the damaged network so it is faster than Dijkstra algorithm, The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.599-602
• /
• 2014

Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. With regard to procedures of proposal algorithm, duplicated agents were transferred to the point, where the second, third, and fourth cells were created in order, after the first cell was made, and the agents were engineered to search the shortest path to each cell, and then find the most efficient element through competition.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.632-635
• /
• 2015

Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was found superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

• Journal of the Korea Computer Graphics Society
• /
• v.4 no.1
• /
• pp.89-100
• /
• 1998

A multi-user virtual reality system supports shared environments for concurrent accesses by multiple users. The performance of these systems depends heavily on the network environments. This paper experiments an effective network model for shared virtual environments. This model has a middle layer called groups placed between the server and its clients, and the tasks of server are distributed to these groups. Using groups solves some of the problems of existing systems such as lack of scalability, message overheads, and latency due to message passing among locally communicating entities in the virtual environment. Some experiments show lower overhead than existing distributed virtual environment systems in WAN as well as LAN environments. This model also supports a method that can be used to construct application specific network environments using message handler which allows user-defined message formats.