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.     

宽带ISDN与ATM交换技术 第四讲 B－ISDN中的业务量控制

本文介绍了Ｂ－ＩＳＤＮ中业务量控制的原理和方法，讨论了连接／呼叫接纳控制（ＣＡＣ）和用法／网络参数控制（ＵＰＣ／ＮＰＣ）两个最基本的业务量控制功能，并对网络拥塞控制、业务量成形、优先级控制和快速资源管理等附加的控制功能作了简要的叙述。     

DESIGN AND EVALUATION OF GCRA SHAPER AND ENFORCER ARCHITECTURE IN ATM NETWORKS

The leaky bucket scheme has been widely treated as a traffic control mechanism. The corresponding multi-connection shaper, which intends to make the passing traffic comply with the declared parameters in the enforcer, has also been implemented. However, we must point out that the regulated cells may be invalid at the corresponding enforcer, even if the CDV between the shaper and enforcer is neglected. In order to cope with this problem, two enforcing methods, say ALP_LB and GCRA, are tried and evaluated. We modify the GCRA algorithm, which was suggested by ITU-T recommendation I.371 and even extended by ATM Forum ’93, to be suitable for shaping. The shaper and enforcer architecture which is suitable for both ALP_LB and GCRA methods is proposed. Simulation results verify the shaping and UPC functions of GCRA. They also reveal that the GCRA shaper would not introduce long delay and queue length. The proposed shaper architecture does have some merits compared with others. Such a shaper is also suitable for regulating traffic for NPC (network parameter control) at the NNI (network node interface).     

嵌入前向网络的虚时间表法UPC

在分析文献[1]虚时间表法不足的基础上,提出利用前向网络动态调整虚时间表法参数的UPC算法。本文算法具有选择性强,检出率合理,动态响应特性好等特点。计算机仿真结果验证了本文算法的优越性。     

CELL LOSS QUALITY OF SERVICE IN AN INTEGRATED TRAFFIC ATM NETWORK

This paper explores and evaluates several aspects of quality of service (QOS) in an integrated traffic ATM network. Specifically, we consider the relationships between service class definitions, usage parameter control (UPC) or policing of customer traffic, network resource allocation mechanisms, and specific network conditions under which realistic QOS limits on cell loss ratio (CLR) can be met. Traffic consists of a mixture of voice, video, image and data divided into two service classes for UPC and network resource allocation. The block oriented network simulator (BONeS) tool is used for performance evaluations. Limitations associated with evaluating very low CLR values (e.g. 10⁻⁸ and 10⁻⁶) via simulation are overcome by a hybrid simulation and extrapolation technique. It is found that these stringent QOS limits on CLR can be met for most traffic with the techniques used here, reasonable backbone trunk loads (75 per cent) and reasonable buffer sizes (200–250 cell buffers per queue). However, meeting similar limits for extremely bursty traffic (such as our image traffic model) would require extra care in network design and operation, including judicious segregation of traffic.     

Content-adaptive parameters estimation for multi-dimensional rate control

Multi-dimensional rate control schemes have been recently utilized to adapt video streams to dynamic network conditions and heterogeneous devices. However, current multi-dimensional rate control methods, which estimate the model coefficients using fixed update duration, usually yield inaccurate parameters for dynamically changing video content. To address this problem, a content-adaptive parameters estimation scheme is proposed for multi-dimensional rate control. Firstly, we propose to estimate the parameters using dynamical update duration based on video content and the update duration of the model coefficients is determined by jointly considering the varying picture complexity and feedback information from the actual encoding results, which can improve the model parameter estimation accuracy. Secondly, a coarse-to-fine initial parameter calculation method is proposed to refine the initial frame rate according to the channel condition and the video sequence characteristics. Extensive experimental results show that the proposed solutions outperform the state-of-the-art schemes, especially for video sequences with high temporal and spatial complexity. Furthermore, our algorithm also slightly reduces the computational complexity as compared to related algorithms.     

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     

Improved lightpath (wavelength) routing in large WDM networks

We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpath is a fully optical transmission path, while a semilightpath is a transmission path constructed by chaining several lightpaths together, using wavelength conversion at their junctions. The problem thus is to find an optimal lightpath/semilightpath in the network in terms of the cost of wavelength conversion and the cost of using the wavelengths on links. In this paper, we first present an efficient algorithm for the problem which runs in time O(k²n+km+kn log(kn)), where n and m are the number of nodes and links in the network, and k is the number of wavelengths. We then analyze that the proposed algorithm requires O(d ²nk₀²+mk₀ log n) time for a restricted version of the problem in which the number of available wavelengths for each link is bounded by k₀ and k₀=o(n), where d is the maximum in-degree or out-degree of the network. It is surprising to have found that the time complexity for this case is independent of k. It must be mentioned that our algorithm can be implemented efficiently in the distributed computing environment. The distributed version requires O(kn) time and O(km) messages. Compared with a previous O(k²n+kn²) time algorithm, our algorithm has the following advantages. (1) We take into account the physical topology of the network which makes our algorithm outperform the previous algorithm. In particular, when k is small [e.g., k=O(log n)] and m=O(n), our algorithm runs in time O(n log² n), while the previous algorithm runs in time O(n log n). (2) Since our algorithm has high locality, it can be implemented on the network distributively     

Efficient bandwidth allocation and call admission control for VBR service using UPC parameters

