Stack Algorithms at High Loads : Analysis of Unfairness or Singular Behaviours - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

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

Cédric Adjih
Philippe Jacquet
Paul Mühlethaler
  • Function : Author
  • PersonId : 833453

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.
Fichier principal
Vignette du fichier
RR-4130.pdf (188.83 Ko) Télécharger le fichier

Dates and versions

inria-00072498 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072498 , version 1

Cite

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⟩
109 View
110 Download

Share

Gmail Facebook X LinkedIn More