2011
DOI: 10.1016/j.comnet.2010.12.001
|View full text |Cite
|
Sign up to set email alerts
|

Modeling the interactions of congestion control and switch scheduling

Abstract: Abstract-In this paper, we study the interactions of user-based congestion control algorithms and router-based switch scheduling algorithms. We show that switch scheduling algorithms that were designed without taking into account these interactions can exhibit a completely different behavior when interacting with feedbackbased Internet traffic. Previous papers neglected or mitigated these interactions, and typically found that flow rates reach a fair equilibrium. On the contrary, we show that these interaction… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

1
2
0

Year Published

2011
2011
2018
2018

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 48 publications
1
2
0
Order By: Relevance
“…Both non-iterative and iterative QBMW rules show extremely unfair allocation between groups. This confirms the observation in [1], [3] that TCP sources in Group 1 which start earlier than those in Group 2 tend to have longer queue lengths due to larger congestion windows and hence are assigned more subcarriers, making them more advantageous than those sources in Group 2 who are starved of bandwidth.…”
Section: A Homogeneous Users With Dif F Erent Starting Timesupporting
confidence: 89%
See 2 more Smart Citations
“…Both non-iterative and iterative QBMW rules show extremely unfair allocation between groups. This confirms the observation in [1], [3] that TCP sources in Group 1 which start earlier than those in Group 2 tend to have longer queue lengths due to larger congestion windows and hence are assigned more subcarriers, making them more advantageous than those sources in Group 2 who are starved of bandwidth.…”
Section: A Homogeneous Users With Dif F Erent Starting Timesupporting
confidence: 89%
“…Such fluctu ations are expected to be further amplified in OFDMA systems, which are usually composed of many subcarriers. Many OFDMA subcarrier scheduling algorithms have been proposed (e.g., [4], [5], [6]) and analyzed but few were evaluated with TCP traffic sources, while the studies in [1], [3] involve both schedulers and TCP but the sched ulers are considered as non-iterative schedulers which lead to overassignment of subcarriers. In this work, we extend the concept of iterative schedulers presented in [6] and evaluate their performance in the system involving TCP traffic sources.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation