We present a simplied model of a network of TCP-like sources that compete for a shared bandwidth. We show that: (i) networks of communicating devices operating AIMD congestion control algorithms may be modelled as a positive linear system; (ii) that such networks possess a unique stationary point; and (iii) that this stationary point is globally exponentially stable. Using these results we establish conditions for the fair co-existence of traffic in networks employing heterogeneous AIMD algorithms. A new protocol for operation over high-speed links is proposed and its dynamic properties discussed as a positive linear system
Congestion control is one of the fundamental issues in computer networks. Without proper congestion ...
Congestion control is one of the fundamental issues in computer networks. Without proper congestion ...
We consider a single link accessed by a single source which responds to congestion signals from the...
We present a simplied model of a network of TCP-like sources that compete for a shared bandwidth. We...
We present a simplied model of a network of TCP-like sources that compete for a shared bandwidth. We...
In this paper we present new results on the dynamics of networks of AIMD flows. The results reveal a...
Abstract—We study communication networks that employ drop-tail queueing and Additive-Increase Multi...
Abstract—We study communication networks that employ drop-tail queueing and Additive-Increase Multi...
Abstract—We study communication networks that employ drop-tail queueing and Additive-Increase Multi...
We consider a linear algebraic model of the Additive-Increase Multiplicative-Decrease congestion con...
Abstract: We derive decentralized and scalable stability conditions for a fluid approximation of a c...
The congestion control mechanism has been responsible for maintaining stability as the Internet scal...
Congestion control is one of the fundamental issues in computer networks. Without proper congestio...
We derive decentralized and scalable stability conditions for a fluid approximation of a class of In...
This paper discusses flow control in networks, in which sources control their rates based on feed-ba...
Congestion control is one of the fundamental issues in computer networks. Without proper congestion ...
Congestion control is one of the fundamental issues in computer networks. Without proper congestion ...
We consider a single link accessed by a single source which responds to congestion signals from the...
We present a simplied model of a network of TCP-like sources that compete for a shared bandwidth. We...
We present a simplied model of a network of TCP-like sources that compete for a shared bandwidth. We...
In this paper we present new results on the dynamics of networks of AIMD flows. The results reveal a...
Abstract—We study communication networks that employ drop-tail queueing and Additive-Increase Multi...
Abstract—We study communication networks that employ drop-tail queueing and Additive-Increase Multi...
Abstract—We study communication networks that employ drop-tail queueing and Additive-Increase Multi...
We consider a linear algebraic model of the Additive-Increase Multiplicative-Decrease congestion con...
Abstract: We derive decentralized and scalable stability conditions for a fluid approximation of a c...
The congestion control mechanism has been responsible for maintaining stability as the Internet scal...
Congestion control is one of the fundamental issues in computer networks. Without proper congestio...
We derive decentralized and scalable stability conditions for a fluid approximation of a class of In...
This paper discusses flow control in networks, in which sources control their rates based on feed-ba...
Congestion control is one of the fundamental issues in computer networks. Without proper congestion ...
Congestion control is one of the fundamental issues in computer networks. Without proper congestion ...
We consider a single link accessed by a single source which responds to congestion signals from the...