Least attained recent service for packet scheduling over access links

Martin Heusse 1 Guillaume Urvoy-Keller 2, * Timothy Brown 3 Andrzej Duda 1
* Auteur correspondant
1 Drakkar
LIG - Laboratoire d'Informatique de Grenoble
2 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe SIGNET
Laboratoire I3S - SIS - Signal, Images et Systèmes
3 University of Colorado Boulder [Boulder]
Abstract : We consider the case of scheduling packets over access links for which traditional FIFO scheduling leads to significant performance problems especially when flows in opposite directions interfere with each other. We propose a new packet scheduling scheme called Least Attained Recent Service (LARS) that schedules packets by giving higher priority to packets of flows with less transferred traffic over a limited period. LARS is tunable and it can pace flows in opposite directions even if operating only on one side of the link, so it is particularly suitable for deployment in a wireless access point or an ADSL box. It has similar advantages to LAS, but it avoids long connection lock-outs.
Keywords : Scheduling Asymmetric links 802.11 ADSL
Type de document :
Article dans une revue
Pervasive and Mobile Computing, Elsevier, 2011, 7 (4), pp.479-494. 〈10.1016/j.pmcj.2011.04.002〉
Liste complète des métadonnées
https://hal.archives-ouvertes.fr/hal-00937299
Contributeur : Valérie Samper <>
Soumis le : mardi 28 janvier 2014 - 10:54:31
Dernière modification le : lundi 5 novembre 2018 - 15:52:02

Identifiants

Collections

LIG | LIG_SRCPR | LIG_SRCPR_DRAKKAR | I3S | UNICE | UGA | UNIV-COTEDAZUR

Citation

Martin Heusse, Guillaume Urvoy-Keller, Timothy Brown, Andrzej Duda. Least attained recent service for packet scheduling over access links. Pervasive and Mobile Computing, Elsevier, 2011, 7 (4), pp.479-494. 〈10.1016/j.pmcj.2011.04.002〉. 〈hal-00937299〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

319

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD