Enhancing the performance of C/sup 3/ traffic in a real-time, distributed Ada application through the use of scheduling algorithms

A realistic, real-world distributed Ada application-taken from a current US government project requiring real-time C/sup 3/ traffic-is used as the model for multimedia traffic. The traffic modelled has three characteristics typical of the traffic requirements of many existing C/sup 3/ systems: (1) real-time constraints, (2) continuous, as well as, bursty, traffic generation at different frequencies, and (3) varying semantic priority classes. We present a simulation study which explores the way real-time scheduling algorithms can be used to enhance the performance of real-time, distributed C/sup 3/ traffic. Throughout the simulation, existing standards are utilized whenever possible. For example, the standard ATM network protocol is used, and the real-time scheduling algorithms used are selected from among those in current use.