Phantom: a simple and effective flow control scheme

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.

[1]  J. Meigs,et al.  WHO Technical Report , 1954, The Yale Journal of Biology and Medicine.

[2]  Howard Paul Hayden,et al.  Voice flow control in integrated packet networks , 1981 .

[3]  Eli Gafni,et al.  Dynamic Control of Session Input Rates in Communication Networks , 1982, MILCOM 1982 - IEEE Military Communications Conference - Progress in Spread Spectrum Communications.

[4]  Eliezer M. Gafni,et al.  The integration of routing and flow-control for voice and data in a computer communication network , 1982 .

[5]  Jeannine Mosely,et al.  Asynchronous distributed flow control algorithms , 1984 .

[6]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[7]  Robert T. Braden,et al.  Requirements for Internet gateways , 1987, RFC.

[8]  V. Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[9]  Lixia Zhang,et al.  A new architecture for packet switching network protocols , 1989 .

[10]  K. K. Ramakrishnan,et al.  A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer , 1988, SIGCOMM '88.

[11]  K. K. Ramakrishnan,et al.  Gateway Congestion Control Survey , 1991, RFC.

[12]  QUTdN QeO,et al.  Random Early Detection Gateways for Congestion Avoidance , 1993 .

[13]  Raj Jain,et al.  The osu scheme for congestion avoidance using explicit rate indication , 1994 .

[14]  A. Charny,et al.  An Algorithm for Rate Allocation in a Packet-Switching Network With Feedback , 1994 .

[15]  L. Wojnaroski,et al.  Baseline text for traffic management sub-working group , 1994 .

[16]  NetworksAllyn Romanow,et al.  Dynamics of Tcp Traac over Atm Networks , 1994 .

[17]  Rate based schemes: mistakes to avoid , 1994 .

[18]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[19]  Raj Jain,et al.  Congestion control with explicit rate indication , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[20]  K. K. Ramakrishnan,et al.  An efficient rate allocation algorithm for ATM networks providing max-min fairness , 1995, HPN.

[21]  Raj Jain,et al.  Erica+: extensions to the erica switch algorithm , 1995 .

[22]  Raj Jain,et al.  A Sample Switch Algorithm , 1995 .

[23]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[24]  Danny H. K. Tsang,et al.  A new rate-based switch algorithm for ABR traffic to achieve max-min fairness with analytical approximation and delay adjustment , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[25]  K. K. Ramakrishnan,et al.  Scalability issues for distributed explicit rate allocation in ATM networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[26]  E. L. Hahne,et al.  Dynamic queue length thresholds in a shared memory ATM switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[27]  Raj Jain.  Congestion Control and Traffic Management in ATM Networks: Recent Advances and a Survey , 1996, Comput. Networks ISDN Syst..

[28]  Raj Jain,et al.  The OSU Scheme for Congestion Avoidance in ATM Networks: Lessons Learnt and Extensions , 1997, Perform. Evaluation.