Real-Time Communications using TDMA-Based Multi-Access Protocol
Identifieur interne : 00C180 ( Main/Merge ); précédent : 00C179; suivant : 00C181Real-Time Communications using TDMA-Based Multi-Access Protocol
Auteurs : Françoise Simonot-Lion ; Ye-Qiong SongSource :
- Computer communications ; 1997.
English descriptors
- KwdEn :
Abstract
In this paper, we study first the performance issues, especially message sojourn time and message overflow of TDMA protocol and then show how to use these results to design some protocol's parameters in order to meet the soft real-time requirements. We consider a single queue with multiple output (b messages) and finite buffer capacity (denoted by K), K and b being two protocol's parameters that a designer can choose. Assuming Poisson fixed-length message arrivals, the exact expressions for the distribution function of the message sojourn time and overflow probability are derived. It has been shown that these results can be applied to various particular cases (eg. infinite buffer capacity case) and therefore appear as a versatile solution for TDMA schemes. Moreover, the monotonicity for the overflow probability is proved which gives us a theoretical base for the dimensionning task. Using the stated results, the design and implementation of real-time protocols based on TDMA can be achieved. An example is examined emphasizing the choice of the parameters K and b according to time and overflow constraints.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 001F24
- to stream Crin, to step Curation: 001F24
- to stream Crin, to step Checkpoint: 002726
Links to Exploration step
CRIN:simonot97eLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="279">Real-Time Communications using TDMA-Based Multi-Access Protocol</title></titleStmt><publicationStmt><idno type="RBID">CRIN:simonot97e</idno><date when="1997" year="1997">1997</date><idno type="wicri:Area/Crin/Corpus">001F24</idno><idno type="wicri:Area/Crin/Curation">001F24</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001F24</idno><idno type="wicri:Area/Crin/Checkpoint">002726</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">002726</idno><idno type="wicri:Area/Main/Merge">00C180</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Real-Time Communications using TDMA-Based Multi-Access Protocol</title><author><name sortKey="Simonot Lion, Francoise" sort="Simonot Lion, Francoise" uniqKey="Simonot Lion F" first="Françoise" last="Simonot-Lion">Françoise Simonot-Lion</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><series><title level="j">Computer communications</title><imprint><date when="1997" type="published">1997</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Deadline miss probability</term><term>Dimensionning</term><term>Multi-access protocol</term><term>Performance evaluation</term><term>Real-time communication</term><term>TDMA</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1988">In this paper, we study first the performance issues, especially message sojourn time and message overflow of TDMA protocol and then show how to use these results to design some protocol's parameters in order to meet the soft real-time requirements. We consider a single queue with multiple output (b messages) and finite buffer capacity (denoted by K), K and b being two protocol's parameters that a designer can choose. Assuming Poisson fixed-length message arrivals, the exact expressions for the distribution function of the message sojourn time and overflow probability are derived. It has been shown that these results can be applied to various particular cases (eg. infinite buffer capacity case) and therefore appear as a versatile solution for TDMA schemes. Moreover, the monotonicity for the overflow probability is proved which gives us a theoretical base for the dimensionning task. Using the stated results, the design and implementation of real-time protocols based on TDMA can be achieved. An example is examined emphasizing the choice of the parameters K and b according to time and overflow constraints.</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 00C180 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00C180 | 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:simonot97e
|texte= Real-Time Communications using TDMA-Based Multi-Access Protocol
}}
| This area was generated with Dilib version V0.6.33. |  |