• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.1
• /
• pp.22-32
• /
• 2003

Many of multimedia applications in distributed environments generate the packets which have the real-time characteristics for continuous audio/video data and transmit them according to the teal-time task scheduling theories. In this paper, we model the traffic for continuous media in the distributed multimedia applications based on the high-bandwidth networks and introduce the PDMA algorithm which is the hard real-time task scheduling theory for guaranteeing QoS requested by the clients. Furthermore, we propose the admission control to control the new request not to interfere the current services for maintaining the high quality of services of the applications. Since the proposed admission control is sufficient for the PDMA algorithm, the PDMA algorithm is always able to find the feasible schedule for the set of messages which satisfies it. Therefore, if the set of messages including the new request to generate the new traffic. Otherwise, it rejects the new request. In final, we present the simulation results for showing that the scheduling with the proposed admission control is of practical use.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1503-1514
• /
• 2006

Today, consumers can access Internet from everywhere, therefore most commercial and other organizations provide their services on the Web. As the result, countless Web service systems are already on the Internet and more systems are under construction. Therefore, many researches of verifying that the system to be constructed will not have any deadlock and will run successfully without any problem at the early stage of design have been performed. Several Petri net based verification methods have also been published. However, they have focused on building Petri net models of Web service systems and none of them introduces efficient analysis methods. As a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the initial marking in a timed net, the minimum cycle time method has been widely used in computer system analysis. A timed net is a modified version of a Petri net where a transition is associated with a delay time. A delay time used in a timed net is a constant even though the duration time associated with an event in the real world is a stochastic number in general. Therefore, this paper proposes 'Mixedly Distributed Stochastic Timed Net' where a transition can be associated with a stochastic number and introduce a minimum cycle time analysis method for 'Mixedly Distributed Stochastic Timed Net'. We also introduce a method of analysing a Web service system's response time with the minimum cycle time analysis method for 'Mixedly Distributed Stochastic Timed Net.'.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4508-4530
• /
• 2021

Today distributed data storage service are being widely used. However lack of proper means of security makes the user data vulnerable. In this work, we propose a Randomized Block Size (RBS) model for secure data storage in distributed environments. The model work with multifold block sizes encrypted with the Chinese Remainder Theorem-based RSA (C-RSA) technique for end-to-end security of multimedia data. The proposed RBS model has a key generation phase (KGP) for constructing asymmetric keys, and a rand generation phase (RGP) for applying optimal asymmetric encryption padding (OAEP) to the original message. The experimental results obtained with text and image files show that the post encryption file size is not much affected, and data is efficiently encrypted while storing at the distributed storage server (DSS). The parameters such as ciphertext size, encryption time, and throughput have been considered for performance evaluation, whereas statistical analysis like similarity measurement, correlation coefficient, histogram, and entropy analysis uses to check image pixels deviation. The number of pixels change rate (NPCR) and unified averaged changed intensity (UACI) were used to check the strength of the proposed encryption technique. The proposed model is robust with high resilience against eavesdropping, insider attack, and chosen-plaintext attack.

• Journal of Korea Multimedia Society
• /
• v.4 no.2
• /
• pp.161-170
• /
• 2001

Mobility management technology is one among the most important issues in future mobile communication systems. The mobility management technology includes location management and handoff technologies. In this paper, we present a hierarchical distributed dynamic location management scheme that is compatible with the IMT-2000 environment. The proposed scheme composes a cluster with location registers, then makes up a hierarchical structures consisting of clusters. Each layer in the hierarchical structure uses different location management strategies cooperating another layers with each other. Also, the proposed scheme uses location update algorithm considering the frequency of location queries from nodes outside the local cells. We evaluate the performance of the proposed scheme through an analytical model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.1 no.2
• /
• pp.145-158
• /
• 1997

