Simulation analyses of weighted fair bandwidth‐on‐demand (WFBoD) process for broadband multimedia geostationary satellite systems

Advanced resource management schemes are required for broadband multimedia satellite networks to provide efficient and fair resource allocation while delivering guaranteed quality of service (QoS) to a potentially very large number of users. Such resource management schemes must provide well‐defined service segregation to the different traffic flows of the satellite network, and they must be integrated with some connection admission control (CAC) process at least for the flows requiring QoS guarantees. Weighted fair bandwidth‐on‐demand (WFBoD) is a resource management process for broadband multimedia geostationary (GEO) satellite systems that provides fair and efficient resource allocation coupled with a well‐defined MAC‐level QoS framework (compatible with ATM and IP QoS frameworks) and a multi‐level service segregation to a large number of users with diverse characteristics. WFBoD is also integrated with the CAC process. In this paper, we analyse via extensive simulations the WFBoD process in a bent‐pipe satellite network. Our results show that WFBoD can be used to provide guaranteed QoS for both non‐real‐time and real‐time variable bit rate (VBR) flows. Our results also show how to choose the main parameters of the WFBoD process depending on the system parameters and on the traffic characteristics of the flows. Copyright © 2005 John Wiley & Sons, Ltd.     

Design of a real-time call admission controller for ATM networks

In this paper, we present a real-time computation algorithm based on the bufferless fluid flow model [Jabbari and Yegenolu, 1992] for call admission control (CAC) on one link of an asynchronous transfer mode (ATM) network with heterogeneous bursty traffic. Cell loss probability is adopted as the measure of quality-of-service (QoS). Our computation algorithm requires a constant memory size and needs only two multiplications and one division to determine whether a connection request can be accepted or not. It is known [Murase et al., 1991], that due to the interference between different types of traffic the individual cell loss probability may not meet the requirement even though the global one does. In this paper, we provide a close upper-bound for individual cell loss probability which can easily be obtained with our computation algorithm. Numerical examples using typical traffic parameters are studied to corroborate the upper-bound. We also compare the performance of the investigated CAC scheme with that of the effective bandwidth technique [Elwalid and Mitra, 1993]     

Effective Admission Policy for Multimedia Traffic Connections over Satellite DVB‐RCS Network

Thanks to the great possibilities of providing different types of telecommunication traffic to a large geographical area, satellite networks are expected to be an essential component of the next‐generation internet. As a result, issues concerning the designing and testing of efficient connection‐admission‐control (CAC) strategies in order to increase the quality of service (QoS) for multimedia traffic sources, are attractive and at the cutting edge of research. This paper investigates the potential strengths of a generic digital‐video‐broadcasting return‐channel‐via‐satellite (DVB‐RCS) system architecture, proposing a new CAC algorithm with the aim of efficiently managing real‐time multimedia video sources, both with constant and high variable data rate transmission; moreover, the proposed admission strategy is compared with a well‐known iterative CAC mainly designed for the managing of real‐time bursty traffic sources in order to demonstrate that the new algorithm is also well suited for those traffic sources. Performance analysis shows that, both algorithms guarantee the agreed QoS to real‐time bursty connections that are more sensitive to delay jitter; however, our proposed algorithm can also manage interactive real‐time multimedia traffic sources in high load and mixed traffic conditions.     

Providing deterministic packet delays and packet losses in multimedia wireless networks

