InforLorV4, PascalFrancis, Corpus, bibRecord, 000A55

Traffic shaping in real-time distributed systems: A low-complexity approach

Identifieur interne : 000A55 ( PascalFrancis/Corpus ); précédent : 000A54; suivant : 000A56

Traffic shaping in real-time distributed systems: A low-complexity approach

Auteurs : B. Gaujal ; N. Navet

Source :

Computer Communications [ 0140-3664 ] ; 1999.

RBID : Pascal:00-0222143

Descripteurs français

Pascal (Inist)
- Théorie, Système informatique réparti, Temps réponse, Théorie contrainte, Complexité calcul, Algorithme, Réseau local, Télétrafic, Gestion encombrement(communication), Système temps réel.

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.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0140-3664`
A03		`1`		`@0 Comput Commun`
A05				`@2 22`
A06				`@2 17`
A08	`01`	`1`	`ENG`	`@1 Traffic shaping in real-time distributed systems: A low-complexity approach`
A11	`01`	`1`		`@1 GAUJAL (B.)`
A11	`02`	`1`		`@1 NAVET (N.)`
A14	`01`			`@1 LORIA-INPL @2 Vandoeuvre-les-Nancy @3 FRA @Z 1 aut.`
A20				`@1 1562-1573`
A21				`@1 1999`
A23	`01`			`@0 ENG`
A43	`01`			`@1 INIST @2 17163`
A44				`@0 A100`
A45				`@0 22 Refs.`
A47	`01`	`1`		`@0 00-0222143`
A60				`@1 P`
A61				`@0 A`
A64	`01`	`1`		`@0 Computer Communications`
A66	`01`			`@0 GBR`
C01	`01`		`ENG`	@0 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.
C02	`01`	`X`		`@0 001D03J07`
C02	`02`	`X`		`@0 001D02A`
C02	`03`	`X`		`@0 001D02B`
C02	`04`	`X`		`@0 001A02`
C02	`05`	`X`		`@0 001D04B`
C03	`01`	`1`	`ENG`	`@0 Traffic shaping @4 INC`
C03	`02`	`1`	`ENG`	`@0 Hard real time traffic (HRT) @4 INC`
C03	`03`	`1`	`ENG`	`@0 Soft real time traffic (SRT) @4 INC`
C03	`04`	`1`	`FRE`	`@0 Théorie`
C03	`04`	`1`	`ENG`	`@0 Theory`
C03	`05`	`1`	`FRE`	`@0 Système informatique réparti`
C03	`05`	`1`	`ENG`	`@0 Distributed computer systems`
C03	`06`	`1`	`FRE`	`@0 Temps réponse`
C03	`06`	`1`	`ENG`	`@0 Response time (computer systems)`
C03	`07`	`1`	`FRE`	`@0 Théorie contrainte`
C03	`07`	`1`	`ENG`	`@0 Constraint theory`
C03	`08`	`1`	`FRE`	`@0 Complexité calcul`
C03	`08`	`1`	`ENG`	`@0 Computational complexity`
C03	`09`	`1`	`FRE`	`@0 Algorithme`
C03	`09`	`1`	`ENG`	`@0 Algorithms`
C03	`10`	`1`	`FRE`	`@0 Réseau local`
C03	`10`	`1`	`ENG`	`@0 Local area networks`
C03	`11`	`1`	`FRE`	`@0 Télétrafic`
C03	`11`	`1`	`ENG`	`@0 Telecommunication traffic`
C03	`12`	`1`	`FRE`	`@0 Gestion encombrement(communication)`
C03	`12`	`1`	`ENG`	`@0 Congestion control (communication)`
C03	`13`	`1`	`FRE`	`@0 Système temps réel @3 P`
C03	`13`	`1`	`ENG`	`@0 Real time systems @3 P`
N21				`@1 157`

Format Inist (serveur)

NO :	PASCAL 00-0222143 EI
ET :	Traffic shaping in real-time distributed systems: A low-complexity approach
AU :	GAUJAL (B.); NAVET (N.)
AF :	LORIA-INPL/Vandoeuvre-les-Nancy/France (1 aut.)
DT :	Publication en série; Niveau analytique
SO :	Computer Communications; ISSN 0140-3664; Royaume-Uni; Da. 1999; Vol. 22; No. 17; Pp. 1562-1573; Bibl. 22 Refs.
LA :	Anglais
EA :	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.
CC :	001D03J07; 001D02A; 001D02B; 001A02; 001D04B
FD :	Théorie; Système informatique réparti; Temps réponse; Théorie contrainte; Complexité calcul; Algorithme; Réseau local; Télétrafic; Gestion encombrement(communication); Système temps réel
ED :	Traffic shaping; Hard real time traffic (HRT); Soft real time traffic (SRT); Theory; Distributed computer systems; Response time (computer systems); Constraint theory; Computational complexity; Algorithms; Local area networks; Telecommunication traffic; Congestion control (communication); Real time systems
LO :	INIST-17163
ID :	00-0222143

Links to Exploration step

Pascal:00-0222143

Le 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><inist:fA14 i1="01"><s1>LORIA-INPL</s1>
<s2>Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</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>
</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><inist:fA14 i1="01"><s1>LORIA-INPL</s1>
<s2>Vandoeuvre-les-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
</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>
</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>
<server><NO>PASCAL 00-0222143 EI</NO>
<ET>Traffic shaping in real-time distributed systems: A low-complexity approach</ET>
<AU>GAUJAL (B.); NAVET (N.)</AU>
<AF>LORIA-INPL/Vandoeuvre-les-Nancy/France (1 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Computer Communications; ISSN 0140-3664; Royaume-Uni; Da. 1999; Vol. 22; No. 17; Pp. 1562-1573; Bibl. 22 Refs.</SO>
<LA>Anglais</LA>
<EA>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.</EA>
<CC>001D03J07; 001D02A; 001D02B; 001A02; 001D04B</CC>
<FD>Théorie; Système informatique réparti; Temps réponse; Théorie contrainte; Complexité calcul; Algorithme; Réseau local; Télétrafic; Gestion encombrement(communication); Système temps réel</FD>
<ED>Traffic shaping; Hard real time traffic (HRT); Soft real time traffic (SRT); Theory; Distributed computer systems; Response time (computer systems); Constraint theory; Computational complexity; Algorithms; Local area networks; Telecommunication traffic; Congestion control (communication); Real time systems</ED>
<LO>INIST-17163</LO>
<ID>00-0222143</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 000A55 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000A55 | 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:00-0222143
   |texte=   Traffic shaping in real-time distributed systems: A low-complexity approach
}}

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

Traffic shaping in real-time distributed systems: A low-complexity approach

Traffic shaping in real-time distributed systems: A low-complexity approach

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