ATM网络中的ABR业务在不同ON—OFF业务背景上的性能研究

本文比较研究了ＡＴＭ网络中的三种不同分布的ＯＮ－ＯＦＦ源对ＡＢＲ业务性能的影响;周期性的ＯＮ－ＯＦＦ源,长度为指数分布的ＯＮ－ＯＦＦ源以及长度为Ｐａｒｅｔｏ分布的ＯＮ－ＯＦＦ源,发现Ｐａｒｅｔｏ分布的ＯＮ－ＯＦＦ源对ＡＢＲ业务的性能影响最大,此时需要更大的缓存器存放在ＶＢＲ业务的ＯＮＭ期间累积的ＡＢＲ信元,为了改善性能,我们对ＰｒｅｔｏXＯＮ－ＯＦＦｉｄｒ ｆｊｔｆｂ ｇｕ ｉｍｅ ｔｈｇｊ２,ｇ     

ATM网络中的ABR业务在不同ONOFF业务背景下的性能研究

本文比较研究了ＡＴＭ网络中的三种不同分布的ＯＮＯＦＦ源对ＡＢＲ业务性能的影响;周期性的ＯＮＯＦＦ源,长度为指数分布的ＯＮＯＦＦ源以及长度为Ｐａｒｅｔｏ分布的ＯＮＯＦＦ源．发现Ｐａｒｅｔｏ分布的ＯＮＯＦＦ源对ＡＢＲ业务的性能影响最大,此时需要更大的缓存器存放在ＶＢＲ业务的ＯＮ期间累积的ＡＢＲ信元．为了改善性能,我们对ＰａｒｅｔｏＯＮＯＦＦ源进行了平滑处理,还在理论上对所得实验结果作了解释．     

新型光缓存器和2×622Mb／s ATM光交换系统

本文给出一种新型的光缓存器的结构，以解决在ＡＴＭ光交换中的信元碰撞问题。这种缓存器由光纤延迟线、光波导开关阵及非线性半导体光放大器构成。文中还报告了一种用于交换各用户不同速率的信元（可达６２２Ｍｂ／ｓ）的ＡＴＭ光交换实验系统，系统的总容量为１．２Ｇｂ／ｓ。     

ATM交换机EPD性能分析

利用ＡＴＭ网络传送ＴＣＰ分组时的一个重要问题是分组中任何一个信元丢失都半导致分组的重传,为解决这一问题,一个方法是发生拥塞时交换机有选择丢弃信元,在有限的存储器容量下,交换机智能化的信元集合源状态与缓存器占用的联合分布,基于这一结果,本文推导出的ＥＰＤ系统的分组丢失率的上界和下界,通过分析比较发现,使用ＥＰＤ的系统,当门限设为缓存器大小时其性能将优于无控制系统。     

基于输入缓存机制的ATM网络优先级流控策略

提出一种基于输入缓存机制的ＡＴＭ网络优先级流控策略，并运用系统仿真技术对采用该优先级流控及ＦＩＦＯ输入流控两种方案的ＡＴＭ多媒体网络性能进行计算机仿真研究。结果表明：采用优先级流控策略将改善ＡＴＭ多媒体网非实时信元丢失率及实时信元排队时延性能，具有较大实用价值。     

基于输入缓存机制的ATM网络优先级流控策略

提出一种基于输入缓存机制的ＡＴＭ网络优先级流控策略，并运用系统仿真技术对采用该优先级流控及ＦＩＦＯ输入流控两种方案的ＡＴＭ多媒体网络性能进行计算机仿真研究。结果表明：采用优先级流控策略将改善ＡＴＭ多媒体网非实时信元丢失率及实时信元排队时延性能，具有较大实用价值。     

输入/输出ATM交换机在突发性业务下的性能

本文详尽分析了内部无阻塞输入／输出排队反压型ＡＴＭ交换机在突发性业务下信元丢失、交换机最大吞吐量等性能。输入端口信元的到达过程是ＯＮ－ＯＦＦ突发流，且ＯＮ态以概率ｐ发送信元，ＯＮ－ＯＦＦ长度为Ｐａｒｅｔｏ分布的随机变量；属于同一突发流的信元输往同一个输出端口，不同突发流的信元等概率输往不同的输出端口；输入／输出缓冲器长度有限，交换机加速因子Ｓ任意。本文同时比较了突发长度为周期／几何分布下的交换机性能，其结论对实际设计一输入／输出排队反压型ＡＴＭ交换机具有一定参考意义。     

