Time scale analysis of explicit rate allocation in ATM networks

Rate based congestion management for computer communication networks has been the focus of considerable research. We examine some of the fundamental properties of such end-to-end rate based algorithms. The first is the requirement for a policy to ensure the feasibility of the transmission rates by the sources. The feasibility implies that the capacity of any of the resources is not exceeded at any time. We show that a source policy which defers increases in the explicit rate for a period of time, while allowing decreases to take effect immediately maintains the requirement of feasibility. We also examine the convergence properties of the end-to-end rate based schemes in general, and give an upper bound on the convergence time of the scheme presented.

[1]  Raj Jain,et al.  A Sample Switch Algorithm , 1995 .

[2]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

[3]  K. K. Ramakrishnan,et al.  Time scale analysis scalability issues for explicit rate allocation in ATM networks , 1996, TNET.

[4]  K. K. Ramakrishnan,et al.  An efficient rate allocation algorithm for ATM networks providing max-min fairness , 1995, HPN.

[5]  H. T. Kung,et al.  Credit-Based Flow Control for ATM Networks , 1994, SIGCOMM 1994.

[6]  Srinivasan Keshav.  A control-theoretic approach to flow control , 1991, SIGCOMM 1991.

[7]  Raj Jain,et al.  Congestion Avoidance in Computer Networks with a Connectionless Network Layer, Part I: Concepts, Goals and Methodology , 1988, ArXiv.

[8]  Jeannine Mosely,et al.  Asynchronous distributed flow control algorithms , 1984 .

[9]  F. Bonomi,et al.  The rate-based flow control framework for the available bit rate ATM service , 1995, IEEE Netw..

[10]  Trevor Blackwell,et al.  Credit-based flow control for ATM networks: credit update protocol, adaptive credit allocation and statistical multiplexing , 1994, SIGCOMM 1994.

[11]  Partho Pratim Mishra,et al.  A hop by hop rate-based congestion control scheme , 1992, SIGCOMM 1992.

[12]  E. L. Hahne,et al.  Round robin scheduling for fair flow control in data communication networks , 1986, ICC.

[13]  K. K. Ramakrishnan,et al.  Scalability issues for distributed explicit rate allocation in ATM networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[14]  Raj Jain,et al.  Congestion Avoidance in Computer NetwQrks Connectionless Network Layer: Concepts, Goals and , 1988 .

[15]  Raj Jain,et al.  Congestion control with explicit rate indication , 1995, Proceedings IEEE International Conference on Communications ICC '95.