Network stability under max-min fair bandwidth sharing (Q988767): Difference between revisions

The author studies a model for congestion control in Internet flows on the connection level. In contrast to previous papers, interarrival and service time distributions are not exponential, for service time \(2+d\) moments (some \(d\) greater than 0) are required. The weighted max-min policies are shown to be stable for a subcritical network, i.e., the joint load of all routes dedicated to a common link does not exceed the link capacity. The methods of proof are general construction of Lyapunov functions for the Markovian network processes.