ATM业务监控的一种模糊逻辑判决算法

本文描述了一种用于ＡＴＭ业务监控的模糊逻辑算法，在本算法中信元的合法性通过提取进入网络的信元流的平均参数和突发性参数，并根据一组模糊规则决定，利用计算机仿真对本算法进行了研究，结果表明本算法对业务流平均到达率的响应和对突发性的响应都优于漏桶算法。     

ATM突发性业务阻塞控制

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

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

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

ATM网中可变比特率小波视频编码和码率控制

本文提出了小波视频编码系统及其码率控制的新方法。对原始图像序列进行时间、水平和垂直三维小波分解,并采用改进的等级树集合分区的算法对小波系数进行量化。在图像组级上对该编码器进行码率控制,使其输出码流遵循漏桶控制器的参数,并对不同大小的漏桶缓冲器进行了讨论。仿真实验证明了该编码系统及其码率控制方法的有效性。     

ATM网络双速漏桶监管算法

本文提出一种ＡＴＭ网络监管新算法———双速漏桶算法。对它的性能进行理论分析和计算机模拟，并探讨其硬件实现的可能性和复杂性。结果表明：在硬件复杂性基本不增加情况下，双速漏桶监管法比单速漏桶算法在监管选择性、信元丢失率及信元等待时间等性能方面有较大改善。     

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

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

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

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

Parlay网关中过载控制算法的研究

针对Parlay网关过载控制的需求,提出了一种基于优先级和漏桶算法的Parlay过载控制算法.该算法一方面解决了优先级算法的"饿死"现象;一方面也解决了漏桶算法的网络资源的浪费的问题.仿真试验表明:该算法能有效地解决Parlay网关中过载的问题,且易于实现.     

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

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

一种基于两级许可的过载控制改进算法

文中对智能网过载控制的三种典型算法进行了分析,根据仿真结果及其特点,总结了各算法的优点。针对适用于移动智能网的基于两级许可证的漏桶算法,提出了一种改进措施,并建立了系统模型。仿真结果表明,该算法在数据丢失率、平均呼叫等待时间等方面均要优于两级许可的单速率漏桶算法。     

Buffered and Unbuffered Leaky Bucket Policing: Guaranteeing QoS,Design and Admission Control

Traffic shaping and smoothing using buffers or leaky buckets does not necessarily improve Quality of Service (QoS). In fact there is a trade-off between controlling user traffic and guaranteeing QoS to the users. We consider the first two stages (source node and border node before entering a network cloud) of an end-to-end QoS problem and assume that the QoS requirements across each of the two stages are given. We formulate and solve a mathematical programming problem to select optimal leaky bucket parameters that would enable high-speed telecommunication network providers to optimize traffic policing subject to guaranteeing a negotiated Quality of Service requirement across the first stage namely the source end. We address both the buffered and unbuffered leaky bucket cases where using fluid models we characterize the output process from the leaky buckets for general traffic sources. Using the optimal leaky bucket parameters and output characteristics (effective bandwidths in particular), we solve design and connection admission control problems given QoS requirements at the second stage, namely the border node.     

Analysis of leaky bucket mechanism based on burstiness characterization

In high-speed networks, a congestion control strategy has to manage bandwidth allocation based on the characteristics of input traffic sources. Accordingly, the definition of traffic characterization becomes significant in all aspects concerning network performance. In this paper, the burstiness characterization of a traffic stream is based on a virtual queue principle. We study the leaky bucket mechanism as a regulator element that controls input traffic before access to a newwork, as well as inside a network. To protect an input traffic stream, we investigate the optimal parameter settings of a leaky bucket. In addition, we analyse the worst case performance, and obtain upper bounds on loss probability and packet delay. We also determine the characteristics of an output stream in the worst case. Such performance bounds reveal the effectiveness of a leaky bucket, and provide enough information for the QOS satisfaction of the network users.     

Performance limitation of the leaky bucket algorithm for ATMnetworks

The performance limitation of the “leaky bucket algorithm” is analyzed for usage parameter control and traffic management in asynchronous transfer mode (ATM) networks. Simulation results show that the conventional statistical bandwidth allocation method, which uses “the worst pattern derived from the cell interarrival time moments” permitted by the leaky bucket algorithm, can not guarantee the quality of service (QOS). As a result, this paper proves that the VC/VP bandwidth allocation method based on the leaky bucket algorithm is unsatisfactory     

Bursty ATM user traffic allowed by a jitter tolerant leaky bucket and its impact on link utilization

In a network based on the asynchronous transfer mode (ATM), quality of service requirements have to be met even in the presence of users who send traffic as bursty as the policing device allows. For peak cell rate policing with a jitter tolerant leaky bucket, a periodic maximally bursty traffic pattern allowed by the leaky bucket is derived. The impact of this kind of bursty user traffic on the cell loss performance of the remaining sources is investigated by introducing, solving and applying the queueing model Geo(n) + P/D/1/K, where P stands for ‘periodic’. Taking bursty user traffic into account, it is shown that the maximal jitter or cell delay variation allocated to the user and tolerated by the leaky bucket is an important parameter for link utilization. The results help to answer the question under which conditions a shaping function is needed in conjunction with the usage parameter control function.     

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

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