Guaranteeing application-to-application deadlines in distributed real-time systems

We address the issue of guaranteeing application-to-application deadlines of messages in distributed real-time systems. Most of the previous studies have focused on either host subsystem or network subsystem. Our study considers the entire integrated system. We develop two methods to test whether the message deadlines are met. The first method called the independent method, obtains conservative estimates of message delays by independently analyzing each subsystem. This method is easy to use and efficient, but may sometimes give pessimistic results. The second method called the integrated method, computes the delays more accurately by modeling interactions among the subsystems in greater detail. Performance of the two methods is evaluated an terms of the probability of guaranteeing message sets for given host utilization