• Journal of Korea Multimedia Society
• /
• v.15 no.5
• /
• pp.651-663
• /
• 2012

Networked digital signage downloads necessary multimedia contents from a large-sized storage on WAN to its local disk of a limited size before starting their playback. If the required time to download the entire contents gets longer, a start time to play the contents at the digital signage could be delayed. In this paper, we propose a hybrid storage architecture that not only inserts an iSCSI storage layer between the existing local disk and the WAN storage, but offers a contents caching scheme in order to obtain all the necessary contents in digital signage rapidly. The proposed caching scheme determines how to place the downloaded contents both in the local disk and the iSCSI storage. Uniquely, the proposed caching scheme manages the iSCSI storage space by dividing it into two regions: (1) in one region, the digital signage can play the contents directly without downloading them into the local disk; (2) in the other region, the digital signage cannot. Performance evaluations on a simulator and an actual system with workloads of various contents show that a contents-downloading time of the hybrid storage architecture is at maximum three times shorter than that of the existing storage architecture.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1766-1777
• /
• 2000

In multimedia new service on the internet, there are problems such as server overload, network congestion and initial latency. To overcome these problems, we propose a proxy push-caching scheme that stores a portion of continuous media stream or entire stream, and a transmission scheme of NOD continuous media, RTP-RR and RTP-nR to exploit push-caching scheme. With the proposed push-caching scheme, NOD server pushes fixed portion of stream to a proxy when new data is generated, and the cached size of each stream changes dynamically according to the caching utility value of each stream. As a result, the initial latency of client side could be reduced and the amount of data transmitted fro ma proxy server to client could be increased. Moreover, we estimate a caching utility value of each stream using correlation between disk space occupied by the stream and the amount of data stream requested by client. And we applied the caching utility value ot replacement policies. The performance of the proxy push-caching and continuous media transmission schemes proposed were compared with other schemes using simulations. In the simulation, these schemes show better results than other schemes in terms of BHR (Byte Hit Rate), initial latency, the number of replacement and packet loss rate.

• The Journal of the Korea Contents Association
• /
• v.16 no.4
• /
• pp.224-230
• /
• 2016

Recently, CCN(Content Centric Network) has been extensively interested in the literature to transfer data traffic efficiently according to the rapid growth of multimedia services on the Internet. CCN is a new networking paradigm to deliver contents efficiently based on the named content not the named or addressed host. This paper presents a mathematical approach for analyzing CCN-caching systems with two routers. Considering the stochastic characteristics of communication networks, the caching system is modeled as a two dimensional Markov chain. This paper analyzes the structural feature of the transition rate matrix in the Markov chain and presents a numerical solution for the CCN-caching performance of the two router system. In addition, various numerical examples are presented.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.3
• /
• pp.575-580
• /
• 2017

In these days, the big-size and high resolution multimedia file is widely used through networks. To transfer and service effectively, the internet network technology is necessary to substitute broadcasting. Normally Content Delivery Network(CDN) is widely used in conventional internet for multimedia services. But it has a small bandwidth to service. So to solve this problems, many researchers have suggest the protocol for download, content distribution/saving, server synchronization, caching, pushing rate, and streaming etc. But all of these has some defects like low resolution, packets loss and delay, real application implementations etc. So, this paper suggests a new method of network protocol based on P2P collaboration and user's content using information. And it evaluated the performance of suggested method. As the results, it showed the effectiveness of 4 performances indices : download speed, decreasing rate of connected user in same time, adaptive hit ratio, traffic decreasing rate.

• Journal of Korea Multimedia Society
• /
• v.11 no.7
• /
• pp.1025-1034
• /
• 2008

In this paper, we developed GridGML for efficiently supplying a GML and visualizing the map with partitioning map and caching method to a mobile device. In order to overcome the weighting of a file, which is the biggest weakness of a GML, GridGML extracts only the most necessary parts for the visualization of the map among GML attributes, and makes the file light as a class instance by applying an offset value. GridGML manages a partition based on the visualization area of a mobile device to visualize the map to a mobile device in real time, and transmits the partition area by serializing it for the benefit of transmission. Also, the received partition area is compounded in a mobile device and is visualized by being partitioned again as four visible areas based on the display of a mobile device. Then, the area is managed by applying a caching algorithm in consideration of repetitiveness for a received map for the efficient operation of resources. Also, in order to prevent the delay in transmission time as regards the instance density area of the map, an adaptive map partition mechanism is proposed for maintaining the transmission time uniformly.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.178-180
• /
• 2003

