Dealing with complex networks of process interactions: a security measure

The majority of faults and consequent errors and failures in computer systems stem from the complexity of the system itself according to B. Schneier (2000). Yet complexity as a non-functional property is largely disregarded from initial development phases or at best is considered "manageable" by the process life cycle. Although at large the property is considered as having being conquered, valid sources inform us as stated in W. B. Kernighan (1987) that complexity as a property - borne by the system or emergent - is the cause of most failures. Furthermore the second most frequent case of failures is that of interaction with the system. In this paper we are looking at one aspect of process interactions. We are presenting a method for modelling and analyzing information system process interactions for the purpose of enhancing security. The paper introduces our work in the area of complex systems and gives a general introduction to our modelling methodology and its usage.

[1]  W. Richard Stevens,et al.  Unix network programming , 1990, CCRV.

[2]  Mile K. Stojcev,et al.  Reliability of Computer Systems and Networks: Fault Tolerance, Analysis and Design; Martin L. Shooman. John Wiley and Sons Inc., New York; 2002. Hardcover, pp 528, plus XXII , 2004, Microelectron. Reliab..

[3]  Martin L. Shooman,et al.  Reliability of computer systems and networks , 2001 .

[4]  Cliff B. Jones,et al.  Editorial message: special track on inter-disciplinary approaches to the design of dependable computer systems , 2002, SAC '02.

[5]  Martin L. Shooman,et al.  Reliability of Computer Systems and Networks: Fault Tolerance,Analysis,and Design , 2002 .

[6]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[7]  Viktor Mikhaĭlovich Glushkov,et al.  An Introduction to Cybernetics , 1957, The Mathematical Gazette.

[8]  E. Kandel,et al.  Proceedings of the National Academy of Sciences of the United States of America. Annual subject and author indexes. , 1990, Proceedings of the National Academy of Sciences of the United States of America.

[9]  I. Anderson,et al.  Graphs and Networks , 1981, The Mathematical Gazette.

[10]  Andrew S. Tanenbaum,et al.  Operating systems - design and implementation, 3rd Edition , 2005 .

[11]  D. Krakauer,et al.  Redundancy, antiredundancy, and the robustness of genomes , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Brian W. Kernighan,et al.  The UNIX™ programming environment , 1979, Softw. Pract. Exp..

[13]  Dock Bumpers,et al.  Volume 2 , 2005, Proceedings of the Ninth International Conference on Computer Supported Cooperative Work in Design, 2005..

[14]  Shari Lawrence Pfleeger,et al.  Software metrics (2nd ed.): a rigorous and practical approach , 1997 .

[15]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[16]  D. Gibson,et al.  Redundancy , 1984 .

[17]  Andrew S. Tanenbaum,et al.  Operating systems: design and implementation , 1987, Prentice-Hall software series.

[18]  W. Ashby,et al.  An Introduction to Cybernetics , 1957 .

[19]  Christopher R. Myers,et al.  Software systems as complex networks: structure, function, and evolvability of software collaboration graphs , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Sergi Valverde,et al.  Hierarchical Small Worlds in Software Architecture , 2003 .

[21]  Bruce Schneier,et al.  Secrets and Lies , 2004 .