Fairness in MIMD Congestion Control Algorithms Export

@misc{citeulike:366282, abstract = {The Mulitplicative Increase Multiplicative Decrease (MIMD) congestion control algorithm in the form of Scalable TCP has been proposed for high speed networks. We study fairness among sessions sharing a common bottleneck link, where one or more sessions use the MIMD algorithm. Losses, or congestion signals, occur when the capacity is reached but could also be initiated before that. Both synchronous as well as asynchronous losses are considered. In the asynchronous case, only one session suffers...}, author = {Altman, E. and Avrachenkov, K. and Prabhu, B.}, citeulike-article-id = {366282}, citeulike-linkout-0 = {http://citeseer.ist.psu.edu/altman05fairness.html}, citeulike-linkout-1 = {http://citeseer.lcs.mit.edu/altman05fairness.html}, citeulike-linkout-2 = {http://citeseer.ifi.unizh.ch/altman05fairness.html}, citeulike-linkout-3 = {http://citeseer.comp.nus.edu.sg/altman05fairness.html}, keywords = {congestion, tcp}, posted-at = {2005-10-27 01:43:23}, priority = {5}, title = {Fairness in MIMD Congestion Control Algorithms}, url = {http://citeseer.ist.psu.edu/altman05fairness.html}, year = {2005} }

TY - GEN ID - citeulike:366282 L3 - citeulike-article-id:366282 N2 - The Mulitplicative Increase Multiplicative Decrease (MIMD) congestion control algorithm in the form of Scalable TCP has been proposed for high speed networks. We study fairness among sessions sharing a common bottleneck link, where one or more sessions use the MIMD algorithm. Losses, or congestion signals, occur when the capacity is reached but could also be initiated before that. Both synchronous as well as asynchronous losses are considered. In the asynchronous case, only one session suffers... TI - Fairness in MIMD Congestion Control Algorithms KW - congestion KW - tcp AU - Altman, E AU - Avrachenkov, K AU - Prabhu, B PY - 2005/// UR - http://citeseer.ist.psu.edu/altman05fairness.html ER -