Bandwidth management: A congestion control strategy for broadband packet networks — characterizing the throughput-burstiness filter

Eckberg, A.E.; Luan, Daniel T.; Lucantoni, David M.

doi:10.1016/0169-7552(90)90052-t

Cited by 51 publications

(16 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Turner [1986] suggested a throttle based on the leaky bucket to monitor the admission of ATM cells. Motivated by the interest in BISDNs, many researchers have subsequently examined (single-class) rate-control throttles based on token banks or leaky buckets; e.g., see Eckberg, Luan, and Lucantoni [1989], Sidi et al [1989], Sohraby and Sidi [1990], Rathgeb [1990], Kroner, Theimer, and Briem [1990], Budka and Yao [1990], Budka [1990], and Elwalid and Mitra [1991]. The multiclass ratecontrol throttle investigated in Whitt [1990, 1991] is also applicable to BISDN/ATM, with the different classes representing different virtual channels that share a common virtual path.…”

Section: Introductionmentioning

confidence: 99%

The Brownian approximation for rate-control throttles and the G/G/1/C queue

Berger

Whitt

1992

Discrete Event Dyn Syst

View full text Add to dashboard Cite

Abstract. This paper studies approximations to describe the performance of a rate-control throttle based on a token bank, which is closely related to the standard G/G/1/C queue and the two-node cyclic network of ./G/l/co queues. Several different approximations for the throttle are considered, but most attention is given to a Brownian or diffusion approximation. The Brownian approximation is supported by a heavy-traffic limit theorem (as the traffic intensity approaches the upper limit for stability) for which an upper bound on the rate of convergence is established. Means and squared coefficients of variation associated with renewal-process approximations for the overflow processes are also obtained from the Brownian approximation. The accuracy of the Brownian approximation is investigated by making numerical comparisons with exact values. The relatively simple Brownian approximation for the job overflow rate is not very accurate for small overflow rates, but it nevertheless provides important insights into the way the throttle design parameters should depend on the arrival-process characteristics in order to achieve a specified overflow rate. This simple approximation also provides estimates of the sensitivity of the overflow rates to the model parameters.

show abstract

Section: Introductionmentioning

confidence: 99%

The Brownian approximation for rate-control throttles and the G/G/1/C queue

Berger

Whitt

1992

Discrete Event Dyn Syst

View full text Add to dashboard Cite

show abstract

“…There are two major differences between this work and the previous work of the rate-based flow control schemes such as [4], [Ill, [2], [3], [12], and [5]. First, packets are delayed in our setting not just due to the waiting for sufficient amount of credit, but also due to the service provided to other packets by the server (e.g., the access link).…”

Section: Introductionmentioning

confidence: 89%

A credit manager for traffic regulation in high-speed networks: a queueing analysis

Leung

Sengupta²,

Yeung

1993

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

“…Leaky Bucket [Tur86] and its variant schemes are described in [SLCG89,ELL90,Rat91]. In a generalized model of the leaky bucket shown in Figure 1, tokens are generated at a fixed rate as long as the token buffer of size b is not full.…”

Section: Leaky Bucket Schemementioning

confidence: 99%

“…This is due to the fact that the users may, inadvertently or otherwise, attempt to exceed the rates specified at the time of connection establishment. Many policing schemes viz., Leaky Bucket (LB), Jumping Window (JW), Moving Window (MW), Exponentially weighted moving average Window (EW) and associated variations have been proposed and analyzed [Thr86, SLCG89,ELL90,Rat91]. Studies on bursty sources have shown that burstiness promotes statistical multiplexing at the cost of possible congestion.…”

Section: Introductionmentioning

confidence: 99%

Design and Performance Study of a Flexible Traffic Shaper for High Speed Networks

Radhakrishnan

Raghavan

Agrawala

1995

High Performance Networking

View full text Add to dashboard Cite

In networks supporting distributed multimedia, maximizing bandwidth utilization and providing performance guarantees are two incompatible goals. Heterogeneity of the multimedia sources calls for effective congestion control schemes to satisfy the diverse Quality of Service(QoS) requirements of each application. These include admission control at connection set up, traffic control at the source ends and efficient scheduling schemes at the switches. The emphasis in this paper is on traffic control at the source end. Traffic control schemes have two functional roles. One is traffic enforcement as a supplement to the admission control policy. The other is shaping the input traffic so that it becomes amenable to the scheduling mechanism at the switches for providing the required QoS guarantees. Studies on bursty sources have shown that burstiness promotes statistical multiplexing at the cost of possible congestion. Smoothing the traffic helps in providing guarantees at the cost of bandwidth utilization. The need for a flexible scheme which can provide a reasonable compromise between the utilization and guarantees is imminent. We present the design and performance study of a flexible traffic shaper which can adjust the burstiness of input traffic to obtain reasonable utilization while maintaining statistical service guarantees. The performance of the traffic shaper for bursty sources is studied using simulation.

show abstract

Bandwidth management: A congestion control strategy for broadband packet networks — characterizing the throughput-burstiness filter

Cited by 51 publications

References 9 publications

The Brownian approximation for rate-control throttles and the G/G/1/C queue

The Brownian approximation for rate-control throttles and the G/G/1/C queue

A credit manager for traffic regulation in high-speed networks: a queueing analysis

Design and Performance Study of a Flexible Traffic Shaper for High Speed Networks

Contact Info

Product

Resources

About