A novel maxmin definition to achieve an optimum fairness in scheduling packets over the internet

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 applications. Our proposal opposes the allocation of the bandwidth which adopted by all previous scheduling mechanisms. It rather adopts the opposition approach by proposing the notion of Maxmin-charge which fairly distributes the congestion. Furthermore, analytical proposition of novel mechanism named as Just Queueing is been demonstrated.