Covert Timing Channel Capacity of Rate Monotonic Real-Time Scheduling Algorithm in MLS Systems

J. Son and J. Alves-Foss (USA)

Keywords

Covert timing channel capacity, quantity of specific infor mation, RateMonotonic scheduling.

Abstract

Real-time systems must satisfy timing constraints. In our previous work, we showed that a covert timing channel cannot be completely closed in some system configura tions due to the timing constraints imposed by the Rate Monotonic (RM) real-time scheduling algorithm. In this paper, we construct a probabilistic model to measure two quantities of a covert timing channel in RM based systems: channel capacity and quantity of specific information. We show how these two metrics can be calculated from our probabilistic model and why they are useful metrics in eval uation of a covert (timing) channel.

Important Links:



Go Back