HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Least attained recent service for packet scheduling over access links

Martin Heusse 1 Guillaume Urvoy-Keller 2, * Timothy Brown 3 Andrzej Duda 1
* Corresponding author
1 Drakkar
LIG - Laboratoire d'Informatique de Grenoble
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.
Document type :
Journal articles
Complete list of metadata

Contributor : Valérie Samper Connect in order to contact the contributor
Submitted on : Tuesday, January 28, 2014 - 10:54:31 AM
Last modification on : Thursday, December 16, 2021 - 3:26:33 PM



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⟩



Record views