Connection allocation schemes for guaranteeing hard real-time communications with ATM Networks
Identifieur interne : 00C052 ( Main/Merge ); précédent : 00C051; suivant : 00C053Connection allocation schemes for guaranteeing hard real-time communications with ATM Networks
Auteurs : Zoubir Mammeri ; K. D. HaouamSource :
English descriptors
- KwdEn :
Abstract
Two technical advantages of ATM, end-to-end QoS and high banwidth, make ATM suitable for distributed real-time systems (DRTSs). however, ATM capabilites can not be used correctly and efficiently without an adequate mapping of timing constraints of messages onto ATM services. This paper presents an approach for a "systematic" mapping of real-time message attributes onto parameters, and quality of service, of ATM connections. This approach is useful for one who needs to develop a distributed real-time application above ATM with a few knowledge of ATM protocols. A message scheduling algorithm based on EDF is used to deal with the sharing of an ATM connection between several message sources.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 001F72
- to stream Crin, to step Curation: 001F72
- to stream Crin, to step Checkpoint: 002598
Links to Exploration step
CRIN:mammeri97aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="660">Connection allocation schemes for guaranteeing hard real-time communications with ATM Networks</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:mammeri97a</idno>
<date when="1997" year="1997">1997</date>
<idno type="wicri:Area/Crin/Corpus">001F72</idno>
<idno type="wicri:Area/Crin/Curation">001F72</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001F72</idno>
<idno type="wicri:Area/Crin/Checkpoint">002598</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">002598</idno>
<idno type="wicri:Area/Main/Merge">00C052</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Connection allocation schemes for guaranteeing hard real-time communications with ATM Networks</title>
<author><name sortKey="Mammeri, Zoubir" sort="Mammeri, Zoubir" uniqKey="Mammeri Z" first="Zoubir" last="Mammeri">Zoubir Mammeri</name>
</author>
<author><name sortKey="Haouam, K D" sort="Haouam, K D" uniqKey="Haouam K" first="K. D." last="Haouam">K. D. Haouam</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>ATM</term>
<term>Real-time Communications</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="1937">Two technical advantages of ATM, end-to-end QoS and high banwidth, make ATM suitable for distributed real-time systems (DRTSs). however, ATM capabilites can not be used correctly and efficiently without an adequate mapping of timing constraints of messages onto ATM services. This paper presents an approach for a "systematic" mapping of real-time message attributes onto parameters, and quality of service, of ATM connections. This approach is useful for one who needs to develop a distributed real-time application above ATM with a few knowledge of ATM protocols. A message scheduling algorithm based on EDF is used to deal with the sharing of an ATM connection between several message sources.</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 00C052 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00C052 | 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:mammeri97a |texte= Connection allocation schemes for guaranteeing hard real-time communications with ATM Networks }}
This area was generated with Dilib version V0.6.33. |