• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.709-718
• /
• 2002

Cluster based VOD systems require elaborate load balancing and buffer management techniques in order to ensure real-time display for multiuser concurrently. In this paper, we propose a new load balancing technique based on the dynamic buffer partitioning in cluster based VOD servers. The proposed technique evenly distribute the user requests into each service node according to its available buffer capacity and disk access rate. In each node, the dynamic buffer partitioning technique dynamically partitions the buffer to minimize the average waiting time for the requests that access the same continuous media. The simulation results show that our proposed technique decreases the average waiting time by evenly distributing the user requests compared with the exiting techniques and then increases the throughput in each node. Particularly under the overloaded condition in the cluster server, the simulation probes that the performance of the proposed technique is better two times than the Generalized Interval Caching based technique.

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

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.7-9
• /
• 2003

기존의 VOD 서비스는 일반적으로 단일 서버 모델을 사용하여 서비스 되어왔다. 그렇지만 단일 서버 모델의 VOD 서비스는 서버 용량의 확장에 따른 오버헤드가 크며 서버 고장시 VOD 서비스를 실시할 수 없는 문제점이 있다. 따라서 이런 문제점들을 해결하고자 병렬 서버 구조에 기반을 둔 VOD 서비스에 대한 연구가 이루어지고 있다. 기존의 유선 네트워크에서의 병렬 서버 구조에 기반을 둔 스트림 전송에 관한 연구가 일부 진행되어 왔지만 무선 네트워크와 관련해선 그러한 연구가 거의 없으며 있어도 아주 이상적인 경우를 가정하였다. 이동통신의 급속한 발전으로 현재 이동국들은 멀티미디어 서비스를 받을 수 있게 되었으며 앞으로는 이동국들에 제공되는 멀티미디어 서비스 역시 QoS가 보장되어야 한다. 따라서 본 논문에서는 무선 모바일 환경에서 병렬 서버 구조를 사용하여 멀티미디어 스트림을 전송함으로서 기지국외 혼잡 상황에도 이동국에서 QoS를 보장할 수 있는 방법을 제시한다. 시뮬레이션 분석 결과를 보면 기지국의 혼잡 상황에서 병렬 서버 구조에 기반을 두고 멀티미디어 스트림을 전송하게 되면 단일 서버로 멀티미디어 스트림을 전송할 때보다 이동국의 수신 상태가 42% 향상됨을 알 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.149-152
• /
• 2003

최근 VOD 서버 모델로 제안되는 클러스터형 VOD 서버는 확장성과 가용성을 높일 수 있다는 장점이 있지만 서버에 노드수가 증가하면서 서버에 장애가 발생할 가능성이 높아지는 문제점을 가지고 있다. 본 논문에서는 클러스터형 VOD 서버에서 노드 장애 발생시 이를 복구하기 위한 방안으로서 RAID-3, 4의 특성을 취합하고, 이에 파이프라인 개념을 더한 복구 시스템을 제시하고자 한다. 본 복구 시스템은 RAID-4 개념을 도입하여 디스크로의 접근을 큰 사이즈의 블록단위로 함으로써 디스크의 효율성을 증가시키며, 네트웍에는 RAID-3 개념을 적용하여 작은 사이즈의 블록으로 나누어 전송함으로써 네트웍을 효율적으로 사용하고 메모리 부하를 줄일 수 있도록 한다. 또한 파이프라인 개념을 도입하여 복구과정을 여러 노드에서 분담하여 동시에 처리함으로써 CPU, 네트웍, 메모리 등과 같은 자원에 대한 부하가 모든 노드로 분산되도록 한다.

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

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.685-697
• /
• 1997

A Viedo-on-Demand(VOD) service is a multimedia service that is realized by the rapid advance of computer and data communication techmologies. Basically, a VOD system is composed of a server and a number fo clients.The server stores and manages a large amount of digital moving picture data. Each slient sends an on-line requwet to the server and receives data for real-time displying. Many researches are performed on a VOD server using hard disks for the permanent video fata storage. However, a hard disk is less reliable and requires more storage cost than a massive storage device. Due to these resasons, a multi-level VOD system is proposed for using teh jukeboxes of optical disks as the permanent video storage,device. In this paper, we prpose the necessary software modules and protocols between the server and its clients for the implementation of the multi-level VOD server.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.127-137
• /
• 2005

This paper presents implementation of client-based VOD service using multicast delivery, Conventional system provide server-based system in multicast delivery but implemented system provides on-demand client-based multicast system. The Multicast Agent Scheduler aggregates clients' request and it generate multicast group addresses and port numbers according to requested video items and service request time. Then it transmits immediately multicast address to VOD server and client who request service. And then VOD server transmits requested streams with a multicast group address and the client joins the group automatically. The Multicast Agent Scheduler assigns the same multicast group address when other clients request an identical video within the same scheduling duration. The proposed system can reduce load of server and support many clients at the same time and applies it to WMT(window media technology) of Microsoft.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.3
• /
• pp.299-310
• /
• 2000

In this paper, we designed and implemented a personal VOD server using multi-thread for the real-time services of video data to the users. The system consists of service manager, disk manager, and network manager. The service manager controls the user admission to the system using the VBR(Variable Bit Rate) characteristics of MPEG (Moving Picture Experts Group) video data. The disk manager provides the functions for VCR-like operations. The disk manager reads blocks from the disk by the size of GOP(Group of Pictures) and buffers the data to the user's thread. The network manager uses TCP/IP for the communication between the server and the client. The communication starts from the client and the VOD server must respond to this request. The implemented personal VOD system shows an acceptable performance.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.3
• /
• pp.217-226
• /
• 2006

Intensive studies have been made in the area of N-VOD server Multimedia files in the N-VOD sever are characterized with the large volume of data, the requirements of synchronization and real-time playback of streams. The basic goal of the study is to find an efficient mechanism to allow maximum number of users under the limited resources such as Buffer size and disk bandwidth. we propose a efficient VCR-LIKE operations and buffer, disk scheduling policy for multimedia services with management of VOD sever resources. Simulation results show that the rate of buffer usage and service time of proposed scheme are about 18% performance improved than that of traditional methods. This implies that our method can allow much more users for given resources.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.4
• /
• pp.43-52
• /
• 2008

The paper presents the problem definition of video placement and efficient methods for placing video data on a cluster of video servers. The video placement is to place each of video replicas on one of the servers where the number and location of the servers are already determined. The rejection ratio of user requests is one of most important user-perceive performance measures, so it has been used as a performance criteria in many researches on the VOD system. The objective of our video placement is to achieve the load balancing among servers and the minimization of total network loads. To our experiment, the presented methods show better performance in terms of the rejection ratio of user requests than the methods for video placements in which only either server load balancing or network load minimization is considered. Also, it is observed that considerations on server load balancing is especially important in video placement. To our survey, little research has been published on video placement in which server and network load are considered together in a video server cluster environment.