• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.6
• /
• pp.331-339
• /
• 2002

This paper presents a garbage collection protocol for checkpoints and message logs which are staved on the stable storage or volatile storage for fault tolerancy. The previous works of garbage collections in coordinated checkpointing protocol delete all the checkpoints except for the last checkpoints on earth processes. But implemented in top of reliable communication protocol like as TCP/IP, rollback recovery protocol based on only last checkpoints makes sympathetic rollback. We show that the old checkpoints or message logs except for the last checkpoints have to be preserved in order to replay the lost message. And we define the conditions for garbage collection of checkpoints and message logs for lost messages and present the garbage collection algorithm for checkpoints and message logs in coordinated checkpointing protocol. Since the proposed algorithm uses process information for lost message piggybacked with messages, the additional messages for garbage collection is not required The proposed garbage collection algorithm makes 'the lazy garbage collectioneffect', because relying on the piggybacked checked checkpoint information in send/receive message. But 'the lazy garbage collection effect'does not break the consistency of the whole systems.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.11-20
• /
• 2007

This paper designs and implements a message passing library called JMPI (Java Message Passing Interface) which complies with MPJ (Message Passing in Java), the MPI standard Specification for Java language, This library provides some graphic user interface tools to enable parallel computing environments to be configured very simply by their administrators and JMPI applications to be executed very conveniently. Also in this paper, we implement two versions of systems using Socket and RPC which are both typical distributed system communication mechanisms and with three benchmark applications, compare performance of these systems with that of an existing system JPVM depending on the increasing number of the computers. Experimental results show that our systems outperform JPVM system in terms of various aspects and that the most efficient processing speedup can be obtained by increasing the number of the computers in consideration of network traffic through processing evaluation. Finally, we can see that, as the number of computers increases, using RMI to transmit a message is more effective than using object streams attached to sockets to transmit a message.

• Journal of Software Engineering Society
• /
• v.26 no.1
• /
• pp.1-16
• /
• 2013

Variable length information message is a communication protocol standard in order for computer network systems to provide efficient delivery of information. The variable length information messages were developed for varying and controlling details of information in accordance with message receiver's required information level or information access level. In the previous studies, data compressing techniques have been in use for information message optimization technologies in order to reduce physical sizes of information messages. In optimization technologies for information messages, accuracy of information is considered as the most important factor; therefore, only non-loss compression techniques are applied to the optimization technologies. However, the non-loss compression based information message optimization methods are not efficient in data compression, and these are limited to efficient delivery of information in wireless network environments that have constraint bandwidth. In this paper, we attempt to optimize information in the variable length information messages at message fields in order to reduce physical sizes of messages more efficiently. To demonstrate the efficiency of our approach, we conduct optimization experiments for variable length information messages.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.543-548
• /
• 2017

In the conventional algorithm, the D2D message dissemination algorithm based on the Epidemic routing protocol frequently causes a problem of duplication of the received messages due to the overlaps of D2D transmission coverages. It is because all D2D devices that receive the messages perform relaying the message replicas to other D2D devices within their transmission range. Therefore, we herein propose the farthest-k relay selection algorithm to mitigate this message duplication problem. In the farthest-k relay selection algorithm, less than k devices within the D2D transmission range perform message relay. Furthermore, we perform comparative performance analysis between the conventional D2D data dissemination algorithm and our farthest-k relay selection algorithm. By using intensive MATLAB simulations we prove the performance excellency of our farthest-k relay algorithm compared with the conventional algorithm with respect to coverage probability, the total number of initially and duplicately received messages, and transmission efficiency.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1995.10a
• /
• pp.288-291
• /
• 1995

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1985.10a
• /
• pp.134-137
• /
• 1985

• Proceedings of the KIEE Conference
• /
• 2008.11a
• /
• pp.376-378
• /
• 2008

This paper covers that modem performance test is effected by traffic and analysis of the result in TETRA network. The SDS is a method of the between PEIs transmission. And only SDS message type-4 is used to test. The range of the SDS message data length is from 10 to 140 bytes with an increment of 10 bytes. For each length transmitted 1000 times for each delay of inter-transmissions 0.5 second, 1.0 second and 1.5 second. The modem used in the test is the Unimo MU-1000MD by UNIMO Corp.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.21 no.3
• /
• pp.361-369
• /
• 2018

This paper proposes a design of asymmetric time division multiple access method for tactical radio communication. Typical tactical radio communication has a limited execution of transmission, because uplink message requires more extended response time than downlink message. In order to solve this problem, this paper analyzes operational environment of Korean tactical radio communication and proposes an asymmetric TDMA based on it for performance of tactical communication. The simulation model is used to investigate constraints of real experiments for proving effectiveness of the proposed approach. Simulations results show that the proposed scheme outperforms the conventional scheme in terms of throughput, response time, and delay.

• Archives of design research
• /
• v.14 no.1
• /
• pp.7-16
• /
• 2001

Human beings have been leading their life and desirable social life through communication. Human communication has been changed and expanded through language, letters, printing media, broadcasting media, and more recently network communication media. Since the invention of characters, books have been the human beings' communication medium that have the longest history, and they have preserved and succeeded human spiritual world. Children's picture books are also a communication medium composed of the transmitter of the information, message, medium, and the receiver, and makes the process of communication. The sender: writer, illustrator, and editor, analyzes children, special receiver, symbolizes messages, make up contents and make communication come true by selecting media and effectively delivering them to children. Considering the developmental characteristics of the receiver, children and their desires, visual media such as the writings and illustrations. The writings and illustrations are the most appropriate for communication with children. The first, picture books are for the communication between grown-ups and children, and also that with society for helping children find their identity and perform their roles. The second, through the message of writings and illustrations young children acquire human communication ability of this age. That is, they experience and learn visual communication and letter communication

• Journal of Korea Multimedia Society
• /
• v.14 no.6
• /
• pp.752-758
• /
• 2011

In this paper, we perform a research on a message delivery link based on visible light communication using illumination light-emitting diodes (LEDs) for car-to-car communications and the link transmission success probability is analyzed for the link. The message delivery system is modeled and the signal-to-noise ratio is calculated from the received optical power. Then, the link transmission probability is estimated from the calculated bit error rates (BERs). The message delivery system has optical links from an LED transmitter near the rear lamp of a car ahead to a receiver near the headlamp of a car behind, whose positions are assumed to follow the normal Gaussian distribution. The link transmission success probability is calculated considering the physical characteristics of the optical link. The car positions are generated according to the normal distribution and the bit error rates are calculated for all links. The link transmission success probability is defined. For the unoptimized optical car-to-car message delivery links, it is shown that the link transmission success probability is larger than 0.9 with the transmitted optical power of 400 mW and the semi-angle at half power of 30 degree.