• Journal of Digital Contents Society
• /
• v.3 no.1
• /
• pp.101-111
• /
• 2002

Lately development of network around Internet expands range of data traffic to multimedia information, and so for the guarantee of multimedia services end-to-end QoS(Quality of Service) must service because comparing with existing Internet service can not support For satisfying those QoS requirements, network have to guarantee not only network on parameter, such as delay, jitter, throughput but also system resources like CPU utilization, memory usage. Therefore it is urgent to develop QoS based middleware to distribute multimedia data and maximize network utilization in the limited resource environment. And it must be necessary of network to provide end-to-end QoS(Quality of Service) for multimedia applications. Multimedia applications want that QoS which satisfy their own service properties be guaranteed Then, We must analyze those necessary QoS requirements md define QoS parameter which specify as two viewpoint, user's and network's perspective. Therefore network provider supplying network for usual user and university, enterprise must want to find about their own network performance and problem. It is essential for network manager to want to use a tool like this. On the basis of technique about QoS test-bed in the AIM network, We studied on the method of QoS measurement and management about end-to-end connection in the Internet. We measured network status about end-to-end connection and analyze the result of performance.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.4
• /
• pp.19-25
• /
• 2010

In this paper, the performance of the DoS information security algorithm is evaluated to provide the multimedia traffic between the nodes using the multicasting services. The essence technology for information security to distribute the multimedia contents is presented. Under the multicasting services, a node participating new group needs a new address and the node compares the collision with the existing nodes, then DoS attack can be occurred between the nodes by a malicious node. Using the NS2 simulator, the number of DoS attacks, the average number of trials to generate new address, and the average time to create address are analyzed. From simulation results, the efficient algorithm with relevant random number design according to the DRM network is needed to provide secure multimedia contents distribution.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.15-21
• /
• 2010

This paper proposes the multimedia fingerprinting code insertion algorithm when video content is distributed in P2P environment, and designs the collusion codebook SRP(Small RISC Processor) embedded system for the collusion attack prevention. In the implemented system, it is detecting the fingerprinting code inserted in the video content of the client user in which it requests an upload to the web server and in which if it is certified content then transmitted to the streaming server then the implemented system allowed to distribute in P2P network. On the contrary, if it detects the collusion code, than the implemented system blocks to transmit the video content to the streaming server and discontinues to distribute in P2P network. And also it traces the colluders who generate the collusion code and participates in the collusion attack. The collusion code of the averaging attack is generated with 10% of BIBD code v. Based on the generated collusion code, the codebook is designed. As a result, when the insert quantity of the fingerprinting code is 0.15% upper in bitplane 0~3 of the Y(luminance) element of I-frame at the video compression of ASF for a streaming service and MP4 for an offline offer of video content, the correlation coefficient of the inserted original code and the detected code is above 0.15. At the correlation coefficient is above 0.1 then the detection ratio of the collusion code is 38%, and is above 0.2 then the trace ratio of the colluder is 20%.

• The KIPS Transactions:PartB
• /
• v.9B no.1
• /
• pp.47-56
• /
• 2002

In the distributed multimedia document system, media objects distributed over a computer network are retrieved from their sources and presented to users according to specified temporal relations. For effective presentation, synchronization has to be supported. Furthermore, since the presentation in the distributed environment is influenced by the network bandwidth and delay, they should be considered for synchronization. This paper proposes a distributed multimedia presentation system that performs presentation effectively in the distributed environment. And it also suggests a method to supports synchronization, in which, network situation and resources are monitored when media objects are transferred from servers to a client. Then a feedback message for the change of them is sent to the server so that the server might adjust the data sending rate to control synchronization. To monitor the situation of network, we use two methods together. One is to manage the level of the buffer by setting thresholds on a buffer and the other is to check the difference between the sending time of a packet from the server and the arrival time of the packet to the client.

• Journal of the Korea Computer Graphics Society
• /
• v.21 no.3
• /
• pp.36-45
• /
• 2015

It is important subject of research in engineering and natural science field that creating continuing high-definition image from very large volume data. The necessity of software that helps analyze useful information in data has improved by effectively showing visual image information of high resolution data with visualization technique. In this paper, we designed multi-platform visualization system based on client-server to analyze and express earth environment data effectively constructed with observation and prediction. The visualization server comprised of cluster transfers data to clients through parallel/distributed computing, and the client is developed to be operated in various platform and visualize data. In addition, we aim user-friendly program through multi-touch, sensor and have made realistic simulation image with image-based lighting technique.

• Journal of Korea Multimedia Society
• /
• v.12 no.7
• /
• pp.953-961
• /
• 2009