Method for synchronizing multimedia data is needed to support continuous transmission of multimedia data through a network in a bounded time and it also required for supporting continuous presentation of multimedia data with the required norminal playout rate in distributed network environments. This paper describes a new synchronization method for supporting delay-sensitive multimedia Presentation without degration of Quality of services of multimedia application. It mainly aims to support both intermedia and intermedia synchronization by absorbing network variations which may cause skew or jitter. In order to remove asynchonization problems, we make use of logical time system, dynamic buffer control method, and adjusting synchronization intervals based on the quality of services of a multimedia. It might be more suitable for working on distribute[1 multimedia systems where the network delay variation is changed from time to time and no global clock is supported. And it also can effectively reduce the amount of buffer requirements needed for transfering multimedia data between source and destination system by adjusting synchronization intervals with acceptable packet delay limits and packet loss rates.

• Journal of Korea Multimedia Society
• /
• v.22 no.4
• /
• pp.463-471
• /
• 2019

The growth of mobile technology particularly smartphone applications such as ticketing, access control, and making payments are on the increase. Elliptic Curve Cryptography (ECC)-based systems have also become widely available in the market offering various convenient services by bringing smartphones in proximity to ECC-enabled objects. When a system user attempts to establish a connection, the AIK sends hashes to a server that then verifies the values. ECC can be used with various operating systems in conjunction with other technologies such as biometric verification systems, smart cards, anti-virus programs, and firewalls. The use of Elliptic-curve cryptography ensures efficient verification and signing of security status verification reports which allows the system to take advantage of Trusted Computing Technologies. This paper proposes a device payment method based on ECC and Shuffling based on distributed key exchange. Our study focuses on the secure and efficient implementation of ECC in payment device. This novel approach is well secure against intruders and will prevent the unauthorized extraction of information from communication. It converts plaintext into ASCII value that leads to the point of curve, then after, it performs shuffling to encrypt and decrypt the data to generate secret shared key used by both sender and receiver.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.137-144
• /
• 2005

Many reliable group communication algorithms were presented to satisfy predetermined message ordering properties in small or medium-scale distributed systems. However, the previous algorithms with their strong reliability properties may be unappropriate for large-scale systems. To address this issue, some epidemic-style group communication algorithms were proposed for considerably improving scalability while guaranteeing the reasonably weaker reliability property than the existing ones. The algorithms are all designed for ensuring the atomic order message delivery property. But, some distributed applications such as multimedia systems and collaborative work, may require only the weaker message ordering property, i.e., causal order delivery. This paper proposes an efficient epidemic-style group communication algorithm ensuring causal order delivery to provide the indigenous scalability of the epidemic-style approach.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.449-452
• /
• 2000

This paper proposes a new, adaptive Dead Reckoning model, called Dynamic Dead Reckoning , for Distributed Interactive Simulation and humanoid avatar systems. The proposed model can overcome the weak points of traditional Dead Reckoning caused by a fixed threshold and strong dependency on rotation event. This paper introduces new criteria for update message filtering , named as Update lifetime. The Dynamic Dead Reckoning keeps the balance between extrapolation fidelity and filtering performance by two component models, Variable Threshold Mechanism and Rotation Event model. The experimental results show that the proposed model can lower the increment rate of update traffic to the increase of rotation frequency without any significant loss of accuracy.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.04a
• /
• pp.376-381
• /
• 1998

다른 지역에 존재하는 자원이나 데이터들을 이용가능하게 하고, 지정된 마감시간내에 결과를 제공해야 하는 시간적 특성을 가진 분산 실시간 시스템의 성능과 신뢰성을 향상시킬 수 있는 장점을 가진다. 이러한 시스템에서 수행되는 타스크는 크게 주기적 타스크와 비주기적 타스크로 나누어지는데, 빠른 수행시간을 위해 대부분의 타스크들은 병렬로 처리되기 위해 여러 개의 서브 타스크들로 분할되어 실행된다. 본 연구에서는 분산 실시간 환경에서 임의의 시간에 마감시간을 가지고 도착한 주기적 타스크에 서브 타스크의 유형에 따라 서브 타스크간의 통신시간과 수행시간을 고려한 EST(Earliest Start Time)기법을 이용하여 서브 타스크들의 효율적인 마감시간 할당 알고리즘과 ITC(Inter Task Communication)시간을 개선하기 위한 처리기 중복 할당 알고리즘을 제시하고 있다. 수행된 결과는 기존의 방법과 비교하여 타스크 전체의 마감시간 위반 최소화와 처리기의 이용률 개선 및 처리기간의 통신시간과 수행 완료시간을 개선하고 있다.

• Journal of Korea Multimedia Society
• /
• v.18 no.6
• /
• pp.710-722
• /
• 2015

Counterfeit products have been a major concern in global market. With the emergence of RFID systems, to detect counterfeit products in supply chain is relatively easy. Many anti-counterfeiting techniques for products attached by RFID tag are proposed. Most of the previous anti-counterfeiting techniques are not considering the distribution of the counterfeit from a customer to a customer. Using the ownership transfer protocols we can prevent the counterfeit from being distributed on the supply chain as well as between the customers and the customers. The ownership transfer protocols must be modified for anti-counterfeiting because of the usage of the protocol. In this paper, we modify the ownership transfer protocol proposed by G. Kapoor and S. Piramuthu[1] to be able to detect the counterfeit and track and trace the products in the supply chain. Our proposed protocol consists of three phases: the products delivery phase, the products takeover phase, and the products sale phase. We show that our protocol is anti-counterfeiting as well as secure against the security attacks.