An efficient rate allocation algorithm for ATM networks providing max-min fairness

  • Kalampoukas L
  • Varma A
  • Ramakrishnan K
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

We describe a new algorithm for rate allocation within theindividual switches of an ATM network implementing a rate-basedcongestion control algorithm for Available Bit-Rate ABR traffic. Thealgorithm performs an allocation θ(1) time, allowing it to beapplied to ATM switches supporting a large number of virtual cicuits.When the total available capacity or the requests of the individualconnections change, the algorithm converges to the max-min allocation.Results from simulations using ATM sources show that the algorithmprovides close to ideal throughput and converges to the max-min fairallocation rapidly when the available bandwidth or the individualrequests change.

Cite

CITATION STYLE

APA

Kalampoukas, L., Varma, A., & Ramakrishnan, K. K. (1995). An efficient rate allocation algorithm for ATM networks providing max-min fairness. In High Performance Networking (pp. 143–154). Springer US. https://doi.org/10.1007/978-0-387-34949-7_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free