ATM网络中CBR业务排队性能分析

分析了ATM网络中CBR业务排队性能,给出了一种简单的计算信元丢失率和信元平均时延的表达式.分析结果表明,一方面在较小的缓冲区容量下,即使CBR业务被分配的带宽大于等于其峰值速率,也还存在着较大的信元丢失;另一方面,当复用的CBR业务源数目很大时,只需要分配相对较小的缓冲区容量就可以满足十分低的信元丢失率要求.该结果对于ATM设备中相应的缓冲区设计、带宽分配以及连接允许控制机制的研究具有重要的意义.     

Intelligent Flow Control Technique of ABR Service in ATM Networks Based on Fuzzy Neural Networks

ＩｎｔｅｌｉｇｅｎｔＦｌｏｗＣｏｎｔｒｏｌＴｅｃｈｎｉｑｕｅｏｆＡＢＲＳｅｒｖｉｃｅｉｎＡＴＭＮｅｔｗｏｒｋｓＢａｓｅｄｏｎＦｕｚｚｙＮｅｕｒａｌＮｅｔｗｏｒｋｓ①ＺｈａｎｇＬｉａｎｇｊｉｅＬｉＹａｎｄａＬｉＱｉｎｇｈｕａＷａｎｇＰｕ（ＤｅｐｔｏｆＡ...     

Capacity Analysis for Connection Admission Control in Indoor Multimedia CDMA Wireless Communications

In this paper, the capacity analysis for connection admission control is presented for the reverse-link transmission of a packetized indoor multimedia wireless communication system using direct sequence code division multiple access (DS/CDMA). Since CDMA is interference limited, the signal-to-interference-plus-noise ratio criterion is used to check if there is enough system resources (i.e., the CDMA channels and received signal power) for each new connection request. Taking into account the stochastical nature of multimedia traffic, the effective bit rate is used to characterize the resources required by each mobile user and a linear approximation is then used to find the total resources required by all the mobile users already admitted to the system and the new connection request. Transmission errors due to both base station buffer overflow and wireless channel impairments are considered. The capacity of multimedia traffic is determined in such a way that the utilization of the system resources is maximized and, at the same time, the required transmission bit error rate and transmission delay of all users admitted to the system are guaranteed. Computer simulation results are given to demonstrate the performance of the proposed method for capacity analysis.     

Video traffic prediction using source information for renegotiatedCBR

A prediction method for variable bit rate video traffic based on source information is presented. By analysing the source before encoding, any changes in the source traffic are detected and the bit rate of the current frame is predicted. In addition, a new channel rate for renegotiated constant bit rate service can be determined for future frames using the predicted bit rate and a bit rate updating algorithm. Simulation results show that the proposed method achieves a better prediction and requires a smaller buffer than the conventional approach     

Guaranteeing delay in ATM switches by using output port QoScontrollers

An ATM quality of service (QoS) controller which combines per-connection buffer management with a table-driven cell scheduler to achieve a broad range of QoS behaviours is proposed. The results show that as a constant bit rate (CBR) or variable bit rate (VBR) virtual connection spans across multiple switches, the QoS controller can firmly guarantee that the connection does not become burstier     

Sizing exit buffers in ATM networks: an intriguing coexistence ofinstability and tiny cell loss rates

This paper deals with the sizing of end buffers in ATM networks for sessions subject to constant bit rate (CBR) traffic. Our objective is to predict the cell-loss rate at the end buffer as a function of the system parameters. We introduce the D+G/D/1 queue as a generic model to represent exit buffers in telecommunications networks under constant rate traffic, and use it to model the end buffer. This is a queue whose arrival rate is equal to its service rate and whose arrivals are generated at regular intervals and materialize after a generally distributed random amount of time. We reveal that under the infinite buffer assumption, the system possesses rather intriguing properties: on the one hand, the system is unstable in the sense that the buffer content is monotonically nondecreasing as a function of time. On the other hand, the likelihood that the buffer contents will exceed certain level B by time t diminishes with B. Improper simulation of such systems may therefore lead to false results. We turn to analyze this system under finite buffer assumption and derive bounds on the cell-loss rates. The bounds are expressed in terms of simple formulae of the system parameters. We carry out the analysis for two major types of networks: (1) datagram networks, where the packets (cells) traverse the network via independent paths and (2) virtual circuit networks, where all cells of a connection traverse the same path. Numerical, examination of ATM-like examples show that the bounds are very good for practical prediction of cell loss and the selection of buffer size     