‘Anytime, anywhere’ communication, information access and processing are much cherished in modern societies because of their ability to bring flexibility, freedom and increased efficiency to individuals and organizations. Wireless communications, by providing ubiquitous and tetherless network connectivity to mobile users, are therefore bound to play a major role in the advancement of our society. Although initial proposals and implementations of wireless communications are generally focused on near‐term voice and electronic messaging applications, it is recognized that future wireless communications will have to evolve towards supporting a wider range of applications, including voice, video, data, images and connections to wired networks. This implies that future wireless networks must provide quality‐of‐service (QoS) guarantees to various multimedia applications in a wireless environment. Typical traffic in multimedia applications can be classified as either Constant‐Bit‐Rate (CBR) traffic or Variable‐Bit‐Rate (VBR) traffic. In particular, scheduling the transmission of VBR multimedia traffic streams in a wireless environment is very challenging and is still an open problem. In general, there are two ways to guarantee the QoS of VBR multimedia streams, either deterministically or statistically. In particular, most connection admission control (CAC) algorithms and medium access control (MAC) protocols that have been proposed for multimedia wireless networks only provide statistical, or soft, QoS guarantees. In this paper, we consider deterministic QoS guarantees in multimedia wireless networks. We propose a method for constructing a packet‐dropping mechanism that is based on a mathematical framework that determines how many packets can be dropped while the required QoS can still be preserved. This is achieved by employing: (1) An accurate traffic characterization of the VBR multimedia traffic streams; (2) A traffic regulator that can provide bounded packet loss and (3) A traffic scheduler that can provide bounded packet delay. The combination of traffic characterization, regulation and scheduling can provide bounded loss and delay deterministically. This is a distinction from traditional deterministic QoS schemes in which a 0% packet loss are always assumed with deterministically bounding the delay. We performed a set of performance evaluation experiments. The results will demonstrate that our proposed QoS guarantee schemes can significantly support more connections than a system, which does not allow any loss, at the same required QoS. Moreover, from our evaluation experiments, we found that the proposed algorithms are able to out‐perform scheduling algorithms adopted in state‐of‐the‐art wireless MAC protocols, for example Mobile Access Scheme Based on Contention and Reservation for ATM (MASCARA) when the worst‐case traffic is being considered. Copyright © 2002 John Wiley & Sons, Ltd.     

Estimation and Prediction‐Based Connection Admission Control in Broadband Satellite Systems

We apply a “sliding‐window” Maximum Likelihood (ML) estimator to estimate traffic parameters of On‐Off source and develop a method for estimating stochastic predicted individual cell arrival rates. Based on these results, we propose a simple Connection Admission Control (CAC) scheme for delay sensitive services in broadband onboard packet switching satellite systems. The algorithms are motivated by the limited onboard satellite buffer, the large propagation delay, and low computational capabilities inherent in satellite communication systems. We develop an algorithm using the predicted individual cell loss ratio instead of using steady state cell loss ratios. We demonstrate the CAC benefits of this approach over using steady state cell loss ratios as well as predicted total cell loss ratios. We also derive the predictive saturation probability and the predictive cell loss ratio and use them to control the total number of connections. Predictive congestion control mechanisms allow a satellite network to operate in the optimum region of low delay and high throughput. This is different from the traditional reactive congestion control mechanism that allows the network to recover from the congested state. Numerical and simulation results obtained suggest that the proposed predictive scheme is a promising approach for real time CAC.     

Utility‐based probabilistic call admission control for complete fairness in wireless networks

Resource reservation or the other prioritization strategies adopted by Call Admission Control (CAC) schemes in wireless networks lead to unfair resource allocation to users belonging to different service classes (SCs) due to high divergence among the respective call blocking probabilities (CBPs). In this paper, we propose dynamic optimization of probabilistic CAC (P‐CAC) schemes to assure CAC fairness among users of different SCs in wireless networks. The approach is based on users utility combined with fairness optimization, aiming at dynamically determining the probability value in the P‐CAC scheme. This optimal probability is adjusted to network ongoing traffic, CBPs of each SC, prioritization levels characterizing the SCs supported, and the users risk aversion, which reflects their behavior toward the perceived QoS. The existence and uniqueness of the optimal probability that leads to absolute fairness among the users of a wireless network are proven. Copyright © 2012 John Wiley & Sons, Ltd.     

Joint connection-level and packet-level quality-of-service support for VBR traffic in wireless multimedia networks

In this paper, we investigate call admission control (CAC) schemes that can jointly provide connection-level quality-of-service (QoS) (in terms of the new call blocking probability and the handoff dropping probability) and packet-level QoS (in terms of the packet loss probability) for wireless multimedia networks. Stationary CAC schemes are proposed as the results of the solution to constrained optimization problems. A dynamic CAC scheme that can be adapted to varied and varying traffic conditions dynamically is also proposed. The proposed CAC schemes are computationally efficient and easy to implement, thus being suitable for real-time system deployment. Simulation results have demonstrated that the proposed dynamic CAC scheme achieves better performance when applied to realistic traffic conditions found in wireless multimedia networks.     

