Dynamic Max-Min fairness in ring networks

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, t...

• Type: Journal
• Year: 2000
• Where: CLUSTER
• Authors: Giuseppe Anastasi, Luciano Lenzini, M. La Porta, Yoram Ofek
• Keywords: Algorithm, CLUSTER 2000, Cycle Size, Distributed And Parallel Computing, Max-Min Fairness Definition