Design and evaluation of an efficient traffic control scheme for integrated voice,video, and data over asynchronous transfer mode networks: Explicit allowed rate algorithm

Asychronous transfer mode (ATM) networks are high‐speed networks with guaranteed quality of service. The main cause of congestion in ATM networks is over utilization of physical bandwidth. Unlike constant bit‐rate (CBR) traffic, the bandwidth reserved by variable bit‐rate (VBR) traffic is not fully utilized at all instances. Hence, this unused bandwidth is allocated to available bit‐rate (ABR) traffic. As the bandwidth used by VBR traffic changes, available bandwidth for ABR traffic varies; i.e., available bandwidth for ABR traffic is inversely proportional to the bandwidth used by the VBR traffic. Based on this fact, a rate‐based congestion control algorithm, Explicit Allowed Rate Algorithm (EARA), is presented in this paper. EARA is compared with Proportional Rate Control Algorithm (PRCA) and Explicit Rate Indication Congestion Avoidance Algorithm (ERICA), in both LAN and WAN environments. Simulations of all three algorithms are conducted under both congestion and fairness configurations with simultaneous generation of CBR, rt‐VBR, nrt‐VBR and ABR traffic. The results show that, with very small over‐head on the switch, EARA significantly decreases the required buffer space and improves the network throughput. Copyright © 1999 John Wiley & Sons, Ltd.     

Quality control for VBR video over ATM networks

Uncontrolled variable-bit-rate (VBR) coded video yields consistent picture quality, but the traffic stream is very bursty. When sent over ATM networks, cell losses may be incurred due to limited buffer capacity at the switches; this could cause severe picture quality degradation. Source rate control can be implemented to generate a controlled VBR bit stream which conforms to specified bit rate bounds and buffer constraints. However, source rate control could result in picture quality degradation too. Hence, for real-time video services, an important issue to address is whether the picture quality degradation incurred by source rate control is within acceptable levels or how to choose the appropriate coding parameters to make it so. We establish quantitatively the relationship between picture quality and source rate control for the case of guaranteed service with different combinations of allocated bandwidth, buffer size, and other key video-coding parameters of MPEG-2. In addition, quality control in the context of two-layered scalable video service (basic and enhanced quality) is also considered. Our study reveals that, in order to maximize both the basic and the enhanced quality, source rate control should be implemented on both layers. The relationships between the two types of quality and different combinations of allocated bandwidths, buffer sizes, and some key coding parameters are also established quantitatively for MPEG-2 SNR scalability     

A new approach for allocating buffers and bandwidth toheterogeneous, regulated traffic in an ATM node

A new approach to determining the admissibility of variable bit rate (VBR) traffic in buffered digital networks is developed. In this approach all traffic presented to the network is assumed to have been subjected to leaky-bucket regulation, and extremal, periodic, on-off regulated traffic is considered; the analysis is based on fluid models. Each regulated traffic stream is allocated bandwidth and buffer resources which are independent of other traffic. Bandwidth and buffer allocations are traded off in a manner optimal for an adversarial situation involving minimal knowledge of other traffic. This leads to a single-resource statistical-multiplexing problem which is solved using techniques previously used for unbuffered traffic. VBR traffic is found to be divisible into two classes, one for which statistical multiplexing is effective and one for which statistical multiplexing is ineffective in the sense that accepting small losses provides no advantage over lossless performance. The boundary of the set of admissible traffic sources is examined, and is found to be sufficiently linear that an effective bandwidth can be meaningfully assigned to each VBR source, so long as only statistically-multiplexable sources are considered, or only nonstatistically-multiplexable sources are considered. If these two types of sources are intermixed, then nonlinear interactions occur and fewer sources can be admitted than a linear theory would predict. A qualitative characterization of the nonlinearities is presented. The complete analysis involves conservative approximations; however, admission decisions based on this work are expected to be less overly conservative than decisions based on alternative approaches     

