A control-theoretic approach to flow control

This paper presents a control-theoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a round-robin-like queue service discipline in the output queues of the network's switches, and propose deterministic and stochastic models for a single conversation in a network of such switches. These models motivate the Packet-Pair rate probing technique, and a provably stable rate-based flow control scheme. A Kalman state estimator is derived from discrete-time state space analysis, but there are difficulties in using the estimator in practice. These difficulties are overcome by a novel estimation scheme based on fuzzy logic. We then present a technique to extract and use additional information from the system to develop a continuous-time system model. This is used to design a variant of the control law that is also provably stable, and, in addition, takes control action as rapidly as possible. Finally, practical issues such as correcting parameter drift and coordination with window flow control are described.

[1]  Graham C. Goodwin,et al.  Adaptive filtering prediction and control , 1984 .

[2]  Janusz Filipiak,et al.  Modelling and control of dynamic flows in communication networks , 1988, Communications and control engineering series.

[3]  Ashok K. Agrawala,et al.  Deterministic analysis of flow and congestion control policies in virtual circuits , 1990 .

[4]  K. Bharath-Kumar,et al.  A new approach to performance-oriented flow control , 1981, IEEE Trans. Commun..

[5]  Scott Shenker,et al.  Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM 1991.

[6]  David M. Lucantoni,et al.  Bandwidth Management: A Congestion Control Strategy for Broadband Packet Networks - Characterizing the Throughput-Burstiness Filter , 1990, Comput. Networks ISDN Syst..

[7]  P. Khedkar,et al.  Fuzzy prediction of time series , 1992, [1992 Proceedings] IEEE International Conference on Fuzzy Systems.

[8]  D. Mitra,et al.  Dynamic adaptive windows for high speed data networks: theory and simulations , 1990, SIGCOMM 1990.

[9]  Aurel A. Lazar,et al.  Flow Control in Integrated Local Area Networks , 1987, Perform. Evaluation.

[10]  Hui Zhang,et al.  Comparison of rate-based service disciplines , 1991, SIGCOMM '91.

[11]  A. Udaya Shankar,et al.  Dynamical behavior of rate-based flow control mechanisms , 1990, CCRV.

[12]  Scott Shenker,et al.  A Theoretical Analysis of Feedback Flow Control , 1990, SIGCOMM.

[13]  Thomas G. Robertazzi,et al.  On the Modeling and Optimal Flow Control of the Jacksonian Network , 1985, Perform. Evaluation.

[14]  Alexander G. Fraser,et al.  Xunet 2: a nationwide testbed in high-speed networking , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[15]  Raj Jain,et al.  Myths about Congestion Management in High Speed Networks , 1992, INDC.

[16]  Lotfi A. Zadeh,et al.  Outline of a New Approach to the Analysis of Complex Systems and Decision Processes , 1973, IEEE Trans. Syst. Man Cybern..

[17]  Debasis Mitra.  Asymptotically optimal design of congestion control for high speed data networks , 1992, IEEE Trans. Commun..

[18]  Malur K. Sundareshan,et al.  Numerical Methods for Modeling Computer Networks Under Nonstationary Conditions , 1990, IEEE J. Sel. Areas Commun..

[19]  Ashok K. Agrawala,et al.  Window dynamics , 1989 .

[20]  Domenico Ferrari.  Client requirements for real-time communication services , 1990 .

[21]  Krishan K. Sabnani,et al.  #d transport protocol for datagram / virtual circuit networks , 1989, SIGCOMM 1989.

[22]  S. J. Golestani.  A stop-and-go queueing framework for congestion management , 1990, SIGCOMM 1990.

[23]  M.-T.T. Hsiao,et al.  Optimal flow control of multiclass queueing networks with partial information , 1990 .

[24]  Ashok K. Agrawala,et al.  Design and analysis of a flow control algorithm for a network of rate allocating servers , 1990 .

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

[26]  Satish K. Tripathi,et al.  Time-Dependent Analysis Of Queueing Systems , 1986 .

[27]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[28]  Andreas D. Bovopoulos,et al.  Asynchronous Algorithms for Optimal Flow Control of BCMP Networks , 1989 .

[29]  Katsuhiko Ogata,et al.  Discrete-time control systems , 1987 .

[30]  F. Vakil,et al.  Flow control protocols for integrated networks with partially observed voice traffic , 1987 .

[31]  Srinivasan Keshav,et al.  Rate controlled servers for very high-speed networks , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[32]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[33]  Srinivasan Keshav.  Congestion control in computer networks , 1991 .

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

[35]  B. Anderson,et al.  Optimal Filtering , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[36]  C. E. Agnew,et al.  Dynamic Modeling and Control of Congestion-Prone Systems , 1976, Oper. Res..