(Enter summary)
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... (Update)
Cited by: More
Analysis of MIMD Congestion Control Algorithm for.. - Altman.. (2004)
(Correct)
Active bibliography (related documents): More All
1.0: Fairness in MIMD Congestion Control Algorithms - Altman, Avrachenkov, Prabhu (2005)
(Correct)
0.3: Approaches to Congestion Control in Packet Networks - Mamatas, Tsaoussidis, Zhang (2004)
(Correct)
0.2: Performance Analysis and Stochastic Stability of.. - Altman.. (2005)
(Correct)
Similar documents based on text: More All
0.3: Analysis of Scalable TCP in the Presence of Markovian.. - Altman, Avrachenkov..
(Correct)
0.2: ANALYSIS of SCALABLE TCP - Altman Avrachenkov Barakat (2004)
(Correct)
0.2: Analysis of Scalable TCP - Eitan Altman Konstantin (2004)
(Correct)
Related documents from co-citation: More All
2: Handbook of Complex Variables (context) - KRANTZ - 1999
2: FAST TCP: Motivation (context) - Jin, Wei et al. - 2004
2: HighSpeed TCP for Large Congestion Windows
- Floyd - 2002
BibTeX entry: (Update)
E. Altman, K. Avrachenkov, and B. J. Prabhu. Fairness in MIMD Congestion Control Algorithms. In Proceedings of the IEEE INFOCOM, 2005. Also available as a INRIA Technical Report RR-5312 at http://www.inria.fr/rrrt/rr5312. html. http://citeseer.ist.psu.edu/article/altman05fairness.html More
@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. J. Prabhu. Fairness in MIMD Congestion
Control Algorithms. In Proceedings of the IEEE INFOCOM, 2005. Also available
as a INRIA Technical Report RR-5312 at http://www.inria.fr/rrrt/rr5312.
html.",
year = "2005",
url = "citeseer.ist.psu.edu/article/altman05fairness.html" }
Citations (may not include all citations):
366
Markov Chains and Stochastic Stability
- Meyn, Tweedie - 1993
124
Queueing Systems Volume I: Theory (context) - Kleinrock - 1975
121
Denumerable Markov Chains (context) - Kemeny, Snell et al. - 1976
65
Analysi IncreaseDecrease Algorithm Congestion Avoidance Comp.. (context) - Jain, the et al. - 1989
64
HighSpeed TCP for Large Congestion Windows
- Floyd - 2003
53
Fairness and Stability of congestion control mechanisms of T..
- Hasegawa, Murata et al. - 2000
40
Scalable TCP: Improving Performance in Highspeed Wide Area N..
- Kelly - 2003
38
the Stability of Networks Operating TCP-like Congestion Cont..
- Vinnicombe - 2002
34
Topics in the Constructive Theory of Countable Markov Chains (context) - Fayolle, Malyshev et al. - 1995
9
End-to-End Rate-Based Congestion Control: Convergence Proper..
- Loguinov, Radha - 2003
8
Performance TCPIP case two Controlled Source (context) - Altman, Erramdani et al. - 1997
7
Binary Increase Congestion Control (context) - Xu, Harfoush et al. - 2004
4
Feedback Modeling in Internet Congestion Control (context) - Gorinsky - 2004
4
Stochastic Differential Equation for TCP Window Size: Analys..
- Budhiraja, Hernndez-Campos et al. - 2004
http://www.isi.edu/nsnam/ns/
Documents on the same site (http://www-sop.inria.fr/mistral/personnel/Balakrishna.Prabhu/pubs/): More
Analysis of MIMD Congestion Control Algorithm for.. - Altman..
(Correct)
Performance Analysis and Stochastic Stability of.. - Altman.. (2005)
(Correct)
Fairness in MIMD Congestion Control Algorithms - Altman, Avrachenkov, Prabhu (2004)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC