A Definition of General Weighted Fairness and its Support in Explicit Rate Switch Algorithms

TL;DR

This paper introduces a comprehensive definition of weighted fairness applicable to network switches, demonstrating how to modify existing algorithms like ERICA+ to support this fairness, with simulation and proof of convergence.

Contribution

It provides a general framework for weighted fairness, shows how to adapt switch algorithms to support it, and validates the approach through simulations and analytical proofs.

Findings

Modified ERICA+ achieves general weighted fairness

Simulations confirm effectiveness of the fairness support

Analytical proof ensures convergence of the modified algorithm

Abstract

In this paper we give a general definition of weighted fairness and show how this can achieve various fairness definitions, such as those mentioned in the ATM Forum TM 4.0 Specifications. We discuss how a pricing policy can be mapped to general weighted (GW) fairness. 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$. We use ERICA+ as an example switch algorithm and show how it can be modified to achieve the general fairness. Simulations 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.