Modeling and call admission control algorithm of variable bit ratevideo in ATM networks

The authors propose a new method for the modeling and call admission control (CAC) of variable bit rate video source, which come to the front of ATM networks as hot issues nowadays. First, the modeling of video source is accomplished using the three-state Markov chains including the effects of scene change at which the bit rate of video source is abruptly increased. Also, using two AR models, they improve the defects which an AR model has in modeling a video source. In addition, they represent the analytical model of a video source so that a network manager can acquire the information which is very important in managing the entire networks. CAC is accomplished using the previously defined analytical model. A routing manager calculates the cell loss probability of a chosen VP where a new call is connected so that the routing manager decides whether this new call is accepted or not. This calculation is accomplished through the GB/D/1-S queuing system. Using BIA (bandwidth increasing algorithm), they check whether the calls rejected by the routing manager could be accepted if possible. Finally, the applicable procedures to suitable allocate bandwidth to each VP on a link are presented in detail     

Bandwidth allocation for bursty isochronous traffic in a hybridswitching system

Consideration is given to a hybrid switch which provides integrated packet and circuit switching. The statistical characteristics of the bandwidth utilized by bursty isochronous traffic are derived. The derivation takes into consideration the waste inherent in the framing structure. Bursty traffic due to circuit allocation requests is modeled by a switched Poisson process. The analysis is performed for two circuit allocation policies, namely, repacking and first-fit with static numbering. Numerical results are presented to demonstrate the effect of traffic burstiness on the capacity utilized by the isochronous traffic     

Real time variable bit rate video traffic prediction

Real time variable bit rate (VBR) video traffic prediction plays an important role in dynamic bandwidth allocation schemes by providing an accurate estimation of the instantaneous bandwidth requirement of VBR video traffic and it has been widely used in dynamic bandwidth allocation. A number of prediction algorithms were proposed in the literature and they can be broadly classified into two categories: time domain approaches and wavelet domain approaches. In this paper, we first present a survey of the existing algorithms in the literature. On the basis of the survey, new algorithms are proposed in the time domain and in the wavelet domain, respectively. Simulations using real VBR video traces are conducted which show that the proposed algorithms achieve better performance than those in the literature. Copyright © 2006 John Wiley & Sons, Ltd.     

Distributed channel allocation for PCN with variable rate traffic

We consider the design of efficient channel allocation algorithms in personal communication networks (PCN) where the cells have varying traffic loads. A common communication channel is to be dynamically shared between the cells. We propose a distributed intercell channel allocation policy that is easy to implement through the use of simple signaling between neighboring cells. For cells arranged in a line, we show that the proposed policy achieves maximum throughput. The same is true when the cells are arranged in a circle and the frequency reuse distance is 2, while for larger reuse distances and planar hexagonal arrays, the policy may not always achieve maximal throughput. For general circular arrays, we enhance the policy to achieve maximal throughput asymptotically as the number of cells increases. For planar hexagonal arrays, we show that the policy can guarantee throughputs which are fairly close to maximal     

Online traffic smoothing for delivery of variable bit rate media streams

Traffic smoothing for delivery of online variable bit rate (VBR) media streams is one of the most important problems in designingmultimedia systems. Given an available client buffer, a window size, and a window-sliding size, previous window-based online smoothing methods have tried to reduce the peak bandwidth allocated in each window. However, as bandwidths allocated in different windows are minimized independently, these methods require a large peak bandwidth for transmitting an entire stream. In this paper, a new window-based method is proposed. It introduces two new ideas, the dynamic windowsliding size and the aggressive workahead, for delivery of online VBR media streams. Our aggressive and dynamic window sliding (ADWS) method can automatically decide on the suitable window-sliding sizes for different windows. Thus, the allocated peak bandwidth can be further reduced. By examining various media streams, ADWS is shown to be effective and efficient. Considering the online transmission of the movieStar Wars with a 90-kB client buffer, ADWS yields 13% less in peak bandwidth, compared with the bestknown window-based online smoothing algorthm SLWIN(1). Its computation cost (the window-sliding number) is 75% of that required by SLWIN(1).This work was partially supported by NSC, Taiwan, under grants. NSC88-2213-E-001-011, NSC88-2213-E-001-012, and NSC88-2213-E-001-025. A primitive version of this work appeared in IEEE INFOCOM'99 [7].     

