(m,k)-WFQ : Integrating (m,k)-Firm Real-Time Constraints into Guaranteed-Rate Networks
Identifieur interne : 006B85 ( Main/Merge ); précédent : 006B84; suivant : 006B86(m,k)-WFQ : Integrating (m,k)-Firm Real-Time Constraints into Guaranteed-Rate Networks
Auteurs : Anis Koubaa ; Ye-Qiong SongSource :
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 real-time streams could tolerate some deadline misses according to their (m,k)-firm constraints, we propose a new scheduling technique called (m,k)-WFQ that 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. Theoretical Results and simulations show lower average and maximum delays provided by the proposed scheduling algorithm, without much degrading bandwidth fairness.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 003E87
- to stream Crin, to step Curation: 003E87
- to stream Crin, to step Checkpoint: 000710
Links to Exploration step
CRIN:koubaa04cLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="399">(m,k)-WFQ : Integrating (m,k)-Firm Real-Time Constraints into Guaranteed-Rate Networks</title></titleStmt><publicationStmt><idno type="RBID">CRIN:koubaa04c</idno><date when="2004" year="2004">2004</date><idno type="wicri:Area/Crin/Corpus">003E87</idno><idno type="wicri:Area/Crin/Curation">003E87</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003E87</idno><idno type="wicri:Area/Crin/Checkpoint">000710</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000710</idno><idno type="wicri:Area/Main/Merge">006B85</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">(m,k)-WFQ : Integrating (m,k)-Firm Real-Time Constraints into Guaranteed-Rate Networks</title><author><name sortKey="Koubaa, Anis" sort="Koubaa, Anis" uniqKey="Koubaa A" first="Anis" last="Koubaa">Anis Koubaa</name></author><author><name sortKey="Song, Ye Qiong" sort="Song, Ye Qiong" uniqKey="Song Y" first="Ye-Qiong" last="Song">Ye-Qiong Song</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>(m</term><term>Bandwidth Guarantee</term><term>Delay Guarantees</term><term>Network Calculus</term><term>WFQ</term><term>k)-firm</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1111">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 real-time streams could tolerate some deadline misses according to their (m,k)-firm constraints, we propose a new scheduling technique called (m,k)-WFQ that 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. Theoretical Results and simulations show lower average and maximum delays provided by the proposed scheduling algorithm, without much degrading bandwidth fairness.</div></front></TEI></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 006B85 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 006B85 | 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é= CRIN:koubaa04c
|texte= (m,k)-WFQ : Integrating (m,k)-Firm Real-Time Constraints into Guaranteed-Rate Networks
}}
| This area was generated with Dilib version V0.6.33. |  |