InforLorV4, PascalFrancis, Corpus, bibRecord, 000464

(m,k)-WFQ, intégration des contraintes temporelles (m,k)-firm dans les réseaux à débit garanti

Identifieur interne : 000464 ( PascalFrancis/Corpus ); précédent : 000463; suivant : 000465

(m,k)-WFQ, intégration des contraintes temporelles (m,k)-firm dans les réseaux à débit garanti

Auteurs : Anis Koubaa ; Ye-Qiong Song ; Jean-Pierre Thomesse

Source :

TSI. Technique et science informatiques [ 0752-4072 ] ; 2005.

RBID : Pascal:06-0149163

Descripteurs français

Pascal (Inist)
- Ordonnancement processeur, Système temps réel, Largeur bande, Temps réel, Entreprise, Qualité service, Débit, Equité, Retard borné, Date limite, Temps retard, Borne supérieure, Approche déterministe, Contrainte temporelle.

English descriptors

KwdEn :
- Bandwidth, Bounded delay, Deadline, Delay time, Deterministic approach, Equity, Firm, Flow rate, Processor scheduling, Real time, Real time system, Service quality, Temporal constraint, Upper bound.

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.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0752-4072`
A02	`01`			`@0 TTSIDJ`
A03		`1`		`@0 TSI, Tech. sci. inform.`
A05				`@2 24`
A06				`@2 8`
A08	`01`	`1`	`FRE`	`@1 (m,k)-WFQ, intégration des contraintes temporelles (m,k)-firm dans les réseaux à débit garanti`
A09	`01`	`1`	`FRE`	`@1 Ordonnancement pour les systèmes temps réel`
A11	`01`	`1`		`@1 KOUBAA (Anis)`
A11	`02`	`1`		`@1 SONG (Ye-Qiong)`
A11	`03`	`1`		`@1 THOMESSE (Jean-Pierre)`
A12	`01`	`1`		`@1 GOOSSENS (Joël) @9 ed.`
A12	`02`	`1`		`@1 NAVET (Nicolas) @9 ed.`
A14	`01`			`@1 LORIA-INPL-UHP Nancy I, LORIA-TRIO 615, rue du Jardin Botanique @2 54600 Villers-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut.`
A15	`01`			`@1 Université Libre de Bruxelles @3 BEL @Z 1 aut.`
A15	`02`			`@1 INRIA, laboratoire LORIA @2 Nancy @3 FRA @Z 2 aut.`
A20				`@1 1013-1046`
A21				`@1 2005`
A23	`01`			`@0 FRE`
A24	`01`			`@0 eng`
A43	`01`			`@1 INIST @2 19593 @5 354000115113350050`
A44				`@0 0000 @1 © 2006 INIST-CNRS. All rights reserved.`
A45				`@0 1 p.1/4`
A47	`01`	`1`		`@0 06-0149163`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 TSI. Technique et science informatiques`
A66	`01`			`@0 FRA`
A68	`01`	`1`	`ENG`	`@1 (m,k)-WFQ integration of time constraints (m,k)-firm in the high rate networks`
C01	`01`		`ENG`	@0 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.
C02	`01`	`X`		`@0 001D02B09`
C02	`02`	`X`		`@0 001D02A05`
C03	`01`	`3`	`FRE`	`@0 Ordonnancement processeur @5 01`
C03	`01`	`3`	`ENG`	`@0 Processor scheduling @5 01`
C03	`02`	`X`	`FRE`	`@0 Système temps réel @5 02`
C03	`02`	`X`	`ENG`	`@0 Real time system @5 02`
C03	`02`	`X`	`SPA`	`@0 Sistema tiempo real @5 02`
C03	`03`	`X`	`FRE`	`@0 Largeur bande @5 06`
C03	`03`	`X`	`ENG`	`@0 Bandwidth @5 06`
C03	`03`	`X`	`SPA`	`@0 Anchura banda @5 06`
C03	`04`	`X`	`FRE`	`@0 Temps réel @5 07`
C03	`04`	`X`	`ENG`	`@0 Real time @5 07`
C03	`04`	`X`	`SPA`	`@0 Tiempo real @5 07`
C03	`05`	`X`	`FRE`	`@0 Entreprise @5 08`
C03	`05`	`X`	`ENG`	`@0 Firm @5 08`
C03	`05`	`X`	`SPA`	`@0 Empresa @5 08`
C03	`06`	`X`	`FRE`	`@0 Qualité service @5 09`
C03	`06`	`X`	`ENG`	`@0 Service quality @5 09`
C03	`06`	`X`	`SPA`	`@0 Calidad servicio @5 09`
C03	`07`	`X`	`FRE`	`@0 Débit @5 18`
C03	`07`	`X`	`ENG`	`@0 Flow rate @5 18`
C03	`07`	`X`	`SPA`	`@0 Gasto @5 18`
C03	`08`	`X`	`FRE`	`@0 Equité @5 19`
C03	`08`	`X`	`ENG`	`@0 Equity @5 19`
C03	`08`	`X`	`SPA`	`@0 Equidad @5 19`
C03	`09`	`X`	`FRE`	`@0 Retard borné @5 20`
C03	`09`	`X`	`ENG`	`@0 Bounded delay @5 20`
C03	`09`	`X`	`SPA`	`@0 Retardo limitado @5 20`
C03	`10`	`X`	`FRE`	`@0 Date limite @5 21`
C03	`10`	`X`	`ENG`	`@0 Deadline @5 21`
C03	`10`	`X`	`SPA`	`@0 Fechas últimas @5 21`
C03	`11`	`X`	`FRE`	`@0 Temps retard @5 23`
C03	`11`	`X`	`ENG`	`@0 Delay time @5 23`
C03	`11`	`X`	`SPA`	`@0 Tiempo retardo @5 23`
C03	`12`	`X`	`FRE`	`@0 Borne supérieure @5 24`
C03	`12`	`X`	`ENG`	`@0 Upper bound @5 24`
C03	`12`	`X`	`SPA`	`@0 Cota superior @5 24`
C03	`13`	`X`	`FRE`	`@0 Approche déterministe @5 25`
C03	`13`	`X`	`ENG`	`@0 Deterministic approach @5 25`
C03	`13`	`X`	`SPA`	`@0 Enfoque determinista @5 25`
C03	`14`	`X`	`FRE`	`@0 Contrainte temporelle @4 CD @5 96`
C03	`14`	`X`	`ENG`	`@0 Temporal constraint @4 CD @5 96`
C03	`14`	`X`	`SPA`	`@0 Constreñimiento temporal @4 CD @5 96`
N21				`@1 093`