Semi-fixed-length motion vector coding for H.263-based low bit ratevideo compression

We present a semi-fixed-length motion vector coding method for H.263-based low bit rate video compression. The method exploits structural constraints within the motion field. The motion vectors are encoded using semi-fixed-length codes, yielding essentially the same levels of rate-distortion performance and subjective quality achieved by H.263's Huffman-based variable length codes in a noiseless environment. However, such codes provide substantially higher error resilience in a noisy environment.     

An algorithm for sizing trunks carrying mixtures of constant and variable bit rate traffic

As new broadband networks based on the asynchronous transfer mode (ATM) protocol emerge to support a variety of services, the need for analytical models and tools for sizing network components carrying mixtures of different kinds of traffic will be increasingly felt. This paper presents a simple, yet efficient algorithm for sizing trunks carrying mixtures of constant and variable bit rate traffic. It combines theoretical results for the multi-dimensional Erlang model and the concept of equivalent bandwidth with some heuristic arguments to produce an analytic method for sizing trunks subject to blocking and quality of service constraints for traffic classes.     

Call admission and code allocation strategies for WCDMA systems with multirate traffic

In this paper, call admission and code allocation schemes are proposed to provide service differentiation in the forward link of wideband code-division multiple-access (WCDMA) systems. In particular, this paper proposes multiple leaf code reservation (MLCR) schemes, where different numbers of orthogonal variable spreading factor (OVSF) leaf codes (i.e., codes of the lowest layer of the OVSF code tree) are reserved to differentiate users with different bandwidth requirements. Leaf codes are only reserved for as long as the call admission process lasts. Once the decision of whether a new request is admitted or not has been made, a Code Dereservation procedure is carried out to increase flexibility in the code assignment phase. The performance of these MLCR strategies with/without code reassignments is then evaluated. Analysis shows that MLCR schemes are also useful in improving fair access among different traffic classes. In addition, perfect fair access among requests with different data rates can be achieved when code reassignments are jointly employed with the proposed OVSF-code reservation schemes.     

Optimal bit allocation for FGS coding

A new bit allocation scheme for fine-granular-scalability (FGS) video coding is proposed. Differing from traditional bit allocation schemes, the focus is on understanding the relationship between rate-distortion analysis and nonzero binary-scaled coefficients (NZBC) in the bitplane coding. An optimal strategy for NZBC coding is then derived and experimental results are given for a comparison of the new scheme with uniform bit allocation.     

Optimal bit allocation for noisy channels

An asymptotic expression for the optimal bit allocation for noisy channels is derived using high-resolution quantisation theory. Theoretically determined bit allocation based on the derived expression is presented.     

OFDM系统中动态子信道和功率的分配

在分析一种多用户OFDM系统中自适应子信道和比特功率分配算法的基础上,根据多径频率选择性衰落信道的瞬时特性,动态地为多用户分配子信道和传输比特数,并服从MA优化准则.并且进一步考虑了系统中有固定速率用户和可变速率用户同时存在的情况:在子信道分配时,先给固定速率的用户分配子信道,再给可变速率用户按照子信道链路增益最大化分配剩余的子信道;在信号发射功率分配上,按照"注水"法则分配,链路增益大的子信道分配的功率大,链路增益小的子信道分配的功率小,则系统的目标函数,总传输速率可以达到最大.仿真证明了此方案优于一般的方案.     

Cell loss analysis of broadband switching systems carrying variable bit rate video traffic

Many different traffic models have been proposed for the data generated by variable bit rate (VBR) video coders. It has been observed in simulation studies that use of different coders results in a wide variation in predicted cell loss statistics. In this paper, several models are studied, and their predictions of network performance compared to those obtained using real data. A quasi-stationary analysis technique is used to obtain analytic approximations for some of these cell loss statistics.     

Cross-Layer optimal connection admission control for variable bit rate multimedia traffic in packet wireless CDMA networks

Next generation wireless code division multiple access (CDMA) networks are required to support packet multimedia traffic. This paper addresses the connection admission control problem for multiservice packet traffic modeled as Markov modulated Poisson process (MMPP) with the quality of service (QoS) requirements on both physical layer signal-to-interference ratio (SIR) and network layer blocking probability. Optimal linear-programming-based algorithms are presented that take into account of SIR outage probability constraints. By exploiting the MMPP traffic models and introducing a small SIR outage probability, the proposed algorithms can dramatically improve the network utilization. In addition, we propose two reduced complexity algorithms that require less computation and can have satisfactory approximation to the optimal solutions. Numerical examples illustrating the performance of the proposed schemes are presented.     

