Results 1  10
of
185
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 364 (19 self)
 Add to MetaCart
(Show Context)
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 control theoretic analysis of RED
 In Proceedings of IEEE Infocom
, 2001
"... Abstract — In this paper we use a previously developed nonlinear dynamic model of TCP to analyze and design Active Queue Management (AQM) control systems using RED. First, we linearize the interconnection of TCP and a bottlenecked queue and discuss its feedback properties in terms of network paramet ..."
Abstract

Cited by 288 (8 self)
 Add to MetaCart
(Show Context)
Abstract — In this paper we use a previously developed nonlinear dynamic model of TCP to analyze and design Active Queue Management (AQM) control systems using RED. First, we linearize the interconnection of TCP and a bottlenecked queue and discuss its feedback properties in terms of network parameters such as link capacity, load and roundtrip time. Using this model, we next design an AQM control system using the random early detection (RED) scheme by relating its free parameters such as the lowpass filter break point and loss probability profile to the network parameters. We present guidelines for designing linearly stable systems subject to network parameters like propogation delay and load level. Robustness to variations in system loads is a prime objective. We presentns simulations to support our analysis. I.
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 271 (21 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.
Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for Active Queue Management
 In Proceedings of ACM SIGCOMM
, 2001
"... Virtual Queuebased marking schemes have been recently proposed for AQM (Active Queue Management) in Internet routers. We consider a particular scheme, which we call the Adaptive Virtual Queue (AVQ), and study its following properties: stability in the presence of feedback delays, its ability to mai ..."
Abstract

Cited by 258 (22 self)
 Add to MetaCart
(Show Context)
Virtual Queuebased marking schemes have been recently proposed for AQM (Active Queue Management) in Internet routers. We consider a particular scheme, which we call the Adaptive Virtual Queue (AVQ), and study its following properties: stability in the presence of feedback delays, its ability to maintain small queue lengths and its robustness in the presence of extremely short flows (the socalled web mice). Using a mathematical tool motivated by the earlier work of Hollot et al, we present a simple rule to design the parameters of the AVQ algorithm. We then compare its performance through simulation with several wellknown AQM schemes such as RED, REM, PI controller and a nonadaptive virtual queue algorithm. With a view towards implementation, we show that AVQ can be implemented as a simple token bucket using only a few lines of code. 1
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 191 (26 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.
Algorithms, Games, and the Internet
 In STOC
, 2001
"... If the Internet is the next great subject for Theoretical Computer Science to model and illuminate mathematically, then Game Theory, and Mathematical Economics more generally, are likely to prove useful tools. In this talk I survey some opportunities and challenges in this important frontier. 1. ..."
Abstract

Cited by 152 (0 self)
 Add to MetaCart
(Show Context)
If the Internet is the next great subject for Theoretical Computer Science to model and illuminate mathematically, then Game Theory, and Mathematical Economics more generally, are likely to prove useful tools. In this talk I survey some opportunities and challenges in this important frontier. 1.
Scalable Laws for Stable Network Congestion Control
 In Proceedings of Conference on Decision and Control
, 2001
"... This paper discusses flow control in networks, in which sources control their rates based on feedback signals received from the network links, a feature present in current TCP protocols. We develop a congestion control system which is arbitrarily scalable, in the sense that its stability is maintain ..."
Abstract

Cited by 113 (26 self)
 Add to MetaCart
This paper discusses flow control in networks, in which sources control their rates based on feedback signals received from the network links, a feature present in current TCP protocols. We develop a congestion control system which is arbitrarily scalable, in the sense that its stability is maintained for arbitrary network topologies and arbitrary amounts of delay. Such a system can be implemented in a decentralized way with information currently available in networks plus a small amount of additional signaling.
Stability criteria for switched and hybrid systems
 SIAM Review
, 2007
"... The study of the stability properties of switched and hybrid systems gives rise to a number of interesting and challenging mathematical problems. The objective of this paper is to outline some of these problems, to review progress made in solving these problems in a number of diverse communities, an ..."
Abstract

Cited by 103 (7 self)
 Add to MetaCart
(Show Context)
The study of the stability properties of switched and hybrid systems gives rise to a number of interesting and challenging mathematical problems. The objective of this paper is to outline some of these problems, to review progress made in solving these problems in a number of diverse communities, and to review some problems that remain open. An important contribution of our work is to bring together material from several areas of research and to present results in a unified manner. We begin our review by relating the stability problem for switched linear systems and a class of linear differential inclusions. Closely related to the concept of stability are the notions of exponential growth rates and converse Lyapunov theorems, both of which are discussed in detail. In particular, results on common quadratic Lyapunov functions and piecewise linear Lyapunov functions are presented, as they represent constructive methods for proving stability, and also represent problems in which significant progress has been made. We also comment on the inherent difficulty of determining stability of switched systems in general which is exemplified by NPhardness and undecidability results. We then proceed by considering the stability of switched systems in which there are constraints on the switching rules, through both dwell time requirements and state dependent switching laws. Also in this case the theory of Lyapunov functions and the existence of converse theorems is reviewed. We briefly comment on the classical Lur’e problem and on the theory of stability radii, both of which contain many of the features of switched systems and are rich sources of practical results on the topic. Finally we present a list of questions and open problems which provide motivation for continued research in this area.
Multipath TCP: A joint congestion control and routing scheme to exploit path diversity on the internet
 IEEE/ACM Transactions on Networking
, 2006
"... We consider the problem of congestionaware multipath routing in the Internet. Currently, Internet routing protocols select only a single path between a source and a destination. However, due to many policy routing decisions, singlepath routing may limit the achievable throughput. In this paper, w ..."
Abstract

Cited by 101 (3 self)
 Add to MetaCart
(Show Context)
We consider the problem of congestionaware multipath routing in the Internet. Currently, Internet routing protocols select only a single path between a source and a destination. However, due to many policy routing decisions, singlepath routing may limit the achievable throughput. In this paper, we envision a scenario where multipath routing is enabled in the Internet to take advantage of path diversity. Using minimal congestion feedback signals from the routers, we present a class of algorithms that can be implemented at the sources to stably and optimally split the flow between each sourcedestination pair. We then show that the connectionlevel throughput region of such multipath routing/congestion control algorithms can be larger than that of a singlepath congestion control scheme. 1