Multiple-access protocols and time-constrained communication
ACM Computing Surveys (CSUR)
Stochastic modelling and analysis: a computational approach
Stochastic modelling and analysis: a computational approach
Queuing analysis of polling models
ACM Computing Surveys (CSUR)
A generalized analysis of message delay in STDMA
Computer Networks and ISDN Systems
Hard real-time communication in multiple-access networks
Real-Time Systems
Analysis of hard real-time communications
Real-Time Systems
Modeling and Analysis of Computer Communications Networks
Modeling and Analysis of Computer Communications Networks
Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Access-control disciplines for multi-access communication channels: Reservation and TDMA schemes
IEEE Transactions on Information Theory
| Hi-index | 0.24 |
In this paper, we study first the performance issues, especially message sojourn time and message overflow, of the TDMA protocol and then show how to use these results to design protocol 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 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 the overflow probability are derived. It has been shown that these results can be applied to various particular cases (e.g. the 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 dimensioning 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.