• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.397-399
• /
• 2001

프록시 서버는 점차 다양해지고 있는 클라이언트의 이질성(heteroginiety)과 이에 따른 서버와 네트워크의 과부하를 해결하기 위한 방법으로 제시되고 있다. 본 연구에서는 분산된 프록시 서버 환경에서 주어진 프록시들의 부하 균형을 위하여 각 비디오 객체의 계층(layer) 들을 서로 다른 프록시에 분리하여 저장하였다가 필요시 전송함으로서 네트워크 환경에서 특정 프록시 서버로의 집중과 혼잡성을 줄이도록 한다. 이로서 적응적인 화질(Quality Adaptation)을 보장하기 위한 계층적 코딩(layered coding) 스트리밍 서비스를 보다 효율적으로 제공할 수 있다.

• Journal of Korea Multimedia Society
• /
• v.15 no.6
• /
• pp.814-826
• /
• 2012

In this paper, we propose scheduling algorithms for transporting variable-bit-rate video stream using playback buffer level of the clients over wireless communication networks. The proposed algorithms attempt to maximize the utilization of limited bandwidth between the central video server and the clients over a mobile network. Since a video server may serve several video request at the same time, it is important to allocate and utilize network bandwidth to serve them fairly and efficiently. In order to improve the quality of service and real-time performance of individual video playback, the video server attempts to allocate temporarily more network bandwidth to serve a video request with the lower buffer level preferentially. The simulation results prove the fair service and load balancing among the mobile concurrent clients with different buffer levels and hence maximizing the number of frames that are transported successfully to the client prior to their playback times.

• Journal of Korea Multimedia Society
• /
• v.13 no.3
• /
• pp.349-358
• /
• 2010

Adaptability is an important issue in video streaming over mobile environments, since the clients may request videos with great differences in their workload. In this paper, we propose the issues in limited bandwidth scheduling for efficient MPEG-4 video stream transmission over a mobile or wireless network. In the phase of admission control, the amount of bandwidth allocated to serve a video request is the mean bandwidth requirement of its requested video. The dynamic allocation of bandwidth in the phase of scheduling depends on the playback buffer levels of the clients with an objective to make it more adaptive to the playback situation of individual clients. In the proposed RTA scheduling protocol, more bandwidth may be allocated temporarily to the client whose buffer level is low. By employing the buffer level based scheduling policy, this protocol attempts to maximize the real-time performance of individual playback while minimizing the impact of transient overloading. Extensive simulation experiments have been performed to investigate the performance characteristics of the RTA protocol as comparing with BSBA protocol. This RTA protocol shows the better performance by transferring more frames than BSBA protocol.Computer simulations reveals that the standard deviation of the bit rate error of the proposed scheme is 50% less than that of the conventional method.

• The KIPS Transactions:PartA
• /
• v.12A no.3 s.93
• /
• pp.197-204
• /
• 2005

In this paper, we consider the transmission or variable bit rate (VBR) stored video for the distributed video streaming service over Internet. In streaming service, users often suffer from the discontinuity in playback due to the decrease in bandwidth during transmission according to bandwidth renegotiation protocol. We propose a novel transmission technique to overcome this problem for stored variable bit rate video. This scheme uses a priori information of stored VBR video to continue streaming without playback discontinuity. In addition, an approximation scheme for the buffer-bandwidth relation is proposed in order to facilitate the admission control under the proposed scheme.

• Journal of Digital Contents Society
• /
• v.18 no.1
• /
• pp.133-139
• /
• 2017

To address the problems caused by such high installation and maintenance cost in the conventional server-based cloud systems, researches on P2P cloud storages have been conducted recently. In this paper, we propose a hierachical overlay structure that can improve the playback quality in P2P cloud storage systems for video transmission. In this structure, after we make groups by clustering the participating peers based on their similarities, we construct subgroups by geographically dividing the peers belonging to a specific group considering the physical proximities among them. Therefore, when a request for video playback is issued, we can minimize the transmission delay by selecting the source peers depending on their locality. By simulations, we show that our proposed hierarchical overlay structure considering the peers' locality outperforms the structure where source peers are selected randomly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2103-2120
• /
• 2011

