98 search results - page 14 / 20 » Fairness in MIMD congestion control algorithms |
QOFIS
2000
Springer
15 years 1 months ago
2000
Springer
Many distributed multimedia applications have the ability to adapt to uctuations in the network conditions. By adjusting temporal and spatial quality to available bandwidth, or man...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixe...
IWQOS
2005
Springer
15 years 2 months ago
2005
Springer
Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and pr...
189
click to vote
Publication
The ERICA switch algorithm has been discussed extensively in TM group in the past. However, over the last two years, the algorithm has been substantially modified. This contributio...
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
— Service prioritization among different traffic classes is an important goal for the future Internet. Conventional approaches to solving this problem consider the existing best...