Rate based flow control with bandwidth information

Ait-Hellal, Omar; Altman, Eitan; Başar, Tamer

doi:10.1109/cdc.1996.573563

Cited by 4 publications

(8 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…which is the minimum rate plus max±min fair share of the capacity, see (1). Hence, we can conclude that the explicit-rate congestion control algorithm is globally convergent.…”

Section: A Link Level Explicit-rate Congestion Control Algorithmmentioning

confidence: 72%

“…Two link case. 1 If this inequality is reversed, the same analysis holds with indices 1 and 2 interchanged.…”

Section: An Extension To a Marking Based Schemementioning

confidence: 98%

“…As the number of connections increases, the transitions in the queue dynamics become smoother. In order to see that our design achieves max±min fairness as well, we first calculate the max±min fair share of each connection according to (1). As the number of bottlenecked connections varies over time, this share varies, too.…”

Section: A Link Level Explicit-rate Congestion Control Algorithmmentioning

confidence: 99%

“…The main advantage of this scheme is its simplicity, but it is difficult to control queue length optimally to avoid buffer overflows. However, this scheme is stable (i.e., the queue length remains bounded in an appropriate stochastic sense [1]. The congestion control problem can also be viewed as a feedback control problem where queue length is used for explicit feedback.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Control of Congestion in High-Speed Networks

Imer

Başary

2001

European Journal of Control

View full text Add to dashboard Cite

“…which is the minimum rate plus max±min fair share of the capacity, see (1). Hence, we can conclude that the explicit-rate congestion control algorithm is globally convergent.…”

Section: A Link Level Explicit-rate Congestion Control Algorithmmentioning

confidence: 72%

“…Two link case. 1 If this inequality is reversed, the same analysis holds with indices 1 and 2 interchanged.…”

Section: An Extension To a Marking Based Schemementioning

confidence: 98%

Section: A Link Level Explicit-rate Congestion Control Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Control of Congestion in High-Speed Networks

Imer

Başary

2001

European Journal of Control

View full text Add to dashboard Cite

“…Of particular relevance to this paper, [7] discusses how a pure rate-matching algorithm, i.e., where the bandwidth available to ABR traffic is completely apportioned without regard of the current queue depth, will produce unacceptably long queues. However, [8] shows that under fairly general restrictions, under-allocating the available bandwidth, using either an additive or multiplicative constant, will ensure stability in the queue length. This gives some credibility to the rate matching schemes proposed here and elsewhere.…”

Section: B Related Workmentioning

confidence: 99%

A practical controller for explicit rate congestion control

Laberteaux

Rohrs

Antsaklis

2002

IEEE Trans. Automat. Contr.

View full text Add to dashboard Cite

This paper examines congestion control for explicit rate data networks. The available bit rate (ABR) service category of asynchronous transfer mode (ATM) networks serves as an example system, however, the results of this paper are applicable to other explicit rate systems as well. After a plant model is established, an adaptive control strategy is presented. Several algorithm enhancements are then introduced. These enhancements reduce convergence time, improve queue depth management, and reduce parameter bias. This work differentiates itself from the other contributions in the area of rate-based congestion control in its balanced approach of retaining enough complexity as to afford attractive performance properties, but not so much complexity as to make implementation prohibitively expensive.

show abstract

Rate control algorithms for the ATM ABR service

Hernandez-Valencia¹,

Benmohamed²,

Nagarajan³

et al. 1997

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Abstract. Over the last couple of years both the ATM Forum and ITU-T have converged on a closed-loop, feedback based, rate control mechanism as the framework for the Available Bit Rate ATM Transfer Capability. In this framework, an ABR source adapts its transmission rate to changing characteristics of the ATM network by either testing periodically the state of the network or through direct feedback from the network. The state of the network is conveyed to the source either as a simple binary feedback signaling congestion or no congestion, or as an explicit rate indicating the rate at which the source can transmit. In this paper we review the detailed framework for the ABR service standardized by the ATM Forum, the underlying service philosophy and protocol design goals for ABR flow control, and the premises and high-level performance characteristics for the more promising AER rate control schemes proposed so far.

show abstract

Rate based flow control with bandwidth information

Cited by 4 publications

References 8 publications

Control of Congestion in High-Speed Networks

Control of Congestion in High-Speed Networks

A practical controller for explicit rate congestion control

Rate control algorithms for the ATM ABR service

Contact Info

Product

Resources

About