Format Inist (serveur)

NO :	PASCAL 06-0149163 INIST
FT :	(m,k)-WFQ, intégration des contraintes temporelles (m,k)-firm dans les réseaux à débit garanti
ET :	((m,k)-WFQ integration of time constraints (m,k)-firm in the high rate networks)
AU :	KOUBAA (Anis); SONG (Ye-Qiong); THOMESSE (Jean-Pierre); GOOSSENS (Joël); NAVET (Nicolas)
AF :	LORIA-INPL-UHP Nancy I, LORIA-TRIO 615, rue du Jardin Botanique/54600 Villers-lès-Nancy/France (1 aut., 2 aut., 3 aut.); Université Libre de Bruxelles/Belgique (1 aut.); INRIA, laboratoire LORIA/Nancy/France (2 aut.)
DT :	Publication en série; Niveau analytique
SO :	TSI. Technique et science informatiques; ISSN 0752-4072; Coden TTSIDJ; France; Da. 2005; Vol. 24; No. 8; Pp. 1013-1046; Abs. anglais; Bibl. 1 p.1/4
LA :	Français
EA :	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.
CC :	001D02B09; 001D02A05
FD :	Ordonnancement processeur; Système temps réel; Largeur bande; Temps réel; Entreprise; Qualité service; Débit; Equité; Retard borné; Date limite; Temps retard; Borne supérieure; Approche déterministe; Contrainte temporelle
ED :	Processor scheduling; Real time system; Bandwidth; Real time; Firm; Service quality; Flow rate; Equity; Bounded delay; Deadline; Delay time; Upper bound; Deterministic approach; Temporal constraint
SD :	Sistema tiempo real; Anchura banda; Tiempo real; Empresa; Calidad servicio; Gasto; Equidad; Retardo limitado; Fechas últimas; Tiempo retardo; Cota superior; Enfoque determinista; Constreñimiento temporal
LO :	INIST-19593.354000115113350050
ID :	06-0149163

Links to Exploration step

Pascal:06-0149163

Le 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><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>
</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><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>
</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><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>
</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>
</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><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>
</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><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>
</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><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>
</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>
</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>
<server><NO>PASCAL 06-0149163 INIST</NO>
<FT>(m,k)-WFQ, intégration des contraintes temporelles (m,k)-firm dans les réseaux à débit garanti</FT>
<ET>((m,k)-WFQ integration of time constraints (m,k)-firm in the high rate networks)</ET>
<AU>KOUBAA (Anis); SONG (Ye-Qiong); THOMESSE (Jean-Pierre); GOOSSENS (Joël); NAVET (Nicolas)</AU>
<AF>LORIA-INPL-UHP Nancy I, LORIA-TRIO 615, rue du Jardin Botanique/54600 Villers-lès-Nancy/France (1 aut., 2 aut., 3 aut.); Université Libre de Bruxelles/Belgique (1 aut.); INRIA, laboratoire LORIA/Nancy/France (2 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>TSI. Technique et science informatiques; ISSN 0752-4072; Coden TTSIDJ; France; Da. 2005; Vol. 24; No. 8; Pp. 1013-1046; Abs. anglais; Bibl. 1 p.1/4</SO>
<LA>Français</LA>
<EA>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.</EA>
<CC>001D02B09; 001D02A05</CC>
<FD>Ordonnancement processeur; Système temps réel; Largeur bande; Temps réel; Entreprise; Qualité service; Débit; Equité; Retard borné; Date limite; Temps retard; Borne supérieure; Approche déterministe; Contrainte temporelle</FD>
<ED>Processor scheduling; Real time system; Bandwidth; Real time; Firm; Service quality; Flow rate; Equity; Bounded delay; Deadline; Delay time; Upper bound; Deterministic approach; Temporal constraint</ED>
<SD>Sistema tiempo real; Anchura banda; Tiempo real; Empresa; Calidad servicio; Gasto; Equidad; Retardo limitado; Fechas últimas; Tiempo retardo; Cota superior; Enfoque determinista; Constreñimiento temporal</SD>
<LO>INIST-19593.354000115113350050</LO>
<ID>06-0149163</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000464 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000464 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |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.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

(m,k)-WFQ, intégration des contraintes temporelles (m,k)-firm dans les réseaux à débit garanti

(m,k)-WFQ, intégration des contraintes temporelles (m,k)-firm dans les réseaux à débit garanti

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri