This paper analyses the stability and fairness of two classes of rate control algorithm for communication networks. The algorithms provide natural generalisations to large-scale networks of simple additive increase/multiplicative decrease schemes, and are shown to be stable about a system optimum characterised by a proportional fairness criterion. Stability is established by showing that, with an appropriate formulation of the overall optimisation problem, the network's implicit objective function provides a Lyapunov function for the dynamical system defined by the rate control algorithm. The network's optimisation problem may be cast in primal or dual form: this leads naturally to two classes of algorithm, which may be interpreted in tenns of either congestion indication feedback signals or explicit rates based on shadow prices. Both classes of algorithm may be generalised to include routing control, and provide natural implementations of proportionally fair pricing.

The publication "Rate control for communication networks: shadow prices, proportional fairness and stability" is placed in the Top 10000 of the best publications in CiteWeb.
Also in the category Economics it is included to the Top 1000. Additionally, the publicaiton "Rate control for communication networks: shadow prices, proportional fairness and stability" is placed in the Top 100 among other scientific works published in 1998.

HTML code:

Wiki code:

CiteWeb Awards:

Popular on CiteWeb

On the security of public key protocols. Recently the use of public key encryption to provide secure network communication has received considerable attention. Such public key systems are usually effective against passive eavesdroppers, who merely tap the lines and try to decipher the message....