A number of congestion control schemes which adopt the max-min fairness criterion and do not require maintenance of per flow states within the network have been proposed in literature. The stability of some of these schemes in networks of arbitrary topology, has been established analytically only for small deviations about the equilibrium point. The establishment of global asymptotic stability ...

Congestion control mechanisms for ATM networks as selected by the ATM Forum traac management group are described. Reasons behind these selections are explained. In particular , selection criterion for selection between rate-based and credit-based approach and the key points of the debate between these two approaches are presented. The apprach that was nally selected and several other schemes th...

A number of congestion control schemes which adopt the max-min fairness criterion and do not require maintenance of per flow states within the network have been proposed in literature. The stability of some of these schemes in networks of arbitrary topology, has been established analytically only for small deviations about the equilibrium point. The establishment of global asymptotic stability ...

We discuss congestion control algorithms, using network awareness as a criterion to categorize different approaches. The first category (”the box is black”) consists of a group of algorithms that consider the network as black box, assuming no knowledge of its state, other than the binary feedback upon congestion. The second category (”the box is grey”) groups approaches that use measurements to...

Congestion control mechanisms for ATM networks as selected by the ATM Forum traffic management group are described. Reasons behind these selections are explained. In particular, selection criterion for selection between rate-based and creditbased approach and the key points of the debate between these two approaches are presented. The approach that was finally selected and several other schemes...

in trading electrical energy in deregulated power systems, violation of operation constraints such as transmission lines flow limits is possible. these conditions have been called “congestion”. one of the most important responsibility of independent system operator (iso) is congestion management in a manner that all the system equipments be operated in their nominal ranges. in this paper, usi...

We consider fair sharing of network resources over a period of time between offline and interactive users. The former value total transferred volume while the latter have timedependent valuations for instantaneous bandwidth. Following the work of Kelly on fair bandwidth sharing, we express the system optimum as an equilibrium of traditional congestion control taking place in a fast timescale an...

In [2] Johari and Tan consider an Internet type network with distributed congestion control of the form proposed by Kelly et al in [3], and determine a sufficient condition for local stability of the network under the condition that all round trip times are equal. They conjecture that the same condition will also guarantee local stability when the round trip times are disparate. The continuous ...

It is known that a data network may not be stable at the connection level under some unfair bandwidth allocation policies, even when the normal offered load condition is satisfied, i.e., the average traffic load at each link is less than its capacity. In this paper, we show that, under the normal offered load condition, a data network is stable when the bandwidth of the network is allocated so ...

Fair resource allocation in high-speed networks, such as the Internet, can be viewed as a constrained optimization program. Kelly et al. have shown that an unconstrained penalty function formulation of this problem can be used to design congestion controllers that are stable. In this paper, we examine the question of providing feedback from the network such that the congestion controllers deriv...