Performance evaluation of a bandwidth allocation scheme for guaranteeing synchronous messages with arbitrary deadlines in an FDDI network
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We study the performance of FDDI networks in terms of their guarantee probability, i.e., the probability that a set of synchronous messages are guaranteed to meet their deadlines. Traditional techniques such as queuing analysis cannot be directly used to derive the guarantee probability. To counter this problem, we develop a new geometric model of schedulability. Based on this model, we obtain a numerical method to compute the exact values of the guarantee probability. A closed-form approximation for the guarantee probability is also derived, and is shown to be relatively accurate and computationally efficient. The network performance is then systematically examined in terms of the guarantee probability. We find that there is a high probability that a randomly chosen message set can be guaranteed even when the real-time traffic is increased beyond the worst case achievable utilization bound. Hence, FDDI networks are applicable for real-time applications in a wide range of loading conditions.Keywords
This publication has 13 references indexed in Scilit:
- Performance analysis of FCFS and improved FCFS scheduling algorithms for dynamic real-time computer systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Optimal synchronous capacity allocation for hard real-time communications with the timed token protocolPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Performance evaluation of a bandwidth allocation scheme for guaranteeing synchronous messages with arbitrary deadlines in an FDDI networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Analysis of three contention protocols in distributed real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- A performance analysis of minimum laxity and earliest deadline scheduling in a real-time systemIEEE Transactions on Computers, 1989
- Cycle Time Properties Of The FDDI Token Ring ProtocolIEEE Transactions on Software Engineering, 1987
- Monte Carlo MethodsPublished by Springer Nature ,1964
- Approximations for Digital ComputersPublished by Walter de Gruyter GmbH ,1955