Mandatory resource access control based on a reachability matrix in storage area networks

We study control mechanisms of user access to information circulating in a distributed data processing system. Limitation of user access to information is necessary for two reasons: presence of confidential information and the problem of “over-analysis”. The goal of this work is to study application level principles of mandatory resource access control and to choose a mathematical instrument for constructing a reachability matrix. Using the matrix allows to identify what data is to be stored on a what node, an ability that in turn allows for aware data routing and control of adequacy of the stored data during synchronization of arbitrary nodes at any given moment. Based on an analytical model of a storage area network described by graph theory we solve the problem of constructing a reachability matrix using a modified version of Floyd-Warshall algorithm. We show that the number of different types of circulating information is directly proportional to the time gain for constructing the matrix. The introduced notion of an “information transmission rule group” allows the end user to intuitively identify the direction of the transmission without the need to understand its implementation.