General weighted fairness and its support in explicit rate switch algorithms

Authors:
B. Vandalore;S. Fahmy;R. Jain;R. Goyal;M. Goyal
Affiliations:
Department of Computer and Information Science, The Ohio State University, 2015 Neil Avenue Mall, Columbus, OH 43210-1277, USA;Department of Computer and Information Science, The Ohio State University, 2015 Neil Avenue Mall, Columbus, OH 43210-1277, USA;Department of Computer and Information Science, The Ohio State University, 2015 Neil Avenue Mall, Columbus, OH 43210-1277, USA;Department of Computer and Information Science, The Ohio State University, 2015 Neil Avenue Mall, Columbus, OH 43210-1277, USA;Department of Computer and Information Science, The Ohio State University, 2015 Neil Avenue Mall, Columbus, OH 43210-1277, USA
Venue:
Computer Communications
Year:
2000

Citing 7
Cited 7

Intelligent congestion control for ABR service in ATM networks

ACM SIGCOMM Computer Communication Review
Phantom: a simple and effective flow control scheme

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
The ERICA switch algorithm for ABR traffic management in ATM networks

IEEE/ACM Transactions on Networking (TON)
An efficient rate allocation algorithm for ATM networks providing max-min fairness

Proceedings of the IFIP Sixth International Conference on High Performance Networking VI
Performance of TCP over ABR with Long-Range Dependent VBR Background Traffic over Terrestrial and Satellite ATM networks

LCN '98 Proceedings of the 23rd Annual IEEE Conference on Local Computer Networks
An ABR Feedback Control Scheme with Tracking

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Design and Analysis of Queue Control Functions for Explicit Rate Switch Schemes

IC3N '98 Proceedings of the International Conference on Computer Communications and Networks

Achieving per-flow fair rate allocation in Diffserv

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Achieving Per-Flow Fair Rate Allocation within Diffserv

ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Architecture for dynamic and fair distribution of bandwidth

International Journal of Network Management
Fairness comparison of FAST TCP and TCP Reno

Computer Communications
To be fair or efficient or a bit of both

Computers and Operations Research
A novel proposal to improve fairness in TCP Reno

International Journal of Communication Networks and Distributed Systems
A selective attenuation feedback mechanism for rate oscillation avoidance

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper gives a new definition of general weighted (GW) fairness and shows how this can achieve various fairness definitions, such as those mentioned in the ATM Forum TM 4.0 specifications. The GW fairness can be achieved by calculating the ExcessFairshare (weighted fairshare of the left over bandwidth) for each VC. We show how a switch algorithm can be modified to support the GW fairness by using the ExcessFairshare term. We use ERICA+ as an example switch algorithm and show how it can be modified to achieve the GW fairness. For simulations, the weight parameters of the GW fairness are chosen to map a typical pricing policy. Simulation results are presented to demonstrate that, the modified switch algorithm achieves GW fairness. An analytical proof for convergence of the modified ERICA+ algorithm is given in the appendix.