Analysis of a rate-based access control mechanism for high-speed networks

Abstract

The authors present an analysis of a rate-based access control mechanism for high-speed networks that is based on the buffered leaky bucket scheme. The analysis assumes a discrete time environment representative of asynchronous transfer mode (ATM) networks and a batch arrival process that captures cell arrivals generated by segmentation of large user packets or superposition of a number of arrival streams. The solution method is based on matrix analytic techniques, but the particular structure of the system allowed for a number of important improvements. It is shown that the problem can be partitioned and that the matrix G, central to the matrix analytic technique, can be computed using exact recursive procedures instead of the traditional iterative approach. These improvements not only extend the range of systems that can be handled, but also eliminate computational issues such as convergence rate and stopping criterion.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>