卫星ATM交换系统的连接允许控制算法研究

连接允许控制（Connection Admission Control，CAC）是卫星ATM交换系统中很重要的部分。从带宽利用率和计算复杂度的角度对当前几种比较流行的CAC算法进行了分析、比较和仿真，并结合卫星通信的特点，从中挑选出一种适合卫星ATM交换系统的CAC算法。     

Performance Analysis of the UPC/NPC Algorithm for Guaranteed QoS in ATM Networks

It is well known that if usage parameter control/network parameter control (UPC/NPC) functions are used together with a cell loss priority control scheme in ATM networks, the measurement phasing problem can occur. This makes it difficult for a network provider to define and commit the cell loss ratio as a QoS parameter. To solve the problem, we propose a new UPC/NPC algorithm. By using the proposed UPC/NPC algorithm, we can define the cell loss ratios for CLP = 0 and CLP = 0+1 cell streams without the measurement phasing problem under any conditions. We analyzed the performance of the proposed UPC/NPC algorithm. Using a discrete time model for the UPC/NPC architecture with a discrete-time semi-Markov process (DSMP) input model, we obtained the cell discarding probabilities of CLP = 0 and CLP = 0+1 cell streams and showed that more CLP = 0 cells are accepted compared to what was proposed in ITU-T.     

Estimation of the cell loss ratio in ATM networks with a fuzzysystem and application to measurement-based call admission control

An important parameter in asynchronous transfer model (ATM)-based network design and management is the cell loss ratio (CLR) in ATM multiplexers. It is a key parameter to many vital functions in the network such as call admission control (CAC), bandwidth allocation, etc. However, the CLR depends usually on many unknown and unpredictable traffic parameters such as input traffic correlations. In this paper, we propose a simple and robust fuzzy-based algorithm to predict the CLR in large-sized systems based on both a small amount of information from small-sized systems, and the asymptotic behavior for very large systems. Unlike the model-based approaches, our approximation avoids the problem of assuming any traffic parameters or arrival process. This algorithm is used with real-time traffic measurement to propose an effective measurement-based call admission control framework for ATM networks     

The transmission of MPEG‐2 VBR video under usage parameter control

This paper studies the transmission of MPEG‐2 VBR video over ATM network under usage parameter control. The idea is to seek a compromise between the network utilization and the quality of video service by applying UPC‐based rate control strategies to the video source. A modified leaky bucket algorithm is proposed to calculate the constraints on the bit‐rate guaranteeing conformance to peak cell rate, sustainable cell rate and burst tolerance usage parameters. Two rate control strategies, one for real‐time generated video coding and the other for pre‐compressed video, are proposed for MPEG‐2 VBR video. The rate control strategies control the video source to generate traffic conforming to the constraints on the bit rate. The experimental results show that both the UPC‐based rate control strategies can provide lossless transmission from the source perspective as well as to reduce the burstiness of the traffic. To keep within the bit‐rate allowed, the control method uses coarser quantization to maintain better picture quality than that by removing the number of AC transformed coefficients. The slight degradation of picture quality caused by the source rate control is preferable than the severe drop of picture quality caused by the cell loss at UPC. Copyright © 2001 John Wiley & Sons, Ltd.     

流媒体业务呼叫接纳控制算法

为满足不同业务对服务质量的不同要求,提出了一种适用于无线流媒体业务的呼叫接纳控制算法。算法的思想是通过移动站和基站的协作和反馈控制,以剩余带宽和业务类型为依据进行接纳概率设计;通过互相协作的反馈控制,移动站可以获取系统的剩余可用带宽等级,依此调整业务的呼叫请求速率;仿真结果表明,该算法的输出变化较平滑、稳定,在呼叫阻塞概率、切换呼叫丢弃概率和带宽利用率方面有良好的综合性能。     