Importance sampling for the estimation of buffer overflow probabilities via trace-driven simulations

We develop an importance sampling technique that can be used to speed up the simulation of a model of a buffered communication multiplexer fed by a large number of independent sources. The sources generate traffic according to a periodic function with a random phase. This traffic model accommodates a wide range of situations of practical interest, including ON-OFF periodic traffic models and sequences of bit rates generated by actual variable bit rate sources, such as MPEG video compressors. The simulation seeks to obtain estimates for the buffer overflow probability that in most cases of interest is very small. We use a large deviations result to devise the change of measure used in the importance sampling technique and demonstrate through numerical results that this change of measure leads to a dramatic reduction in the required simulation time over direct Monte Carlo simulation. Possible practical applications include short-term network resource planning and even real-time call admission control.     

A self-governing rate buffer control strategy for pseudoconstantbit rate video coding

Video coding is a key to successful visual communications. An interframe video coding algorithm using hybrid motion-compensated prediction and interpolation is considered for coding studio quality video at a bit rate of over 5 Mb/s. Interframe coding without a buffer control strategy usually results in variable bit rates. Although packet networks may be capable of handling variable bit rates, in some applications, a constant bit rate is more desirable either for a simpler network configuration or for channels with fixed bandwidth. A self-governing rate buffer control strategy that can automatically steer the coder to a pseudoconstant bit rate is considered. This self-governing rate buffer control strategy employs more progressive quantization parameters, and constrains quantizer adjustments so that a smoother quality transition can be attained. Simulation results illustrate the performance of the pseudoconstant bit rate coder with this buffer control strategy.     

A new feedback congestion control policy for long propagationdelays

This paper presents a new feedback congestion control mechanism for the flow control of the best-effort available bit rate (ABR) traffic in ATM networks. This new mechanism belongs to the class of feedback control schemes that ensure no data losses and operate based on simple `stop' and `start' signals. A novelty presented by this paper is a methodology which, for a given set of desired properties, leads to the specification of the corresponding control algorithm. For the case of a single connection, the algorithm can operate with the theoretically minimum possible buffer size. Interestingly, the algorithm obtained has a different structure than the previous schemes; it does not operate based on fixed high and low thresholds. A new congestion control mechanism is subsequently derived for the flow control of multiple connections. The new scheme is exercised hop-by-hop and on a per-connection basis. This scheme allows connections to share memory and bandwidth resources efficiently within the network. The performance of the new scheme is also presented, and its statistical multiplexing efficiency is demonstrated. The measures investigated include buffer occupancy, average delay, overhead due to the protocol signals, and sustained throughput. In the case of long propagation delays, the buffer savings achieved by the new scheme are substantial     

Optimal smoothing for guaranteed service

We consider the transmission of variable bit rate (VBR) video over a network offering a guaranteed service such as ATM VBR or the guaranteed service of the IETF. The guaranteed service requires that the flow accepted by the network has to be conforming with a traffic envelope σ; in return, it receives a service guarantee expressed by a network service curve β. Functions α and β are derived from the parameters used for setting up the reservation, for example, from the T-SPEC and R-SPEC fields used with the resource reservation protocol (RSVP). In order to satisfy the traffic envelope constraint, the output of the encoder is fed to a smoother, possibly with some look-ahead. The resulting stream is transported by the network; at the destination, the decoder waits for an initial playback delay and reads the stream from the receive buffer. We consider the problem of whether there exists one optimal strategy at the smoother which minimizes the playback delay and the receive buffer size, given the traffic envelope α and the service curve β. We show that there does exist such an optimal smoothing, and give an explicit representation for it. We also obtain a simple expression for the smallest playback delay and playback buffer size which can be achieved over all possible smoothing and playback strategies. We show that the computation of optimal smoothing and minimum playback delay do not depend on the past. We show that separate delay equalization is optimal in the constant bit rate (CBR) case, but not otherwise. We also apply the theory to the analysis of which T-SPEC should be requested by a source-destination pair, given some playback delay and buffer constraint, and given the path characteristics advertised in RSVP PATH messages     

