Optimization flow control: basic algorithm and convergence (1999)

by S H Low, D E Lapley
Venue:IEEE/ACM Transaction on Networking
Add To MetaCart
Results 1 - 10 of 694

Coverage Control for Mobile Sensing Networks

by Jorge Cortes, Sonia Martínez, Timur Karatas, Francesco Bullo , 2002
"... This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility functio ..."
Abstract - Cited by 582 (49 self) - Add to MetaCart
This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies. The resulting closed-loop behavior is adaptive, distributed, asynchronous, and verifiably correct.

FAST TCP: Motivation, Architecture, Algorithms, Performance

by C. Jin, D. X. Wei, S. H. Low , 2004
"... We describe FAST TCP, a new TCP congestion control algorithm for high-speed long-latency networks, from design to implementation. We highlight the approach taken by FAST TCP to address the four difficulties, at both packet and flow levels, which the current TCP implementation has at large windows. W ..."
Abstract - Cited by 369 (18 self) - Add to MetaCart
We describe FAST TCP, a new TCP congestion control algorithm for high-speed long-latency networks, from design to implementation. We highlight the approach taken by FAST TCP to address the four difficulties, at both packet and flow levels, which the current TCP implementation has at large windows. We describe the architecture and characterize the equilibrium and stability properties of FAST TCP. We present experimental results comparing our first Linux prototype with TCP Reno, HSTCP, and STCP in terms of throughput, fairness, stability, and responsiveness. FAST TCP aims to rapidly stabilize high-speed long-latency networks into steady, efficient and fair operating points, in dynamic sharing environments, and the preliminary results are promising.
(Show Context)

REM: Active Queue Management

by Sanjeewa Athuraliya , Victor H. Li, Steven H. Low, Qinghe Yin - IEEE NETWORK , 2000
"... REM is an active queue management scheme that measures congestion not by a performance measure such as loss or delay, but by a quantity we call price. Price is computed by each link distributively using local information and is fed back to the sources through packet dropping or marking. This decoupl ..."
Abstract - Cited by 273 (22 self) - Add to MetaCart
REM is an active queue management scheme that measures congestion not by a performance measure such as loss or delay, but by a quantity we call price. Price is computed by each link distributively using local information and is fed back to the sources through packet dropping or marking. This decoupling of congestion and performance measures allows REM to achieve high utilization with negligible delays and buffer overflow regardless of the number of. sources. We prove that REM is asymptotically stable and compare its performance with RED using simulations.

Fairness and optimal stochastic control for heterogeneous networks

by Michael J. Neely, Eytan Modiano, Chih-ping Li - Proc. IEEE INFOCOM, March 2005. TRANSACTIONS ON NETWORKING, VOL , 2008
"... Abstract — We consider optimal control for general networks with both wireless and wireline components and time varying channels. A dynamic strategy is developed to support all traffic whenever possible, and to make optimally fair decisions about which data to serve when inputs exceed network capaci ..."
Abstract - Cited by 266 (63 self) - Add to MetaCart
Abstract — We consider optimal control for general networks with both wireless and wireline components and time varying channels. A dynamic strategy is developed to support all traffic whenever possible, and to make optimally fair decisions about which data to serve when inputs exceed network capacity. The strategy is decoupled into separate algorithms for flow control, routing, and resource allocation, and allows each user to make decisions independent of the actions of others. The combined strategy is shown to yield data rates that are arbitrarily close to the optimal operating point achieved when all network controllers are coordinated and have perfect knowledge of future events. The cost of approaching this fair operating point is an end-to-end delay increase for data that is served by the network.
(Show Context)

Distributed Subgradient Methods for Multi-agent Optimization

by Angelia Nedić, Asuman Ozdaglar , 2007
"... We study a distributed computation model for optimizing a sum of convex objective functions corresponding to multiple agents. For solving this (not necessarily smooth) optimization problem, we consider a subgradient method that is distributed among the agents. The method involves every agent minimiz ..."
Abstract - Cited by 240 (25 self) - Add to MetaCart
We study a distributed computation model for optimizing a sum of convex objective functions corresponding to multiple agents. For solving this (not necessarily smooth) optimization problem, we consider a subgradient method that is distributed among the agents. The method involves every agent minimizing his/her own objective function while exchanging information locally with other agents in the network over a time-varying topology. We provide convergence results and convergence rate estimates for the subgradient method. Our convergence rate results explicitly characterize the tradeoff between a desired accuracy of the generated approximate optimal solutions and the number of iterations needed to achieve the accuracy.
(Show Context)

A game theoretic framework for bandwidth allocation and pricing in broadband networks

