• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.303-308
• /
• 2000

VOD(Video-On-Demand) 시스템에서 제한 없는 VCR 서비스는 클라이언트들의 개별 서비스 요청에 대하여 유일한 비디오 스트림을 할당함으로서 제공될 수 있다. 이 방식은 서버 부하의 증가와 부족한 네트워크 자원의 고갈 등과 같은 중대한 문제점을 갖고 있으나 클라이언트의 셋톱박스에 버퍼를 구현함으로서 매우 제한된 VCR 기능을 제공하게 된다. 본 논문에서는 대화형 VOD 시스템에서 제한 없는 VCR 기능을 제공할 수 있는 새로운 MBA(Multicast Buffering Algorithm) 알고리듬을 제안한다. MBA 알고리듬 하에서 VCR 서비스는 버퍼가 동적으로 확장되어 비디오 데이터를 저장하기 때문에 사용자에게 제한 없이 제공되어진다. 또한 MBA 알고리듬은 버퍼의 사용 효율을 증대시키는 방법을 제공하며 모든 클라이언트들의 서비스 요청을 지연 없이 즉시 처리하므로 사용자들에게 진정한 대화형 VOD 서비스를 제공하게 된다. 본 논문에서는 MBA 알고리듬을 이용하여 지연 없는 VCR 기능을 갖춘 VOD 서비스를 구현하였으며 시뮬레이션 결과는 MBA 알고리듬이 다른 버퍼링 방식과 비교하여 매우 우수한 성능을 갖고 있음을 보여주고 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.145-148
• /
• 2003

본 논문은 단일 VOD 환경에서의 서버/클라이언트 간 데이터 서비스 모델을 분석하고 이를 병렬 VOD 환경에 적용함으로써 보다 나은 사용자 QoS(Quality of Service)를 제공하고자 한다. 이를 위해 단일 VOD 환경에서는 클라이언트가 데이터를 요청하고 서버가 전달해주는 Client Pull 모델과 서버 측에서 일방적으로 데이터를 전달해주는 Server Push 모델을 네트워크상 전달지연 측면에서 분석하고 위 두 모델.을 통합한 IPP(Interleaving Pull & Push) 서비스 모델과 Client Pull 모델을 전달지연과 클라이언트 버퍼 내 데이터 잔여량 측면에서 병렬 VOD 환경에서 적용 및 비교하였다. 시뮬레이션을 통해 병렬 VOD 환경에서 IPP 서비스 모델이 가장 적은 전달지연과 보다 안정적인 클라이언트 버퍼를 유지함을 알 수 있으며 이를 동해 사용자에게 보다 나은 서비스를 제공할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.10-12
• /
• 2004

초고속망의 급속한 보급은 인터넷 사용자로 하여금 다양한 형태의 멀티미디어 서비스에 대한 요구를 증가시키고 있다. 하지만 데이터 용량의 기하급수적인 증가는 VOD(Video On Demand) 서비스에 많은 문제를 야기하고 있다. 따라서 이와 같은 문제점을 지닌 병렬 VOD 서버를 개선, 보완할 수 있는 새로운 형태의 P2P 기반 VOD 서버를 본 논문에서 제안하고자 한다. P2P 기반 VOD 서버는 병렬 VOD 서버에 비해 저렴한 구축비용과 용이한 확장성을 제공하며 계층화된 멀티미디어 데이터 서비스를 제공함으로써 다양한 대역폭을 갖고 있는 통신망 환경에서 실시간 멀티미디어 서비스가 가능한 장점을 가지고 있다.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.80-88
• /
• 2005

In ubiquitous spaces, a user wants to be provided with a VOD service while moving one space to another freely. Since the traditional VOD system is dependent on user location, the VOD server transmits video data to a single client during a session. If the user moves to another space, he/she should close the old session and make a new request for the same video. However, the location-aware VOD system supports user mobility by closing and opening the session automatically. That is, the VOD system automatically perceives the movement of a user and allows the server to change the data flow so that a client near the user can receive the video data. This paper proposes a location-aware VOD service architecture and a session handoff scheme to provide a mobile user with continuous video delivery and implements a location-aware VOD prototype system based on Jini and Java. In experiment, we show that the proposed handoff scheme has a smaller handoff delay than the other handoff scheme.

• Journal of Broadcast Engineering
• /
• v.24 no.3
• /
• pp.506-514
• /
• 2019

