Graceful degradation of loss-tolerant QoS using (m,k)-finn constraints in guaranteed rate networks
Identifieur interne : 006629 ( Main/Merge ); précédent : 006628; suivant : 006630Graceful degradation of loss-tolerant QoS using (m,k)-finn constraints in guaranteed rate networks
Auteurs : Anis Koubaa [France] ; Ye-Qiong Song [France]Source :
- Computer communications [ 0140-3664 ] ; 2005.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Garantie.
English descriptors
- KwdEn :
Abstract
The Weighted Fair Queueing (WFQ) scheduling algorithm and its variants can be used to provide real-time guarantees by making bandwidth reservation. However, while hard guarantees are based on a peak workload model that leads to underutilize network resources, soft guarantees, based on average workload model, are not always sufficient to maintain acceptable Quality-of-Service (QoS) since consecutive packet losses or deadline misses may occur, which are not suitable for real-time applications. In this paper, we propose a trade-off between hard and soft real-time guarantees to maintain an acceptable QoS in overload conditions and efficiently maximize the utilization of network resources. The key to our solution is based on the fact that many real-time applications, such as voice and video, are loss-tolerant. The loss profile must be well defined, and such a profile can be easily specified using the (m,k)-firm model. Therefore, we propose the (m,k)-WFQ algorithm to take into account (m,A-)-firm timing constraints to provide delay guarantees of at least in packets out of any k consecutive packets without violating bandwidth fairness or misusing network resources. Using the Network Calculus theory, an analytic study gives the deterministic delay bound provided by the (m,k)-WFQ algorithm for upper bounded arrival curve traffic. We extend our analytic results for guaranteed-rate networks, such as the IntServ QoS model and ATM networks, and the DiffServ QoS model. Analytic results and simulations show a noticeable improvement in delay guarantee made by (m,k)-WFQ compared to WFQ without much degradation of bandwidth faimess.
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000528
- to stream PascalFrancis, to step Curation: 000510
- to stream PascalFrancis, to step Checkpoint: 000492
Links to Exploration step
Pascal:05-0385323Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Graceful degradation of loss-tolerant QoS using (m,k)-finn 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="3"><inist:fA14 i1="01"><s1>LORIA-TRIO-INPL, Computer Science, 615, rue du jardin botanique</s1><s2>Villers Les Nancy 54602</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 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></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-TRIO-INPL, Computer Science, 615, rue du jardin botanique</s1><s2>Villers Les Nancy 54602</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 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></placeName></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">05-0385323</idno><date when="2005">2005</date><idno type="stanalyst">PASCAL 05-0385323 INIST</idno><idno type="RBID">Pascal:05-0385323</idno><idno type="wicri:Area/PascalFrancis/Corpus">000528</idno><idno type="wicri:Area/PascalFrancis/Curation">000510</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000492</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000492</idno><idno type="wicri:doubleKey">0140-3664:2005:Koubaa A:graceful:degradation:of</idno><idno type="wicri:Area/Main/Merge">006629</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Graceful degradation of loss-tolerant QoS using (m,k)-finn 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="3"><inist:fA14 i1="01"><s1>LORIA-TRIO-INPL, Computer Science, 615, rue du jardin botanique</s1><s2>Villers Les Nancy 54602</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 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></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-TRIO-INPL, Computer Science, 615, rue du jardin botanique</s1><s2>Villers Les Nancy 54602</s2><s3>FRA</s3><sZ>1 aut.</sZ><sZ>2 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></placeName></affiliation></author></analytic><series><title level="j" type="main">Computer communications</title><title level="j" type="abbreviated">Comput. commun.</title><idno type="ISSN">0140-3664</idno><imprint><date when="2005">2005</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Computer communications</title><title level="j" type="abbreviated">Comput. commun.</title><idno type="ISSN">0140-3664</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>ATM network</term><term>Bandwidth</term><term>Guarantee</term><term>Service quality</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Qualité service</term><term>Largeur bande</term><term>Garantie</term><term>Réseau ATM</term><term>Calcul réseau</term><term>Weighted fair queuing</term><term>(m,k) firm guarantee</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Garantie</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The Weighted Fair Queueing (WFQ) scheduling algorithm and its variants can be used to provide real-time guarantees by making bandwidth reservation. However, while hard guarantees are based on a peak workload model that leads to underutilize network resources, soft guarantees, based on average workload model, are not always sufficient to maintain acceptable Quality-of-Service (QoS) since consecutive packet losses or deadline misses may occur, which are not suitable for real-time applications. In this paper, we propose a trade-off between hard and soft real-time guarantees to maintain an acceptable QoS in overload conditions and efficiently maximize the utilization of network resources. The key to our solution is based on the fact that many real-time applications, such as voice and video, are loss-tolerant. The loss profile must be well defined, and such a profile can be easily specified using the (m,k)-firm model. Therefore, we propose the (m,k)-WFQ algorithm to take into account (m,A-)-firm timing constraints to provide delay guarantees of at least in packets out of any k consecutive packets without violating bandwidth fairness or misusing network resources. Using the Network Calculus theory, an analytic study gives the deterministic delay bound provided by the (m,k)-WFQ algorithm for upper bounded arrival curve traffic. We extend our analytic results for guaranteed-rate networks, such as the IntServ QoS model and ATM networks, and the DiffServ QoS model. Analytic results and simulations show a noticeable improvement in delay guarantee made by (m,k)-WFQ compared to WFQ without much degradation of bandwidth faimess.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region></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></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 006629 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 006629 | 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:05-0385323
|texte= Graceful degradation of loss-tolerant QoS using (m,k)-finn constraints in guaranteed rate networks
}}
| This area was generated with Dilib version V0.6.33. |  |