Optimal rate control for high speed telecommunication networks

The ATM Forum has chosen the rate‐based approach for flow control of ABR (Available Bit Rate) traffic in ATM. It is based on a reactive approach whereby the transmission rate of ABR sources can be adapted to the available bandwidth at a bottleneck link. The ATM forum has specified the behavior of the source and destination, as well as the manner in which feedback information (on the available bandwidth and on the congestion state of the network) should be conveyed back to the source. The decision on the precise control mechanism, however, has been left to the designer of the switches. We propose in this paper a reactive control scheme that is based only on information on the available bandwidth. We analyze its stability, and then test its performance and fairness by simulations in the presence of other higher priority CBR or VBR traffic.

show abstract

“…As in [2,3], we let {£n} correspond to a stable ARMA process driven by an i.i.d. sequence {fin} with mean zero and variance one:…”

Section: Main R Esultsmentioning

confidence: 99%

“…The behavior of the switches has not been standardized, however, and their design has been left to the manufacturer. Several schemes have been proposed in the literature; see, for example, [1,2,3,7,13,14] and the references therein.…”

Section: Introductionmentioning

confidence: 99%

Rate based flow control with bandwidth information

Ait-Hellal

Altman

Basar

1997

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…We use the fixed point method to solve numerically the system of equations (1), (3) and (4). The advantage of this simple model is that we can compute the loss probability and thus the throughput for large values of K and ρ.…”

Section: A the Exponential Service Time Casementioning

confidence: 99%

The Role of Information Update in Flow Control

Altman

Başar

Malouch

2008

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

Abstract-A common feature of congestion control protocols is the presence of information packets used to signal congestion. We address here the question of how frequently such protocols need to generate information packets in order to optimize their performance. Through a number of congestion control models, we identify and quantify different types of effects of the frequency of generating information packets. We consider both TCP-type protocols, in which controlling the frequency of information packets is done through static or dynamic delayed ACK options, as well as ATM type flow control, where the optimal time spacing between the generation of network management packets is computed. We show how the spacing between information packets influences the throughput and the stability of the system.

show abstract

“…Again, for exponential service time, we can explicitly calculate the transition probabilities and the stationary distributions. Then P~(q > 0) provides the mean throughput of the system while E~[A~]E[s(1)] + AE[s (2)] is the mean input intensity. Thus, the stationary fraction of information loss for the system is P~(q > 0)/(E~[A,,]E[s(1)] + AE[s(2)]).…”

Section: Nw = N[w(l)] N[~] + ~ + E[w(2)] E(a) + ~mentioning

confidence: 99%

“…Some earlier studies on this problem, motivated by the analysis of congestion control in datagram networks, may be found in [10,17,18,25]. More recent studies, motivated by high-speed networks, include [2,3,7,13,14,16,19,21,28]. Siu and Tzeng [21] provide a general survey of the different proposals discussed at ATM forums for the flow control of ABR traffic.…”

Section: Introductionmentioning

confidence: 99%