Premium
A simple, scalable and provably stable explicit rate computation scheme for flow control in communication networks
Author(s) -
Aweya James,
Ouellette Michel,
Montuno Delfin Y.
Publication year - 2001
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.496
Subject(s) - computer science , scalability , computation , controller (irrigation) , simple (philosophy) , flow control (data) , process (computing) , scheme (mathematics) , control (management) , algorithm , control theory (sociology) , computer network , mathematics , mathematical analysis , philosophy , epistemology , database , agronomy , biology , operating system , artificial intelligence
This paper describes fast rate computation (FASTRAC), an explicit rate flow control algorithm for available bit rate (ABR) traffic. Using digital control theory, we develop a simple rate controller for the ABR flow control process. We prove that the controller is stable, fair to all participating sources and configurable with respect to responsiveness. The analysis presented shows that stability of the flow control process depends primarily on two factors, the control update rate and the feedback delay. The implementation of the proposed algorithm is much simpler than other fair rate allocation algorithms. The proposed algorithm demonstrates the ability to scale with speed, distance, different feedback delays, number of users, and number of nodes while remaining robust, efficient, and fair under stressing and dynamic traffic conditions. Copyright © 2001 John Wiley & Sons, Ltd.