An extended discrete autoregressive model for variable bit rate video traffic encoded by scalable video codec

Designing an effective and high performance network requires accurate characterization and modeling of network traffic. This paper provides a study of the transmission, modeling, and analysis of variable bit rate (VBR) video, which is fundamental for designing protocols and for effective utilization of networks in video transmission. To meet the specified requirements of future networks, the scalable video codec (SVC) was chosen as the video compression standard. The main objective of this work was to propose a statistical model that will allow better coordination between generated SVC video traffic and original video traffic. The performance of the proposed model was evaluated by comparing the model with three existing low‐complex statistical models using graphical and statistical measurements as well as cross‐validation. For all evaluation techniques, the accuracy of the proposed model was evaluated, and the frame size distribution of the modeled traffic was found to match that of the original video traffic better than other existing models. Copyright © 2015 John Wiley & Sons, Ltd.     

Bandwidth allocation for TDMA-based wireless local loops

Wireless local loops are of interest due to their many advantages over the wireline systems. However, the bandwidth allocation schemes in wireless local loops are different from that of the cellular networks in some aspects since the terminals are fixed. In this paper, we propose a strategy of bandwidth allocation for time-division multiple-access based wireless local loops. We align the sectors assigned the same channels such that the cochannel interference is reduced. In the performance evaluation, we demonstrate that the proposed scheme improves the bandwidth efficiency and increases system capacity with minimal loss of signal-to-interference ratio     

Bandwidth allocation scheme for cyclic-service fieldbus networks

Field devices in factory automation and process control systems generate time-critical, periodic, and time-available data that share the bandwidth of one fieldbus network medium. This paper presents a bandwidth allocation scheme that is applicable to cyclic-service fieldbus networks. The bandwidth allocation scheme transmits time-critical data as soon as the server is available. Transmission of periodic data is scheduled such that the network-induced delay will not exceed the maximum limit allowed. The bandwidth allocation scheme restricts the packet length of time-available data to satisfy the delay requirements of time-critical and periodic data. The bandwidth allocation scheme not only satisfies the real-time transmission requirements of both time-critical and periodic data, but also fully utilizes the bandwidth resources of the fieldbus network. The validity of this bandwidth allocation scheme is examined through simulation     

Bandwidth allocation for multiservice access on EPONs

Ethernet passive optical networks are a low-cost high-speed solution to the bottleneck problem of the broadband access network. A major characteristic of EPONs is the shared upstream channel among end users, mandating efficient medium access control to facilitate statistical multiplexing and provision multiple services for different types of traffic. This article addresses and provides an overview of the upstream bandwidth allocation issue for multiservice access provisioning over EPONs, and proposes an algorithm for dynamic bandwidth allocation with service differentiation. Based on the multipoint control protocol (MPCP) and bursty traffic prediction, our algorithm enhances QoS metrics such as average frame delay, average queue length, and frame loss probability over other existing protocols     

Optimised frequency-domain bit allocation for video coding

An optimal frequency domain bit allocation technique is presented. A Lagrange multiplier based approach is used for the rate-distortion optimisation of a quantisation matrix in video coding. Since the optimal quantisation matrix is heavily dependent on the choice of quantiser, the quantiser is also jointly optimised in order to alleviate the interaction between the two. The complexity of the algorithm is analysed, and it is shown to be directly proportional to the number of possible quantisation matrices and quantisation scales. Experimental results comparing the new technique with a conventional video encoder are also presented.     

Interlayer bit allocation for scalable video coding

In this paper, we present a theoretical analysis of the distortion in multilayer coding structures. Specifically, we analyze the prediction structure used to achieve temporal, spatial, and quality scalability of scalable video coding (SVC) and show that the average peak signal-to-noise ratio (PSNR) of SVC is a weighted combination of the bit rates assigned to all the streams. Our analysis utilizes the end user's preference for certain resolutions. We also propose a rate-distortion (R-D) optimization algorithm and compare its performance with that of a state-of-the-art scalable bit allocation algorithm. The reported experiment results demonstrate that the R-D algorithm significantly outperforms the compared approach in terms of the average PSNR.