Results 1  10
of
24
A ControlTheoretic Approach to Flow Control
, 1991
"... This paper presents a controltheoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a roundrobinlike queue service discipline in the output queues of the network’s switches, and propose deterministic and stochastic models for a single conversation in a ne ..."
Abstract

Cited by 383 (7 self)
 Add to MetaCart
This paper presents a controltheoretic approach to reactive flow control in networks that do not reserve bandwidth. We assume a roundrobinlike 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 PacketPair rate probing technique, and a provably stable ratebased flow control scheme. A Kalman state estimator is derived from discretetime 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 horn the system to develop a continuoustime system model. This is used to design a wuisnt 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 cmmlination with window flow control are described.
PacketPair Flow Control
 IEEE/ACM Transactions on Networking
, 1994
"... This paper presents the packetpair ratebased feedback flow control scheme. This scheme is designed for networks where individual connections do not reserve bandwidth and for the available bitrate (besteffort) component of integrated networks. We assume a roundrobinlike queue service discipline ..."
Abstract

Cited by 44 (2 self)
 Add to MetaCart
This paper presents the packetpair ratebased feedback flow control scheme. This scheme is designed for networks where individual connections do not reserve bandwidth and for the available bitrate (besteffort) component of integrated networks. We assume a roundrobinlike queue service discipline in the output queues of the network's switches, and propose a linear stochastic model for a single conversation in a network of such switches. These model motivates the PacketPair rate probing technique, which forms the basis for provably stable discrete and continuous time ratebased flow control schemes. We present a novel state estimation scheme based on fuzzy logic. We then address several practical concerns: dealing with system startup, retransmission and timeout strategy, and dynamic setpoint probing. We present a finite state machine as well as source code for a model implementation. The dynamics of a single source, the interactions of multiple sources, and the behavior of packetpai...
Analysis Of A Fluid Approximation To Flow Control Dynamics
 In Proc. IEEE INFOCOM '92
, 1992
"... We consider a flow control mechanism that dynamically regulates the rate of data flow into a network based on feedback information about the network state. Such mechanisms have been introduced recently in a variety of networks including the Internet, and have been advocated for future highspeed net ..."
Abstract

Cited by 26 (6 self)
 Add to MetaCart
We consider a flow control mechanism that dynamically regulates the rate of data flow into a network based on feedback information about the network state. Such mechanisms have been introduced recently in a variety of networks including the Internet, and have been advocated for future highspeed networks. We first model the flow control mechanism by a discretespace stochastic process and define appropriate performance measures for transient and steadystate regimes. However, the model does not appear to be analytically tractable and we study it through simulation. We then simplify it to a continuousspace deterministic (or fluid) model for which we can easily derive closedform solutions. We find the analytical results for the fluid model to agree well with the simulation results obtained using the discretespace model. Both models explicitly consider delay of the feedback information, thus making them relevant for highspeed networks. 1 Introduction In a computer network, packets g...
Congestion Detection Methods and their Impact on the Performance of the ABR Flow Control
, 1997
"... This paper discusses and compares the performance of three easytoimplement congestion detection schemes for ATM switches supporting the ABR service category. ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
This paper discusses and compares the performance of three easytoimplement congestion detection schemes for ATM switches supporting the ABR service category.
Analysis of a Queueing Model with Delayed Feedback and its Application to the ABR Flow Control
, 1997
"... A common method for regulating the input flow in today's telecommunication networks is the implementation of reactive traffic control mechanisms. By limiting the user's access according to the current network load situation, the throughput is optimized while congestion is avoided. In ATM networks, f ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
A common method for regulating the input flow in today's telecommunication networks is the implementation of reactive traffic control mechanisms. By limiting the user's access according to the current network load situation, the throughput is optimized while congestion is avoided. In ATM networks, for example, a ratebased feedback control is applied to dynamically adjust the transmission rates of connections belonging to the ABR service category. This paper presents a discretetime analysis of a queueing model with nondeterministic arrivals and delayed feedback. The binary feedback information is used to regulate the input flowbychanging the interarrival distribution accordingly. Applying this model, the performance of the ABR flow control can be studied with respect to the variabilityofthecell generation process.
Integrated Control of Connection Admission, Flow Rate, and Bandwidth for ATM based Networks
 IEEE INFOCOM'96, 15th Conference on Computer Communications
, 1996
"... Abstract: The combined control problem of connection admission, flow rate, and bandwidth allocation (capacity, servicerate) in ATM based networks under nonstationary conditions has recently attained considerable importance. In an earlier paper we adopted a nonlinear control approach to derive an in ..."
Abstract

Cited by 12 (8 self)
 Add to MetaCart
Abstract: The combined control problem of connection admission, flow rate, and bandwidth allocation (capacity, servicerate) in ATM based networks under nonstationary conditions has recently attained considerable importance. In an earlier paper we adopted a nonlinear control approach to derive an integrated control strategy (for the finite buffer and finite server case) that is insensitive to any propagation delay. The performance of the proposed scheme was carried out using analysis and simulation. In this paper we report and analyse the results of a comparative evaluation with a well known method of flow control: that of BECN (Backward Explicit Congestion Notification). 1.
ZIteration: A Simple Method for Throughput Estimation in TimeDependent MultiClass Systems
 In ACM SIGMETRICS /PERFORMANCE '95
