DMCA
Service differentiation by means of packet scheduling
BibTeX
@MISC{R&d_servicedifferentiation,
author = {France Télécom R&d and Guillaume Urvoy-keller and Luca Muscariello and Norberto Ostallo},
title = {Service differentiation by means of packet scheduling},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This document presents Shortest Queue First (SQF) packet scheduling algorithm, as a solution to improve Internet access on ADSL links. This queuing policy provides implicit service differentiation, avoiding the need of packet marking and resource reservation associated to usual Quality of Service (QoS) architectures like Differentiated Services (DiffServ) and Integrated Services (IntServ). SQF is compared with two existing alternative disciplines, First In First Out (FIFO) and Stochastic Fairness Queuing (SFQ), and several experiments are performed in order to underline aspects of each algorithm in different scenarios. Some of the most significant results are presented here to help understand advantages and drawbacks of each scheduler and how they behave in these different situations. Results show that SQF fully meets its design goals, outperforming both FIFO and SFQ in all the tests. Effectiveness of the algorithm is also evaluated in a demo. Real-world programs are used in some common home scenarios: everyday usage situations
Keyphrases
packet scheduling service differentiation packet marking internet access adsl link differentiated service alternative discipline real-world program different scenario stochastic fairness queuing everyday usage situation implicit service differentiation significant result design goal resource reservation queuing policy several experiment different situation usual quality common home scenario shortest queue first underline aspect
