Layering as optimization decomposition: A mathematical theory of network architectures
Network protocols in layered architectures have historically been obtained on an ad hoc
basis, and many of the recent cross-layer designs are also conducted through piecemeal …
basis, and many of the recent cross-layer designs are also conducted through piecemeal …
Internet congestion control
This article reviews the current transmission control protocol (TCP) congestion control
protocols and overviews recent advances that have brought analytical tools to this problem …
protocols and overviews recent advances that have brought analytical tools to this problem …
Consensus problems in networks of agents with switching topology and time-delays
R Olfati-Saber, RM Murray - IEEE Transactions on automatic …, 2004 - ieeexplore.ieee.org
In this paper, we discuss consensus problems for networks of dynamic agents with fixed and
switching topologies. We analyze three cases: 1) directed networks with fixed topology; 2) …
switching topologies. We analyze three cases: 1) directed networks with fixed topology; 2) …
Distributed robust fixed-time consensus for nonlinear and disturbed multiagent systems
In this paper, the robust fixed-time consensus problem for multiagent systems with nonlinear
dynamics and uncertain disturbances under a weighted undirected topology is investigated …
dynamics and uncertain disturbances under a weighted undirected topology is investigated …
Congestion control for high bandwidth-delay product networks
Theory and experiments show that as the per-flow product of bandwidth and latency
increases, TCP becomes inefficient and prone to instability, regardless of the queuing …
increases, TCP becomes inefficient and prone to instability, regardless of the queuing …
[图书][B] The mathematics of Internet congestion control
R Srikant, T Başar - 2004 - Springer
Congestion control algorithms were implemented for the Internet nearly two decades ago,
but mathematical models of congestion control in such a large-scale network are relatively …
but mathematical models of congestion control in such a large-scale network are relatively …
FAST TCP: motivation, architecture, algorithms, performance
DX Wei, C Jin, SH Low, S Hegde - IEEE/ACM transactions on …, 2006 - ieeexplore.ieee.org
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 …
latency networks, from design to implementation. We highlight the approach taken by FAST …
FAST TCP: motivation, architecture, algorithms, performance
C Jin, DX Wei, SH Low - IEEE INFOCOM 2004, 2004 - ieeexplore.ieee.org
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 …
latency networks, from design to implementation. We highlight the approach taken by FAST …
A duality model of TCP and queue management algorithms
SH Low - IEEE/ACM Transactions On Networking, 2003 - ieeexplore.ieee.org
We propose a duality model of end-to-end congestion control and apply it to understanding
the equilibrium properties of TCP and active queue management schemes. The basic idea …
the equilibrium properties of TCP and active queue management schemes. The basic idea …
Network optimization and control
S Shakkottai, R Srikant - Foundations and Trends® in …, 2008 - nowpublishers.com
We study how protocol design for various functionalities within a communication network
architecture can be viewed as a distributed resource allocation problem. This involves …
architecture can be viewed as a distributed resource allocation problem. This involves …