, 1995
"... Multipleclass multipleresource (MCMR) systems, where each class of customers requires a particular set of resources, are common. These systems are often analyzed under steadystate conditions. We describe a simple method, referred to as Ziteration, to estimate both transient and steadystate perf ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Multipleclass multipleresource (MCMR) systems, where each class of customers requires a particular set of resources, are common. These systems are often analyzed under steadystate conditions. We describe a simple method, referred to as Ziteration, to estimate both transient and steadystate performances of such systems. The method makes use of results and techniques available from queueing theory, network analysis, dynamic flow theory, and numerical analysis. We show the generality of the Ziteration by applying it to an ATM network, a parallel disk system, and a distributed batch system. Validations against discreteevent simulations show the accuracy and computational advantages of the Ziteration. 1 Introduction We consider a general multipleclass multipleresource (MCMR) system. We have a set R of resources and a set C of customer classes. The nature of a resource depends on the system being modeled; for example, it may be computer memory, floor space, transmission capacity, e...
Adaptive Bandwidth Provisioning Envelope based on Discrete Temporal Network Measurements
 Proceedings of IEEE INFOCOM 2004, Hong Kong
, 2004
"... We propose an adaptive bandwidth provisioning mechanism based on packetlevel measurements (done at discrete time intervals) without any assumption on the statistical property of the traffic. Our approach consists of two stages: traffic forecasting, followed by bandwidth estimation. For the first st ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We propose an adaptive bandwidth provisioning mechanism based on packetlevel measurements (done at discrete time intervals) without any assumption on the statistical property of the traffic. Our approach consists of two stages: traffic forecasting, followed by bandwidth estimation. For the first stage, we have developed a ProbabilityHop Forecasting algorithm (based on ARIMA model) to forecast traffic based on online traffic measurements in a temporal management information base framework. For the second stage, we present several bandwidth provisioning schemes that allocate or deallocate bandwidth depending on the traffic forecast generated by our forecasting algorithm. We have introduced an utility function (along with other measures) to evaluate the overall effectiveness of our bandwidth provisioning framework. Through the use of realworld data, we have found that our approach works well for highly fluctuating data.
Adaptive Congestion Control in ATM based Networks: Quality of Service and High Utilisation
 JOURNAL OF COMPUTER COMMUNICATIONS
, 1997
"... To improve network utilisation and robustness for ATM networks there is increasing evidence that reactive congestion controls are necessary. However the large bandwidthdelay product and the difficulty in traffic modelling inherent in ATM networks makes design of effective reactive controls difficul ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
To improve network utilisation and robustness for ATM networks there is increasing evidence that reactive congestion controls are necessary. However the large bandwidthdelay product and the difficulty in traffic modelling inherent in ATM networks makes design of effective reactive controls difficult. In this paper, we use adaptive (feedback and feedforward) predictive control techniques, and despite the (large) propagation delays avoid congestion at high server utilisation while maintaining quality of service at prescribed levels. Our method overcomes the difficulty of the large propagation delays by using adaptive traffic prediction calculated from measurements of the net input traffic at an ATM buffer. Effective prediction is possible due to the high level of correlation present in some VBR traffic. The sensitivity to traffic modelling is addressed by using adaptive (predictive) control. Bounds on operating conditions are derived analytically, and evaluated using simulation. A comparative evaluation is also presented.
Congestion control for differentiatedservices using nonlinear control theory
 In Proceedings of the Sixth IEEE Symposium on Computers and Communications
, 2001
"... The growing demand of computer usage requires efficient ways of managing network traffic in order to avoid or at least limit the level of congestion in cases where increases in bandwidth are not desirable or possible. Using nonlinear control theory we developed and analysed a generic Integrated Dyn ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
The growing demand of computer usage requires efficient ways of managing network traffic in order to avoid or at least limit the level of congestion in cases where increases in bandwidth are not desirable or possible. Using nonlinear control theory we developed and analysed a generic Integrated Dynamic Congestion Control (IDCC) scheme for controlling traffic using information on the status of each queue in the network. The IDCC scheme is based on a nonlinear model of the network that is generated using fluid flow considerations. The methodology used is general and independent of technology, as for example TCP/IP or ATM. We assume a differentiatedservices network framework and formulate our control strategy in the same spirit as IP DiffServ for three types of services: Premium Service, Ordinary Service, and Best Effort Service. The three differentiated classes of traffic operate at each output port of a router/switch. An IDCC scheme is designed for each output port, and a powerful, simple to implement controller is designed and analysed. The IDCC methodology has been applied to an ATM network. We use OPNET simulations to demonstrate that the proposed control methodology achieves the desired behaviour of the network, and possesses important attributes, such as: stable and robust behaviour, high utilisation with bounded delay and loss performance, and good steady state and transient behaviour.