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

Kalampoukas, Lampros; Varma, A.; Ramakrishnan, K. K.

doi:10.1007/978-0-387-34949-7_11

Cited by 93 publications

(30 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus they cannot: (1) use the number of established connections as an indication of the number of sources, (2) measure or estimate the rate of each source, (3) distinguish between overloading and underloading sources, or compute the number of overloading sources, (4) estimate the effective number of active sources. Such techniques are used in many of the popular point-to-point switch schemes, such as the MIT scheme [3] and the UCSC scheme [14].…”

Section: Rate Allocation Design Issuesmentioning

confidence: 99%

Fair flow control for ATM-ABR multipoint connections

Fahmy

Jain

Goyal³

et al. 2002

Computer Communications

View full text Add to dashboard Cite

Multipoint-to-multipoint communication can be implemented by combining the point-to-multipoint and multipoint-to-point connection algorithms. In an ATM multipoint-to-point connection, multiple sources send data to the same destination on a shared tree. Traffic from multiple branches is merged into a single stream after every merge point. It is sometimes impossible for the network to determine any source-specific characteristics since all sources in the multipoint connection may use the same connection identifiers. The challenge is to develop a fair rate allocation algorithm without per-source accounting as this is inequivalent to per-connection or per-flow accounting in this case.We define fairness objectives for multipoint connections, and we design and simulate an O(1) fair ATM-ABR rate allocation scheme for point-to-point and multipoint connections sharing the same links. Simulation results show that the algorithm performs well and exhibits many desirable properties. We list key modifications necessary for any ATM-ABR rate allocation scheme to fairly accommodate multiple sources.

show abstract

Section: Rate Allocation Design Issuesmentioning

confidence: 99%

Fair flow control for ATM-ABR multipoint connections

Fahmy

Jain

Goyal³

et al. 2002

Computer Communications

View full text Add to dashboard Cite

show abstract

“…Some, however, has been done for more general bandwidth scheduling algorithms [2,4,5,6,12,13,17,18,21,22,31]. Hahne [17,18] proves that if each bottleneck/router relays the packets of the jobs in a round-robin way, then the bandwidths converge to max-min fairness between the jobs.…”

Section: Introductionmentioning

confidence: 99%

On the Competitiveness of AIMD-TCP within a General Network

Edmonds

2004

LATIN 2004: Theoretical Informatics

View full text Add to dashboard Cite

This paper studies the performance of AIMD (Additive Increase Multiplicative Decrease) TCP as an online distributed scheduling algorithm for allocating transmission rate to sessions/jobs running on a general network. The network consists of a set of routers which in this context act only as bottlenecks, i.e. when a router's capacity has been reached, it informs the jobs passing through it to multiplicatively back off transmission rates. The analysis is easier when this AIMD algorithm is modeled by a continuous algorithm. We improve on that presented by Kelly to better capture the interconnectedness of the network. Extending the paper by Edmonds, Datta, and Dymond that solves the single bottleneck case, we prove that with extra resources, this algorithm AIMDEQUI is competitive against the optimal global algorithm in minimizing the average transmission time of the jobs. We also bound the fairness of this resource allocation according to three different definitions of fairness.

show abstract

“…These algorithms can be classified into two categories: direct marking and progressive marking. Examples of direct marking algorithms include [2,5,6,11,12,15,24,25,26]. This approach allows the link to achieve both fairness and high utilization.…”

Section: Introductionmentioning

confidence: 99%

The Virtual Bandwidth Based ER Marking Algorithms for Flow Control in ATM Networks

Yang

Wang

Zhai

2000

Broadband Communications

View full text Add to dashboard Cite

ABR service is designed for a wide range of applications that do not require bounded delay and loss ratio, but rather prefer low loss ratio and high throughput with only a minimum cell rate guaranteed. In this paper, we introduce the concept of virtual bandwidth and discuss its application to ABR flow control. We develop a new explicit rate marking algorithm that adopts a traffic-driven measurement-based approach to track the available bandwidth and the virtual bandwidth concept to achieve both fairness and high utilisation. This algorithm exhibits O(1)-computationai complexity, O(1)-storage complexity, fast responsiveness, and quick convergence. It does not require special information from end systems nor any information from other switches, such as bottleneck link and bottleneck connection indication. Simulation results show that the proposed scheme adapts well to the distributed dynamic network environment and converges to max-min fairness allocation quick.

show abstract

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

Cited by 93 publications

References 2 publications

Fair flow control for ATM-ABR multipoint connections

Fair flow control for ATM-ABR multipoint connections

On the Competitiveness of AIMD-TCP within a General Network

The Virtual Bandwidth Based ER Marking Algorithms for Flow Control in ATM Networks

Contact Info

Product

Resources

About