模糊逻辑控制方法在ATM网络拥塞控制中的应用

将普通漏桶技术和移动窗口机制相结合，提出了一种基于模糊规则的ＡＴＭ网络拥塞控制方法，并研究了它作为监管机制一些特性，对它的性能进行了计算机仿真，仿真结果表明，该机制对覆行连接接纳控制协议的信元有提供透明传输，对过份违约的信无能快速阻止其进入网络，与普通漏桶技术相比，本文方法具有同时监管信元流峰值速率和平均速率的优点。     

ATM网中具有优先级管理的漏桶监管器性能分析

本文利用推广的流体流方法分析了具有优先级管理的ＡＴＭ网漏桶监管器（ＰＬＢ）性能。这种ＰＬＢ将部分缓冲共享（ＰＢＳ）的选择丢弃优先级策略用于业务监管，对高、低优先级信元区别对待，从而保证高优先级信元的低丢失率。文中针对突发业务分析了此种监管方案的性能。理论计算及体育场实验结果表明了方案的有效性，通过性能分析可望选取合适的ＰＬＢ参数进行有效控制。     

动态缓冲区门限漏桶方案的性能分析

本文提出了缓冲区门限随着有漏桶速率变化的动态缓冲区门限漏桶方案,以马尔可夫调制泊松过程（ＭＭＰＰ）作为信源输入人流,用嵌入马尔可夫过程这系统,得到了系统状态在嵌入点和任意时刻的极限分面具人而获得信损失率、信元平均时延及占用的有效带宽性能测度,数值分析表明本方案的信元人率及平均信元时延性能较缓冲区门限漏桶方案有显著提高,而且占用更少的带宽。     

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

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

模糊漏桶在ATM网络UPC中的应用

本文提出了模糊漏桶模型，研究了它与普通漏桶在用户量参数控制（ＵＰＣ）中的作用。由于ＣＡＣ初步协议的不完全合理性，在实际应用中动态调节是必要的；仿真结果表明在降低信元丢失率、时延和时延抖动方面，及在动态利用网络资源方面，模糊漏桶算法要比普通的优越。我们还给出了合适的模糊控制规则。     

ATM网中具有优先级管理的漏桶监管器性能分析

本文利用推广的流体流方法分析了具有优先级管理的ATM网漏桶监管器(PLB)性能.这种PLB将部分缓冲共享(PBS)的选择丢弃优先级管理策略用于业务监管,对高、低优先级信元区别对待,从而保证高优先级信元的低丢失率。文中针对突发业务分析了此种监管方案的性能.理论计算及仿真实验结果表明了该方案的有效性。通过性能分析可望选取合适的PLB参数进行有效控制。     

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

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

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

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

ATM突发性业务阻塞控制

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

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

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

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

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

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

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

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.     

与多媒体信源模型弱相关的ATM复接器监管方案

本文提出一种与信源模型弱相关的复接器监管方案－－采用模糊漏桶控制方法改变令牌产生速率,对多媒体信源接入实施动态带宽分配。用ＭＭＢＰ模型及其合成讨论了该方案的可能性给出了模糊控制方案和规则,计算机仿真表明,在多个不同速率不同特性的语音、图像、数据信源接入时延该方法能很好地满足低时延低丢失的要求,提高带宽利用率,傅诉异步和编者复用特性被有效、充分地利用。     

Solving the trade-off between fairness and throughput: Token bucket and leaky bucket-based weighted fair queueing schedulers

In this article, we present two efficient weighted fair queueing (WFQ) scheduling algorithms leaned on the well-known token bucket and leaky bucket shaping/policing algorithms. The performance of the presented algorithms is compared to those of the state-of-the-art WFQ approximations such as weighted round robin (WRR) and the recently proposed bin sort fair queueing (BSFQ). Our simulation results show that the proposed algorithms provide a better fairness at a lower implementation complexity while simultaneously achieving a comparable network utilization.     

A comparative analysis of fuzzy versus conventional policingmechanisms for ATM networks

In ATM networks, usage parameter control is required in order to ensure that each source conforms to its negotiated parameters. To this purpose, several policing methods, such as leaky bucket and window mechanisms, have been introduced in literature. However, traditional methods have proved to be inefficient in coping with the conflicting requirements of ideal policing, that is, a low false alarm probability and high responsiveness. This led us to explore alternative solutions based on artificial intelligence techniques, specifically, in the field of fuzzy systems. We propose a policing mechanism based on fuzzy logic that aims at detecting violations of the parameters negotiated. The main characteristics of the proposed fuzzy policer are simplicity and the capacity to combine a high degree of responsiveness with a selectivity close to that of an ideal policer. Moreover, it can easily be implemented in hardware, thus, enhancing both cost and processing performance. The reported simulation results show that the performance of our fuzzy policer is much better than that of conventional policing mechanisms     

Lowpass traffic policing mechanism based on the leaky bucket

A traffic throttle can be modelled as a gate with one input and two outputs: pass for accepted calls, and gap for rejected calls. The gate decides whether to pass or to gap an incoming call according to its policing mechanism. The authors show that a small modification to a leaky bucket policing mechanism yields a lowpass filter. The proposed mechanism is a new type of a nonlinear filter     

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.