Breaking the Legend: Maxmin Fairness notion is no longer effective

TL;DR

This paper introduces Maxmin-charge and Just Queueing, novel scheduling mechanisms that improve fairness and quality of service for real-time applications by fairly distributing congestion, challenging traditional maxmin fairness approaches.

Contribution

The paper proposes Maxmin-charge and Just Queueing as new fairness mechanisms that outperform traditional maxmin fairness in scheduling for real-time services.

Findings

Maxmin-charge effectively distributes congestion fairly.

Just Queueing improves quality of service for real-time applications.

The proposed mechanisms outperform traditional fairness methods.

Abstract

In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application. Our proposal oppose the allocation of the bandwidth which adopted by all previous scheduling mechanism. It rather adopt the opposition approach be proposing the notion of Maxmin-charge which fairly distribute the congestion. Furthermore, analytical proposition of novel mechanism named as Just Queueing is been demonstrated.