Phantom
- 28 August 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 26 (4) , 169-182
- https://doi.org/10.1145/248157.248172
Abstract
This paper presents Phantom , a simple constant space algorithm for rate based flow control. As shown by our simulations, it converges fast to a fair rate allocation while generating a moderate queue length. While our approach can be easily implemented in ATM switches for managing ABR traffic, it is also suitable for flow control in TCP router based networks. Both the introduced overhead and the required modifications in TCP flow control systems are minimal. The implementation of this approach in TCP guarantees fairness and provides a unifying interconnection between TCP routers and ATM networks. The new algorithm easily inter-operates with current TCP flow control mechanisms and thus can be gradually introduced into installed based TCP networks.Keywords
This publication has 13 references indexed in Scilit:
- Congestion control and traffic management in ATM networks: Recent advances and a surveyComputer Networks and ISDN Systems, 1996
- TCP Vegas: end to end congestion avoidance on a global InternetIEEE Journal on Selected Areas in Communications, 1995
- TCP and explicit congestion notificationACM SIGCOMM Computer Communication Review, 1994
- Dynamics of TCP traffic over ATM networksPublished by Association for Computing Machinery (ACM) ,1994
- Random early detection gateways for congestion avoidanceIEEE/ACM Transactions on Networking, 1993
- A control-theoretic approach to flow controlPublished by Association for Computing Machinery (ACM) ,1991
- A binary feedback scheme for congestion avoidance in computer networksACM Transactions on Computer Systems, 1990
- Congestion avoidance and controlPublished by Association for Computing Machinery (ACM) ,1988
- Dynamic control of session input rates in communication networksIEEE Transactions on Automatic Control, 1984
- Bottleneck Flow ControlIEEE Transactions on Communications, 1981