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

Authors:
Siavash Khorsandi;Alberto Leon-Garcia
Affiliations:
Department of Electrical Engineering, University of Toronto, Toronto, Ont., Canada;Department of Electrical Engineering, University of Toronto, Toronto, Ont., Canada
Venue:
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Year:
1996

Citing 7
Cited 2

Cooperative distributed scheduling for ATS-based broadband networks

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
A hop by hop rate-based congestion control scheme

SIGCOMM '92 Conference proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Reliable and efficient hop-by-hop flow control

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Credit-based flow control for ATM networks: credit update protocol, adaptive credit allocation and statistical multiplexing

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Design and analysis of a credit-based controller for congestion control in B-ISDN/ATM networks

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
A calculus for network delay. II. Network analysis

IEEE Transactions on Information Theory

Fault tolerance overhead in network-on-chip flow control schemes

SBCCI '05 Proceedings of the 18th annual symposium on Integrated circuits and system design
Analysis of manufacturing blocking systems with network calculus

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Credit-based flow control is a promising method to use in ATM networks. In this paper, 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.