Loss performance analysis of an ATM multiplexer loaded withhigh-speed on-off sources

The performance of an asynchronous transfer mode (ATM) multiplexer whose input consists of the superposition of a multiplicity of homogeneous on-off sources modeled by a two-state Markovian process is studied. The approach is based on the approximation of the actual input process by means of a suitably chosen two-state Markov modulated Poisson process (MMPP), as a simple and effective choice for the representation of superposition arrival streams. To evaluate the cell loss performance, a new matching procedure that leads to accurate results compared to simulation is developed. The application limits of the proposed method are also discussed. The outstanding physical meaning of this procedure permits a deep insight into the multiplexer performance behavior as the source parameters and the multiplexer buffer size are varied     

Loss performance analysis for heterogeneous on-off sources withapplication to connection admission control

The bufferless fluid flow model (BFFM) is often used in the literature for loss performance analysis. We propose an efficient and effective means of investigating cell loss using the BFFM. We define the cell loss rate function (CLRF) and use it to characterize the loss performance of traffic sources in the BFFM. Stochastic ordering theory is used to study the CLRF. The introduction of the stochastic ordering theory not only simplifies the theoretical analysis but also makes it possible to extend the scope of applications and theoretical analysis presented. A cell loss upper bound for heterogeneous on-off sources is proposed. The proposed cell loss upper bound is tighter than those previously proposed in the literature. A connection admission control (CAC) scheme using online measurements is designed based on the cell loss upper bound. Extensive simulation is carried out to study the performance of the CAC scheme. Particular attention is paid to the impact of inaccuracies in user-declared traffic parameters on the performance of the CAC scheme. Simulation results indicate that the proposed CAC scheme can ensure QoS guarantee, is robust to inaccuracies in declared traffic parameters, and is capable of achieving high link utilization     

Performance analysis of an ATM multiplexer loaded with VBR trafficgenerated by multimode speech coders

Multimode coders are able to exploit the different characteristics of the speech waveform and to take into account the different peculiarities of background noise, thus allowing improvements in both signal reconstruction and network-offered load. In this context the variable rate code excited linear prediction (VR-CELP) coding, that is, a multimode variable bit rate (VBR) coding based on the CELP technique, has been introduced in the literature and is currently being considered for use in various applications, especially in the third-generation UMTS cellular systems. The target of the paper is to introduce an efficient and accurate framework allowing a network designer to analyze the impact of multimode VBR speech coding on the quality of service (QoS) provided by a wireless/wired ATM network. In order to capture the coder output characteristics, we propose to model a VR-CELP voice source by using a switched batch Bernoulli process (SBBP). More specifically, three models are introduced and compared in terms of accuracy and simplicity in determining network performance. As a result of the comparison, a four-state model has been chosen as the best tradeoff. The model is then used to analytically derive the loss probability and the jitter probability density function of an ATM multiplexer loaded by a number of VR-CELP sources. Finally, the proposed paradigm has been assessed in a case study where we demonstrate that, for a given output ATM link capacity and for a number of telecommunication services involving voice transmission, VR-CELP coding performs better than traditional on-off coding     

A Bernoulli process approximation with buffer size adjustment forthe analysis of an ATM multiplexer

The heterogeneity and the burstiness of input source traffic together with large size of the shared buffer make it difficult to analyze the performance of an asynchronous transfer mode (ATM) multiplexer. Based on the asymptotic decay rate of queue length distribution at the shared buffer, we propose a Bernoulli process approximation for the individual on-off input source with buffer size adjustment, which gives a good upper bound of the cell loss probability     

DYNAMIC BANDWIDTH ALLOCATION IN AN ATM MULTIPLEXER WITH MULTICLASS TRAFFIC AND ITS PERFORMANCE ANALYSIS

This paper introduces two source models: MAP(Markovian arrival process) model for the traffic with correlation and burst, e.g., voice, video, etc. and PAP(Poisson arrival process) model for the traffic with non-correlation, such as data, etc. Then a movable boundary bandwidth access policy is chosen.Basing on above model, the performance measures, e.g., mean waiting time and loss probability,especially the queue length time distribution are obtained. Finally, a number of numerical results are provided and shown through simulation.     

