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

• Journal of Korea Multimedia Society
• /
• v.7 no.3
• /
• pp.357-367
• /
• 2004

In VOD systems the number of channels available to a video server is limited since the number of channels, the video server can support, is determined by the communication bandwidth of the video server. Multicast techniques such as batching, patching and batch-patching have been proposed to reduce I/O demand on the video server by sharing multicast data. In this paper, we propose a channel reservation batch-patching technique that first applies the batching technique to hot video requests and then applies the patching technique to the batches of the hot video requests. And the proposed technique reserves a part of the channel capacity of the video server for many hot video requests, so that the hot video requests can be served without defection. The performance of the proposed technique is compared with those of Patching and Batch-Patching techniques in terms of average service latency, defection rate, fairness and frame reduction rate by simulations.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.1
• /
• pp.21-28
• /
• 2006

This paper describes the design and implementation of video conference system using hybrid type P2P(Peer to Peer). The proposed video conference system has hybrid type P2P architecture based on a client-server and P2P(Peer to Peer), where client-server is used for exchange of account management, client list and status information and P2P is used for the real time video conference. The proposed video conference system decreases the traffic of server, and cuts down the load of a network. Because the multimedia data is decentralized to client by P2P. Also, this system is tested by the multi-party video conference system using communication protocol and application software through high speed networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3B
• /
• pp.144-151
• /
• 2008

In this paper, we propose a video streaming server that guarantees a certain level of quality when a server should serve video streaming service to multiple heterogenous clients simultaneously with TCP transport. If each heterogeneous client requests video streaming service in according to its own requirement such as bitrate of content and these requests are accepted by a server, then TCP flows for each video streaming session fairly share limited uplink bandwidth of the server. At this time, because TCP's bandwidth fair-share characteristics can result in bandwidth shrinkage of higher bitrate video streaming session, the client of higher bitrate video may suffer sluggish playback which is related with streaming QoS degradation. To tackle this problem, our proposed server system uses multiple TCP connections adaptively for each video streaming session depending on the anticipated status of the client playout buffer. Simulation results show that our proposed algorithm can successfully reduce the occurrence of playout buffer underrun and enhance streaming quality for whole video clients.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.577-593
• /
• 2000

A distributed video-on-demand (VoD) system is one where collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in the setting of a distributed VoD system, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present three types of presentation plans that a local server must construct in order to satisfy the customer request. Informally speaking, a presentation plan is a temporally synchronized detailed sequence of steps that the local server must perform for presenting the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, for evaluating the goodness of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer, and minimizing access bandwidth is used. We develop algorithms to compute optimal presentation plans for all three types, and carry out extensive experiments to compare their performance. We have also mathematically proved certain results for the presentation plans that had previously been verified experimentally in the literature.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2790-2796
• /
• 1999

In video-on-demand systems, the I.O bandwidth of video servers is the critical resource which contributes to increase in latency. Several approaches: bridging, piggybacking are used to reduce the I/O demand on the video server through sharing. Batching delays the requests for the different videos for a batching window so that more requests for the same video arriving during the current batching window may be served using the same stream. In this paper, we propose an adaptive reservation-based batching policy which dynamically reserves video server capacity for popoular videos according to video server loads. The performance of the proposed policy is evaluated through a simulation, and is compared with simple batching and static reservation-based batching policies. As the result, we know that the adaptive reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching polices.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.10
• /
• pp.147-153
• /
• 2011

In this paper, we present a new video management technique using forward timeline to efficiently store and delete the videos on a local server. The proposed method is based on capturing the changing preference of the videos according to recentness, frequency, and playback length of the requested videos. For this purpose, we utilize the forward timeline which represents the time area within a number of predefined intervals. The local server periodically measures time popularity and request segment of all videos. Based on the measured data, time popularity and request segment, the local server calculates the mean time popularity and mean request segment of a video using forward timeline. Using mean time popularity and mean request segment of video, we estimate the ranking and allocated storage space of a video. The ranking represents the priority of deletion when the storage area of local server is running out of space and the allocated storage space means the maximum size of storage space to be allocated to a video. In addition, we propose an efficient storage space partitioning technique in order to stably store videos and present a time based free-up storage space technique using the expected variation of video data in order for avoiding the overflow on a local server in advance. The simulation results show that the proposed method performs better than other methods in terms of hit rate and number of deletion. Therefore, our video management technique for local server provides the lowest user start-up latency and the highest bandwidth saving significantly.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.9
• /
• pp.67-74
• /
• 2008

This paper proposes, designs and implements an architecture of a server involved with the network camera based video surveillance systems to solve common problems including lack of inter-network operability at the video information sharing, drawback of bandwidth and processing-overhead caused by increase of the number of users, and difficulty of continuous monitoring over changes of network configurations. The proposed saver was designed to manage and service numerous network cameras and users as well as solving the existing problems by providing video distribution facility. Through the empirical study after applying the implemented server to a real video surveillance system we proved that the server can provide reasonable service quality while it processes several hundreds of simultaneous user connections under persisting more than one hundred connections to network cameras. We expect the developed video distribution server to enhance service quality of the large scale video surveillance systems for citizen-wide services such as traffic reporting informatics or natural calamities supporting.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.1
• /
• pp.143-149
• /
• 2018

This paper presents an implementation of a streaming system which can forward live video stream to multiple users from a Phantom4, which is a drone made by DJI. We constructed the streaming server on Raspberry Pi 3 board for high mobility. Also We implemented the system so that the video stream can be played on any devices if the HTML5 standard web browser is utilized. We compiled C codes of FFmpeg open sources and installed in the Raspberry Pi3 as the streaming server and developed a Java application to execute as the integrated server that controls the other softwares on the streaming server. Also we developed an Android application which receives the live video stream from the drone and sends the streaming server continuously. The implemented system in this paper can successfully stream the live video on 24 frames per second at the resolution of 148x112 in considering the low hardware throughput of the streaming server.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.334-343
• /
• 2001

Most of currently used videos have variable bit rate(VBR) characteristics. Since the display rate of VBR videos compared to CBR videos vary with time, it is not proper to configure resources of the VBR video server using the method proposed for the CBR video server. In this paper we propose an optimal resource configuration method for the VBR video server which is based on the probability model. The proposed method decides the amount of disk and memory, and the disk access cycle of the video server with the lowest hardware cost, while preserving the throughput of the video server. In addition, we show the usefulness of the method through the various experiments.