• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.404-407
• /
• 2014

CDN(Content Delivery Network)은 사용자의 콘텐츠 요청에 대해 캐쉬 서버의 부하를 줄이기 위해 사용자와 가장 인접한 캐쉬 서버를 통하여 사용자에게 보다 빠르게 콘텐츠를 제공 하도록 되어있다. 현재까지의 연구는 대용량 콘텐츠 스트리밍 서비스를 위한 속도적 측면만 고려하고 있으며 콘텐츠를 빠르게 제공하기 위하여 같은 콘텐츠를 여러 캐싱서버로 분산하여 보안성이 충분하지 못한 단점이 있다. 하지만 사용자에게 충분한 보안성을 갖춘 대용량 콘텐츠를 제공하려면 암호화 연산의 증가로 인하여, 속도적 측면이 감소하므로 CDN의 본연의 기능을 잃을 수 있다. 그러므로 본 논문에서는 해시기반 스크램블링을 이용한 암호화 기법의 보안의 취약성을 분석하고 이를 극복하기 위해 보안성을 향상시킨 RECOS(Robust Encryption for COntent Secure)기법을 제안한다. 제안 기법은 시뮬레이션에서 기존 기법과 제안 기법의 속도를 비교하였으며, 기존 기법의 취약성 분석을 통하여 제안 기법의 향상된 보안성을 보였다. 결과적으로 기존의 해시기반 암호화 기법과 비교하여 속도에 차이가 거의 없음에도 불구하고 향상된 보안성을 보였다.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.111-122
• /
• 2006

As VOD service over the Internet becomes popular, a large sealable VOD system in P2P streaming environment has become increasing important. In this paper, we propose a new proxy caching scheme, called P2Proxy, to replace the traditional proxy with a sealable P2P proxy in P2P streaming environment. In the proposed scheme, each client in a group stores a different part of the stream from a server into its local buffer and then uses a group of clients as a proxy. Each client receives the request stream from other clients as long as the parts of the stream are available in the client group. The only missing parts of the stream which are not in the client group are directly received from the server. We represent the caching process between clients in a group and a server and then describe a group creation process. This paper proposes the directory structure to share the caching information among clients. By using the directory information, we minimize message exchange overload for a stream caching and playing. We also propose a recovery method for failures about the irregular behavior of P2P clients. In this paper, we evaluate the performance of our proposed scheme and compare the performance with the existing P2P streaming systems.

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