Dynamic Max-Min fairness in ring networks

Authors:
G. Anastasi;L. Lenzini;M. La Porta;Y. Ofek
Affiliations:
Department of Information Engineering, University of Pisa, Via Diotisalvi 2, 56126 Pisa, Italy;Department of Information Engineering, University of Pisa, Via Diotisalvi 2, 56126 Pisa, Italy;Basis Information Technology, viale della Repubblica 141, 59100 Prato, Italy;Synchrodyne, Inc., 2600 Netherland Ave., Riverdale, NY 10463, USA
Venue:
Cluster Computing
Year:
2000

Citing 6
Cited 1

Data networks

Data networks
Overview of the MetaRing architecture

Computer Networks and ISDN Systems - Special issue: media-access techniques for high-speed LANs and MANs
Simulation Modeling and Analysis

Simulation Modeling and Analysis
Interface Comparisons: SSA versus FC-AL

IEEE Concurrency
Have Storage Area Networks Come of Age?

Computer
Approximating max-min fair rates via distributed local scheduling with partial information

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2

Fairness comparison of FAST TCP and TCP Reno

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ring networks are enjoying renewed interest as Storage Area Networks (SANs), i.e., networks for interconnecting storage devices (e.g., disk, disk arrays and tape drives) and storage data clients. This paper addresses the problem of fairness in ring networks with spatial reuse operating under dynamic traffic scenarios. To this end, in the first part of the paper the Max-Min fairness definition is extended to dynamic traffic scenarios and an algorithm for computing Max-Min fair rates in a dynamic environment is introduced. In the second part of the paper the extended Max-Min fairness definition is used as a measure to compare the performance in dynamic conditions of three fairness algorithms proposed for ring-based SANs. These algorithms are characterized by different fairness cycle sizes (number of links involved in each instance of the fairness algorithm), i.e., different complexity. The results show that the performance increases as the fairness cycle size decreases. In particular, the Global-cycle algorithm (implemented in the Serial Storage Architecture – SSA), whose cycle size is equal to the number N of links in the ring, exhibits the lowest performance, while the One-cycle algorithm, so called because of its cycle size equal to 1, has the best performance. The Variable-cycle algorithm, whose cycle size changes between 1 and N links, performs in between and provides the best tradeoff between performance and complexity.