Analysis of an ATM multiplexer under self-similar traffic

Recent empirical studies of the real traffic measurement show that the traditional traffic models cannot capture the character of long-range dependence of the traffic. And many computer simulations said that this character has large influences on the network performance. So fractal or self-similar models are more suitable to describe the modern traffic. But there is still little known about the performance of the multiplexer under self-similar traffic. In this paper, a quasi-self-similar traffic model (QSSP) is proposed. Using this model, the upper bond of the cell loss rate and multiplexing gain of the multiplexer are gotten when there are N i.i.d. QSSP inputs. If the sources have different parameters, an efficient numerical algorithm to get, this bond is proposed. Simulations indicate that our analysis is correct and accurate.     

Analysis of DQLT scheduling policy for an ATM multiplexer

This letter suggests a modified priority scheduling policy for the asynchronous transfer mode (ATM) multiplexer, which is called DQLT. In the dual queue length threshold (DQLT) method, there exist two queues: (1) Q₁ is for nonreal-time traffic and (2) Q₂ is for real-time traffic and each queue has its own threshold to adaptively control the buffer congestion. If Q₁ is congested over the threshold T₁ one cell at the head of Q₁ moves into Q₂ in a slot time. It is shown that the DQLT method gives intermediate performance between those of minimum laxity threshold (MLT) and queue length threshold (QLT) policy, but its control method is quite simpler     

Bound analysis for WRR scheduling in a statistical multiplexer with bursty sources

Among various cell scheduling schemes for ATM networks, weighted round‐robin (WRR) seems a promising algorithm for explicit bandwidth allocation [15]. In this paper, we present a method for analyzing a discrete‐time queueing model of a statistical multiplexer with contiguous slot assignments, deterministic vacations, and bursty input sources, which serves as a bound analysis for WRR scheduling in ATM networks. Similar models have been studied as well in the context of TDMA (time division multiple access) schemes with multiple contiguous slots assigned per frame [3,16]. For the model under study, after establishing an expression for the probability generating function (pgf) of the system contents, we derive closed‐form expressions for performance measures such as the expected value, and an asymptotic approximation for the tail probabilities of the system contents distribution. Also, after examining the cell delay, we formulate the pgf of the cell delay in a closed form in terms of the system contents pgf. The numerical results obtained for the system contents and cell delay distributions illustrate that they match with simulation results extremely well, especially in the low probability area. We also discuss the impact of the slot assignment cycle of WRR on the system performance. This revised version was published online in June 2006 with corrections to the Cover Date.     

Traffic studies of a multiplexer in an ATM network and applications to the future broadband ISDN

In the first part of this paper the influence of the arrival process on these three performance parameters is discussed. The values of these three performance parameters depend strongly on the utilization distribution over the input trunks of the multiplexer while the total utilization on the input trunks is fixed. If there is the same utilization on all input trunks, the values of these three performance paramters reach a maximum. This result is also valid for an ATM switching matrix with a separate FIFO buffer at each output trunk. In the second part of this paper some examples are provided of how to apply the results of these studies to the future broadband ISDN which is intended to transmit services with very high bit rates (e.g. 135 Mb/s) as well as services with very low bit rates (e.g. 64 kb/s).     

DELAY JITTER OF A PERIODIC CELL STREAM THROUGH AN ATM MULTIPLEXER IN A BURSTY TRAFFIC ENVIRONMENT

The periodic cell stream is a very important member among the input traffic sources in ATM networks. In this paper, a finite-buffered ATM multiplexer with traffic sources composed of a periodic cell stream, multiple i.i.d Bernoulli cell streams and bursty two-state Markov Modulated Bernoulli Process (MMBP) cell streams is exactly analyzed. The probability mass function of queuing delay, the autocorrelation and power spectrum of delay jitter for this periodic cell stream are derived. The analysis is used to expose the behavior of delay jitter for a periodic cell stream through an ATM multiplexer in a bursty traffic environment. The simulation results indicate that the analytical results are accurate.     

