• Journal of Korea Multimedia Society
• /
• v.1 no.1
• /
• pp.67-79
• /
• 1998

In this paper, we present the design and analyze the transmission rate of a control algorithm for the client buffer on the VOD systems. The design is based on the server's data transmission rate and clients' data consumption rate. The proposed algorithm stabilizes the client's buffer by reducing the oscillation phenomena of the buffer. And it uses the BCT (Buffer Check Time) to reduce the scheduling load of the client system. The client's data consumption rate and the buffer size are calculated on the basis of BCT. In case that the predicted buffer size operates in the overrun or starvation the buffer. As the load fluctuation of the network, the transmission rate control policy cannot stabilize the client's buffer alone. The media scaling policy, therefore, also performs its complementary part in stabilizing the client's buffer, and performance evaluation of the proposed algorithm is provided through simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.535-540
• /
• 2005

This paper presents a scalable caching algorithm of proxy server with the finite storage size minimizing client's buffer size and constant-bit-rate channel bandwidth. Under the general video traffic condition, it is observed that the amount of decreased client's buffer size and channel bandwidth after caching a video frame depends on the relative frame position in the time axis as the frame size. Based on this fact, we propose an effective caching algorithm to select the cached frames by using the normalized buffer size. Finally, experimental results are provided to show the superior performance of the proposed alghrithm.

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.207-212
• /
• 2004

This paper provides the higher user QoS(Quality of Service) by analyzing media service model between server and client in single VoD(Video on Demand) environment and applying it to parallel VoD environment. Media service model is divided into the Client Pull, Server Push, and IPP(Interleaving Pull & Push) model. A server sends data based on client's request in the Client Pull Model. A server one-sidedly sends data without client's request in the Server Pull model. And the WP model unites above two models. For a parallel VoD environment, We built the PMSS system which provides the parallel media streaming services that one client is simultaneously served by several servers. In the single and parallel VoD environment, We compare and analyze the performance of service models with respect to network delay and data size in buffer. In this experiment, we found that IPP service model keeps the least network delay and stable client buffer in the parallel VoD environment. This result shows that PMSS can provide the more quality of service.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.241-248
• /
• 2006

Mobile computing has such characteristics as portability, wireless network, mobility, etc. These characteristics cause various problems to mobile terminals like frequent disconnection, high error rate, and varying network status. These problems motivate us to develop an adaptive error control mechanism for supporting multimedia service in mobile computing environment. In this paper, we propose the Adaptive Error Control(AEC) scheme using client's buffer size and current error rate. After categorizing the status into four groups according to client's buffer size and current error rate, this scheme applies an appropriate error control scheme to each status. In this scheme, thresholds of buffer size and error rate are determined by the data transmission time, play rate and average VOP size, and by the probability of error for a sequence of packets. The performance of proposed scheme is evaluated by flaying MPEG-4 files on an experimental client/server environment, respectively. The results show that error correcting rate is similar to other schemes while the time for correcting error reduce a little. In addition, the size of data for correcting error is decreased by 23% compared with FEC and Hybrid FEC, respectively. Theses results demonstrate that the proposed scheme is more suitable in mobile computing environment with small bandwidth and varying environment than existing schemes.

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.647-656
• /
• 2001

Video delivery from a server to a client across a network system is an important part of many multimedia applications. Usually, the network system has constraint in both the amount of network bandwidth and the buffer size in the client. While delivering a video stream across such a constrained network system, loss of frames may be unavoidable. The system resources consumed by the dropped frames are wasted, and the losses of frames would result in discontinuous display at the client. In this paper, for delivering hierarchically encoded video stream, we introduce the notion of selective layer discard algorithm at the server which not only preemptively discards data at the server but also drops less important part of a frame instead of the entire frame. By the simulation, we compare the proposed selective layer discard algorithm and the existing selective frame discard algorithm. The simulation results show that the proposed algorithm may improve the quality of decoded video, and decrease the replay discontinuity at the client.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.1
• /
• pp.46-56
• /
• 2008

Double Patching is a multicasting technique for a VoD system which has been proposed to provide a true VoD service by making clients share a long patching stream as well as a regular stream For subsequent short patching streams, the technique always makes the long patching stream have extra data that will be played back during a double period of a patching window. In this paper, we propose a technique, using the start time of the latest short patching stream, optimizes Double Patching by deleting the useless data included in the long patching stream when the patching window of the long patching stream closes. The mean requirement for the server's bandwidth to provide the true VoD service is used as a performance metric, and the effect of the request inter-arrival time, the size of the client's local buffer and the video length on the mean bandwidth requirement is evaluated. Performance evaluation result shows that the proposed technique optimizes Double Patching in all cases.