Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer A
DOI: 10.1109/infcom.2000.832529
|View full text |Cite
|
Sign up to set email alerts
|

End-to-end congestion control schemes: utility functions, random losses and ECN marks

Abstract: We present a framework for designing end-to-end congestion control schemes in a network where each user may have a different utility function and may experience noncongestion-related losses. We first show that there exists an additive-increase-multiplicative-decrease scheme using only end-to-end measurable losses such that a socially optimal solution can be reached. We incorporate round-trip delay in this model, and show that one can generalize observations regarding TCP-type congestion avoidance to more gener… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

5
407
0
3

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 342 publications
(415 citation statements)
references
References 20 publications
5
407
0
3
Order By: Relevance
“…Although the α-fairness scheme has been studied both from a theoretical and a practical perspective, prominently in networks (see [15], [5], [11], [14], [17]), the underlying efficiencyfairness tradeoff is still not well understood. Recent work has been devoted to theoretically characterizing what it actually means for a higher value of α to be more fair [12].…”
Section: Efficiency-maximizing and Fair Allocationsmentioning
confidence: 99%
“…Although the α-fairness scheme has been studied both from a theoretical and a practical perspective, prominently in networks (see [15], [5], [11], [14], [17]), the underlying efficiencyfairness tradeoff is still not well understood. Recent work has been devoted to theoretically characterizing what it actually means for a higher value of α to be more fair [12].…”
Section: Efficiency-maximizing and Fair Allocationsmentioning
confidence: 99%
“…Here we can employ a content-based fairness strategy as described in [13], and it is scalable and does not require maintenance of any state information beyond a time slot which is important in a network with a fast changing topology. As to the content-based fairness strategy, that is when each node receives 19 the packets, it judges the packet content whether it has hold or not. If has, it will throw out the packet directly and inform his partner do not transmit after that moment.…”
Section: Fairnessmentioning
confidence: 99%
“…The work in [18], [19], [16], [12] provides a utility-based optimization framework for Internet congestion control. The same framework has been applied to study the congestion control over ad hoc wireless networks (see, e.g., [20], [21]).…”
Section: Related Workmentioning
confidence: 99%
“…The latter is the case in the widely-used droptail algorithm. Random Early Detection (RED) [15] and its variations such as AVQ [16], REM [17], BLUE [18], and E-RED [19] are other wellknown examples of AQM algorithms [9], [20] with different characteristics, which have been proposed and studied by the research community.…”
mentioning
confidence: 99%