• Journal of Convergence for Information Technology
• /
• v.7 no.6
• /
• pp.97-102
• /
• 2017

In this paper, we have interested in cooperative intelligent transport system and autonomous driving system, and focused on analysis of the characteristics of Cooperative Awareness Message (CAM) and Decentralized Environmental Notification Basis Service (DENM) message, which is key delivery message among cooperative intelligent transport system (C-ITS) characteristics for research objectivity. For research method, we also described V2X communication, and also analyzed the security certificate and header structure of CAM and DENM messages. We described CAM message, which is a message informing the position and status of the vehicle. And the DENM message is presented a message informing an event such as a vehicle accident, and analysis security communication, which is supported services. According to standard analysis result, 186 bits or 275 bits are used. In addition to the security header and the certificate format used for vehicle communication, we have gained the certificate verification procedure for vehicles and PKI characteristics for vehicles. Also We derived the characteristics and transmission capability of the security synchronization pattern required for V2X secure communication. Therefore when it is considered for communication service of DENM and CAM in the C-ITS environment, this paper may be meaningful result.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.6
• /
• pp.145-154
• /
• 2018

A loosely coupled message broker system is a popular method for integrating distributed software components. Especially, a distributed broker structure with multiple brokers with active-standby or active-active message replicas are used to enhance availability as well as message processing performance. However, there are problems in both active-standby and active-active replica structure. The active-standby has relatively low processing performance and The active-active structure requires a high synchronization overhead. In this paper, we propose an active-active structure of replicas to increase the availability of the brokers without compromising its high fault-tolerancy. In the proposed structure, standby replicas process the requests of the active replicas so that load balancing is achieved without additional brokers, while the distributed coordinators are used for the synchronization process to decrease the overhead. We formulated the overhead incurred when synchronizing messages among replicas, and the formulation was used to support the experiment results. From the experiment, we observed that replicas of the active-active structure show better performance than the active stand-by structure with increasing number of users.

• Journal of KIISE
• /
• v.42 no.11
• /
• pp.1332-1338
• /
• 2015

Recently, growing attention has been paid to multi-GPU rendering to support real-time high-quality rendering at high resolution. In order to attain high performance in real-time multi-GPU rendering, great care needs to be taken to reduce the overhead of data transfer among GPUs and frame composition. This paper presents a novel multi-GPU algorithm that greatly enhances split frame rendering with implicit query-based synchronization. In order to support implicit synchronization in frame composition, we further present a message queue-based scheduling algorithm. We carried out an experiment to evaluate our algorithm, and found that our algorithm improved rendering performance up to 200% more than previously existing algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.6
• /
• pp.863-870
• /
• 1993

A new methodology of multimedia data composition generated SRT(Synchronization Relation Tree) dynamically after user composing multimedia date by using high level user interface, and processes message passing protocols to adjust multimedia data temporal composition. In this paperl we propose SRT generating algorithm which transfer user defined timeline diagram to SRT dynamically. SRT generating algorithm is to use divide and conquer methodology and recurvise programming. And prove that it generates and type of multimedia date compositon to SRT.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.6
• /
• pp.1215-1222
• /
• 2009

In this paper, a method of designing a controller which ensures the synchronization between the transmission and the reception ends of chaotic secure communication systems with interval time-varying delays is proposed. To increase communication security, the transmitted message is encrypted with the techniques of N-shift cipher and public key. And to reduce the conservatism of the stabilization criterion for error dynamic system obtained from the transmitter and receiver, a new Lyapunov-functional and bounding technique are proposed. Through a numerical example, the effectiveness of the proposed method is shown in the chaotic secure communication system.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.3
• /
• pp.3-9
• /
• 2011

In this paper, we propose workload partitioning methods in parallelizing AES-CCM which is proposed as the wireless encryption and message integrity standard IEEE 802.11i. In parallelizing AES-CCM having data dependency, synchronizations among processors are required, and multi-core processors have a very large range of synchronization performance. We propose and compare the performance of various workload partitioning methods by considering both the computational characteristics of AES-CCM and the synchronization overhead.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.647-656
• /
• 2002