이동 컴퓨팅 환경에서의 프록시는 트랜스코딩과 캐슁 등의 방법으로 미디어 스트림을 재가공하여 멀티미디어 스트리밍의 연속성을 보장해 준다. 프록시에 대한 기존의 접근들은 대체로 트랜스코딩과 캐슁을 별개의 주제로 다루었었다. 따라서 본 논문에서는 트랜스코딩과 캐슁을 통할하여 연동시킨 프록시 시스템 아키텍처를 구현하였다. 또한 서버와 프록시 사이의 전송 지연. 프록시에서의 미디어 스트림 재가공에 걸리는 지연, 프록시와 클라이언트 사이의 bandwidth 자원 등을 창조하여 adaptive한 트랜스코딩 및 캐슁을 할 수 있도록 해주는 transco-prefix caching에 대해 제안하였다. 그 결과 transco-prefix caching을 통하여 트랜스코딩과 캐슁의 장점들을 동시에 살필 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.608-618
• /
• 2006

The increasing popularity of multimedia streaming services introduces new challenges in content distribution. Especially, it is important to provide the QoS guarantees as they are increasingly expected to support the multimedia applications. The service providers can improve the performance of multimedia streaming by caching the initial segment (prefix) of the popular streams at proxies near the requesting clients. The proxy can initiate transmission to the client while requesting the remainder of the stream from the server. In this paper, in order to apply the prefix caching service based on IETF's RTSP environment to the wireless networks, we propose the effective RTSP handling scheme that can adapt to the radio situation in wireless network and reduce the cutting phenomenon. Also, we propose the traffic based caching algorithm (TSLRU) to improve the performance of caching proxy. TSLRU classifies the traffic into three types, and improve the performance of caching proxy by reflecting the several elements such as traffic types, recency, frequency, object size when performing the replacement decision. In simulation, TSLRU and RTSP handling scheme performs better than the existing schemes in terms of byte hit rate, hit rate, startup latency, and throughput.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.37-44
• /
• 2009

Recently, as the quality of multimedia data gets higher, multimedia servers require larger storage capacity and higher I/O bandwidth. In these large scale multimedia servers, the load-unbalance problem among disks due to the difference in access frequencies to multimedia objects according to their popularities significantly affects the system performance. To address this problem, many data replication schemes have been proposed. In this paper, we propose a novel data migration/replication scheme to provide better storage efficiency and performance than the dynamic data replication scheme which is typical data replication scheme employed in multimedia servers. This scheme can reduce the additional storage space required for replication, which is a major defect of replication schemes, by decreasing the number of copies per object. The scheme can also increase the number of concurrent users by increasing the caching effect due to the reduced lengths of the intervals among requests for each object.

• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.181-188
• /
• 2009

Transcoding is one of core techniques that implement VoD services according to QoS. But it consumes a lot of CPU resource. A transcoding proxy transcodes multimedia objects to meet requirements of various mobile devices and caches them to reuse later. In this paper, we propose a service policy that reduces the load of transcoding multimedia objects by degrading QoS in a transcoding proxy. Due to the tradeoff between QoS and the load of a proxy system, a transcoding proxy provides lower QoS than a client's requirement so that it can accomodate more clients.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.15-23
• /
• 2004

This paper presents distributive web-caching technique on the Head-End-Network (HNET) to solve excessive load of multimedia sever and inefficient use of network resources, The proposed web-caching is not concentration of load for a specific Head-End-Node(HEN), and it has advantage that there is no copy of a specific item on distributive HENs. This technique distributively stores on HENs partial streams of requested videos from clients connected to HENs and the order of store streams follows the order of request of identical video items from HENs. Thus, storing streams on each HEN that requests sevice are different. When a client requests the cached video on some HENs, the HEN that connects him receives streams in the order of store from HENs which stored them and it transmits them to him. These procedures are performed under the control of SA. This technique uses cache replacement algorithm that the combination of LFU, LRU and the last remove for the first stream of videos In order to reduce end-to-end delay.