Results 1  10
of
410
Coverage Control for Mobile Sensing Networks
, 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 349 (50 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 closedloop behavior is adaptive, distributed, asynchronous, and verifiably correct.
FAST TCP: Motivation, Architecture, Algorithms, Performance
, 2004
"... We describe FAST TCP, a new TCP congestion control algorithm for highspeed longlatency 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 273 (18 self)
 Add to MetaCart
We describe FAST TCP, a new TCP congestion control algorithm for highspeed longlatency 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 highspeed longlatency networks into steady, efficient and fair operating points, in dynamic sharing environments, and the preliminary results are promising.
A Duality Model of TCP and Queue Management Algorithms
 IEEE/ACM Trans. on Networking
, 2002
"... We propose a duality model of congestion control and apply it to understand the equilibrium properties of TCP and active queue management schemes. Congestion control is the interaction of source rates with certain congestion measures at network links. The basic idea is to regard source rates as p ..."
Abstract

Cited by 239 (34 self)
 Add to MetaCart
We propose a duality model of congestion control and apply it to understand the equilibrium properties of TCP and active queue management schemes. Congestion control is the interaction of source rates with certain congestion measures at network links. The basic idea is to regard source rates as primal variables and congestion measures as dual variables, and congestion control as a distributed primaldual algorithm carried out over the Internet to maximize aggregate utility subject to capacity constraints. The primal iteration is carried out by TCP algorithms such as Reno or Vegas, and the dual iteration is carried out by queue management such as DropTail, RED or REM. We present these algorithms and their generalizations, derive their utility functions, and study their interaction.
REM: Active Queue Management
 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 205 (18 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.
Endtoend congestion control schemes: Utility functions, random losses and ECN marks
 In Proceedings of IEEE Infocom
, 2000
"... We present a framework for designing endtoend congestion control schemes in a network where each user may have a different utility function and may experience noncongestionrelated losses. We first show that there exists an additive increasemultiplicative decrease scheme using only endtoend me ..."
Abstract

Cited by 178 (1 self)
 Add to MetaCart
We present a framework for designing endtoend congestion control schemes in a network where each user may have a different utility function and may experience noncongestionrelated losses. We first show that there exists an additive increasemultiplicative decrease scheme using only endtoend measurable losses such that a sociallyoptimal solution can be reached. We incorporate roundtrip delay in this model, and show that one can generalize observations regarding TCPtype 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., perflow measurements are not required. 1
A game theoretic framework for bandwidth allocation and pricing in broadband networks
 IEEE/ACM Trans. on Networking
, 2000
"... Abstract—In this paper, we present a game theoretic framework for bandwidth allocation for elastic services in highspeed 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 opti ..."
Abstract

Cited by 176 (4 self)
 Add to MetaCart
Abstract—In this paper, we present a game theoretic framework for bandwidth allocation for elastic services in highspeed 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. Index Terms—Bandwidth allocation, elastic traffic, game theory, Nash bargaining solution, pricing. I.
Mathematical modelling of the Internet
"... 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, largescale networks appear as coherent, almost intelligent, organisms. The des ..."
Abstract

Cited by 153 (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, largescale 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.
Fairness and optimal stochastic control for heterogeneous networks
 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 150 (29 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 endtoend delay increase for data that is served by the network.
EndtoEnd Congestion Control for the Internet: Delay and Stability
, 2001
"... Under the assumption that queueing delays will eventually become small relative to propagation delays, we derive stability results for a fluid flow model of endtoend Internet congestion control. The theoretical results of the paper are intended to be decentralized and locally implemented: each end ..."
Abstract

Cited by 144 (1 self)
 Add to MetaCart
Under the assumption that queueing delays will eventually become small relative to propagation delays, we derive stability results for a fluid flow model of endtoend Internet congestion control. The theoretical results of the paper are intended to be decentralized and locally implemented: each end system needs knowledge only of its own roundtrip delay. Criteria for local stability and rate of convergence are completely characterized for a single resource, single user system. Stability criteria are also described for networks where aH users share the same roundtrip delay. Numerical experiments investigate extensions to more general networks. Through simulations, we are able to evaluate the relative importance of queueing delays and propagation delays on network stability. Finally, we suggest how these results may be used to design network resources.
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 141 (24 self)
 Add to MetaCart
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.