一种基于PLL的CBR业务时钟恢复方案

信元在 ATM 网内传输时,由于网内缓存的存在,造成了信元延时变化。信元延时变化对基于锁相环(PLL)的恒定比特率业务时钟的恢复有很大影响,即时钟的抖动和漂移比较明显。从而使这种基于 PLL 的CBR 业务时钟恢复方案在某些场合不能应用。本文提出了一种基于 PLL 的时钟恢复新方案,该方案可以明显地降低由于信元延时变化而造成的 CBR 业务时钟的抖动和漂移,同时不增加缓存的容量。     

一种基于差分技术的CBR业务时钟自适应恢复算法与方案

信元在ATM网内传输时,由于网内缓存的存在,造成了信元延时抖动。信元延时抖动对基于PLL的恒定比特率业务时钟的自适应恢复有很大影响,即时钟的抖动/漂移比较明显。这使得这种基于PLL的CBR业务时钟恢复方案在某些场合不能应用。本文提出了一种基于差分技术的时钟自适应恢复新方案,该方案可以明显地降低由于信元延时抖动而造成的CBR业务时钟的抖动和漂移,同时不增加缓存的容量。     

基于ON/OFF信源模型的信元丢失分析

ＯＮ／ＯＦＦ信源模型体出在漏桶速率控制策略控制下信源的信元生成特性,通过对单一业务源的信元生成特性演是出了多业务源的信元生成特性模型;以信元丢失为主要研究对象,通过对多业务源复用器排队系统的信元丢失进行了深入的研究得出了一些新的定量结论,这些结论也可用一献计献策中存在存储器溢出概率。     

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     

Loss Probability for a Finite Buffer Multiplexer with the <Emphasis Type="Italic">M/G/∞</Emphasis> Input Process

This paper studies the impact of long-range-dependent (LRD) traffic on the performance of a network multiplexer. The network multiplexer is characterized by a multiplexing queue with a finite buffer and an M/G/∞ input process. Our analysis expresses the loss probability bounds using a simple relationship between loss probability and buffer full probability. Our analysis also derives an exact expression for the buffer full probability and consequently calculates the loss probability bounds with excellent precision. Through numerical calculations and simulation examples, we show that existing asymptotic analyses lack the precision for calculating the loss probability over realistic ranges of buffer capacity values. We also show that existing asymptotic analyses may significantly overestimate the loss probability and that designing networks using our analysis achieves efficient resource utilization.     

An error-controlled approximate analysis of a stochastic fluid flowmodel applied to an ATM multiplexer with heterogeneous on-off sources

The stochastic fluid flow approach is applied to the analysis of the cell loss performance of an ATM multiplexer. The input traffic stream offered to the multiplexer is the superposition of heterogeneous on-off sources with independent and exponentially distributed on and off times. The focus is on the numerical investigation of the steady-state behavior of models involving very large state spaces. To this end, an efficient algorithm for the evaluation of tight upper and lower bounds of the cell loss probability is developed. The algorithm allows a significant reduction of the computational burden, while yielding a guaranteed overestimate of the error implied by the proposed approximation of the cell loss probability. Numerical results are presented both to assess the tightness of the proposed bounds and to gain insight into the behavior of heterogeneous traffic mixes. The main conclusion, from the multiplexer performance evaluation point of view, is that it is not convenient to mix very different traffic streams in a completely shared FIFO buffer, without some kind of control     

Cell arrival modeling and related statistical multiplexer performance in ATM networks

