ATM网络中漏桶算法在突发业务输入时的性能分析

本文首先引入了描述分组图像业务的突发业务模型，分析了漏桶算法在突发业务输入时的性能；研究了各参数对业务服务质量的影响，研究结果表明，增大缓冲器容量可以降低信元丢失率，但会增大时延和时延抖动。     

无线Ad hoc网络动态TDMA信道接入协议的研究

文章提出了一种新的基于动态时分多址接入(TDMA)方案适用于无线Ad hoc网络信道接入控制协议,分别为突发业务,实时业务和非实时业务提供相应顺序接入信道的优先级,并且在传输的过程中避免碰撞和保证突发业务有限的时延。最后通过仿真比较了动态TDMA、CSMA及MACA三种信道接入协议的性能。     

基于IP突发信源模型数据包的定量计算研究

本文以IP突发信源on/off模型的单IP业务源的数据包生成特性分析为基础,以队列缓冲配置和IP数据包丢失率、排队时延的计算为主要研究对象,通过对多业务源排队系统的IP数据包排队时延进行深入的综合分析,得出了一些新的QoS定量计算解析式,这些解析式可用于计算IP交换路由器QoS参数.     

基于IP突发信源模型数据包的定量计算研究

本文以IP突发信源on／off模型的单IP业务源的数据包生成特性分析为基础，以队列缓冲配置和IP数据包丢失率、排队时延的计算为主要研究对象，通过对多业务源排队系统的IP数据包排队时延进行深入的综合分析，得出了一些新的QoS定量计算解析式，这些解析式可用于计算IP交换路由器QoS参数．     

移动Ad Hoc网络中一种分布式QoS保证的多址接入协议

基于随机竞争和冲突解决的思想,本文为多跳移动Ad Hoc网络提出了一种分布式服务质量(QoS)保证的多址接入(QMA)协议.该协议中,节点在发送业务分组前利用预报突发进行竞争接入,节点根据业务分组时延情况和最早失效优先原则确定预报突发的长度,所发预报突发能持续到最后的节点优先获得接入.同时,具有实时业务的节点可以按照其优先级在更早的竞争微时隙中开始发送预报突发,而有非实时业务的节点只能在前面竞争微时隙空闲的情况下,才能在后面的微时隙开始发送预报突发,因此发送实时业务的节点可以比发送非实时业务的节点更优先接入信道,从而在移动Ad Hoc网络中实现了对多媒体业务的QoS保证.最后利用OPNET仿真评估了QMA协议的多址性能,并与IEEE 802.11e协议的性能做了比较,结果表明QMA协议可以提供较高的吞吐量和较低的实时业务时延.     

OBS网络中支持实时业务的管道机制

在分析光突发交换网络时延的基础上,提出了一种有效支持实时业务的管道机制.在边缘节点与核心节点之间建立通信管道.实时业务的突发控制包通过管道的核心节点时,不需要被处理,其处理时间为零,因而减少了偏置时间和网络时延.同时也降低了核心节点处理突发控制包的次数,降低了核心节点的实现复杂度.仿真结果表明,管道机制能有效降低实时业务的端对端时延.     

温敏网络的关键能力和架构体系

温敏网络给网络安装了高精度的智能传感器,以快速感知网络的质量,挖掘网络的最大能量,能满足业务SLA保障、网络更高可靠和最大通量。温敏网络提出的nTouch、xRecognition和iX关键技术能力,能够很好地应对低时延、高带宽、易流量微突发的未来网络,可作为复杂多变网络的基础能力。     

无源光接入网对多业务接入的支持

文章介绍基子ATM的无源光接入网APON和SuperPON的多业务接入能力,并提出采用区分服务等级,把光线路终端中的许可调度逻辑与光网络单元中的缓存管理机制和信元调度算法结合起来,可提高突发业务的吞吐率,有效公平地分配带宽;重点介绍APON对GFR业务的支持,分析SuperPON的时延特性,提出采用捎带MAC信道,以缩短时延敏感业务的端到端时延。     

基于门控制的星载时间敏感网络调度算法

空间信息网络中时间敏感业务的实时性、确定性和可靠性要求对基于存储转发方式的传统以太网交换提出巨大挑战。提出一种基于门控制的星载时间敏感网络调度算法,设计星载时间敏感网络交换方案;针对卫星业务突发的特点,提出一种基于时分复用的门控制列表生成方法,对该调度算法在不同业务流量特征背景下的确定性时延及时延抖动性能进行仿真分析。仿真结果表明,所提算法的最小时延减小至10 μs量级,最小时延抖动为0,满足空间时间时敏业务的确定性传输要求,提高了空间信息网络业务传输的确定性、可靠性、灵活性。     

突发业务环境下CBR业务性能的实验分析

CBR业务是一类极为重要的实时业务,能否有效地传递这类业务关系到从现有网络向ATM的过渡,因此CBR业务的服务质量是一个值得研究的重要课题。本文利用计算机仿真的方法,全面地分析了突发业务环境下,影响CBR业务服务质量的各种因素,指出复接器占有率、缓冲区容量、背景强度、背景流的自相关特征对CBR业务的时延及时延抖动有很大的影响,尤其是背景流具有长时相关性时,CBR业务的服务质量将严重恶化,必须设法加以控制。     

PERFORMANCE ANALYSIS OF LEAKY BUCKET ALGORITHM WITH BURSTY TRAFFIC INPUT IN ATM NETWORKS

