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.>

The cell multiplexing characteristics of an asynchronous transfer mode (ATM) network should be evaluated on the so-called worst-case traffic as characterized by the usage parameter control algorithm. A bandwidth allocation method suitable for any periodic cell traffic is proposed. Numerical assessment shows that the proposed method can achieve relatively high link utilization. Using the proposed method, the performances of traffic management schemes adopting the sliding window or leaky bucket algorithms are compared. The result is that traffic control using the sliding window algorithm ensures efficient network resource utilization. Traffic control using the leaky bucket fails to identify the worst-case traffic permitted by the leaky bucket algorithm.

A path and link capacity design method for asynchronous transfer mode (ATM) networks using statistical multiplexing of cells is proposed. By developing the design method, the statistical cell multiplexing effect can be exploited to significantly reduce required network resources. The necessary design procedures are identified. A simple and effective policing mechanism is proposed. An analytical method for the evaluation of cell multiplexing characteristics using declared parameters is provided. Path and link capacity design algorithms that use these techniques are proposed. The effectiveness of the proposed design procedure is confirmed by comparing analytical results to those from a computer simulation.>

An exploration is made of some techniques which will play important roles in the development of the future universal transport network. In the network, the information can be efficiently integrated and transported by making the most of the burstiness of the information flows and of the store-and-forward process at the transport nodes. First, a coding and multiplexing scheme for audio signals matched to the above transportation mode is proposed. The effectiveness of the scheme is demonstrated through computer simulation and the extent of the deviations are provided for some sets of parameters. The analysis provides useful tools to perform sensitivity analysis of network delay performance.>