Performance evaluation of priority based adaptive multiguard channel call admission control for multiclass services in mobile networks

The CAC (call admission control), which can guarantee call services to meet their QoS (Quality of Service) requirements, plays a significant role in providing QoS in wireless mobile networks. In this paper, an adaptive multiguard channel scheme‐based CAC strategy is proposed to prioritize traffic types and handoff calls. The major aim of the study is to develop the analytical model of the priority traffic and handoff calls based adaptive multiguard channel scheme and examining the performance through setting the value of the adaptive ratio parameters. Our proposed scheme tries to mediate the advantages and drawbacks of the static and dynamic CAC schemes. The proposed scheme is quite different from previous studies because multithreshold values have been considered for multiclass traffic by adaption parameters, and a closed form analytical model is developed The numerical results show that this scheme can be used to keep the targeted QoS requirement by suitably setting the adaptive ratio parameters. Copyright © 2011 John Wiley & Sons, Ltd.     

Call admission control in cellular networks: A reinforcement learning solution

In this paper, we address the call admission control (CAC) problem in a cellular network that handles several classes of traffic with different resource requirements. The problem is formulated as a semi‐Markov decision process (SMDP) problem. We use a real‐time reinforcement learning (RL) [neuro‐dynamic programming (NDP)] algorithm to construct a dynamic call admission control policy. We show that the policies obtained using our TQ‐CAC and NQ‐CAC algorithms, which are two different implementations of the RL algorithm, provide a good solution and are able to earn significantly higher revenues than classical solutions such as guard channel. A large number of experiments illustrates the robustness of our policies and shows how they improve quality of service (QoS) and reduce call‐blocking probabilities of handoff calls even with variable traffic conditions. Copyright © 2004 John Wiley & Sons, Ltd.     

移动网自适应业务的CAC算法研究

宽带移动网络中的连续媒体流业务能够根据无线链路质量和小区负载情况自适应调整其源速率，因而使网络容量具有一定的弹性。自适应业务的CAC算法既要能保护用户的QoS降级期小于一定上限，从而保护用户的Qos；又要尽量提高接入率以充分利用无线资源。本文提出了一种基于滑动窗口的CAC算法，仿真结果表明该算法获得的接入率明显高于固定门限算法，并且能够有效的保护自适应业务的QoS。     

基于功率谱密度分析的ATM连接允许控制研究

本文研究了ＡＴＭ网络中的多媒体实时突发业务流的功率谱密度特性，利用反映业务流相关特性的功率谱密度，设计了一个用于多媒体业务的ＡＴＭ连接允许控制方法，并给出了将人工神经网络技术应用于实现业务流的功率谱密度、负载强度与信元丢失概率之间映射的理论方法，增强了ＡＴＭ连接允许控制的智能特性。     

A real-time dynamic connection admission controller based ontraffic modeling, measurement, and fuzzy logic control

Broadband networks based on asynchronous transfer mode (ATM) have to support traffic with widely different traffic characteristics and quality of service requirement. In this paper, we extend our earlier work in and develop a dynamic connection admission controller (CAC) that supports cell loss requirements. The CAC algorithm explicitly computes the equivalent bandwidth required to support each class of connections based on on-line observations of aggregate traffic statistics as well as the declared parameters. We use Gaussian and diffusion approximations to characterize the aggregate traffic stream, and use fuzzy control strategy to combine model and measurement results to derive simple closed-form formulas to estimate the equivalent bandwidth in real time. We validate the proposed algorithms for various variable bit-rate traffic profiles and show that the system utilization can be substantially improved by appropriately tuning the fuzzy logic controller to combine traffic characteristics deduced from the declared parameters and traffic measurements     

模糊漏桶在ATM网络UPC中的应用

本文提出了模糊漏桶模型，研究了它与普通漏桶在用户量参数控制（ＵＰＣ）中的作用。由于ＣＡＣ初步协议的不完全合理性，在实际应用中动态调节是必要的；仿真结果表明在降低信元丢失率、时延和时延抖动方面，及在动态利用网络资源方面，模糊漏桶算法要比普通的优越。我们还给出了合适的模糊控制规则。