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

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

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

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

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

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

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

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

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

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

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

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

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

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

ATM突发性业务阻塞控制

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

基于统计网络演算的双漏桶模型带宽需求研究北大核心

为满足双漏桶模型的业务流量需求,提出一种基于统计网络演算理论的带宽需求研究方案。该方案利用统计网络演算在分析业务时延性能方面的优势,由时延与带宽的关系建立出双漏桶模型业务流带宽需求的统计模型,对业务带宽需求进行了研究分析。数值分析结果表明了该方案的有效性和优越性,对网络合理分配带宽资源有一定的参考意义。     

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

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

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     

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.     

End-station performance under leaky bucket traffic shaping

The shaping of traffic at its source is a prominent congestion control solution in ATM networks. The “leaky bucket” with a “cell spacer” is a very popular traffic-shaping approach. By sizing the leaky bucket and spacer parameters, an end station shapes its traffic to conform to a “good behaviour” contract with the network. The leaky bucket delays the transmission of a selected number of cells, while the spacer forces a minimum time distance between transmitted cells. When a contracted transmission rate is close to the traffic generation rate of the end station, this traffic stream will utilize most of the bandwidth available on its virtual connection. The high utilization of such a connection leads to large queues of frames and cells at the end station, with high adverse consequences for end-to-end delay and jitter. Based on the negotiated traffic parameters and source traffic characteristics, we study, through simulations, the contribution of the leaky bucket plus cell spacer subsystem to the delay and jitter in an end station. We also study the distribution of the size of the bursts of cells leaving the end station and entering the network. Finally, we derive the theoretical upper bound for the size of bursts of the cells     

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.     

ATM网络中的变比特速率视频图像业务模型

选择合适的业务源模型是成功设计和建设未来高效ＡＴＭ网络的一个非常重要的因素。因此至今，已提出了大量的业务源模型。本文就目前提出的变比特速率视频图像（ＶＢＲＶｉｄｅｏ）业务的主要经典模型，作一分析评价，并给出业务模型较详细的参数和选择准则。最后，给出采用一业务模型检测了我们设计的模糊联合存储漏桶模型在网络系统中业务带宽监管性能