InforLorV4, PascalFrancis, Corpus, bibRecord, 000491

Loss-tolerant QoS using firm constraints in guaranteed rate networks

Identifieur interne : 000491 ( PascalFrancis/Corpus ); précédent : 000490; suivant : 000492

Loss-tolerant QoS using firm constraints in guaranteed rate networks

Auteurs : Anis Koubaa ; Ye-Qiong Song

Source :

RBID : Pascal:06-0023804

Descripteurs français

Pascal (Inist)
- Calculateur embarqué, Système temps réel, Qualité service, Entreprise, Temps réel, Largeur bande, Surcharge, Perte transmission, Système temporisé, Retard borné, Equité, Approche déterministe, Borne supérieure.

English descriptors

KwdEn :
- Bandwidth, Boarded computer, Bounded delay, Deterministic approach, Equity, Firm, Overload, Real time, Real time system, Service quality, Timed system, Transmission loss, Upper bound.

Abstract

We propose in this paper a trade-off between hard and soft real-time guarantees to maintain an acceptable QoS guarantee in overload condition and maximize efficiently the utilization of network resources. The key of our solution is that many real-time applications are loss-tolerant, but the loss profile must be well defined since successive packet losses are not suitable. We use the concept of(m,k)-firm timing constraints to define a novel guaranteed loss-tolerant QoS. Therefore, we extend the basic WFQ algorithm to take into account the firm timing constraints to provide lower delay guarantees without violating bandwidth fairness or misusing network resources. The proposal is called (m,k)-WFQ. Using Network Calculus formalism, analytic study gives the deterministic delay bound provided by the (m,k)-WFQ algorithm for upper bounded arrival curve traffic. Theoretical results and simulations show a noticeable improvement on delay guarantee made by (m,k)-WFQ compared to standard WFQ algorithm without much degrading bandwidth fairness.

Notice en format standard (ISO 2709)

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

A08	`01`	`1`	`ENG`	`@1 Loss-tolerant QoS using firm constraints in guaranteed rate networks`
A09	`01`	`1`	`ENG`	`@1 RTAS 2004 : 10th IEEE real-time and embedded technology and applications symposium : 25-28 May 2004, Toronto, Canada`
A11	`01`	`1`		`@1 KOUBAA (Anis)`
A11	`02`	`1`		`@1 SONG (Ye-Qiong)`
A14	`01`			`@1 LORIA Research Laboratory National Polytechnic Institute of Lorraine @3 FRA @Z 1 aut.`
A14	`02`			`@1 LORIA Research Laboratory Henri Poincaré University @2 Nancy @3 FRA @Z 2 aut.`
A18	`01`	`1`		`@1 IEEE Computer Society. Technical Committee on Real-Time Systems @3 USA @9 ed.`
A20				`@1 526-533`
A21				`@1 2004`
A23	`01`			`@0 ENG`
A25	`01`			`@1 IEEE Computer Society @2 Los Alamitos CA`
A26	`01`			`@0 0-7695-2148-7`
A30	`01`	`1`	`ENG`	`@1 IEEE real-time and embedded technology and applications symposium @2 10 @3 Toronto ON CAN @4 2004-05-25`
A43	`01`			`@1 INIST @2 Y 38570 @5 354000124514650580`
A44				`@0 0000 @1 © 2006 INIST-CNRS. All rights reserved.`
A45				`@0 20 ref.`
A47	`01`	`1`		`@0 06-0023804`
A60				`@1 C`
A61				`@0 A`
A66	`01`			`@0 USA`
C01	`01`		`ENG`	@0 We propose in this paper a trade-off between hard and soft real-time guarantees to maintain an acceptable QoS guarantee in overload condition and maximize efficiently the utilization of network resources. The key of our solution is that many real-time applications are loss-tolerant, but the loss profile must be well defined since successive packet losses are not suitable. We use the concept of(m,k)-firm timing constraints to define a novel guaranteed loss-tolerant QoS. Therefore, we extend the basic WFQ algorithm to take into account the firm timing constraints to provide lower delay guarantees without violating bandwidth fairness or misusing network resources. The proposal is called (m,k)-WFQ. Using Network Calculus formalism, analytic study gives the deterministic delay bound provided by the (m,k)-WFQ algorithm for upper bounded arrival curve traffic. Theoretical results and simulations show a noticeable improvement on delay guarantee made by (m,k)-WFQ compared to standard WFQ algorithm without much degrading bandwidth fairness.
C02	`01`	`X`		`@0 001D02`
C03	`01`	`X`	`FRE`	`@0 Calculateur embarqué @5 01`
C03	`01`	`X`	`ENG`	`@0 Boarded computer @5 01`
C03	`01`	`X`	`SPA`	`@0 Calculador embarque @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 Qualité service @5 06`
C03	`03`	`X`	`ENG`	`@0 Service quality @5 06`
C03	`03`	`X`	`SPA`	`@0 Calidad servicio @5 06`
C03	`04`	`X`	`FRE`	`@0 Entreprise @5 07`
C03	`04`	`X`	`ENG`	`@0 Firm @5 07`
C03	`04`	`X`	`SPA`	`@0 Empresa @5 07`
C03	`05`	`X`	`FRE`	`@0 Temps réel @5 08`
C03	`05`	`X`	`ENG`	`@0 Real time @5 08`
C03	`05`	`X`	`SPA`	`@0 Tiempo real @5 08`
C03	`06`	`X`	`FRE`	`@0 Largeur bande @5 09`
C03	`06`	`X`	`ENG`	`@0 Bandwidth @5 09`
C03	`06`	`X`	`SPA`	`@0 Anchura banda @5 09`
C03	`07`	`X`	`FRE`	`@0 Surcharge @5 18`
C03	`07`	`X`	`ENG`	`@0 Overload @5 18`
C03	`07`	`X`	`SPA`	`@0 Sobrecarga @5 18`
C03	`08`	`X`	`FRE`	`@0 Perte transmission @5 19`
C03	`08`	`X`	`ENG`	`@0 Transmission loss @5 19`
C03	`08`	`X`	`SPA`	`@0 Pérdida transmisión @5 19`
C03	`09`	`X`	`FRE`	`@0 Système temporisé @5 20`
C03	`09`	`X`	`ENG`	`@0 Timed system @5 20`
C03	`09`	`X`	`SPA`	`@0 Sistema temporizado @5 20`
C03	`10`	`X`	`FRE`	`@0 Retard borné @5 21`
C03	`10`	`X`	`ENG`	`@0 Bounded delay @5 21`
C03	`10`	`X`	`SPA`	`@0 Retardo limitado @5 21`
C03	`11`	`X`	`FRE`	`@0 Equité @5 22`
C03	`11`	`X`	`ENG`	`@0 Equity @5 22`
C03	`11`	`X`	`SPA`	`@0 Equidad @5 22`
C03	`12`	`X`	`FRE`	`@0 Approche déterministe @5 23`
C03	`12`	`X`	`ENG`	`@0 Deterministic approach @5 23`
C03	`12`	`X`	`SPA`	`@0 Enfoque determinista @5 23`
C03	`13`	`X`	`FRE`	`@0 Borne supérieure @5 24`
C03	`13`	`X`	`ENG`	`@0 Upper bound @5 24`
C03	`13`	`X`	`SPA`	`@0 Cota superior @5 24`
N21				`@1 009`
N44	`01`			`@1 OTO`
N82				`@1 OTO`

