A model of computer system security operation is developed based on the fork-join queueing network formalism. We introduce a secu- rity operation performance measure, and show how it may be used to performance evaluation of actual systems. against computer security treats leads to considerable damage, and even can cause an organization to be paralized. Therefore, the development of new models and methods of performance analysis of security systems seems to be very important. In this paper, we propose a model of computer security operation, and intro- duce its related performance measure. It is shown how the model can be applied to performance evaluation of actual systems. Finally, a technique of security system performance analysis is described and its practical implementation is discussed. We conclude with an appendix which contains technical details concerning fork-join network representation of the model, and related results.
[1]
Evaluation of the Mean Interdeparture Time in Tandem Queueing Systems 1
,
2001
.
[2]
William Stallings.
Network and Internetwork Security: Principles and Practice
,
1994
.
[3]
N. K. Krivulin,et al.
On evaluation of the mean service cycle time in tandem queueing systems
,
2012,
1212.5309.
[4]
Armand M. Makowski,et al.
Queueing models for systems with synchronization constraints
,
1989,
Proc. IEEE.
[5]
Nikolai K. Krivulin.
Algebraic modelling and performance evaluation of acyclic fork-join queueing networks
,
2012,
ArXiv.