Stack Algorithms at High Loads : Analysis of Unfairness or Singular Behaviours
Overview & Synopsis
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.
Indexed from repository: HAL Open Science
(
hal.science)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Stack Algorithms at High Loads : Analysis of Unfairness or Singular Behaviours |
|---|---|
| Author / Organization | Cédric Adjih, Philippe Jacquet, Paul Mühlethaler |
| Subject & Discipline | Multidisciplinary Academic Open Research |
| Categories | Science & Mathematics |
| Publication Year | 2001 |
| License / Rights | Open Access / Creative Commons |
| Resource Verification | Listed PDF (Verification Pending) |
| Original Host Website |
HAL Open Science
(hal.science)
|
| File Format | application/pdf (Portable Document Format) |
| Language | EN |
| Catalog ID | DOC-188651 |
| Original Source Link | Visit Source Page on hal.science » |