Stack Algorithms at High Loads : Analysis of Unfairness or Singular Behaviours
Résumé
In this paper, we investigate the fairness of stack access algorithms in overload conditions. We show that conventional Last In First Out free-acces- s stack algorithms provide unfair channel access at high loads. A subset of end-users may starve during network overloads as the other nodes capture the whole channel capacity. We show that the First In First Out free-access stack protocol can cope with this unfairness problem. The blocked access stack algorithms are not showing unfairness problems.