by Haïkel Yaïche, Ravi R. Mazumdar, Catherine Rosenberg - IEEE/ACM TRANS. ON NETWORKING , 2000
"... In this paper, we present a game theoretic framework for bandwidth allocation for elastic services in high-speed networks. The framework is based on the idea of the Nash bargaining solution from cooperative game theory, which not only provides the rate settings of users that are Pareto optimal from ..."
Abstract - Cited by 238 (11 self) - Add to MetaCart
In this paper, we present a game theoretic framework for bandwidth allocation for elastic services in high-speed networks. The framework is based on the idea of the Nash bargaining solution from cooperative game theory, which not only provides the rate settings of users that are Pareto optimal from the point of view of the whole system, but are also consistent with the fairness axioms of game theory. We first consider the centralized problem and then show that this procedure can be decentralized so that greedy optimization by users yields the system optimal bandwidth allocations. We propose a distributed algorithm for implementing the optimal and fair bandwidth allocation and provide conditions for its convergence. The paper concludes with the pricing of elastic connections based on users ’ bandwidth requirements and users’ budget. We show that the above bargaining framework can be used to characterize a rate allocation and a pricing policy which takes into account users’ budget in a fair way and such that the total network revenue is maximized.
(Show Context)

End-to-end congestion control schemes: Utility functions, random losses and ECN marks

by Srisankar Kunniyur, R. Srikant - In Proceedings of IEEE Infocom , 2000
"... We present a framework for designing end-to-end congestion control schemes in a network where each user may have a different utility function and may experience non-congestion-related losses. We first show that there exists an additive increase-multiplicative decrease scheme using only end-to-end me ..."
Abstract - Cited by 215 (1 self) - Add to MetaCart
We present a framework for designing end-to-end congestion control schemes in a network where each user may have a different utility function and may experience non-congestion-related losses. We first show that there exists an additive increase-multiplicative decrease scheme using only end-to-end measurable losses such that a socially-optimal solution can be reached. We incorporate round-trip delay in this model, and show that one can generalize observations regarding TCP-type congestion avoidance to more general window flow control schemes. We then consider explicit congestion notification (ECN) as an alternate mechanism (instead of losses) for signaling congestion and show that ECN marking levels can be designed to nearly eliminate losses in the network by choosing the marking level independently for each node in the network. While the ECN marking level at each node may depend on the number of flows through the node, the appropriate marking level can be estimated using only aggregate flow measurements, i.e., per-flow measurements are not required. 1
(Show Context)

Fair Resource Allocation in Wireless Networks using Queue-length-based Scheduling and Congestion Control

by Atilla Eryilmaz, R. Srikant
"... We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different re-ceiver. The channel conditions may be time-varying and different for different receivers. It is well-known that appropriate ..."
Abstract - Cited by 202 (45 self) - Add to MetaCart
We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different re-ceiver. The channel conditions may be time-varying and different for different receivers. It is well-known that appropriately chosen queue-length based policies are throughput-optimal while other policies based on the estimation of channel statistics can be used to allocate resources fairly (such as proportional fairness) among competing users. In this paper, we show that a combination of queue-length-based scheduling at the base station and congestion control implemented either at the base station or at the end users can lead to fair resource allocation and queue-length stability.

Internet Congestion Control.

by Steven H Low , Fernando Paganini , John C Doyle - IEEE Control Systems Magazine, , 2002
"... Abstract This article reviews the current TCP congestion control protocols and overviews recent advances that have brought analytical tools to this problem. We describe an optimization-based framework that provides an interpretation of various flow control mechanisms, in particular, the utility bei ..."
Abstract - Cited by 194 (25 self) - Add to MetaCart
Abstract This article reviews the current TCP congestion control protocols and overviews recent advances that have brought analytical tools to this problem. We describe an optimization-based 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 built-in 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.
(Show Context)

Mathematical modelling of the Internet

by Frank Kelly
"... Modern communication networks are able to respond to randomly uctuating demands and failures by adapting rates, by rerouting traffic and by reallocating resources. They are able to do this so well that, in many respects, large-scale networks appear as coherent, almost intelligent, organisms. The des ..."
Abstract - Cited by 191 (0 self) - Add to MetaCart
Modern communication networks are able to respond to randomly uctuating demands and failures by adapting rates, by rerouting traffic and by reallocating resources. They are able to do this so well that, in many respects, large-scale networks appear as coherent, almost intelligent, organisms. The design and control of such networks present challenges of a mathematical, engineering and economic nature. This paper outlines how mathematical models are being used to address current issues concerning the stability and fairness of rate control algorithms for the Internet.