Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have