Proceedings of INFOCOM '97
DOI: 10.1109/infcom.1997.635145
|View full text |Cite
|
Sign up to set email alerts
|

A control theoretic approach to the design of closed loop rate based flow control for high speed ATM networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
25
0

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 52 publications
(25 citation statements)
references
References 4 publications
0
25
0
Order By: Relevance
“…In contrast to very few studies of rate-based controls in end-to-end applications, a large body of data-link algorithms exists [4], [22], [31], [39]; however, these methods often rely on routers to compute the sending rate of each flow (e.g., in ATM) and explicitly feed it back to the end flows. In the current Internet, such computation is considered too costly to be implemented in the network layer, which makes these methods unsuitable for end-to-end applications.…”
mentioning
confidence: 99%
“…In contrast to very few studies of rate-based controls in end-to-end applications, a large body of data-link algorithms exists [4], [22], [31], [39]; however, these methods often rely on routers to compute the sending rate of each flow (e.g., in ATM) and explicitly feed it back to the end flows. In the current Internet, such computation is considered too costly to be implemented in the network layer, which makes these methods unsuitable for end-to-end applications.…”
mentioning
confidence: 99%
“…Since the congestion control concept that was introduced in [5], several attempts at control theoretic-based schemes have been made in the literature by using approaches such as optimal control [6]; linear control [7]; fuzzy and neural control [8]; predictive adaptive control [9]; and nonlinear control techniques [10], [11]. Despite these efforts, formal, quantitative, and analytical investigation of performance of large scale networks with Diff-Serv traffics have not been fully addressed and resolved.…”
Section: Introductionmentioning
confidence: 99%
“…[9] derived analytically a control-theoretic fair rate allocation algorithm which allows for arbitrary control of the closed-loop performance, but its practical use is limited by high degree of implementation complexity as the round-trip delay increases. T he work by [9,10,11] proposed distributed algorithms which adapt quickly to congestion while achieving max-min fairness, either with or without minimum rate guarantee, among competing flows. The work by [12] addressed a weighted max-min fair bandwidth sharing with minimumrate guarantee, but employs per-flow state management to calculate fair rate for each flow.…”
Section: Introductionmentioning
confidence: 99%