Results 1  10
of
17
Optimization Flow Control, I: Basic Algorithm and Convergence
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1999
"... We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In thi ..."
Abstract

Cited by 575 (58 self)
 Add to MetaCart
We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using gradient projection algorithm. In this system sources select transmission rates that maximize their own benefits, utility minus bandwidth cost, and network links adjust bandwidth prices to coordinate the sources' decisions. We allow feedback delays to be different, substantial and timevarying, and links and sources to update at different times and with different frequencies. We provide asynchronous distributed algorithms and prove their convergence in a static environment. We present measurements obtained from a preliminary prototype to illustrate the convergence of the algorithm in a slowly timevarying environment.
Internet congestion control
 IEEE Control Systems Magazine
, 2002
"... This article reviews the current transmission control protocol (TCP) congestion control protocols and overviews recent advances that have brought analytical tools to this problem. We describe an optimizationbased framework that provides an interpretation of various flow control mechanisms, in parti ..."
Abstract

Cited by 157 (24 self)
 Add to MetaCart
(Show Context)
This article reviews the current transmission control protocol (TCP) congestion control protocols and overviews recent advances that have brought analytical tools to this problem. We describe an optimizationbased framework that provides an interpretation of various flow control mechanisms, in particular, the utility being optimized by the protocol’s equilibrium structure. We also look at the dynamics of TCP and employ linear models to exhibit stability limitations in the predominant TCP versions, despite certain builtin compensations for delay. Finally, we present a new protocol that overcomes these limitations and provides stability in a way that is scalable to arbitrary networks, link capacities, and delays.
Optimization flow control—I: basic algorithm and convergence
 IEEE/ACM Transactions on Networking
, 1999
"... Abstract—We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using a gradient projection algori ..."
Abstract

Cited by 84 (1 self)
 Add to MetaCart
(Show Context)
Abstract—We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using a gradient projection algorithm. In this system, sources select transmission rates that maximize their own benefits, utility minus bandwidth cost, and network links adjust bandwidth prices to coordinate the sources ’ decisions. We allow feedback delays to be different, substantial, and time varying, and links and sources to update at different times and with different frequencies. We provide asynchronous distributed algorithms and prove their convergence in a static environment. We present measurements obtained from a preliminary prototype to illustrate the convergence of the algorithm in a slowly timevarying environment. We discuss its fairness property. Index Terms — Asynchronous algorithm, congestion pricing, convergence, gradient projection, optimization flow control.
An Enhanced Random Early Marking Algorithm for Internet Flow Control, Infocom
, 2000
"... Abstruct We propose earlier an optimization based flow control ..."
Abstract

Cited by 48 (6 self)
 Add to MetaCart
(Show Context)
Abstruct We propose earlier an optimization based flow control
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 46 (2 self)
 Add to MetaCart
(Show Context)
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...
Optimization Flow Control with Online Measurement or Multiple Paths
 In Proceedings of the ITC
, 1999
"... We proposed earlier an optimization approach to reactive flow control where the objective of the control is to maximize the total utility of all sources over their transmission rates. The control mechanism is derived as a gradient projection algorithm to solve the dual problem. In this paper we cons ..."
Abstract

Cited by 30 (11 self)
 Add to MetaCart
We proposed earlier an optimization approach to reactive flow control where the objective of the control is to maximize the total utility of all sources over their transmission rates. The control mechanism is derived as a gradient projection algorithm to solve the dual problem. In this paper we consider two extensions to the basic algorithm. First, the basic algorithm requires communication from sources of their rates to links in their paths in order to carry out the gradient projection algorithm. We prove that it is possible for the links to estimate the gradient using only local information, thus eliminating the need for explicit communication. Second, the basic algorithm assumes that each source is served by a single path. We generalize the model to the case where there are multiple paths between a sourcedestination pair. This allows flow control and routing to be jointly optimized. 1 Introduction We have proposed previously an optimization approach to flow control where the cont...
DiscreteTime Analysis of Adaptive Rate Control Mechanisms
 In Proc. 5th Int. Conference on Data and Communications
, 1994
"... We analyze the performance of a generic feedback flow control mechanism which captures the properties of several such mechanisms recently proposed in the literature. These mechanisms dynamically regulate the rate of data flow into a network based on feedback information about the network state. They ..."
Abstract

Cited by 25 (4 self)
 Add to MetaCart
(Show Context)
We analyze the performance of a generic feedback flow control mechanism which captures the properties of several such mechanisms recently proposed in the literature. These mechanisms dynamically regulate the rate of data flow into a network based on feedback information about the network state. They are used in a variety of networks and they have been advocated for upcoming highspeed networks. However, they are difficult to model realistically. In this paper, we present a stochastic discretetime approach that yields models which are realistic and yet tractable and computationally easy to solve. For our generic mechanism, the feedback consists of an exponentially averaged estimate of the bottleneck service rate and queue size. We obtain a model described by nonlinear stochastic difference equations. We find the conditions under which these equations converge to a steadystate and we characterize the speed of convergence to steadystate. We then consider a linearized version of the mo...
Optimization Flow Control with NewtonLike Algorithm
 Journal of Telecommunication Systems
, 2000
"... this paper we extend the algorithm to a scaled gradient projection. The diagonal scaling matrix approximates the diagonal terms of the Hessian and can be computed at individual links using the same information required by the unscaled algorithm. We prove the convergence of the scaled algorithm an ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
(Show Context)
this paper we extend the algorithm to a scaled gradient projection. The diagonal scaling matrix approximates the diagonal terms of the Hessian and can be computed at individual links using the same information required by the unscaled algorithm. We prove the convergence of the scaled algorithm and present simulation results that illustrate its superiority to the unscaled algorithm. Keywords: Flow control, optimization flow control, Newton algorithm 1. Introduction We have proposed previously an optimization approach to flow control where the control mechanism is derived as a gradient projection algorithm to solve the dual of a global optimization problem [18,22]. An important feature is that the problem is decomposed into simple algorithms that are executed at individual links and sources using `local' information. It is well known that Newton method, where the gradient is scaled by the inverse of the second derivative matrix, typically enjoys a m
MaxMin Fair Rate Control of ABR Connections with Nonzero MCRs
 Proceedings of IEEE Globecom' 97, pp 498 \Gamma 502
, 1997
"... Traffic sources that do not have intrinsic temporal characteristics are expected to be transported over ATM networks using the Available Bit Rate (ABR) service. These sources are amenable to reactive flow control and are expected to use bandwidth left over after servicing the guaranteed QoS services ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
(Show Context)
Traffic sources that do not have intrinsic temporal characteristics are expected to be transported over ATM networks using the Available Bit Rate (ABR) service. These sources are amenable to reactive flow control and are expected to use bandwidth left over after servicing the guaranteed QoS services (CBR and VBR). Fair allocation of the available bandwidth to competing ABR connections is based on the concept of MaxMin fairness. The ABR service definition allows sources to specify a Minimum Cell Rate (MCR) that is acceptable to them. Most studies of MaxMin fair rate allocation assume zero MCRs. In this paper, we first develop a natural extension of the concept of MaxMin fair rate allocation to the case of ABR sessions with nonzero MCR values. Then we present a centralised algorithm and discuss the construction of distributed algorithms for obtaining the MaxMin allocation. We show that the MaxMin allocation can be obtained as the solution of a certain vector equation, and discuss how...
Feedback Control of Multiloop ABR Traffic in Presence of CBR/VBR Traffic Transmission
 In Proc. of the ICC’96
, 1996
"... Existing works on ABR feedback control design basically neglected the effect of multiple feedback loop delays and highpriority CBR/VBR traffic transmission. With multiloop delays, the already existing lowfrequency highmagnitude oscillations of ABR traffic within each loop can become much worsened ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
Existing works on ABR feedback control design basically neglected the effect of multiple feedback loop delays and highpriority CBR/VBR traffic transmission. With multiloop delays, the already existing lowfrequency highmagnitude oscillations of ABR traffic within each loop can become much worsened. With CBR/VBR priority traffic, the original control stability conditions can be ruined. This paper proposes a new ABR feedback control scheme where the effects of multiloop delays and highpriority traffic transmission are built into the control model. A socalled General Prediction Control (GPC) method is then applied to the control model for oscillation elimination and control stability. Our control objective is to minimize the unused link capacity subject to no congestion, where the ABR traffic is adapted to the lowfrequency variation of highpriority traffic flow for high efficiency. Simulation study shows a significant improvement on achievable throughput as well as on control stabi...