Format Inist (serveur)

NO :	PASCAL 06-0023804 INIST
ET :	Loss-tolerant QoS using firm constraints in guaranteed rate networks
AU :	KOUBAA (Anis); SONG (Ye-Qiong)
AF :	LORIA Research Laboratory National Polytechnic Institute of Lorraine/France (1 aut.); LORIA Research Laboratory Henri Poincaré University/Nancy/France (2 aut.)
DT :	Congrès; Niveau analytique
SO :	IEEE real-time and embedded technology and applications symposium/10/2004-05-25/Toronto ON CAN; Etats-Unis; Los Alamitos CA: IEEE Computer Society; Da. 2004; Pp. 526-533; ISBN 0-7695-2148-7
LA :	Anglais
EA :	We propose in this paper a trade-off between hard and soft real-time guarantees to maintain an acceptable QoS guarantee in overload condition and maximize efficiently the utilization of network resources. The key of our solution is that many real-time applications are loss-tolerant, but the loss profile must be well defined since successive packet losses are not suitable. We use the concept of(m,k)-firm timing constraints to define a novel guaranteed loss-tolerant QoS. Therefore, we extend the basic WFQ algorithm to take into account the firm timing constraints to provide lower delay guarantees without violating bandwidth fairness or misusing network resources. The proposal is called (m,k)-WFQ. Using Network Calculus formalism, analytic study gives the deterministic delay bound provided by the (m,k)-WFQ algorithm for upper bounded arrival curve traffic. Theoretical results and simulations show a noticeable improvement on delay guarantee made by (m,k)-WFQ compared to standard WFQ algorithm without much degrading bandwidth fairness.
CC :	001D02
FD :	Calculateur embarqué; Système temps réel; Qualité service; Entreprise; Temps réel; Largeur bande; Surcharge; Perte transmission; Système temporisé; Retard borné; Equité; Approche déterministe; Borne supérieure
ED :	Boarded computer; Real time system; Service quality; Firm; Real time; Bandwidth; Overload; Transmission loss; Timed system; Bounded delay; Equity; Deterministic approach; Upper bound
SD :	Calculador embarque; Sistema tiempo real; Calidad servicio; Empresa; Tiempo real; Anchura banda; Sobrecarga; Pérdida transmisión; Sistema temporizado; Retardo limitado; Equidad; Enfoque determinista; Cota superior
LO :	INIST-Y 38570.354000124514650580
ID :	06-0023804

