Robust non-probabilistic bounds for delay and throughput in credit-based flow control

Abstract

Credit-based flow control is a promising method to use in ATM networks. We analyze the properties and performance of a credit-based protocol as a function of different system parameters such as propagation delay, source peak rate and network utilization. We have found robust non-probabilistic bounds for the throughput, cell and burst delay of a flow controlled connection as a function of its round-trip delay and buffer allocation. These bounds also serve as a fairness criteria in dealing with local users with small buffers and remote users with large buffers. Extensive simulations have been used to verify our results and to study the buffer occupancy, achievable throughput and cell transfer delay under credit-based flow control.