The usage of DRM-applied digital contents reduces user's convenience, thus it leads the many users to avoid using DRM-applied digital contents. In this paper, therefore, we propose the new distribution model in which the users, who purchase the DRM-applied digital contents, can resale freely those contents to the other users. As a result, the proposed model induces the users to distribute contents soundly by including them in one of distribution objects. For the purpose of this, in this paper, we propose that a packaged content and usage rights are transferred to another user by using a method which based on some existing digital ticket or coupon. In addition, the security of the proposed system is discussed for the double transfer, the forgery and the modification of usage rights, and the reproduction of contents and usage rights.

• Journal of Korea Multimedia Society
• /
• v.6 no.1
• /
• pp.128-135
• /
• 2003

A fairness control method for Distributed-Queue Dual-Bus(DQDB) has been studied under specific traffic types such as equal probability traffic, symmetric traffic and asymmetric traffic. To distribute DQDB network bandwidth fairly to all stations under general traffic such as a client-server traffic that differs from specific traffic types, we propose an effective fairness control method. Based on an access limit, the proposed mechanism applies two bandwidth control mechanisms to DQDB networks. One is the mechanism that is called APS(Access Protection Scheme) for servers. And another is the mechanism that controls the allocation of bandwidth only using an access limit lot clients. Simulation results show that it outperforms other mechanisms.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.911-923
• /
• 2010

In wireless sensor networks (WSNs), cluster based data routing protocols have the advantages of reducing energy consumption and link maintenance cost. Unfortunately, most of clustering protocols have been designed for uniformly distributed sensor networks. However, some urgent situations do not allow thousands of sensor nodes being deployed uniformly. For example, air vehicles or balloons may take the responsibility for deploying sensor nodes hence leading a normally distributed topology. In order to improve energy efficiency in such sensor networks, in this paper, we propose a new cluster formation algorithm named DAEEC (Density Aware Energy-Efficient Clustering). In this algorithm, we define two kinds of clusters: Low Density (LD) clusters and High Density (HD) clusters. They are determined by the number of nodes participated in one cluster. During the data routing period, the HD clusters help the neighbor LD clusters to forward the sensed data to the central base station. Thus, DAEEC can distribute the energy dissipation evenly among all sensor nodes by considering the deployment density to improve network lifetime and average energy savings. Moreover, because the HD clusters are densely deployed they can work in a manner of our former algorithm EEVAR (Energy Efficient Variable Area Routing Protocol) to save energy. According to the performance analysis result, DAEEC outperforms the conventional data routing schemes in terms of energy consumption and network lifetime.

• Journal of Korea Multimedia Society
• /
• v.14 no.12
• /
• pp.1601-1612
• /
• 2011

In recent years, advanced in digital technologies have created significant changes in the way we reproduce, distribute and market Intellectual Property (IP). DRM for multicast contents is complicated risk, the further technology development and human demand, this approaching is still being researched by the scientist and all by the company which is conducting in piracy management reduced, and every country has national policy to make this consortium to limit piracy properties, based on this paper research development, just only two approaching to reduce piracy in DRM they are Industrial Property (IP) and Copyright. In this paper, we are not only figuring and analyzing about the processes to reduce and limit the piracy and unprotected copy law but also describing about the encryption process, watermarking and digital signature process algorithms. The basic concepts of this encryption process for web-based multicast content in DRM are implemented in Java. We conduct this method is a computerized through web based application system approaching to reduce unprotected copy and piracy. Which is used in DRM for multicast content in every section, by providing a fundamental in information technology development, we believe this research is reliable to prove that is unprotected copy, and piracy can be reduced by protecting with this paradigm.

• Journal of Korea Multimedia Society
• /
• v.17 no.7
• /
• pp.769-777
• /
• 2014

With the rapid interest in Geographic Information System (GIS) contents, a large volume of valuable GIS dataset has been distributed illegally by pirates, hackers, or unauthorized users. Therefore the problem focus on how to protect the copyright of GIS vector map data for storage and transmission. At this point, GIS security techniques focusing on secure network and data encryption have been studied and developed to solve the copyright protection and illegal copy prevention for GIS digital map. But GIS vector map data is very large and current data encryption techniques often encrypt all components of data. That means we have encrypted large amount of data lead to the long encrypting time and high complexity computation. This paper presents a novel selective encryption scheme for GIS vector map data protection to store, transmit or distribute to authorized users using K-means algorithm. The proposed algorithm only encrypts a small part of data based on properties of polylines and polygons in GIS vector map but it can change whole data of GIS vector map. Experimental results verified the proposed algorithm effectively and error in decryption is approximately zero.