(m,k)-WFQ, intégration des contraintes temporelles (m,k)-firm dans les réseaux à débit garanti
Identifieur interne : 000440 ( PascalFrancis/Checkpoint ); précédent : 000439; suivant : 000441(m,k)-WFQ, intégration des contraintes temporelles (m,k)-firm dans les réseaux à débit garanti
Auteurs : Anis Koubaa [France] ; Ye-Qiong Song [France] ; Jean-Pierre Thomesse [France]Source :
- TSI. Technique et science informatiques [ 0752-4072 ] ; 2005.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Entreprise.
English descriptors
- KwdEn :
Abstract
Guaranteed-Rate (GR) servers, such as Weighted Fair Queueing (WFQ) and its variants, have been widely used to give mainly bandwidth guarantees and consequently delay guarantees for real-time flows provided that their arrivals are upper-bounded. Problems may arise if a bursty traffic with a small service share needs a specific short delay. In fact, the higher the service share is, the lower the delay the flow gets. However, WFQ and its variants are share-driven servers and no temporal constraint is considered in the scheduling process. Therefore, having in mind that many real-time applications could tolerate some deadline misses according to their (m,k)-firm constraints, we propose a new scheduling technique called (m,k)-WFQ which extends WFQ to also consider (m,k)-firm temporal requirement. Analytic expressions using Network Calculus theory are derived to give deterministic upper bound on delay provided by the (m,k)- WFQ scheduler.
Affiliations:
- France
- Grand Est, Lorraine (région)
- Nancy, Villers-lès-Nancy
- Centre national de la recherche scientifique, Institut national de recherche en informatique et en automatique, Laboratoire lorrain de recherche en informatique et ses applications, Université de Lorraine
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:06-0149163Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="fr" level="a">(m,k)-WFQ, intégration des contraintes temporelles (m,k)-firm dans les réseaux à débit garanti</title><author><name sortKey="Koubaa, Anis" sort="Koubaa, Anis" uniqKey="Koubaa A" first="Anis" last="Koubaa">Anis Koubaa</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LORIA-INPL-UHP Nancy I, LORIA-TRIO 615, rue du Jardin Botanique</s1><s2>54600 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ><sZ>3 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy</settlement></placeName></affiliation></author><author><name sortKey="Song, Ye Qiong" sort="Song, Ye Qiong" uniqKey="Song Y" first="Ye-Qiong" last="Song">Ye-Qiong Song</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LORIA-INPL-UHP Nancy I, LORIA-TRIO 615, rue du Jardin Botanique</s1><s2>54600 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ><sZ>3 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy</settlement></placeName></affiliation></author><author><name sortKey="Thomesse, Jean Pierre" sort="Thomesse, Jean Pierre" uniqKey="Thomesse J" first="Jean-Pierre" last="Thomesse">Jean-Pierre Thomesse</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LORIA-INPL-UHP Nancy I, LORIA-TRIO 615, rue du Jardin Botanique</s1><s2>54600 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ><sZ>3 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy</settlement></placeName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="region" nuts="2">Lorraine (région)</region></placeName><orgName type="laboratoire" n="5">Laboratoire lorrain de recherche en informatique et ses applications</orgName><orgName type="university">Université de Lorraine</orgName><orgName type="institution">Centre national de la recherche scientifique</orgName><orgName type="institution">Institut national de recherche en informatique et en automatique</orgName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">06-0149163</idno><date when="2005">2005</date><idno type="stanalyst">PASCAL 06-0149163 INIST</idno><idno type="RBID">Pascal:06-0149163</idno><idno type="wicri:Area/PascalFrancis/Corpus">000464</idno><idno type="wicri:Area/PascalFrancis/Curation">000569</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000440</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000440</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="fr" level="a">(m,k)-WFQ, intégration des contraintes temporelles (m,k)-firm dans les réseaux à débit garanti</title><author><name sortKey="Koubaa, Anis" sort="Koubaa, Anis" uniqKey="Koubaa A" first="Anis" last="Koubaa">Anis Koubaa</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LORIA-INPL-UHP Nancy I, LORIA-TRIO 615, rue du Jardin Botanique</s1><s2>54600 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ><sZ>3 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy</settlement></placeName></affiliation></author><author><name sortKey="Song, Ye Qiong" sort="Song, Ye Qiong" uniqKey="Song Y" first="Ye-Qiong" last="Song">Ye-Qiong Song</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LORIA-INPL-UHP Nancy I, LORIA-TRIO 615, rue du Jardin Botanique</s1><s2>54600 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ><sZ>3 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy</settlement></placeName></affiliation></author><author><name sortKey="Thomesse, Jean Pierre" sort="Thomesse, Jean Pierre" uniqKey="Thomesse J" first="Jean-Pierre" last="Thomesse">Jean-Pierre Thomesse</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LORIA-INPL-UHP Nancy I, LORIA-TRIO 615, rue du Jardin Botanique</s1><s2>54600 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ><sZ>3 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy</settlement></placeName><placeName><settlement type="city">Nancy</settlement><region type="region" nuts="2">Grand Est</region><region type="region" nuts="2">Lorraine (région)</region></placeName><orgName type="laboratoire" n="5">Laboratoire lorrain de recherche en informatique et ses applications</orgName><orgName type="university">Université de Lorraine</orgName><orgName type="institution">Centre national de la recherche scientifique</orgName><orgName type="institution">Institut national de recherche en informatique et en automatique</orgName></affiliation></author></analytic><series><title level="j" type="main">TSI. Technique et science informatiques</title><title level="j" type="abbreviated">TSI, Tech. sci. inform.</title><idno type="ISSN">0752-4072</idno><imprint><date when="2005">2005</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">TSI. Technique et science informatiques</title><title level="j" type="abbreviated">TSI, Tech. sci. inform.</title><idno type="ISSN">0752-4072</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Bandwidth</term><term>Bounded delay</term><term>Deadline</term><term>Delay time</term><term>Deterministic approach</term><term>Equity</term><term>Firm</term><term>Flow rate</term><term>Processor scheduling</term><term>Real time</term><term>Real time system</term><term>Service quality</term><term>Temporal constraint</term><term>Upper bound</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Ordonnancement processeur</term><term>Système temps réel</term><term>Largeur bande</term><term>Temps réel</term><term>Entreprise</term><term>Qualité service</term><term>Débit</term><term>Equité</term><term>Retard borné</term><term>Date limite</term><term>Temps retard</term><term>Borne supérieure</term><term>Approche déterministe</term><term>Contrainte temporelle</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Entreprise</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Guaranteed-Rate (GR) servers, such as Weighted Fair Queueing (WFQ) and its variants, have been widely used to give mainly bandwidth guarantees and consequently delay guarantees for real-time flows provided that their arrivals are upper-bounded. Problems may arise if a bursty traffic with a small service share needs a specific short delay. In fact, the higher the service share is, the lower the delay the flow gets. However, WFQ and its variants are share-driven servers and no temporal constraint is considered in the scheduling process. Therefore, having in mind that many real-time applications could tolerate some deadline misses according to their (m,k)-firm constraints, we propose a new scheduling technique called (m,k)-WFQ which extends WFQ to also consider (m,k)-firm temporal requirement. Analytic expressions using Network Calculus theory are derived to give deterministic upper bound on delay provided by the (m,k)- WFQ scheduler.</div></front></TEI><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0752-4072</s0></fA01><fA02 i1="01"><s0>TTSIDJ</s0></fA02><fA03 i2="1"><s0>TSI, Tech. sci. inform.</s0></fA03><fA05><s2>24</s2></fA05><fA06><s2>8</s2></fA06><fA08 i1="01" i2="1" l="FRE"><s1>(m,k)-WFQ, intégration des contraintes temporelles (m,k)-firm dans les réseaux à débit garanti</s1></fA08><fA09 i1="01" i2="1" l="FRE"><s1>Ordonnancement pour les systèmes temps réel</s1></fA09><fA11 i1="01" i2="1"><s1>KOUBAA (Anis)</s1></fA11><fA11 i1="02" i2="1"><s1>SONG (Ye-Qiong)</s1></fA11><fA11 i1="03" i2="1"><s1>THOMESSE (Jean-Pierre)</s1></fA11><fA12 i1="01" i2="1"><s1>GOOSSENS (Joël)</s1><s9>ed.</s9></fA12><fA12 i1="02" i2="1"><s1>NAVET (Nicolas)</s1><s9>ed.</s9></fA12><fA14 i1="01"><s1>LORIA-INPL-UHP Nancy I, LORIA-TRIO 615, rue du Jardin Botanique</s1><s2>54600 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ><sZ>3 aut.</sZ></fA14><fA15 i1="01"><s1>Université Libre de Bruxelles</s1><s3>BEL</s3><sZ>1 aut.</sZ></fA15><fA15 i1="02"><s1>INRIA, laboratoire LORIA</s1><s2>Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></fA15><fA20><s1>1013-1046</s1></fA20><fA21><s1>2005</s1></fA21><fA23 i1="01"><s0>FRE</s0></fA23><fA24 i1="01"><s0>eng</s0></fA24><fA43 i1="01"><s1>INIST</s1><s2>19593</s2><s5>354000115113350050</s5></fA43><fA44><s0>0000</s0><s1>© 2006 INIST-CNRS. All rights reserved.</s1></fA44><fA45><s0>1 p.1/4</s0></fA45><fA47 i1="01" i2="1"><s0>06-0149163</s0></fA47><fA60><s1>P</s1></fA60><fA61><s0>A</s0></fA61><fA64 i1="01" i2="1"><s0>TSI. Technique et science informatiques</s0></fA64><fA66 i1="01"><s0>FRA</s0></fA66><fA68 i1="01" i2="1" l="ENG"><s1>(m,k)-WFQ integration of time constraints (m,k)-firm in the high rate networks</s1></fA68><fC01 i1="01" l="ENG"><s0>Guaranteed-Rate (GR) servers, such as Weighted Fair Queueing (WFQ) and its variants, have been widely used to give mainly bandwidth guarantees and consequently delay guarantees for real-time flows provided that their arrivals are upper-bounded. Problems may arise if a bursty traffic with a small service share needs a specific short delay. In fact, the higher the service share is, the lower the delay the flow gets. However, WFQ and its variants are share-driven servers and no temporal constraint is considered in the scheduling process. Therefore, having in mind that many real-time applications could tolerate some deadline misses according to their (m,k)-firm constraints, we propose a new scheduling technique called (m,k)-WFQ which extends WFQ to also consider (m,k)-firm temporal requirement. Analytic expressions using Network Calculus theory are derived to give deterministic upper bound on delay provided by the (m,k)- WFQ scheduler.</s0></fC01><fC02 i1="01" i2="X"><s0>001D02B09</s0></fC02><fC02 i1="02" i2="X"><s0>001D02A05</s0></fC02><fC03 i1="01" i2="3" l="FRE"><s0>Ordonnancement processeur</s0><s5>01</s5></fC03><fC03 i1="01" i2="3" l="ENG"><s0>Processor scheduling</s0><s5>01</s5></fC03><fC03 i1="02" i2="X" l="FRE"><s0>Système temps réel</s0><s5>02</s5></fC03><fC03 i1="02" i2="X" l="ENG"><s0>Real time system</s0><s5>02</s5></fC03><fC03 i1="02" i2="X" l="SPA"><s0>Sistema tiempo real</s0><s5>02</s5></fC03><fC03 i1="03" i2="X" l="FRE"><s0>Largeur bande</s0><s5>06</s5></fC03><fC03 i1="03" i2="X" l="ENG"><s0>Bandwidth</s0><s5>06</s5></fC03><fC03 i1="03" i2="X" l="SPA"><s0>Anchura banda</s0><s5>06</s5></fC03><fC03 i1="04" i2="X" l="FRE"><s0>Temps réel</s0><s5>07</s5></fC03><fC03 i1="04" i2="X" l="ENG"><s0>Real time</s0><s5>07</s5></fC03><fC03 i1="04" i2="X" l="SPA"><s0>Tiempo real</s0><s5>07</s5></fC03><fC03 i1="05" i2="X" l="FRE"><s0>Entreprise</s0><s5>08</s5></fC03><fC03 i1="05" i2="X" l="ENG"><s0>Firm</s0><s5>08</s5></fC03><fC03 i1="05" i2="X" l="SPA"><s0>Empresa</s0><s5>08</s5></fC03><fC03 i1="06" i2="X" l="FRE"><s0>Qualité service</s0><s5>09</s5></fC03><fC03 i1="06" i2="X" l="ENG"><s0>Service quality</s0><s5>09</s5></fC03><fC03 i1="06" i2="X" l="SPA"><s0>Calidad servicio</s0><s5>09</s5></fC03><fC03 i1="07" i2="X" l="FRE"><s0>Débit</s0><s5>18</s5></fC03><fC03 i1="07" i2="X" l="ENG"><s0>Flow rate</s0><s5>18</s5></fC03><fC03 i1="07" i2="X" l="SPA"><s0>Gasto</s0><s5>18</s5></fC03><fC03 i1="08" i2="X" l="FRE"><s0>Equité</s0><s5>19</s5></fC03><fC03 i1="08" i2="X" l="ENG"><s0>Equity</s0><s5>19</s5></fC03><fC03 i1="08" i2="X" l="SPA"><s0>Equidad</s0><s5>19</s5></fC03><fC03 i1="09" i2="X" l="FRE"><s0>Retard borné</s0><s5>20</s5></fC03><fC03 i1="09" i2="X" l="ENG"><s0>Bounded delay</s0><s5>20</s5></fC03><fC03 i1="09" i2="X" l="SPA"><s0>Retardo limitado</s0><s5>20</s5></fC03><fC03 i1="10" i2="X" l="FRE"><s0>Date limite</s0><s5>21</s5></fC03><fC03 i1="10" i2="X" l="ENG"><s0>Deadline</s0><s5>21</s5></fC03><fC03 i1="10" i2="X" l="SPA"><s0>Fechas últimas</s0><s5>21</s5></fC03><fC03 i1="11" i2="X" l="FRE"><s0>Temps retard</s0><s5>23</s5></fC03><fC03 i1="11" i2="X" l="ENG"><s0>Delay time</s0><s5>23</s5></fC03><fC03 i1="11" i2="X" l="SPA"><s0>Tiempo retardo</s0><s5>23</s5></fC03><fC03 i1="12" i2="X" l="FRE"><s0>Borne supérieure</s0><s5>24</s5></fC03><fC03 i1="12" i2="X" l="ENG"><s0>Upper bound</s0><s5>24</s5></fC03><fC03 i1="12" i2="X" l="SPA"><s0>Cota superior</s0><s5>24</s5></fC03><fC03 i1="13" i2="X" l="FRE"><s0>Approche déterministe</s0><s5>25</s5></fC03><fC03 i1="13" i2="X" l="ENG"><s0>Deterministic approach</s0><s5>25</s5></fC03><fC03 i1="13" i2="X" l="SPA"><s0>Enfoque determinista</s0><s5>25</s5></fC03><fC03 i1="14" i2="X" l="FRE"><s0>Contrainte temporelle</s0><s4>CD</s4><s5>96</s5></fC03><fC03 i1="14" i2="X" l="ENG"><s0>Temporal constraint</s0><s4>CD</s4><s5>96</s5></fC03><fC03 i1="14" i2="X" l="SPA"><s0>Constreñimiento temporal</s0><s4>CD</s4><s5>96</s5></fC03><fN21><s1>093</s1></fN21></pA></standard></inist><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li><li>Villers-lès-Nancy</li></settlement><orgName><li>Centre national de la recherche scientifique</li><li>Institut national de recherche en informatique et en automatique</li><li>Laboratoire lorrain de recherche en informatique et ses applications</li><li>Université de Lorraine</li></orgName></list><tree><country name="France"><region name="Grand Est"><name sortKey="Koubaa, Anis" sort="Koubaa, Anis" uniqKey="Koubaa A" first="Anis" last="Koubaa">Anis Koubaa</name></region><name sortKey="Song, Ye Qiong" sort="Song, Ye Qiong" uniqKey="Song Y" first="Ye-Qiong" last="Song">Ye-Qiong Song</name><name sortKey="Thomesse, Jean Pierre" sort="Thomesse, Jean Pierre" uniqKey="Thomesse J" first="Jean-Pierre" last="Thomesse">Jean-Pierre Thomesse</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000440 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000440 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Checkpoint
|type= RBID
|clé= Pascal:06-0149163
|texte= (m,k)-WFQ, intégration des contraintes temporelles (m,k)-firm dans les réseaux à débit garanti
}}
| This area was generated with Dilib version V0.6.33. |  |