Sciweavers

98 search results - page 14 / 20
» Fairness in MIMD congestion control algorithms
Sort
View
QOFIS
2000
Springer
13 years 11 months ago
The Direct Adjustment Algorithm: A TCP-Friendly Adaptation Scheme
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...
Dorgham Sisalem, Henning Schulzrinne
INFOCOM
2010
IEEE
13 years 5 months ago
Value-aware Resource Allocation for Service Guarantees in Networks
—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...
Parimal Parag, Srinivas Shakkottai, Jean-Fran&cced...
IWQOS
2005
Springer
14 years 26 days ago
Processor Sharing Flows in the Internet
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...
Nandita Dukkipati, Masayoshi Kobayashi, Rui Zhang-...

Publication
191views
15 years 5 months ago
ERICA Switch Algorithm: A Complete Description
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...
Raj Jain, Shiv Kalyanaraman, Rohit, Goyal, Sonia F...
INFOCOM
2003
IEEE
14 years 19 days ago
TCP-LP: A Distributed Algorithm for Low Priority Data Transfer
— Service prioritization among different traffic classes is an important goal for the future Internet. Conventional approaches to solving this problem consider the existing best...
Aleksandar Kuzmanovic, Edward W. Knightly