• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1268-1278
• /
• 1999

In this paper, we propose an analytic method for dimensioning of traffic descriptors at the leaky bucket-based UPC for VBR MPEG video traffic on ATM networks. We analytically derive cell violation probabilities at the UPC by using the proposed scene-based video traffic model, and then we show that it is possible to select sets of traffic descriptors that have the same required violation probability. For two example video traces, numerical results show that our proposed traffic descriptors dimensioning method can approximate well the simulation-based traffic control results of the real video traces. When the effective bandwidth allocation method of an ON/OFF model is used for the call admission control in the networks, we present an efficient traffic descriptor selection method by studying the allocated bandwidth to each possible traffic descriptor set.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.156-167
• /
• 2007

In this paper, we develop the model based prediction algorithm for Variable-Bit-Rate(VBR) video traffic with regular Group of Picture(GOP) pattern. We use multiplicative ARIMA process called GOP ARIMA (ARIMA for Group Of Pictures) as a base stochastic model. Kalman Filter based prediction algorithm consists of two process: GOP ARIMA modeling and prediction. In performance study, we produce three video traces (news, drama, sports) and we compare the accuracy of three different prediction schemes: Kalman Filter based prediction, linear prediction, and double exponential smoothing. The proposed prediction algorithm yields superior prediction accuracy than the other two. We also show that confidence interval analysis can effectively detect scene changes of the sample video sequence. The Kalman filter based prediction algorithm proposed in this work makes significant contributions to various aspects of network traffic engineering and resource allocation.

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

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.367-376
• /
• 1999

A variable bit-rate based video services have much limitation for bandwidth management, since its trarfic has a some variances in frame level. In particular, the bandwidth management for video which has characteristics of VBR traffic such a MPEG video could be more complicated. Also, it is difficult to manage the bandwidth effectively for proving a VCR function from VOD service, since we don't know the traffic variance exactly at that time. In this paper, we proposed the dynamic bandwidth allocation a scheme based on VBR traffic based stored video such as MPEG for interactive video service. This scheme can maximize the given total bandwidth through the prefetch based variable length bandwidth allocation scheme and dynamic bandwidth management scheme for multiple streams. Also, our scheme can be used for a MPEG-based bandwidth allocation scheme, and provides the method that can maximize the utilization of network resource for multiple stream by using a dynamic bandwidth management.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06a
• /
• pp.147-151
• /
• 1996

This paper describes two traffic shaping methods for VBR(variable bit rate) video bit streams encoded in the MPEG-2 syntax. Difficulties in control of VBR video traffic are lessened by traffic shaping. Burstness of single layer MPEG-2 video can be reduced by performing intra-refresh in more than one consecutive frames. In two layer encoding of spatial scalability, burstness can be reduced by setting the temporal locations of GOP starting frame of a layer, differently from the other. Queueing analysis shows that these two methods outperform conventional encoding schemes in terms of temporal and semantic QoS requirements.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.8
• /
• pp.15-21
• /
• 1996

This paper describes data placement schemes that provide uniform and balanced to multiple disks load for retrievals of VBR (variable bit rate) video at varying retrieval speeds. To support maximum concurent users at arbitrary-speed playbacks in a disk-arry based system, the hot spot disks should be carefully avoided. In this paper, we extend the proposed scheme, prime round-robin(PRR), for VBR video. In addition, we have compared the performance of PRR and PRR (PRR extension).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10A
• /
• pp.1554-1559
• /
• 2000

On ATM networks, MPEG video stream is transferred using CBR or VBR services. But because the MPEG video traffic varies greatly from time to time, it is very difficult to transfer the MPEG steam efficiently without loss of transmission bandwidth. Until now, the study on the traffic analysis and control on a single MPEG video stream has been done by many researchers, but the traffic analysis and control on a multiplexed traffic of multiple MPEG video streams has not been studied by any researcher. This paper proposes a multiplexing method to reduce the PCR and traffic variance of a multiplexed traffic of multiple MPEG video streams. By reducing the PCR of the multiplexed traffic, the multiplexed VBR traffic can be transferred efficiently with less loss of transmission bandwidth.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.75-79
• /
• 2001

near VOU 시스템의 주기적 브로드캐스팅 방식(periodic broadcasting system)으로 여러 가지방법이 제시되었다. 그러나, 대부분 CBR 비디오를 전송하기 위한 방법이다. 요즘의 비디오들은 주고 VHR방식으로 압축되어 있어 VBR 비디오의 브로드캐스팅 기법이 필요하다. 하지만, 이에 대한 연구가 미미한 상태이다. 본 논문에서는 CBR 비디오의 브로드캐스팅 방식의 하나인 SB(Skyscraper Broadcasting)을 수정하여 VBR 비디오를 브로드캐스팅 하는 방법을 제시하였다. 관 논문에서 제시한 방식의 성능 평과 결과, 짧은 초기지연시간과 적은 버퍼가 필요함을 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.142-155
• /
• 2000

In this paper, we propose an efficient policing mechanism for Markov model-based traffic descriptors of VBR MPEG video traffic. A VBR video sequence is described by a set of traffic descriptors using a scene-basedMarkov model to the network for the effective resource allocation and accurate QoS prediction. The networkmonitors the input traffic from the source using a proposed new policing method. for policing the steady statetransition probability of scene states, we define two representative monitoring parameters (mean holding andrecurrence time) for each state. For frame level cell rate policing of each scene state, accumulated average cellrates for the frame types are compared with the model parameters. We propose an exponential bounding functionto accommodate dynanic behaviors during the transient period. Our simulation results show that the proposedpolicing mechanism for Markovian traffic descriptors monitors the sophisticated traffic such as MPEG videoeffectively and well protects network resources from the nalicious or misbehaved traffic.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.4
• /
• pp.455-470
• /
• 2001

This paper is focused on the traffic characterization for the efficient transmission of the VBR video source in the ATM network. For the traffic characterization, low traffic monitoring technique is applied and the dynamic VBR characterization method is suggested to satisfy the delay requirement. The dynamic VBR method uses the token bucket algorithm buffering though Cumulative Constraint Function. According to the Cumulative Constraint Function, the packet initially started transferring at the peak rate and the token bucket provided proper amount of buffer for traffic after a certain period of monitoring. It also reduced the network resource bandwidth through renewal of the cumulative frame and changed the rate from the previous frame information. It requires only small amount of monitoring and causes little overhead. In addition, it lowered the complexity of Deterministic Constraint Function to 0(n) and mapped the token rate and token depth to the token bucket. This study shows less network resource consumed than the previous method, comparing and analyzing the result of simulations.