Synchronization is the process of making replicated data on multiple devices be consistent, i.e., identical with each other. In Dec. 2000, major handheld computer manufacturers including Nokia, Ericsson, IBM published the SyncML protocol specification. In this paper, we describe the CNU SyncML server for PIMS(Personal Information Management System) service that we developed based on the SyncML specification. The server architecture and capabilities of the frames are presented along with the procedure of message processing by each frame. We put the CNU SyncML server to the conformance tests and interoperability tests to confirm its functionality. The session managing mechanism of the CNU SyncML server showed better performance than our previous implementations.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.251-266
• /
• 1996

In this paper, we design MHEG engine that can generate MHEG objects and present It to the users in Multimedia/Hypermedia Applications In the MHEG engine, the transmitted MHEG objects decoded into internal format. For the easy interpretation of MHEG objects, we define internal format as to be matched for each MHEG object. We easily processobjectinformation using the tree data structure because object inheritance and possession can be represented in tree structure. Object inheritance and possession must be represented in the internal format because they used in resolving the reference to external objector data file. The presentation synchronization extracts the synchronization information from MHEG composite objects, representing and controlling heterogencous media associated to spatio- temporal relation. In order to exactly represent the spatio-temporal synchronization included into MHEG composite object, we propose the algorithm that processes synchronization using the message of the synchronization module and the internal objects. MHEG engine proposed in this paper may be basic technology fro multimedia application area using Korea New Net.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1194-1205
• /
• 1999

인과적 메시지 로깅은 정상수행시 낙관적 메시지 로깅의 장점을 가지고, 회복시 비관적 메시지 로깅의 장점을 가지고 있다. 본 논문에서는 회복 프로세스들간의 비동기성을 향상시키기 위한 인과적 메시지 로깅에 기반한 새로운 회복 알고리즘을 제안하고자 한다. 기존의 인과적 메시지 로깅 기반 회복 알고리즘들은 살아있는 프로세스들의 수행을 대기시키거나, 회복 프로세스들간의 높은 동기성을 요구한다. 본 논문에서 제안하는 회복 알고리즘은 각 회복 프로세스가 자신의 회복만을 책임지게 함으로써, 여러 개의 프로세스들이 동시적으로 고장이 발생하더라도 회복시 살아있는 프로세스들의 수행을 대기시키지 않고, 회복 프로세스들 중 하나의 회복 프로세스에게만 과부하가 발생하지 않도록 한다. 또한, 제안하는 알고리즘은 각 회복 프로세스의 회복 과정이 다른 회복 프로세스의 연속적인 고장들에 의해 지연되지 않도록 한다. 본 논문에서는 제안하는 회복 알고리즘의 정당성을 증명하고, 시뮬레이션을 통해서 제안하는 회복 알고리즘이 기존 회복 알고리즘에 비해 고장난 프로세스의 평균회복시간을 단축시킨다는 것을 보여준다.Abstract Causal message logging has the advantages of optimistic message logging during failure-free execution and pessimistic message logging during recovery. In this paper, we present a new recovery algorithm based on causal message logging for improving asynchrony among recovering processes. Existing recovery algorithms based on causal message logging block the execution of live processes or require high synchronization among recovering processes. As each recovering process is responsible for only its recovery in our algorithm, the algorithm avoids blocking the execution of live processes during recovery even in concurrently multiple failures and overloading only one among recovering processes. Moreover, it allows the recovery of each recovering process not to be delayed by the continuous failures of other recovering processes. We prove the correctness of our recovery algorithm, and our simulation results show that our algorithm reduces the average recovery time of a failed process compared with the existing recovery algorithms.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.18 no.6
• /
• pp.762-770
• /
• 2015

Fault tolerance is a crucial design for a mission-critical computer such as engagement control computer that has to maintain its operation for long mission time. In recent years, software fault-tolerant design is becoming important in terms of cost-effectiveness and high-efficiency. In this paper, we propose MPCMCC which is a model-based software component to implement fault tolerance in mission-critical computers. MPCMCC is a fault tolerance design that synchronizes shared data between two computers by using the one-way message-passing scheme which is easy to use and more stable than the shared memory scheme. In addition, MPCMCC can be easily reused for future work by employing the model based development methodology. We verified the functions of the software component and analyzed its performance in the simulation environment by using two mission-critical computers. The results show that MPCMCC is a suitable software component for fault tolerance in mission-critical computers.