Traffic shaping in real-time distributed systems: A low-complexity approach
Identifieur interne : 000A61 ( PascalFrancis/Checkpoint ); précédent : 000A60; suivant : 000A62Traffic shaping in real-time distributed systems: A low-complexity approach
Auteurs : B. Gaujal [France] ; N. NavetSource :
- Computer Communications [ 0140-3664 ] ; 1999.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Réseau local.
English descriptors
- KwdEn :
- Algorithms, Computational complexity, Congestion control (communication), Constraint theory, Distributed computer systems, Hard real time traffic (HRT), Local area networks, Real time systems, Response time (computer systems), Soft real time traffic (SRT), Telecommunication traffic, Theory, Traffic shaping.
Abstract
In real-time systems, one generally identifies two types of timing requirements, hard and soft constraints. In this study, it is assumed that the Hard Real-Time traffic (HRT) is periodic with deadlines that must be guaranteed, while the Soft Real-Time traffic (SRT) is aperiodic with timing constraints that could occasionally be missed without major consequences. In this paper, the problem of scheduling these two types of traffic with different performance objectives will be addressed: (1) ensure that the timing requirements of HRT traffic are met; (2) minimize as much as possible the response time of SRT traffic while satisfying (1). For this purpose, we propose an easily implementable and low-complexity traffic shaping policy, which preserves feasibility and improves response times for SRT traffic. The underlying idea is that it is possible to diminish the response time of SRT traffic if the busy periods induced by the HRT traffic are harmoniously' distributed over time, creating time intervals during which the resource (i.e. the processor or the medium) can be used by SRT traffic with minimum delay. A computer-implementable algorithm that has to be executed independently on each node of the bus is also provided, as well as several extensions of the original model.
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:00-0222143Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Traffic shaping in real-time distributed systems: A low-complexity approach</title><author><name sortKey="Gaujal, B" sort="Gaujal, B" uniqKey="Gaujal B" first="B." last="Gaujal">B. Gaujal</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LORIA-INPL</s1><s2>Vandoeuvre-les-Nancy</s2><s3>FRA</s3><sZ>1 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><settlement type="city">Vandœuvre-lès-Nancy</settlement><settlement type="city" wicri:auto="agglo">Nancy</settlement></placeName></affiliation></author><author><name sortKey="Navet, N" sort="Navet, N" uniqKey="Navet N" first="N." last="Navet">N. Navet</name></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">00-0222143</idno><date when="1999">1999</date><idno type="stanalyst">PASCAL 00-0222143 EI</idno><idno type="RBID">Pascal:00-0222143</idno><idno type="wicri:Area/PascalFrancis/Corpus">000A55</idno><idno type="wicri:Area/PascalFrancis/Curation">000027</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000A61</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000A61</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Traffic shaping in real-time distributed systems: A low-complexity approach</title><author><name sortKey="Gaujal, B" sort="Gaujal, B" uniqKey="Gaujal B" first="B." last="Gaujal">B. Gaujal</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>LORIA-INPL</s1><s2>Vandoeuvre-les-Nancy</s2><s3>FRA</s3><sZ>1 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><settlement type="city">Vandœuvre-lès-Nancy</settlement><settlement type="city" wicri:auto="agglo">Nancy</settlement></placeName></affiliation></author><author><name sortKey="Navet, N" sort="Navet, N" uniqKey="Navet N" first="N." last="Navet">N. Navet</name></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="1999">1999</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>Algorithms</term><term>Computational complexity</term><term>Congestion control (communication)</term><term>Constraint theory</term><term>Distributed computer systems</term><term>Hard real time traffic (HRT)</term><term>Local area networks</term><term>Real time systems</term><term>Response time (computer systems)</term><term>Soft real time traffic (SRT)</term><term>Telecommunication traffic</term><term>Theory</term><term>Traffic shaping</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Théorie</term><term>Système informatique réparti</term><term>Temps réponse</term><term>Théorie contrainte</term><term>Complexité calcul</term><term>Algorithme</term><term>Réseau local</term><term>Télétrafic</term><term>Gestion encombrement(communication)</term><term>Système temps réel</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Réseau local</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In real-time systems, one generally identifies two types of timing requirements, hard and soft constraints. In this study, it is assumed that the Hard Real-Time traffic (HRT) is periodic with deadlines that must be guaranteed, while the Soft Real-Time traffic (SRT) is aperiodic with timing constraints that could occasionally be missed without major consequences. In this paper, the problem of scheduling these two types of traffic with different performance objectives will be addressed: (1) ensure that the timing requirements of HRT traffic are met; (2) minimize as much as possible the response time of SRT traffic while satisfying (1). For this purpose, we propose an easily implementable and low-complexity traffic shaping policy, which preserves feasibility and improves response times for SRT traffic. The underlying idea is that it is possible to diminish the response time of SRT traffic if the busy periods induced by the HRT traffic are harmoniously' distributed over time, creating time intervals during which the resource (i.e. the processor or the medium) can be used by SRT traffic with minimum delay. A computer-implementable algorithm that has to be executed independently on each node of the bus is also provided, as well as several extensions of the original model.</div></front></TEI><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0140-3664</s0></fA01><fA03 i2="1"><s0>Comput Commun</s0></fA03><fA05><s2>22</s2></fA05><fA06><s2>17</s2></fA06><fA08 i1="01" i2="1" l="ENG"><s1>Traffic shaping in real-time distributed systems: A low-complexity approach</s1></fA08><fA11 i1="01" i2="1"><s1>GAUJAL (B.)</s1></fA11><fA11 i1="02" i2="1"><s1>NAVET (N.)</s1></fA11><fA14 i1="01"><s1>LORIA-INPL</s1><s2>Vandoeuvre-les-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></fA14><fA20><s1>1562-1573</s1></fA20><fA21><s1>1999</s1></fA21><fA23 i1="01"><s0>ENG</s0></fA23><fA43 i1="01"><s1>INIST</s1><s2>17163</s2></fA43><fA44><s0>A100</s0></fA44><fA45><s0>22 Refs.</s0></fA45><fA47 i1="01" i2="1"><s0>00-0222143</s0></fA47><fA60><s1>P</s1></fA60><fA61><s0>A</s0></fA61><fA64 i1="01" i2="1"><s0>Computer Communications</s0></fA64><fA66 i1="01"><s0>GBR</s0></fA66><fC01 i1="01" l="ENG"><s0>In real-time systems, one generally identifies two types of timing requirements, hard and soft constraints. In this study, it is assumed that the Hard Real-Time traffic (HRT) is periodic with deadlines that must be guaranteed, while the Soft Real-Time traffic (SRT) is aperiodic with timing constraints that could occasionally be missed without major consequences. In this paper, the problem of scheduling these two types of traffic with different performance objectives will be addressed: (1) ensure that the timing requirements of HRT traffic are met; (2) minimize as much as possible the response time of SRT traffic while satisfying (1). For this purpose, we propose an easily implementable and low-complexity traffic shaping policy, which preserves feasibility and improves response times for SRT traffic. The underlying idea is that it is possible to diminish the response time of SRT traffic if the busy periods induced by the HRT traffic are harmoniously' distributed over time, creating time intervals during which the resource (i.e. the processor or the medium) can be used by SRT traffic with minimum delay. A computer-implementable algorithm that has to be executed independently on each node of the bus is also provided, as well as several extensions of the original model.</s0></fC01><fC02 i1="01" i2="X"><s0>001D03J07</s0></fC02><fC02 i1="02" i2="X"><s0>001D02A</s0></fC02><fC02 i1="03" i2="X"><s0>001D02B</s0></fC02><fC02 i1="04" i2="X"><s0>001A02</s0></fC02><fC02 i1="05" i2="X"><s0>001D04B</s0></fC02><fC03 i1="01" i2="1" l="ENG"><s0>Traffic shaping</s0><s4>INC</s4></fC03><fC03 i1="02" i2="1" l="ENG"><s0>Hard real time traffic (HRT)</s0><s4>INC</s4></fC03><fC03 i1="03" i2="1" l="ENG"><s0>Soft real time traffic (SRT)</s0><s4>INC</s4></fC03><fC03 i1="04" i2="1" l="FRE"><s0>Théorie</s0></fC03><fC03 i1="04" i2="1" l="ENG"><s0>Theory</s0></fC03><fC03 i1="05" i2="1" l="FRE"><s0>Système informatique réparti</s0></fC03><fC03 i1="05" i2="1" l="ENG"><s0>Distributed computer systems</s0></fC03><fC03 i1="06" i2="1" l="FRE"><s0>Temps réponse</s0></fC03><fC03 i1="06" i2="1" l="ENG"><s0>Response time (computer systems)</s0></fC03><fC03 i1="07" i2="1" l="FRE"><s0>Théorie contrainte</s0></fC03><fC03 i1="07" i2="1" l="ENG"><s0>Constraint theory</s0></fC03><fC03 i1="08" i2="1" l="FRE"><s0>Complexité calcul</s0></fC03><fC03 i1="08" i2="1" l="ENG"><s0>Computational complexity</s0></fC03><fC03 i1="09" i2="1" l="FRE"><s0>Algorithme</s0></fC03><fC03 i1="09" i2="1" l="ENG"><s0>Algorithms</s0></fC03><fC03 i1="10" i2="1" l="FRE"><s0>Réseau local</s0></fC03><fC03 i1="10" i2="1" l="ENG"><s0>Local area networks</s0></fC03><fC03 i1="11" i2="1" l="FRE"><s0>Télétrafic</s0></fC03><fC03 i1="11" i2="1" l="ENG"><s0>Telecommunication traffic</s0></fC03><fC03 i1="12" i2="1" l="FRE"><s0>Gestion encombrement(communication)</s0></fC03><fC03 i1="12" i2="1" l="ENG"><s0>Congestion control (communication)</s0></fC03><fC03 i1="13" i2="1" l="FRE"><s0>Système temps réel</s0><s3>P</s3></fC03><fC03 i1="13" i2="1" l="ENG"><s0>Real time systems</s0><s3>P</s3></fC03><fN21><s1>157</s1></fN21></pA></standard></inist><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Nancy</li><li>Vandœuvre-lès-Nancy</li></settlement></list><tree><noCountry><name sortKey="Navet, N" sort="Navet, N" uniqKey="Navet N" first="N." last="Navet">N. Navet</name></noCountry><country name="France"><region name="Grand Est"><name sortKey="Gaujal, B" sort="Gaujal, B" uniqKey="Gaujal B" first="B." last="Gaujal">B. Gaujal</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A61 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000A61 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Checkpoint
|type= RBID
|clé= Pascal:00-0222143
|texte= Traffic shaping in real-time distributed systems: A low-complexity approach
}}
| This area was generated with Dilib version V0.6.33. |  |