A novel approach to estimating the cell loss probability in an ATMmultiplexer loaded with homogeneous on-off sources

Estimating the cell loss probability in an ATM multiplexer is one of the most important problems concerning congestion control and bandwidth management in an ATM-based BISDN. We propose a new approach to estimating the cell loss probability in an ATM multiplexer. We use the Markov modulated deterministic process (MMDP) to approximate the actual arrival process and then model the ATM multiplexer as an MMDP/D/1/K queueing system. Using queueing analysis, we derive a formula for the cell loss probability expressed in terms of the limiting probabilities of a Markov chain. We propose two approximation methods based on the results of the analysis. The actual arrival process is approximated by an (M+1)-state MMDP in the first method and by a two-state MMDP in the second. The major advantages of both methods are simplicity, computational efficiency, and numerical stability. The most attractive feature of the second method is that the cell loss probability can be expressed in closed form. Numerical and simulation results show that the first method is sufficiently accurate for all cases in which burst-level congestion is the main contributing factor to cell loss, while the closed-form formula is sufficiently accurate for applications where the average burst length is large (such as large file transfers, image retrievals, etc.)     

An analysis of statistical multiplexing in an ATM transport network

The traffic characteristics of an asynchronous transfer mode (ATM) network are analyzed by theoretical methods. A new method is proposed to express the burstiness of the cell arrival process. Both statistical multiplexing and statistical bandwidth allocation are quantitatively evaluated. When packetized video traffic and voice traffic are multiplexed, the number of multiplexable sources strongly depends on the peak bit rate of the multiplexed video sources, and statistical bandwidth allocation is ineffective without control. On the other hand, lowering the peak bit rate of video traffic effectively improves bandwidth utilization     

An approximate analysis of shared‐buffer channel‐grouped ATM switches under imbalanced traffic

Grouping output channels in a shared‐buffer ATM switch has shown to provide great saving in buffer space and better throughput under uniform traffic. However, uniform traffic does not represent a realistic view of traffic patterns in real systems. In this paper, we extend the queuing analysis of shared‐buffer channel‐grouped (SBCG) ATM switches under imbalanced traffic, as it better represent real‐life situations. The study focuses on the impact of the grouping factor and other key switch design parameters on the performance of such switches as compared to the unichannel allocation scheme in terms of cell loss probability, throughput, mean cell delay and buffer occupancy. Numerical results from both the analytical model and simulation are presented, and the accuracy of the analysis is presented. Copyright © 2005 John Wiley & Sons, Ltd.     

Imbedded semi-Markov process applied to stochastic analysis of a two-unit standby system with two types of failures

A two unit standby redundant system with two types of failures whose system behaviour on [0,∞) can be described by a stochastic process which is not a semi-Markov process (SMP) but possesses an imbedded SMP with the set of up-states as state-space is considered. Failure time distributions are exponential while repair time distributions are general. The closed form results for mean-time-to-system-failure, steady-state availability, expected number of occurrences of a state, etc. are obtained.     

Computer simulation for the evaluation of static and dynamic priority schemes in an ATM multiplexer with multimedia traffic

This paper is concerned with the evaluation of static and dynamic priority schemes for ATM multiplexers using digital computer simulation and has three main parts. The first provides a basic computer simulation model of an ATM multiplexer with multimedia traffic streams that enables investigation of static and dynamic priority schemes. The second part uses the simulation model to study such schemes. The third part investigates combined dynamic space and dynamic time priorities to provide better performance for ATM multiplexers in comparison to using dynamic time priority only. Copyright © 1999 John Wiley & Sons, Ltd.     

An approximate analysis of a buffered CSMA/CD

