Name
Abstract | ||
|---|---|---|
Most practical policies for handling covert storage channels are based on bandwidth-limitation techniques. In this paper we present a Markov model for bandwidth computation and its application to Secure Xenix. The model can be used for computing the bandwidth of both individual channels and aggregated channels (i.e., serial and parallel aggregation). Based on this model, a tool has been built and experiments conducted to determine the factors that affect the bandwidth of covert storage channels (i.e., noise, scheduling delays, load, "think times"). The tool can be used to compute the minimum delays for each channel under various loads and program behavior. Thus, it enables the placement dynamically-adjustable delays in multiprogrammed systems, which guarantees minimum performance impact. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1109/SECPRI.1988.8103 | IEEE Symposium on Security and Privacy |
Keywords | Field | DocType |
markov model,bandwidth-limitation technique,bandwidth computation model,individual channel,secure xenix,aggregated channel,minimum delay,bandwidth computation,multiprogrammed system,minimum performance impact,covert storage channel,computational modeling,markov processes,degradation,operating systems,bandwidth,computer model,multiprogramming,noise,concurrent computing | Markov process,Scheduling (computing),Computer science,Markov model,Communication channel,Covert,Real-time computing,Bandwidth (signal processing),Computer multitasking,Distributed computing,Computation | Conference |
ISBN | Citations | PageRank |
0-8186-0850-1 | 21 | 2.99 |
References | Authors | |
2 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chii-Ren Tsai | 1 | 74 | 8.77 |
| Virgil D. Gligor | 2 | 4133 | 513.94 |