This study classified the different types of service attributes being provided through cable VOD services and looked at how the key service attribute types affect the willingness to use paid VOD for each group of paid and non-experienced users. Studies have shown that for a group of non-experienced people, 'content information-oriented attributes' have the greatest impact, and for a group of experienced people, 'convenience-oriented attributes' have the greatest impact. Thus, expanding users of paid VOD services requires setting up step-by-step strategies that match their respective collective characteristics. For a group of non-experienced people, it is necessary to take a direct persuasion strategy through the provision of relevant information and an indirect approach strategy through the expansion of promotion opportunities, and for an experienced group, a strategy to expand functional convenience.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3182-3194
• /
• 2000

It is strongly beliefed that Video on Demand(VOD) will become one of the most promising services in Broadband Integrated Services Digital Network(B-ISDN) for the nest generation VOD service can be classified into two types of services 'Near VOD(NVOD) and Interactive VOD(IVOD). For both services, some video servers should be installed at some nodes(especially, at the root node for NVOD service) in the tree structued VOD network,so that each node with video server stores video programs and distribules stored programs to customers. We consider thre kinds of cost.a program transmission cost, a program storage cost, and a video server installation cost. There exists a trade-off relationship among those three costs according to locationsl of video servers and the kinds of programs stord at each video server. Given a tree structured VOD network, and the total number of programs being served in the network, the resource allocation problem in a VOD network providing both IVOD and NVOD services is to determine where to install video servers for IVOD service, which and how many programs should be stored at each video server for both IVOD and NVOD services, so as to minunize the total cost which is the sum of three costs for both IVOD and NVOD services. In this paper we develop an efficient cynamic programming algorithm for solving the problem. We also implement the algorithm based on a service policy assumed in this paper.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.5
• /
• pp.529-546
• /
• 2002

A VOD server, which is the central component for constructing VOD systems, requires to provide high bandwidth and continuous real-time delivery. It is also necessary to the sophisticated disk scheduling and data placement schemes in VOD sewers. One of the most common problem facing in such a system is the high initial latency time to service multiple users concurrently. In this paper, we propose a dynamic stream merging scheme for reducing the initial latency time in VOD servers. The proposed scheme allows clients to merge streams on a request as long as their requests fall within the reasonable time interval. The basic idea behind the dynamic stream merging is to merge multiple streams into one by increasing the frame rate of each stream. In the performance study, the proposed scheme can reduce the initial latency time under the minimum buffer use and also can enhance the performance of the VOD server with respect to the capacity of user admission.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.685-691
• /
• 2008

Recently with the rapid evolution of the mobile computing and communication technologies, mobile VOD service becomes increasingly important for wireless mobile users. The VOD service is being widely used in various areas of application, such as education, entertainment and business, because it provides users convenience in easily having access to video information at any time in any places. However, in reality, the mobile system has many difficulties in providing the smooth VOD service owing to frequent transfers and cutoffs of clients. The importance of a technique to transmit broadcasting is being stressed as a method for providing stabler mobile VOD service to a large number of clients. This paper is aimed at showing how to reduce demands for server bandwidth and delay of earlier service through performance analysis by suggesting an effective VOD broadcasting transmission technique through channel division in the mobile atmosphere. Many researches have been made about regular broadcasting techniques in particular. This study divides the methods used for assigning channels which have been decided by the size of segments into a group of regular channels and assistant channels using wireless gap-fillers to provide effective VOD services to a large number of clients at the mobile environment using small bandwidth resources. The regular channels transfer regular streams, while assistant channels repeatedly transfer the first segment to reduce early service delay time to receive regular streams. In this way, the study suggests a technique to reduce server bandwidth demand and early service delay time. Through the proposed technique, the server bandwidth demand could be reduced by more than 30 percent and the study continuously shows reduced early service delay time through conducting performance analysis.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2013.07a
• /
• pp.65-68
• /
• 2013

스마트폰을 이용하여 인터넷 검색, SNS 및 VOD의 이용률이 증가함에 따라 스마트폰에서 제공하는 VOD 및 멀티미디어 서비스에 관심이 높아지고 있다. 특히 사용자의 위치를 기반으로 사용자에게서 유용한 정보를 추론하고 이에 맞은 비디오를 제공하는 위치기반 VOD 서비스에 대한 관심도 역시 상당히 높다. 그러나 사용자들이 도로 또는 거리가 아닌 지하철, 쇼핑몰 등의 건물 내부에 있을 때에는 GPS를 사용할 수 없기 때문에 기존의 위치기반 VOD 시스템은 작동을 하지 못한다. 본 논문은 스마트폰 센서를 이용하여 사용자의 걸음 수와 진행 방향을 판정하고, 이를 바탕으로 사용자의 위치를 판정함으로 옥내위치기반 VOD 서비스가 가능한 스마트폰용 앱을 설계하고 구현한다.

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