Data networks
Locality in distributed graph algorithms
SIAM Journal on Computing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Overview of the MetaRing architecture
Computer Networks and ISDN Systems - Special issue: media-access techniques for high-speed LANs and MANs
Guaranteeing fair service to persistent dependent tasks
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An experimental distributed switching system to handle bursty computer traffic
Proceedings of the first ACM symposium on Problems in the optimization of data communications systems
A SAT-based network access scheme for fairness in high speed networks
IEEE/ACM Transactions on Networking (TON)
Local and congestion-driven fairness algorithm in arbitrary topology networks
IEEE/ACM Transactions on Networking (TON)
Dynamic Max-Min fairness in ring networks
Cluster Computing
Fairness in Routing and Load Balancing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A fair and traffic dependent scheduling algorithm for Bluetooth scatternets
Mobile Networks and Applications
Design, analysis, and implementation of DVSR: a fair high-performance protocol for packet rings
IEEE/ACM Transactions on Networking (TON)
A game-theoretic approach to stable routing in max-min fair networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Max-Min fairness has been recognized as an optimal throughput-fairness definition. However, its realization in packet switching networks and its computational requirements have not yet been understood. In this work we attempt to take a step in this direction. The Max-Min definition is given in terms of transmission rates of sources sending to their destinations (sessions). In order to realize Max-Min rates in a packet switching environment, transmission schedules of packets need to be realized. We first show that finding Max-Min fair schedules (with given rates) requires global state and timing informution of all the nodes in the network. We then design a local scheduling algorithm for ring and bus networks with minimum transmission-delay, concurrent access, and spatial bandwidth reuse. This distributed algorithm uses only partial state information and is based on locally exchanging simple signals only between directly conflicting sessions (sessions which share at least one link) rather than collecting global information. The results of this algorithm are novel in various ways: (1) we prove that each session has access-delay of at most twice its bottleneck link; (2) we show that the algorithm operates adaptively with optimal access-delay in a dynamic environment (bursty traffic sources); and (3) by means of simulation experiments we further show that this algorithm achieves, in a steady-state, Max-Min fair rates for a vast majority of sessions and average aggregate throughput which is 99 percent the throughput obtained by Max-Min fair rates.