Network stability under max-min fair bandwidth sharing (Q988767): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:50, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Network stability under max-min fair bandwidth sharing |
scientific article |
Statements
Network stability under max-min fair bandwidth sharing (English)
0 references
18 August 2010
0 references
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.
0 references
bandwith sharing
0 references
stability
0 references
Lyapunov functions
0 references
non-exponential service times
0 references
non-exponential interarrival times
0 references
weighted max-min fair policy
0 references