Simulation analysis of a communication link with statisticallymultiplexed bursty noise sources

Variable bit rate (VBR) coding techniques have received great research interest as very promising tools for transmitting bursty multimedia traffic with low bandwidth requirements over a communication link. Statistically multiplexing the multimedia bursty traffic is a very efficient method of maximizing the utilization of the link capacity. The application of computer simulation techniques in analyzing a rate-based access control scheme for multimedia traffic such as voice traffic is discussed. The control scheme regulates the packetized bursty traffic at the user network interface of the link. Using a suitable congestion measure, namely, the multiplexer buffer length, the scheme dynamically controls the arrival rate by switching the coder to a different compression ratio (i.e., changing the coding rate). VBR coding methods can be adaptively adjusted to transmit at a lower rate with very little degradation in the voice quality. Reported results prove that the scheme greatly improves the link performance, in terms of reducing the probability of call blocking and enhancing the statistical multiplexing gain     

Optimal choice of Reed-Solomon codes to protect against queuing losses in wireless networks

This article proposes algorithms to determine an optimal choice of the Reed-Solomon forward error correction (FEC) code parameters (n,k) to mitigate the effects of packet loss on multimedia traffic caused by buffer overflow at a wireless base station. A network model is developed that takes into account traffic arrival rates, channel loss characteristics, the capacity of the buffer at the base station, and FEC parameters. For Poisson distributed traffic, the theory of recurrent linear equations is applied to develop a new closed form solution of low complexity of the Markov model for the buffer occupancy. For constant bit rate (CBR) traffic,an iterative procedure is developed to compute the packet loss probabilities after FEC recovery.     

A method for congestion control in atm networks using peak rate throttling

This paper presents a technique, called peak rate throttling, for congestion control of controllable, variable bit rate traffic in ATM (asynchronous transfer mode) networks. It is much less conservative than techniques that have already been proposed. This is because techniques already proposed take no account of the load that is actually being carried by the network. Techniques already proposed assign a predetermined share of network capacity to connections regardless of what is actually being used. The technique proposed here works by throttling the peak bit rate that a user is allowed to send on a connection when the network detects a rising network load that may increase the cell loss rate of connections to greater than an acceptable limit. Users are still permitted to send whatever average bit rate they require, however. The technique relies on the assumption that the load offered to network links is stationary for a long enough period so that controlling action does not need to be performed too often or too quickly. It is feasible to achieve congestion control of a network using peak bit rate throttling alone and no other technique apart from connection control.     

Resource planning and bandwidth allocation in hybrid fiber–coax residential networks

The introduction of new high bandwidth services such as video-on-demand by cable operators will put a strain on existing resources. It is important for cable operators to know how many resources to commit to the network to satisfy customer demands. In this paper, we develop models of voice and video traffic to determine the effect of demand growth on hybrid fiber–coax networks. We obtain a set of guidelines that network operators can use to build out their networks in response to increased demand. We begin with one type of traffic and generalize to an arbitrary number of high-bandwidth constant bit rate (CBR) like services to obtain service blocking probabilities. We consider the effect of supporting variable bit rate (VBR) packet-switched traffic in addition to CBR services. These computations help us to determine how cable networks would function under various conditions (i.e., low, medium, and heavy loads). We also consider how the growth rate of the popularity of such services would change over time, and how this impacts network planning. Our findings will help cable operators estimate how much bandwidth they need to provision for a given traffic growth model and connection blocking requirement.