Links to Exploration step

Pascal:06-0023804

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Loss-tolerant QoS using firm constraints in guaranteed rate networks</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 Research Laboratory National Polytechnic Institute of Lorraine</s1>
<s3>FRA</s3>
<sZ>1 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="02"><s1>LORIA Research Laboratory Henri Poincaré University</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">06-0023804</idno>
<date when="2004">2004</date>
<idno type="stanalyst">PASCAL 06-0023804 INIST</idno>
<idno type="RBID">Pascal:06-0023804</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000491</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Loss-tolerant QoS using firm constraints in guaranteed rate networks</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 Research Laboratory National Polytechnic Institute of Lorraine</s1>
<s3>FRA</s3>
<sZ>1 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="02"><s1>LORIA Research Laboratory Henri Poincaré University</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Bandwidth</term>
<term>Boarded computer</term>
<term>Bounded delay</term>
<term>Deterministic approach</term>
<term>Equity</term>
<term>Firm</term>
<term>Overload</term>
<term>Real time</term>
<term>Real time system</term>
<term>Service quality</term>
<term>Timed system</term>
<term>Transmission loss</term>
<term>Upper bound</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Calculateur embarqué</term>
<term>Système temps réel</term>
<term>Qualité service</term>
<term>Entreprise</term>
<term>Temps réel</term>
<term>Largeur bande</term>
<term>Surcharge</term>
<term>Perte transmission</term>
<term>Système temporisé</term>
<term>Retard borné</term>
<term>Equité</term>
<term>Approche déterministe</term>
<term>Borne supérieure</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We propose in this paper a trade-off between hard and soft real-time guarantees to maintain an acceptable QoS guarantee in overload condition and maximize efficiently the utilization of network resources. The key of our solution is that many real-time applications are loss-tolerant, but the loss profile must be well defined since successive packet losses are not suitable. We use the concept of(m,k)-firm timing constraints to define a novel guaranteed loss-tolerant QoS. Therefore, we extend the basic WFQ algorithm to take into account the firm timing constraints to provide lower delay guarantees without violating bandwidth fairness or misusing network resources. The proposal is called (m,k)-WFQ. Using Network Calculus formalism, analytic study gives the deterministic delay bound provided by the (m,k)-WFQ algorithm for upper bounded arrival curve traffic. Theoretical results and simulations show a noticeable improvement on delay guarantee made by (m,k)-WFQ compared to standard WFQ algorithm without much degrading bandwidth fairness.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA08 i1="01" i2="1" l="ENG"><s1>Loss-tolerant QoS using firm constraints in guaranteed rate networks</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>RTAS 2004 : 10th IEEE real-time and embedded technology and applications symposium : 25-28 May 2004, Toronto, Canada</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>KOUBAA (Anis)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>SONG (Ye-Qiong)</s1>
</fA11>
<fA14 i1="01"><s1>LORIA Research Laboratory National Polytechnic Institute of Lorraine</s1>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>LORIA Research Laboratory Henri Poincaré University</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA18 i1="01" i2="1"><s1>IEEE Computer Society. Technical Committee on Real-Time Systems</s1>
<s3>USA</s3>
<s9>ed.</s9>
</fA18>
<fA20><s1>526-533</s1>
</fA20>
<fA21><s1>2004</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA25 i1="01"><s1>IEEE Computer Society</s1>
<s2>Los Alamitos CA</s2>
</fA25>
<fA26 i1="01"><s0>0-7695-2148-7</s0>
</fA26>
<fA30 i1="01" i2="1" l="ENG"><s1>IEEE real-time and embedded technology and applications symposium</s1>
<s2>10</s2>
<s3>Toronto ON CAN</s3>
<s4>2004-05-25</s4>
</fA30>
<fA43 i1="01"><s1>INIST</s1>
<s2>Y 38570</s2>
<s5>354000124514650580</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2006 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>20 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>06-0023804</s0>
</fA47>
<fA60><s1>C</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA66 i1="01"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We propose in this paper a trade-off between hard and soft real-time guarantees to maintain an acceptable QoS guarantee in overload condition and maximize efficiently the utilization of network resources. The key of our solution is that many real-time applications are loss-tolerant, but the loss profile must be well defined since successive packet losses are not suitable. We use the concept of(m,k)-firm timing constraints to define a novel guaranteed loss-tolerant QoS. Therefore, we extend the basic WFQ algorithm to take into account the firm timing constraints to provide lower delay guarantees without violating bandwidth fairness or misusing network resources. The proposal is called (m,k)-WFQ. Using Network Calculus formalism, analytic study gives the deterministic delay bound provided by the (m,k)-WFQ algorithm for upper bounded arrival curve traffic. Theoretical results and simulations show a noticeable improvement on delay guarantee made by (m,k)-WFQ compared to standard WFQ algorithm without much degrading bandwidth fairness.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Calculateur embarqué</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Boarded computer</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Calculador embarque</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>Qualité service</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Service quality</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Calidad servicio</s0>
<s5>06</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Entreprise</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Firm</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Empresa</s0>
<s5>07</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Temps réel</s0>
<s5>08</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Real time</s0>
<s5>08</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Tiempo real</s0>
<s5>08</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Largeur bande</s0>
<s5>09</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Bandwidth</s0>
<s5>09</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Anchura banda</s0>
<s5>09</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Surcharge</s0>
<s5>18</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Overload</s0>
<s5>18</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Sobrecarga</s0>
<s5>18</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Perte transmission</s0>
<s5>19</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Transmission loss</s0>
<s5>19</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Pérdida transmisión</s0>
<s5>19</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Système temporisé</s0>
<s5>20</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Timed system</s0>
<s5>20</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Sistema temporizado</s0>
<s5>20</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Retard borné</s0>
<s5>21</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Bounded delay</s0>
<s5>21</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Retardo limitado</s0>
<s5>21</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Equité</s0>
<s5>22</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Equity</s0>
<s5>22</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Equidad</s0>
<s5>22</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Approche déterministe</s0>
<s5>23</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Deterministic approach</s0>
<s5>23</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA"><s0>Enfoque determinista</s0>
<s5>23</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Borne supérieure</s0>
<s5>24</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Upper bound</s0>
<s5>24</s5>
</fC03>
<fC03 i1="13" i2="X" l="SPA"><s0>Cota superior</s0>
<s5>24</s5>
</fC03>
<fN21><s1>009</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 06-0023804 INIST</NO>
<ET>Loss-tolerant QoS using firm constraints in guaranteed rate networks</ET>
<AU>KOUBAA (Anis); SONG (Ye-Qiong)</AU>
<AF>LORIA Research Laboratory National Polytechnic Institute of Lorraine/France (1 aut.); LORIA Research Laboratory Henri Poincaré University/Nancy/France (2 aut.)</AF>
<DT>Congrès; Niveau analytique</DT>
<SO>IEEE real-time and embedded technology and applications symposium/10/2004-05-25/Toronto ON CAN; Etats-Unis; Los Alamitos CA: IEEE Computer Society; Da. 2004; Pp. 526-533; ISBN 0-7695-2148-7</SO>
<LA>Anglais</LA>
<EA>We propose in this paper a trade-off between hard and soft real-time guarantees to maintain an acceptable QoS guarantee in overload condition and maximize efficiently the utilization of network resources. The key of our solution is that many real-time applications are loss-tolerant, but the loss profile must be well defined since successive packet losses are not suitable. We use the concept of(m,k)-firm timing constraints to define a novel guaranteed loss-tolerant QoS. Therefore, we extend the basic WFQ algorithm to take into account the firm timing constraints to provide lower delay guarantees without violating bandwidth fairness or misusing network resources. The proposal is called (m,k)-WFQ. Using Network Calculus formalism, analytic study gives the deterministic delay bound provided by the (m,k)-WFQ algorithm for upper bounded arrival curve traffic. Theoretical results and simulations show a noticeable improvement on delay guarantee made by (m,k)-WFQ compared to standard WFQ algorithm without much degrading bandwidth fairness.</EA>
<CC>001D02</CC>
<FD>Calculateur embarqué; Système temps réel; Qualité service; Entreprise; Temps réel; Largeur bande; Surcharge; Perte transmission; Système temporisé; Retard borné; Equité; Approche déterministe; Borne supérieure</FD>
<ED>Boarded computer; Real time system; Service quality; Firm; Real time; Bandwidth; Overload; Transmission loss; Timed system; Bounded delay; Equity; Deterministic approach; Upper bound</ED>
<SD>Calculador embarque; Sistema tiempo real; Calidad servicio; Empresa; Tiempo real; Anchura banda; Sobrecarga; Pérdida transmisión; Sistema temporizado; Retardo limitado; Equidad; Enfoque determinista; Cota superior</SD>
<LO>INIST-Y 38570.354000124514650580</LO>
<ID>06-0023804</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 000491 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000491 | 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-0023804
   |texte=   Loss-tolerant QoS using firm constraints in guaranteed rate networks
}}

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

Loss-tolerant QoS using firm constraints in guaranteed rate networks

Loss-tolerant QoS using firm constraints in guaranteed rate networks

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