| |
| | Fairness in MIMD Congestion Control Algorithms - Altman, Avrachenkov, Prabhu (ResearchIndex) (Site not responding. Last check: 2007-10-26) |
 | | Abstract: We study in this paper the fairness in throughput among two sessions that share a common bottleneck link, where one or both of the sessions use a multiplicative increase multiplicative decrease (MIMD) algorithm. |
 | | Losses or congestion signals occur when the capacity is achieved but could also be initiated before that. |
 | | @misc{ altman05fairness, author = "E. Altman and K. Avrachenkov and B. Prabhu", title = "Fairness in MIMD Congestion Control Algorithms", text = "E. Altman, K. Avrachenkov, and B. Prabhu. |
| citeseer.csail.mit.edu /718940.html (397 words) |
|