A continuous-time carrier-sense multiple access with collision detection (CSMA/CD) system with a finite number of homogeneous stations, each possessing an infinite buffer, is analyzed. The system and each station is treated approximately as an independent M/G/1 queuing system. Since stations are mutually dependent, the interference from other stations is taken into account, in terms of the service-time distribution. With this analysis, the mean message delay can be numerically obtained. The stability of the system is also discussed. In addition, the upper-bound condition for the transmission interval is presented that keeps the system stable. It is concluded that the stability of the system becomes more sensitive to the retransmission interval as the number of stations increases     

An approximate stochastic analysis of the packet‐pair probing technique for available bandwidth estimation

The packet‐pair probing algorithm for network‐bandwidth estimation is examined and an approximate model is proposed for predicting its behaviour. The model replaces the Poisson arrival process with a Gaussian distribution and resolves the queue‐size profile into two separate components: A transient component representing the buffer‐emptying process and an equilibrium component representing the return to steady‐state behaviour. Comparison with discrete‐event simulation results shows that the model is accurate in single‐hop paths when utilization is ?70% when the cross‐traffic packets are ?½ the size of the probe packets. When extended to two‐hop paths, the model remains accurate for smaller cross‐traffic packets ($\leq\frac{1}{10}-\frac{1}{5}The packet‐pair probing algorithm for network‐bandwidth estimation is examined and an approximate model is proposed for predicting its behaviour. The model replaces the Poisson arrival process with a Gaussian distribution and resolves the queue‐size profile into two separate components: A transient component representing the buffer‐emptying process and an equilibrium component representing the return to steady‐state behaviour. Comparison with discrete‐event simulation results shows that the model is accurate in single‐hop paths when utilization is ?70% when the cross‐traffic packets are ?½ the size of the probe packets. When extended to two‐hop paths, the model remains accurate for smaller cross‐traffic packets ($\leq\frac{1}{10}-\frac{1}{5}$ the probe‐packet size). Copyright © 2008 John Wiley & Sons, Ltd.     

Estimation of equivalent bandwidth without modeling arrival processes for connection admission control in an ATM multiplexer

The traffic modeling is a key element in analyzing and simulating communications network. Most of the previously studied approaches to the connection admission control (cac) are based on an assumed arrival process model. However, there are some limits to apply the assumed model to the real environment. In this paper, we study a connection admission control (cac) method without assuming arrival processes in an atm multiplexer when homogeneous traffics are multiplexed. To obtain the equivalent bandwidth (eb) without modeling arrival processes, the concept of equivalent bandwidth convergence (ebc) is proposed and implemented by using the upper bound of the first derivative of cell loss rate (clr) for the load. With the ebc concept, one can avoid modeling of the arrival process and implement the cac simply and effectively. We show by numerical examples the convergence process of the average clr and the eb for voice and video traffics, and the robustness of the ebc concept.     

An analysis of low-frequency second-order distortion in bipolar transistors applied to an amplifier

A distortion theory for bipolar transistors is applied to reduce low-frequency second-order distortion M/SUB 2/ in an amplifier. An equation for M/SUB 2/ is developed in terms of the physical parameters of the transistor. It is found that M/SUB 2/ depends critically on generator resistance that can be optimized for the transistor studied. The theory and this finding are then applied to the distortion producing Darlington pair in an amplifier, and an optimal value of base resistance for the second transistor is predicted and verified to improve M/SUB 2/ by 30 dB at 5 MHz for the pair. The corresponding improvement in the amplifier is 17 dB (from -50 to -70 dB) at 5 MHz and is accompanied by a small, acceptable degradation in M/SUB 3/ of 3 dB at high frequencies.     

An approximate performance analysis of interconnected token-passingrings

An analysis of the performance, in terms of average message delay, is presented for a system of interconnected ring networks. The system is hierarchical, with local rings served by a high-speed backbone ring through gateway queues. In both the local and the backbone rings, the access technique employed is token passing. Service disciplines, with and without priority, have been studied. In the former, priority is given to inter-ring traffic over local traffic. The study makes use of certain results on average delay in systems where the customer initiating a busy period receives special service for the M/G/1 queue with nonpreemptive priority and for the G/G/1 queue. The analysis, which involved several approximations, was verified by simulation