A bursty traffic model is introduced in this paper to describe the statistical characteristics of packet video. The performance of leady bucket algorithm with bursty traffic input is analyzed. The influences of various parameters on QOS (Quality of Service) are investigated. The analysis shows that although the loss probability decreases through expanding the buffer capacity, the delay and delay jitter increase, whose effect on QOS will not be negligible.     

信道成组ATM交换系统中混合业务的性能分析

本文分析了信道成组ＡＴＭ交换系统中混合业务的性能。混合业务包括突发业务和随机业务，为了满足两类业务不同的服务质量要求，本文将部分缓冲共享方案略作修改。用一个二维Ｍａｒｋｏｖ链来描述交换系统的状态，用Ｇａｕｓｓ－Ｓｉｅｄｅｌ迭代法求解系统稳态方程。研究了业务平均突发长度、缓冲门限、业务量及信道成组技术对系统性能的影响。模拟结果与理论分析吻合。     

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.     

A call admission control scheme for ATM networks using a simplequality estimate

The authors propose a call admission control scheme based on a method of estimating cell loss quality for individual bursty traffic sources. The estimate is expressed in terms of virtual cell loss probability, which may be defined by two traffic characteristic parameters alone: peak and mean rate. The approach is suitable for the estimation of real cell loss probability in heterogeneous and homogeneous traffic models when burst length is larger than buffer capacity. The concept of virtual cell loss probability is extended to the individual call level so as to be able to estimate the quality of service (QOS) provided to individual calls. A virtual bandwidth method is used to develop a practical call admission control system. Quality is ensured by combining a traffic clustering scheme, with a scheme for assigning individual clusters to subcapacities of a link. Priority levels are presented in terms of the class of QOS required, i.e., deterministic or statistical, and the allocation of virtual bandwidth is discussed in terms of both QOS class and traffic characteristics     

An analytical approach to the performance evaluation of the balanced gamma switch under multicast traffic

This paper presents the performance evaluation of a new cell‐based multicast switch for broadband communications. Using distributed control and a modular design, the balanced gamma (BG) switch features high performance for unicast, multicast and combined traffic under both random and bursty conditions. Although it has buffers on input and output ports, the multicast BG switch follows predominantly an output‐buffered architecture. The performance is evaluated under uniform and non‐uniform traffic conditions in terms of cell loss ratio and cell delay. An analytical model is presented to analyse the performance of the multicast BG switch under multicast random traffic and used to verify simulation results. The delay performance under multicast bursty traffic is compared with those from an ideal pure output‐buffered multicast switch to demonstrate how close its performance is to that of the ideal but impractical switch. Performance comparisons with other published switches are also studied through simulation for non‐uniform and bursty traffic. It is shown that the multicast BG switch achieves a performance close to that of the ideal switch while keeping hardware complexity reasonable. Copyright © 2006 John Wiley & Sons, Ltd.     

Multimedia traffic characteristics in broadband networks

It is pertinent to develop a set of simple parameters that can best characterize the variability and the statistical correlations of the packet arrival process. These parameters are then used by the network to allocate its resources among the different users in order to avoid congestion and maintain a predefined quality of service (QOS) for each user. The traffic characterization and modeling of the real-time bursty traffic, mainly voice and video traffic sources, using statistical methods are described. It is shown that the variability of the variance of the sum of consecutive packet interarrival times leads to significant queuing delays and therefore is a major cause of congestion in broadband networks     

Delay performance of some scheduling strategies in an input queuingATM switch with multiclass bursty traffic

Considers an N×N nonblocking, space division, input queuing ATM cell switch, and a class of Markovian models for cell arrivals on each of its inputs. The traffic at each input comprises geometrically distributed bursts of cells, each burst destined for a particular output. The inputs differ in the burstiness of the offered traffic, with burstiness being characterized in terms of the average burst length. We analyze burst delays where some inputs receive traffic with low burstiness and others receive traffic with higher burstiness. Three policies for head-of-the-line contention resolution are studied: two static priority policies [shorter-expected-burst-length-first (SEBF), longer-expected-burst-length-first (LEBF)] and random selection (RS). Direct queuing analysis is used to obtain approximations for asymptotic high and low priority mean burst delays with the priority policies. Simulation is used for obtaining mean burst delays for finite N and for the random selection policy. As the traffic burstiness increases, the asymptotic analysis can serve as a good approximation only for large switch sizes. Qualitative performance comparisons based on the asymptotic analysis are, however, found to continue to hold for finite switch sizes. It is found that the SEBF policy yields the best delay performance over a wide range of loads, while RS lies in between. SEBF drastically reduces the delay of the less bursty traffic while only slightly increasing the delay of the more bursty traffic. LEBF causes severe degradation in the delay of less bursty traffic, while only marginally improving the delays of the more bursty traffic. RS can be an adequate compromise if there is no prior knowledge of input traffic burstiness     

具有业务量平滑功能的ATM交换机的性能分析

ATM网络支持大量的突发业务源。突发业务量可用间断Bernoulli过程描述。本文采用一种循环算法,分析了ATM交换机在既有连续比特流业务量又行突发业务量环境下的信元丢失率和平均延迟。数值分析结果和计算机仿真结果一致表明,具有业务量平滑功能的ATM交换机的性能有较大改进。