• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.458-468
• /
• 2009

The patching technique has been used for removing initial waiting time of NVOD. The technique was applicable only to time segmented NVOD services. However, data segmented NVOD methods have been known to have less initial waiting time or use less server's bandwidths than the time segmented NVODs. Therefore, we expect that if patching is applied to a data segmented NVOD, a more efficient NVOD service will be possible. But there has not been such approach. In this paper, we propose a new VOD scheduling algorithm that combines the patching technique with a data segmented NVOD, thus it uses less server's bandwidths and removes initial waiting time, hence makes a true VOD service possible. The proposed technique also absorbs the storage overhead necessary for client buffering incurred by patching into the data segmentation policy of the NVOD scheduling, hence does not need any extra overhead of the client's resource. Therefore, it is also applicable to the case that the client has resource limits.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.01a
• /
• pp.247-248
• /
• 2014

NVOD 서비스는 IPTV 서비스 형태의 일종으로, 여러 비디오 콘텐츠를 방송 서비스 제공자가 지정한 스케줄에 따라 스트림 출력한다. 접속자들은 접속 시각에 스트림 되고 있는 콘텐츠를 감상할 수 있기 때문에 원하는 비디오를 주문하여 보는 것이 불가능하다는 단점이 있으나, 멀티캐스트 방식으로 제공하여 통신비용을 절약할 수 있다는 장점도 있다. 본 논문은 NVOD 서비스를 제공하는 시스템에 대하여 연구한다.

• The KIPS Transactions:PartA
• /
• v.15A no.4
• /
• pp.227-238
• /
• 2008

Recently, as network environment has broadened, the demands on VOD have been increased. The VOD services can be categorized into two types, RVOD and NVOD. Practical VOD services adopt one of them exclusively. Since a method using only one of RVOD and NVOD is not able to deal with frequently variable demand of clients, it leads to a result of overload on a server and a waste of server bandwidth. The efficiency of the network resource usage becomes lower. Hence this paper presents a study on the protocol for efficient VOD services. We propose a new protocol appliable for the existing VOD service algorithm, analyze its performance through simulation, and developed server/client systems applying the new protocol. We propose a mode switching protocol combined with protocols used in RVOD and NVOD. The proposed protocol is not able only to control both RVOD and NVOD but also to change the mode between RVOD and NVOD. As a result of using the proposed protocol to meet frequently variable demand, server bandwidth can be used efficiently. Especially, it can be applied to the existing VOD service algorithms. Therefore, we expect that the proposed protocol in this paper will be widely used in emerging VOD markets.

• IE interfaces
• /
• v.11 no.2
• /
• pp.39-48
• /
• 1998

It is strongly believed that Video on Demand(VOD) will become one of the most promising services for Broadband Integrated Services Digital Network(B-ISDN). VOD service can be classified into two types of services: Near VOD(NVOD) and Interactive VOD(IVOD). Although VOD network requires many kinds of resources, we only consider video servers, programs. and storages. In the network. some video servers should be installed at some nodes(especially, at the root node for NVOD service). so that each node with video server stores video programs and distributes stored programs to customers. We take into account three kinds of costs related with the above resources: 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 the locations of video servers and the kinds of programs stored at each video server. Given a multi-level VOD network and the total number of programs being served in the network. the resource. optimization problem for providing both IVOD and NVOD services is to determine where to install video servers, and which and how many programs should be stored at each video server, in order to minimize the total cost. In this paper we develop an efficient dynamic programming algorithm to solve the problem. We also implement the algorithm based on two different service policies assumed in this paper.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.245-248
• /
• 2005

최근 네트워크 환경은 광대역화 되고 있고, VOD 서비스를 제공받는 사용자의 단말기들은 용도나 취향에 따라 다양화 되고 있다. 기존의 NVOD 서비스들은 단말기에 일정 저장 공간을 요구하거나 단말기의 네트워크 전송률은 고려하지 않았다. 본 논문에서는 광대역통합망에서 다양한 단말기의 저장 공간과 네트워크 전송률에 따라 적응가능한 NVOD 서비스방법을 제안한다. 따라서 제안된 방법을 이용해서 필요에 따라 다양한 환경의 단말기를 개발할 수 있고, 모든 단말환경에 적용할 수 있기 때문에 활용도가 매우 높을 것으로 기대된다.

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