A source is assumed to go through independently distributed ON and OFF periods. During an ON period, cells arrive spaced apart in time by a fixed interval. No cells arrive during an OFF period. The probability distribution of the ON and OFF periods are arbitrary. Traffic from a number of such sources is statistically multiplexed. The related statistical multiplexer performance is studied analytically as follows. A statistical multiplexer is modeled as a discrete-time single-server queueing system where the traffic from a new source (conforming to the cell arrival process described above) joins traffic that is already being statistically multiplexed. The aggregated arrival of cells from existing traffic is assumed to follow a two-state Markov modulated cell arrival process. Numerical examples that relate the performance at the statistical multiplexer to the parameters describing the traffic from the new source and the aggregated traffic are presented.This research was supported in part by the National Science Foundation under Grant No. NCR-9016348, and by the Pacific Bell External Technology Program.     

突发性业务环境下周期性信元流通过ATM复接器的时延抖动

在输入ATM网络的业务源中,周期性信元流是很重要的一种.本文精确地分析了一个有限缓存的ATM复接器,其输入业务源由一路周期性信元流、多路随机性贝努利(Bernoulli)信元流和突发性两状态马尔科夫调制贝努利(MMBP)信元流构成.得出了该路周期性信元流的排队时延分布、时延抖动的自相关函数和功率谱.揭示了突发性业务环境下周期性信元流通过ATM复接器的时延抖动行为.计算机模拟验证了分析结果的正确性.     

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.     

Performance Analysis of an ATM Multiplexer with Multiple QoS VBR Traffic

In this paper, we propose a new queuing model, MMDP/MMDP/1/K, for an asynchronous transfer mode (ATM) multiplexer with multiple quality of service (QoS) variable bit rate (VBR) traffic in broad band-integrated services digital network (B-ISDN). We use the Markov Modulated Deterministic Process (MMDP) to approximate the actual arrival process and another MMDP for service process. Using queuing analysis, we derive a formula for the cell loss probability of the ATM multiplexer in terms of the limiting probabilities of a Markov chain. The cell loss probability can be used for connection admission control in ATM multiplexer and the calculation of equivalent bandwidth for arrival traffic. The major advantages of this approach are simplicity in analysis, accuracy of analysis by comparison of simulation, and numerical stability.     

A buffer allocation scheme for ATM networks: complete sharing basedon virtual partition

Buffer allocation to provide an efficient and fair use of the available buffer spaces is critically important for ATM networks. A complete sharing with virtual partition (CSVP) strategy for buffer management at a multiplexer or an output port of an output buffered switch is proposed and analyzed. The total buffer space is partitioned based on the relative traffic loads (measured or estimated). Virtual partition allows a newly arriving cell belonging to an oversubscribed type to occupy the spare space of an undersubscribed type, and to be overwritten when necessary. Using a fluid flow approach, a set of partial differential equations with a triangular stability region is established to characterize the dynamics of a system supporting two traffic flows. Under a buffer full condition, the system behavior is described by a set of non-homogeneous ordinary differential equations. The cell loss probability for each traffic type is obtained by solving the ordinary differential equations. Numerical examples indicate that by appropriately selecting the partitions, the CSVP method may be used to provide differential cell loss rate requirements by the different traffic types     

Traffic equivalence and substitution in a multiplexer withapplications to dynamic available capacity estimation

For a multiplexer fed by a large number of sources, we derive conditions under which a given subset of the sources can be substituted for a single source while preserving the buffer overflow probability and the dominant timescales of buffer overflows. This notion of traffic equivalence is stronger than simple effective bandwidth equality and depends on the multiplexing context. We propose several applications of the above traffic substitution conditions. First, we show that fractional Brownian motion as a single source substitute can effectively model a large number of multiplexed sources using information obtained purely from traffic traces; this has direct application to simple but accurate traffic generation. Second, we focus on dynamic (i.e., on-line) estimation of available capacity and buffer overflow probability. This requires the solution of a double optimization problem expressed in terms of functions whose values are obtained from time averages of the traffic traces over a large range of timescales. We show how to solve this problem on-line by reducing it to the calculation of a fixed-point equation that can be solved iteratively by combining traffic substitution using fractional Brownian motion with dynamic measurements of the actual traffic. We have validated this approach by extensive experimentation with large numbers of real traffic sources that are fed to a high bandwidth link, and comparing our on-line estimation of available capacity and the resulting dynamic call admission control with other existing approaches. The superior accuracy of our approach also suggests that taking the buffer size into account, as does our on-line algorithm, may be vital for achieving approximations of practical interest