• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.363-372
• /
• 2009

For large scale VOD service, cluster servers are spotlighted to their high performance and low cost. A cluster server usually consists of a front-end node and multiple back-end nodes. Though increasing the number of back-end nodes can result in the more QoS streams for clients, the possibility of failures in back-end nodes is proportionally increased. The failure causes not only the stop of all streaming service but also the loss of the current playing positions. In this paper, when a back-end node becomes a failed state, the recovery mechanisms are studied to support the unceasing streaming service. For the actual VOD service environment, we implement a cluster-based VOD servers composed of general PCs and adopt the parallel processing for MPEG movies. From the implemented VOD server, a video block recovery mechanism is designed on parity algorithms. However, without considering the architecture of cluster-based VOD server, the application of the basic technique causes the performance bottleneck of the internal network for recovery and also results in the inefficiency CPU usage of back-end nodes. To address these problems, we propose a new failure recovery mechanism based on the pipeline computing concept.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.11b
• /
• pp.921-924
• /
• 2003

본 논문은 인터넷 상에서 서비스되는 스트리밍 미디어를 캐쉬 서버에서 캐슁할 때 적용할 수 있는 재배치 정책에 관한 것이다. 스트리밍 미디어의 특성에 적합한 재배치 기준을 제시하고, 그에 따라 미디어 데이터를 캐슁하고 재배치하는 방법을 제안한다. 또한, 제안한 재배치 정책과 기존의 알려진 방법들에 대한 성능 비교 분석을 수행 한다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.398-398
• /
• 2004

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.79-81
• /
• 2001

본 논문은 멀티미디어 스트리밍 환경에서 RTSP 표준화 프로토콜을 기반한 스트리밍 캐쉬 서버를 설계하고 구현한다. 또한 기존의 스트리밍 시스템과 호환성을 유지하기 위해 캐쉬 서버의 On-Demand 스트리밍 서비스를 지원하는 RTSP 세션 제어 기능의 응용과 절차에 대하여 기술한다.

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

• ETRI Journal
• /
• v.35 no.1
• /
• pp.69-79
• /
• 2013

For real-time interactive multimedia operations, such as video uploading, video play, fast-forward, and fast-rewind, solid state disk (SSD)-based storage systems for video streaming servers are becoming more important. Random access rates in storage systems increase significantly with the number of users; it is thus difficult to simultaneously serve many users with HDD-based storage systems, which have low random access performance. Because there is no mechanical operation in NAND flash-based SSDs, they outperform HDDs in terms of flexible random access operation. In addition, due to the multichannel architecture of SSDs, they perform similarly to HDDs in terms of sequential access. In this paper, we propose a new SSD-based storage system for interactive media servers. Based on the proposed method, it is possible to maximize the channel utilization of the SSD's multichannel architecture. Accordingly, we can improve the performance of SSD-based storage systems for interactive media operations.

• Annual Conference of KIPS
• /
• 2009.04a
• /
• pp.1144-1147
• /
• 2009

멀티미디어의 방송 서비스 제공하기 위해서 IP 멀티캐스트의 대안으로써 현재의 인터넷 환경에서도 동시 접속자 수의 제한과 자원 낭비 문제를 효과적으로 해결할 수 있는 다양한 오버레이 멀티캐스트 기법이 제시되고 있다. 본 논문에서는 멀티미디어의 방송 서비스 제공을 위한 병렬 미디어 스트리밍 서버(PMSS : Parallel Media Streaming Server)시스템에 대해 알아보고 오버레이 멀티캐스트 트리 구성 방안으로 분산형 Tree-First 기반의 Spanning tree 구조의 하나인 TBCP기법에 대해 설명하고, TBCP기법의 한계점을 극복하기 위한 오버레이 멀티캐스트 기반의 알고리즘 적용한 효율적이고 향상된 성능을 제공하는 miniOverlay Broadcasting Control Protocol (mOBCP)에 대해 알아본다. 또 제안한 mOBCP 멀티캐스트 기법을 기반으로 PMSS를 이용하여 오버레이 방송 서비스를 제공하는 방안에 제시한다. 성능 비교는 Single 서버와 PMSS로 멀티미디어 방송 서비스를 제공했을 때의 지연시간(Latency)를 비교해 보고 mOBCP기법과 TBCP기법을 PMSS 시스템에서 적용하여 사용자 요구량에 따른 서비스 받는대 걸리는 지연시간을 비교함으로써 제안된 기법의 효율성을 보여주고 있다.

• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.54-63
• /
• 2004

This paper describes a hybrid QoS guarantee scheme for high quality audio streaming services on the Internet. The continuous playback of the audio data requires the isochronous transmission of the audio data packet through the Internet. In order to retain the QoS at the ultimate destination (client) as the same as servers provide, the transmission protocols should consider the error conditions such as packet loss, and out of order delivery. Generally, the protocols supporting the transmission of continuous media data do not try to recover the errors. The protocols are working somehow for the toll quality multimedia streaming services, but rot for the high quality streaming services, such as the DVD sound/music payback. The hybrid QoS guarantee scheme includes the three mechanisms to overcome the problem. The selective retransmission for the lost packet, the adaptive buffering at client-side, and the adaptive transmission rate at server-side are totally adopted to recover the packet loss with the minimal overhead, to prevent from the buffer starvation during the retransmission, and to maintain the isochronous transmission even after the retransmission. The experiments have shown good results for the high Quality audio streaming services on the Internet.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.4
• /
• pp.485-492
• /
• 2009

In the mobile service environment, patterns generated by temporal synchronization are streamed with different instance values. This paper proposed a variable clustering management method, which manages multiple data streaming dynamically, to support flexible clustering. The method manages synchronization effectively and differently with conventional streaming methods in data streaming environment and manages clustering streaming after the structural presentation level and the fitness presentation level. In the structural presentation level, the stream structure is presented using level matching and accumulation matching, and clustering management is carried out by the management of dynamic segment and static segment. The performance of the proposed method is tested by using k-means method, C/S server method, CDN method, and simulation. The test results showed that the proposed method has better performance than the other methods.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.783-788
• /
• 2005

Recently researches that apply P2P networks to VOD streaming have been actively published In the previous works on VOD streaming, they aimed at achieving two major goals, which are zero-delay transmission and minimization of service rejection ratio. This paper proposes a new method, called ForwardCast, for VOD streaming based on a P2P-based multicasting tree in order to achieve theses two goals. In this method,- basically a new client selects one of the preceding clients and starts receiving a whole video from the selected one without any delay. In some situation, two preceding clients are selected to transfer the ending part of the video and its the remaining part simultaneously. In our experiment, ForwardCast can reduce the rejection ratio compared to previous works without increasing server stress.