Provision of Quality‐of‐Service (QoS) guarantees is an important and challenging issue in the design of Asynchronous Transfer Mode (ATM) networks. Call Admission Control (CAC) is an integral part of the challenge and is closely related to other aspects of network designs such as traffic characterization and QoS specification. Since the Usage Parameter Control (UPC) parameters are the only standardized traffic characterizations, developing efficient CAC schemes based on UPC parameters is significant for the implementation of CAC on ATM switches. In this paper, we develop a CAC algorithm called TAP (derived from TAgged Probability) as well as two other CAC algorithms using the UPC parameters. These CAC algorithms are based on our observation that the loss‐probability‐to‐overflow‐probability ratio tends to decrease as the number of sources increases. By introducing the loss‐probability‐to‐overflow‐probability ratio K, we find that this ratio sheds light on increasing resource utilization while still guaranteeing QoS. Analysis, simulation, and numerical results have shown that the proposed TAP algorithm is simple and efficient. Copyright © 2000 John Wiley & Sons, Ltd.     

QoS-aware joint working packet scheduling and call admission control for video streaming service over WiMAX network

In this paper, we propose a QoS-aware joint working packet scheduling algorithm and call admission control algorithm to support stable video streaming service to more subscribers over WiMAX network. The proposed call admission control algorithm estimates the network throughput by using a local linear model in terms of a control parameter of the proposed scheduling algorithm, and performs its own functions based on the information. The proposed scheduling algorithm continuously updates the control parameter to pursue an effective tradeoff between the quality-of-service of video streaming and the network throughput. Finally, simulation results are provided to show the performance of the proposed video streaming system.     

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

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

支持优先级与公平策略的队列规程

首先介绍了队列调度算法在流量控制中的关键地位,然后讨论了现有队列调度算法,如基于优先级的调度算法、轮询调度算法与公平队列调度算法,最后提出了一种新的队列规程,该队列规程融合了优先级调度算法与DRR调度算法。在网络正常情况下,不同业务流公平地共享网络带宽,在网络出现拥塞的情况下,高优先级业务流能够抢占带宽,保证其较低的丢包率,并能够实现两种调度算法的快速切换。     

A Centralized MAC-Level Admission Control Algorithm for Traffic Stream Services in IEEE 802.11e Wireless LANs

The admission control algorithm that can be performed at the MAC (Medium Access Control) layer in a real-time is proposed for the decision for accepting or rejecting the requests for adding traffic streams to an IEEE 802.11e wireless LAN (Local Area Network). In numerical examples, we apply the proposed admission control algorithm to VOIP (Voice Over Internet Protocol) traffic streams, and obtain the maximum numbers of VOIP traffic streams that can be admitted to IEEE 802.11a/e, IEEE 802.11b/e and IEEE 802.11g/e wireless LANs for various delay requirements.     

Bandwidth renegotiation for VBR video over ATM networks

A scheme for delivery or variable bit-rate (VBR) video over asynchronous transfer mode (ATM) networks where bandwidth can be renegotiated during the duration of a call between the video source and the network is considered. Renegotiation can be initiated by either the video source or the network. The video bandwidth requirement is characterized by a usage parameter control (UPC) consisting, in general, of peak rate, burst length, and sustained rate. A baseline design is outlined where rate-control adjusts the source's rate while a new UPC is requested from the network. When granted, the new UPC allows the source to maintain its target quantization and delay requirements. Rate control epochs may be extended when the network blocks UPC requests or sets a lower UPC value to temporally deal with congestion. Simulation results are presented for VBR MPEG video. The results show that with a moderate renegotiation rate the scheme tracks the bandwidth requirements of the source. As a result, the video quality and bandwidth efficiency can be maintained     

具有紧凑馈电网络的宽带四臂螺旋天线

传统的自相移馈电四臂螺旋天线(QHA)由于最小回波损耗频点和最小轴比频点不在一个频率上,因此,难以在较宽的频带内同时满足良好的阻抗匹配和圆极化特性.虽然采用功分相移网络馈电可以解决上述问题,但是馈电网络尺寸普遍较大,难以应用于手持机上.本文提出了一种底部带有紧凑的功分相移馈电网络的四臂螺旋天线,可以在宽频带内实现四个输出端功率平衡输出,相位两两相差90度.所提出的馈电网络使得四臂螺旋天线既可以实现宽带圆极化辐射,又具有小尺寸,非常适合GPS、北斗移动手持设备的应用需求.     

Efficient Transmission of MPEG-2 Coded Video Traffic over ATM Networks

Video traffic is expected to account for a significant share of the traffic volume in the future asynchronous transfer mode (ATM) networks. MPEG-2 proposed by Moving Picture Expert Group is one of the most promising compression techniques for such applications. One of the critical issues in MPEG-2 is to realize effective variable bit rate (VBR) video transfer thorough ATM networks. The Leaky Bucket (LB) scheme has been widely accepted as the usage parameter control (UPC) mechanism to police the VBR sources. We proposed a new Adaptive Dynamic Leaky Bucket (ADLB) congestion control mechanism, which is based on the LB scheme. Unlike the conventional LB, the leak rate of the ADLB is controlled using delayed feedback information of available bandwidth sent by the network. This scheme allows sources to get varying amounts of bandwidth over time, while reserving a minimum guaranteed bandwidth (MCR) for the entire duration of the connection. At the time of congestion, the leak rate of the ADLB is adjusted according to the feedback indicating the currently available bandwidth to the connection. The simulation results show that the end-to-end cell transfer delay and cell loss of each source has been improved significantly.