Loss-tolerant QoS using firm constraints in guaranteed rate networks
Identifieur interne : 007029 ( Main/Merge ); précédent : 007028; suivant : 007030Loss-tolerant QoS using firm constraints in guaranteed rate networks
Auteurs : Anis Koubaa [France] ; Ye-Qiong Song [France]Source :
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Entreprise.
English descriptors
- KwdEn :
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.
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000491
- to stream PascalFrancis, to step Curation: 000542
- to stream PascalFrancis, to step Checkpoint: 000594
Links to Exploration step
Pascal:06-0023804Le 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 wicri:level="1"><inist:fA14 i1="01"><s1>LORIA Research Laboratory National Polytechnic Institute of Lorraine</s1><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>LORIA Research Laboratory National Polytechnic Institute of Lorraine</wicri:noRegion><wicri:noRegion>LORIA Research Laboratory National Polytechnic Institute of Lorraine</wicri:noRegion></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="02"><s1>LORIA Research Laboratory Henri Poincaré University</s1><s2>Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></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><idno type="wicri:Area/PascalFrancis/Curation">000542</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000594</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000594</idno><idno type="wicri:Area/Main/Merge">007029</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 wicri:level="1"><inist:fA14 i1="01"><s1>LORIA Research Laboratory National Polytechnic Institute of Lorraine</s1><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>LORIA Research Laboratory National Polytechnic Institute of Lorraine</wicri:noRegion><wicri:noRegion>LORIA Research Laboratory National Polytechnic Institute of Lorraine</wicri:noRegion></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="02"><s1>LORIA Research Laboratory Henri Poincaré University</s1><s2>Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><placeName><region type="region">Grand Est</region><region type="old region">Lorraine (région)</region><settlement type="city">Nancy</settlement></placeName></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><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Entreprise</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><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li></settlement></list><tree><country name="France"><noRegion><name sortKey="Koubaa, Anis" sort="Koubaa, Anis" uniqKey="Koubaa A" first="Anis" last="Koubaa">Anis Koubaa</name></noRegion><name sortKey="Song, Ye Qiong" sort="Song, Ye Qiong" uniqKey="Song Y" first="Ye-Qiong" last="Song">Ye-Qiong Song</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 007029 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 007029 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|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. |  |