Proceedings of the Eighth ACM International Conference on Multimedia 2000
DOI: 10.1145/354384.354492
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic-CBT and ChIPS—router support for improved multimedia performance on the Internet

Abstract: The explosive increase in the volume and variety of Internet traffic has placed a growing emphasis on congestion control and fairness in Internet routers. Approaches to the problem of congestion, such as active queue management schemes like Random Early Detection (RED) use congestion avoidance techniques and are successful with TCP flows. Approaches to the problem of fairness, such as Fair Random Early Drop (FRED), keep per-flow state and punish misbehaved, non-TCP flows. Unfortunately, these punishment mechan… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0
1

Year Published

2003
2003
2011
2011

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 11 publications
0
8
0
1
Order By: Relevance
“…To solve this problem, some schemes have incorporated a dropping probability that is attached to the requirements or the class of the type of traffic that they belong to. Dynamic-Class Based Thresholds (D-CBT) [10] apply different policies when classifying flows into three classes, TCP, UDP (multimedia) and other UDP. In this case, D-CBT applies the same dropping probability to VoIP as to other multimedia flows.…”
Section: Related Workmentioning
confidence: 99%
“…To solve this problem, some schemes have incorporated a dropping probability that is attached to the requirements or the class of the type of traffic that they belong to. Dynamic-Class Based Thresholds (D-CBT) [10] apply different policies when classifying flows into three classes, TCP, UDP (multimedia) and other UDP. In this case, D-CBT applies the same dropping probability to VoIP as to other multimedia flows.…”
Section: Related Workmentioning
confidence: 99%
“…With this type of algorithms, for every non-TCP class a threshold is defined, setting a limit to the maximum amount of packets that a certain class can achieve in the queue. CBT [16] and DCBT [17] characterized this class of AQM algorithms as well as SHRED [18].…”
Section: Classical Active Queue Management (Aqm)mentioning
confidence: 99%
“…For instance, Flow Random Early Drop (FRED, [12]) and Approximate Fair Dropping (AFD, [13]). Additionally, the Dynamic Class Based Thresholds (D-CBT, [14]) method prevents congestion by using flow classification and applying distinct policies according to the given flow class.…”
Section: Active Queue Managementmentioning
confidence: 99%