• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.767-777
• /
• 1999

인과적 메시지 로깅 기법은 정상프로세스를 역전(roll-back)시키거나 메시지의 저장을 위해 프로세스의 수행을 중단시키지 않는 장점을 지니고 있지만, 메시지의 크기가 지나치게 커진다는 단점을 지니고 있다. 본 논문에서는 인과적 메시지 로깅 기법의 이러한 문제점을 해결하기 위하여 로그 상속의 개념을 정의하고 로그 연혁을 이용하여 로그 비용, 특히 로그 크기 면에서 효율적인 로깅 기법을 제안한다. 또한 이 로깅 알고리즘을 이용하여 복구시 메시지의 수와 크기를 줄여 복구시간을 줄이는 효율적인 복구 알고리즘을 제안하고, 제안한 알고리즘이 메시지 로그 크기 면에서 효율적임을 증명한다. 또 제안한 알고리즘의 성능을 검증하기 위하여 두 가지 종류의 모의 실험을 수행하여 기존의 로깅 프로토콜과 메시지 크기 면에서의 성능을 비교한 결과를 제시하였다.Abstract Causal message logging has many good properties such as nonblocking message logging and no rollback propagation. However, it requires a large amount of information to be piggybacked on each message, which may incur severe performance degradation. This paper presents an efficient causal logging algorithm based on the new message log structure, LogOn, which represents the causal inter-process dependency relation with much smaller overhead compared to the existing algorithms. The proposed algorithm is efficient in the sense that it entails no additional information other than LogOn to be carried in each message, while other existing algorithms require extra information other than the message logs. This paper also presents an efficient recovery algorithm to solve the problem of a large amount of data exchanges during the recovery. To verify the performance of our algorithm, we give an analysis of the algorithm and perform two simulations and compare the log size with other causal logging protocols.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.1-14
• /
• 1994

In this paper, an analytical model of the message delay in the DQDB (Distributed Queue Dual Bus) network is investigated. The DQDB network has been adopted as a subnetwork for the IEEE 802 MAN (Metropolitan Area Network) standard. The DQDB network consists of two high speed undirectional buses and a series of stations attached to both of the buses. Massages arriving at each station consists of severla packets according to its size. This system is approximated into " $B^{[x]}$/G/1 with exceptional first service queueing " by defining the concept of service time on a packet. The service time for a packet is defined as the time from the instant the packet arrives at the transmission buffer until the time the packet is fully transmitted. By using the BASTA property and the average work in the system, the mean message delay time is obtained.age work in the system, the mean message delay time is obtained.d.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.327-330
• /
• 2004

This research work is concerned with a location-based alert service in wireless communication network environment. The alert service automatically transfers alert message to subscriber in the disaster area. This research work deals with automatic alert services that automatically provide people in emergency area with the state of emergency. The alert service uses the mobile device to inform its urgency to the subscribers in its area. The location tracking service will give the list of people in emergency area. The all processes of this research work are followed as. First, when a disaster or a calamity comes in, an emergency management center receives the emergency to analyze its shape and size and to declare the place to 'the disaster area.' Secondly, then the center finds information of mobile device subscribers in the disaster area. Finally, the center automatically generates a shape of text or audio of alert message of the emergency to send the message to the subscribers in the disaster area. Our mobile automatic alert service proposed above is so efficient that the subscribers in disasters area may meet the emergency more efficiently and may save their own valuable lives and properties more safely.

• ETRI Journal
• /
• v.38 no.1
• /
• pp.123-132
• /
• 2016

The Boneh, Goh, and Nissim (BGN) cryptosytem is the first homomorphic encryption scheme that allows additions and multiplications of plaintexts on encrypted data. BGN-type cryptosystems permit very small plaintext sizes. The best-known approach for the expansion of a message size by t times is one that requires t implementations of an initial scheme; however, such an approach becomes impractical when t is large. In this paper, we present a method of message expansion of BGN-type homomorphic encryption using composite product pairing, which is practical for relatively large t. In addition, we prove that the indistinguishability under chosen plaintext attack security of our construction relies on the decisional Diffie-Hellman assumption for all subgroups of prime order of the underlying composite pairing group.

• Asia-Pacific Journal of Business
• /
• v.4 no.1
• /
• pp.43-51
• /
• 2013

