ATM网络中漏桶涌量控制特性的研究

本文对ＡＴＭ（异步转移模式）网络中话音、数据和图像业务的漏桶流量控制特性进行了研究。计算机模拟结果表明，由于各种业务内在的相关性不同，相应的漏桶流量控制特性有较大的差异，漏桶参数的选择对于各种业务具有不同的公平性，因而应根据业务的特性来设计漏桶参数。     

ATM网络中优先级业务漏桶算法的研究

本文对优先级业务的漏桶算法进行了分析，得出了各种优先级业务的漏桶性能与输入业务统计特性和漏桶参数之间的关系。文中引入了低优先级业务的固定服务速率调节因子ｎ，并研究了它对高优先级业务和低优先级业务性能的影响。     

GPRS网络中综合业务漏桶算法的研究

GPRS是新一代传输综合业务的网络.本文提出了适用于GPRS网络的一种综合业务漏桶算法.通过对这种算法的分析,得出了实时业务和非实时业务的漏捅性能与输入业务统计参数及漏捅参数之间的关系.并用数值计算结果表明选用合适的漏桶参数可以对GPRS网络进行有效的流量控制.     

ATM网络中优先级业务漏桶算法的研究

本文对优先级业务的漏桶算法进行了分析,得出了各种优先级业务的漏桶性能与输入业务统计特性和漏桶参数之间的关系。文中引入低优先级业务的固定服务速率调节因子,并研究了它对高优先级业务和低优先级业务性能的影响。     

ATM网络中突发业务的漏桶算法分析

统计复用可以使突发业务获得较高的频带利用率，但必须对输入的业务量进行恰当的控制，否则会造成严重的网络拥塞，漏桶法是ＡＴＭ网络基于速率调节进行业务量控制的一种重要的方法，本文对突发业务的漏桶算法进行了分析，得出了突发业务的漏桶性能与输入业务统计参数和漏桶参数之间关系的解析式，计算机模拟结果表明它与理论分析的一致性。     

ATM业务监控的最差通过流分析及二级漏桶算法

讨论了一定算法下最差通过流的概念，强调了最差通过流的参数特性是评价一种业务监控算法的重要指标之一。对基本漏桶和缓冲漏桶逄法进行了比较。     

模糊逻辑在ATM网络实时流量控制中的应用

提出了一种模糊逻辑控制系统，能实时处理ＡＴＭ网络中的流量问题。中使用峰值速率和突发时间长度来描述业务源特性，并据此动态地调节令牌速率。与传统的漏桶算法相比，该系统能透明传输符合流量协议的业务源，并能对业务源的违约行为迅速而有效地作出反应。     

ATM突发性业务阻塞控制

在ＡＴＭ网里业务阻塞控制是一个十分重要的问题，本文对一种缓冲漏桶业务阻塞控制算法在突发性业务输入情况下的性能进行了计算机模拟分析，模拟结构表明缓冲漏桶算法是一种适合于突发性业务的阻塞控制算法，文章在模拟结果的基础上给出了缓冲漏桶算法中参量选择的算法。     

帧中继网络的一种拥塞控制机制

本文介绍一帧中继网络的拥塞控制机制－输入速率控制机制。它采用漏桶算法调节从源节点到网络节点的数据流量。本文着重介绍了该输入速度控制机制的实现并作了性能分析。依据帧中继子网的拓扩结构，进行理论分析和计算机模拟，给出了不同参数下的各项性能曲线。     

具有漏桶控制的ATM复接器性能分析

提出了用间断贝努利过程可近似描述突发源经漏桶后的输出过程。分析了综合业务环境下，具有漏桶控制的ＡＴＭ复接器的性能。计算机模拟验证了分析的正确性。     

Fuzzy Congestion Control and Policing in ATM Networks

1IntroductionASynchronousTransferMode(ATM)isthesuitabletransfermodefortransmissioninnewhighspeediniCgratedservicenetWorks.Itpossessestheflexibilityneededtosupportserviceswithdifferentrates,qualitiesofservices(QoS)andcharacteristics.TheStatisticalmult...     

On the capability of the policing function to release an ATM connection

The capability of releasing a connection has been recognized within standardization bodies as a desirable feature for the policing function in ATM networks. In this paper, we investigate how to implement this new scheme. For this purpose, we introduce a simple modification to some well known policing mechanisms, namely the Leaky Bucket, the EWMA, the Jumping and Moving Window. We first draw attention to the fact that all of them suffer from the drawback that they discard useful information which could be used to enforce tighter policing and to shut a connection off when too much excess traffic is submitted to the connection. We then propose a modification to the above mentioned schemes in which the discarded cell information is used, with almost no overhead compared to the usual ones. In the context of the Leaky Bucket, analysis using Bernoulli and On/Off MMBP input processes shows that the modified version has a behavior which differs significantly from its original counterpart. A major difference is that the new mechanism stops serving sources requiring much more resources than negotiated. It also reacts more severely to abuses of smaller magnitude and polices the sources closer to their declared resource utilization. A method is then presented to select the appropriate parameters of the modified Leaky Bucket in order to achieve a faster response time.     

一种智能监管方法性能的研究

本文提出了改进的模糊漏桶,用于对ＡＴＭ网络业务进行监管,对ＯＮ／ＯＦＦ业务及ＶＢＲ（ＶａｒａｂｌｅＢｉｔＲａｔｅ）视频ＡＲ（一阶ＡｕｔｏＲｅｇｒｅｓｓｉｖｅ模型）业务的仿真结果表明改进模糊漏桶对业务的监管能力要好于漏桶,即监管违约业务响应快,幅度大,并且合法业务对改进模糊漏桶的计资源要求少。     

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.     

Evaluating scheduling in integrated‐services networks using a semi‐fluid‐flow model

An integratedservices network carries diverse traffic, which leads to diverse performance objectives. For example, voice and video packets typically have performance objectives based on the fraction of packets that will be delivered within a given delay bound, while data packets often have objectives based on mean delay. Greater loads can be supported in networks in which a voice or video packet is given priority over data packets if and only if the former is in danger of missing its deadline. Algorithms that allow this include CostBased Scheduling, occupancybased algorithms, the Priority Token Bank, and to a lesser extent, the Leaky Bucket. This paper presents an approach to evaluating performance with these algorithms in the realistic case where data arrivals are highly bursty, but voice and video packets are not. Mean queueing delay for data bursts is determined analytically in some important scenarios, and an efficient simulation approach based on the same model is described for cases where analysis is not currently possible. The model is a semifluidflow model in which voice or video packets are assumed to arrive as a continuous fluid flow, whereas data packets arrive in large bursts at discrete instants in time.     

ANALYSIS OF THE LEAKY BUCKET ALGORITHM FOR PRIORITY SERVICES

The leaky bucket algorithm with loss priorities is studied in this paper. The analytical expression of the relation among leaky bucket performance, statistical parameters of input traffic and leaky bucket, parameters for various priority services is obtained, and the effect of adjustment factor on leaky bucket performance of higher-priority service and lower-priority service is studied with two priority classes.     

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

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

Multi-wavelength switching in IP optical nodes adopting different buffering strategies

The paper addresses the topic of long-haul optical networking for the provision of large-bandwidth IP services. A class of optical packet switching architectures is considered which adopts an arrayed wavelength grating device as packet router. The architecture performs slotted packet switching operations and fully exploits the wavelength routing capabilities by allowing multi-wavelength switching. Fiber delay lines are used to perform optical packet buffering, which accomplishes either input queueing or shared queueing. Here a thorough performance evaluation is carried out with different buffering configurations and the effect of various switch parameters on traffic performance is studied.