In this research, we consider the replication strategy for the applications of video streaming in wireless mesh networks (WMNs). In particular, we propose a closed-form of optimal replication densities for a set of frames of a video streaming by exploiting not only the skewed access probability of each frame but also the skewed loss probability and skewed encoding rate-distortion information. The simulation results demonstrate that our method improves the replication performance in terms of user-perceived quality (UPQ) which includes: 1) minimum average maximum reconstructed distortion for high peak signal-to-noise ratio (PSNR), 2) small reconstructed distortion fluctuation among frames for smooth playback, and 3) reasonable average maximum transmission distance for continuous playback. Furthermore, the proposed strategy consumes smaller storage capacity compared to other existing optimal replication strategies. More importantly, the effect of encoding rate is carefully investigated to show that high encoding rate does not always gain high performance of replication for video streaming.

• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.3
• /
• pp.95-103
• /
• 2007

Portable multimedia Player (PMP) devices have been gaining in its popularity with the emerging digital convergence of data, video, audio, etc. Since the PMP devices are typically equipped with DSP, a bigger LCD screen, and a hard disk, efficient power management has become more crucial than the other portable devices. This paper builds up a hardware/software-based power measurement system based on data acquisition devices. Subsequently, it measures and analyzes the power consumed in commercial PMP devices under different types of events: the system boot & shutdown, video playback, and the use of different video-coding types. Finally, our analysis of the measured power consumption patterns reveals useful information for the design of low-power PMP devices.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1643-1651
• /
• 1999

Video-On-Demand (VOD) is expected to provide the user with interactive operations such as VCR functions. In particular, fast scan functions like “Fast Forward” of “Fast Backward” for a certain speedup playback are required. Since they require a significant amount of system resources, schemes to reduce bandwidth requirements for the network or disk are needed. In MPEG standard, Group-of-Pictures (GoP) is a random access unit which can be decoded independently. Since storing and transmitting a video stream based on GoP is efficient, it is practical to support fast scan functions based on GoP. In this paper, we present a dynamic transmission scheduling scheme to support fast scan functions with m-times normal playback rate for a stored video. The proposed scheme writes a transmission schedule whenever user requests a fast scan function. That is, the scheme constructs the data set to be smoothed by skipping GoPs according to a given speedup factor, and then writes the transmission schedule by applying a bandwidth smoothing. Finally, the scheme restarts the transmission of video data to a client according to the new schedule. The proposed scheme results in speeding up the playback rate by utilizing “GoP skipping”, and then reduces the computational overhead by applying a bandwidth smoothing based on GoP.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.65-65
• /
• 2000

For Video on Demand(VoD) servers, a design of an efficient scheduler is important to the support a large number of clients having various playback speeds and receiving rates. In this paper, we propose the scheduling algorithm to handle establishing deadlines and selection using the earliest deadline first. To establish deadlines and selections, the period of the receiving rates for each client is located between the over-max receiving rate and the over-playback rate. To avoid video starvation and the buffer overflow of each client, the proposed algorithm guarantees providing the admission control. Because of establishing deadlines and selection, period of each client receiving is between one over max receiving rate and one over play back rate. Using Virtual Buffer in server, scheduling load is reduced. The efficiency of the proposed algorithm is verified using a Petri Net_Based simulation tool, Exspect.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.97-99
• /
• 2021

Edge caching can provide high QoE by reducing traffic in the backhaul network and reducing latency in video streaming services. But due to the limited capacity of edge cache, large amounts of content cannot be cached. In this paper, we propose an edge-fog prefix caching that reduces playback delay by caching prefixes of video content on edges and storing the rest in fog cache.