The research is done with reference to insurance industry. Three companies are taken for the study, first one is LIC, second is ICICI Prudential and third one is ING Vysya life insurance. The impact of advertising message was seen on the brand image of these companies. Six print ads were taken for each company and data was collected from five hundred and forty respondents and forming a sample size of thirty. Three questionnaires were prepared one for brand image before showing ad; second one for advertising message and third one for brand image after showing ads. Through this study these three companies were also compared on the ground of which company has the effect on its brand image by showing ads of that company before and after.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.1
• /
• pp.79-84
• /
• 2016

In this paper, we propose reliable message transmission scheme based on CoAP, considering the constrained feature of IoT device, such as low power, the limited memory size and low computing capacity. Recently, the various kinds of application protocol has been studied to support IoT environments. In particular, CoAP protocol was developed as application protocol for IoT at the IETF core WG. However, because CoAP protocol is deigned to be used in constrained node, this protocol uses UDP at transport layer. Thus, data loss may occur frequently in network congestion environments. The proposed scheme, in this paper, is to overcome the problem of frequent data loss with low overhead. Also it includes the function which is to minimize the data loss in sleep mode of IoT device.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.11
• /
• pp.2678-2684
• /
• 2014

In this paper a new message control method that can reduce server load and network traffic in XMPP/SIP presence service system has been proposed. This presence service system can process both XMPP(Extensible Massaging and Presence Protocol) based presence information and SIP(Session Initiation Protocol) based presence information. A new XMPP stanza architecture with added elements for presence stanza and IQ stanza has been designed, and a new presence information data processing method which can reduce size of SIP notification message and SIP PUBLISH message has been suggested. Furthermore a messages exchanging procedure that can transfer presence information between XMPP domain and SIP domain has been also suggested. The performance of the proposed system has been analysed by simulation.

• Journal of Korea Society of Industrial Information Systems
• /
• v.22 no.5
• /
• pp.9-15
• /
• 2017

In the Digital Age, All Data used in the Internet is Digitized and Transmitted and Received Over a Communications Network. Therefore, it is Important to Transmit Data with Confidentiality and Integrity, Since Digital Data may be Tampered with and Tampered by Illegal users. Steganography is an Efficient Method for Ensuring Confidentiality and Integrity Together with Encryption Techniques. I Propose a Hangul Steganography Method that Inserts a Secret Message based on a Changing Insertion Position and a Changing Eojeol Size in a Cover Medium. Considering the Insertion Capacity of 3.35% and the File Size Change of 0.4% in Hangul Text Steganography, Experimental Results Show that the Jaro_score Value needs to be Maintained at 0.946.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.4
• /
• pp.418-423
• /
• 2014

Intelligent Transportation Systems (ITS) are advanced applications which, without embodying intelligence as such, aim to provide innovative services relating to different modes of transport and traffic management and enable various users to be better informed and make safer, more coordinated, and 'smarter' use of transport networks. However, ITS has the different size and shapes according to the city environment policy to adjust the city scene and it has to be displayed by different message on the information display device in real-time. And the information service providers must make the information display system which has the different information and data each time. That is very time and workers consuming and auto message frame generation system is necessary. In this paper, we design and develop the message frame generation system which can set several parameters easily for the generation of the message frame automatically on the windows environment and we do not need to go the field to get the test data.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.277-285
• /
• 2002

This paper proposes and analyzes an error control scheme for the transmission control based real-time communication, such as FDDI, TDMA, and wireless LAN, which delivers the message according to the round robin fashion after the off-line bandwidth allocation. Taking into account the time constraint of each message, the proposed error control scheme makes the receiver transmit the error report via asynchronous traffic while the sender resend the requested message via overallocated access time which is inevitably introduced by the bandwidth allocation procedure for hard real -time guarantee. The error control procedure does not interfere other real -time message transmissions. In addition, as each frame contains the size of the message it belongs, the receiver can recognize the end of completion of message transmission. This enables earlier error report to the receiver so that the sender can cope with more network errors. The analysis results along with simulation performed via SMPL show that the proposed scheme is able to enhance the deadline meet ratio of messages by overcoming the network errors. Using the proposed error control scheme, the hard real -time network can be built at cost lower than, but performance comparable to the expensive dual link network.