• The KIPS Transactions:PartA
• /
• v.15A no.1
• /
• pp.53-60
• /
• 2008

Streaming media has contributed to a significant amount of today's Internet Traffic. Like traditional web objects, rich media objects can benefit from proxy caching, but caching streaming media is more of challenging than caching simple web objects, because the streaming media have features such as huge size and high bandwidth. And to support various bandwidth requirements for the heterogeneous ubiquitous devices, a transcoding proxy is usually necessary to provide not only adapting multimedia streams to the client by transcoding, but also caching them for later use. The traditional proxy considers only a single version of the objects, whether they are to be cached or not. However the transcoding proxy has to evaluate the aggregate effect from caching multiple versions of the same object to determine an optimal set of cache objects. And recent researches about multimedia caching frequently store initial parts of videos on the proxy to reduce playback latency and archive better performance. Also lots of researches manage the contents with segments for efficient storage management. In this paper, we define the 9-events of transcoding proxy using 4-atomic events. According to these events, the transcoding proxy can define the next actions. Then, we also propose the segment-based caching policy for the transcoding proxy system. The performance results show that the proposing policy have a low delayed start time, high byte-hit ratio and less transcoding data.

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.943-952
• /
• 2005

This paper proposes a user's mobility based cooperative proxy caching policy for effective resource management of continuous media objects in mobile environments. This policy is different from the existing proxy caching policies in terms of how to exploit users' mobility. In other words, existing caching policies work based on the information about objects by referring to users' requests within a specified domain whereas the proposed caching policy runs by utilizing a number of users' requests across several domains. So, the proposed policy is applicable to random requests in mobile environments. Moreover, we also propose a replacement policy based on weights and playback time. To check the efficiency of the proposed caching policy, the proposed replacement policy is run with different size of caching unit: object or segment. The result of performance evaluation tells that segment sizes, ratio of users' mobility and weights are major factors for the efficient operation of the cooperative caching.

• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.691-700
• /
• 2004

This paper proposes a user's mobility based cooperative proxy caching policy for effective resource management of continuous media objects in mobile environments. This policy is different from the existing proxy caching policies in terms of how to exploit users' mobility. In other words, existing caching policies work based on the information about objects by referring to user's requests within a specified domain whereas the proposed caching policy runs by utilizing a number of user's requests across several domains. So, the proposed policy is applicable to random requests in mobile environments Moreover, we also propose a replacement policy based on weights and playback time. To check the efficiency of the proposed caching policy, the proposed replacement policy is run with different size of caching unit object or segment. The result of performance analyze tells what a ratio of user's mobility is are major factors for the efficient operation of the cooperative caching.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.313-320
• /
• 2005

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. Multimedia streams typically experience the high start-up delay due to the large protocol overhead, the delay, and the loss properties of the wireless networks. 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, 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 performs better than the existing schemes in terms of byte hit rate, hit rate, startup latency, and throughput.

• 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.