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 recently. Dierent variants to the end-to-end rate based algorithm have been proposed and studied. In this paper, we examine some of the fundamental properties of such end-to-end rate based algorithms. First is the requirement for a policy to ensure feasibility of transmission rates by sources. 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 eect immediately enables maintaining the requirement of feasibility. Understanding the time-scale for maintaining feasibility is useful to understand buer requirements and the tradeos involved when choosing policies that do not maintain strict feasibility. We also examine convergence properties of the end-to-end to rate based schemes in general, and give an upper bound ...

• Type: Conference
• Year: 1996
• Where: INFOCOM
• Authors: Anna Charny, K. K. Ramakrishnan
• Keywords: Communications, End-to-end Rate, INFOCOM 1996, Rate Based Algorithms, Rate Based Congestion