Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Stack Algorithms at High Loads : Analysis of Unfairness or Singular Behaviours

Cédric Adjih 1 Philippe Jacquet 1 Paul Mühlethaler 1 
1 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : 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.
Document type :
Reports (Research report)
Complete list of metadata
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 10:08:04 AM
Last modification on : Friday, October 28, 2022 - 3:28:52 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:10:30 PM


  • HAL Id : inria-00072498, version 1



Cédric Adjih, Philippe Jacquet, Paul Mühlethaler. Stack Algorithms at High Loads : Analysis of Unfairness or Singular Behaviours. [Research Report] RR-4130, INRIA. 2001. ⟨inria-00072498⟩



Record views


Files downloads