Modelling structures of computer networks
DOI:
https://doi.org/10.15587/1729-4061.2013.14384Keywords:
Computer networks, stochastic graph, statistical modeling, targeted attacks, security modelAbstract
The object of research is computer systems, the processes of evolutionary dynamics of which are described on the basis of the concepts of statistical physics of complex networks. Computer networks are not static, therefore, in order to understand the dynamics of their development, it is necessary to discover the principles of their evolution.
The present study presents the model and the formulated rules for the structuring of complex computer networks with the application of the graph theory apparatus. The algorithm of modeling and the adequacy of description by means of the real structure model have been illustrated by the generation of stochastic graph with the application of statistical characteristics of real computer networks, such as “BV-Star & FoxNet”, “The City Cable Television” and “DSS-Group” in Chernivtsi.
The empirical data as well as the original method of network generation for the assigned law of degree distribution of nodes enabled us to carry out network modeling in the environment «Processing» and perform the comparative analysis and systematization of the main characteristics.
Performed estimations, the utilized modeling algorithms, and the validity of applying mathematical tools enable us to make a conclusion about the accuracy and adequacy of the application of the suggested model to real structures. The proposed algorithms of modeling can be applied in solving the problem of the stability of scale-free computer networks against directed hacker attacks and the distribution of computer virusesReferences
- Albert, R. Statistical mechanics of complex networks [Text] / R. Albert, A.-L. Barabasi // Reviews of Modern Physics. – 2002. – P. 47-97.
- Barabasi, A-L. Emergence of scaling in random networks [Text] / A.-L. Barabasi, R. Albert // Science. – 1999. – Vol. 286. – P. 509-512.
- Нікольський, Ю. Дискретна математика [Текст] / Ю.В. Нікольський, В.В. Пасічник, Ю.М. Щербина // Львів: «Магнолія – 2006». – 2009. – 432 с.
- Newman, M.E.J. The Structure and Function of Complex Networks [Text] / M.E.J. Newman // SIAM Review. – 2003. – Vol. 45. - N. 2. – P. 167-256.
- Erdős, P. On the evolution of random graphs [Text] / P. Erdős, A. Renyi // Publications of the Mathematical Institute of the Hungarian Academy of Sciences. – 1960. – Vol. 5. – P. 17-61.
- Frank, O. Markov graphs [Text] / O. Frank, D. Strauss // Journal of the American Statistical Association. – 1986. – Vol. 81. – P. 832-842.
- Watts, D.J. Collective dynamics of “small-world” networks [Text] / D.J. Watts, S.H. Strogatz // Nature. – 1998. – Vol. 393. – P. 440-442.
- Price, D.J. de S. A general theory of bibliometric and other cumulative advantage processes [Text] / D.J. de S. Price // Journal of the American Society for Information Science. – 1976. – Vol. 27. – P. 292-306.
- Albert, R. Error and attack tolerance of complex networks [Text] / R. Albert, H. Jeong, A.-L. Barabasi // Nature (London). – 2000. – Vol. 406. – P. 378 – 381.
- Tu, Y. How robust is the Internet? [Text] / Y. Tu // Nature (London). – 2000. – Vol. 406. – P. 353 – 354.
- Jeong, H. The large-scale organization of metabolic networks [Text] / H. Jeong, B. Tombor, R. Albert, Z. N. Oltvai, A.– L. Barabasi // Nature (London). – 2000. – Vol. 407. – P. 651 – 654.
- Sole, R. V. Complexity and fragility in ecological networks [Text] / R.V. Sole, J.M. Montoya // Proc. R. Soc. Lond. – 2001. – B 268. – P. 2039 – 2045.
- Galindo F. Modeling of Aggregate Attacks on Complex Networks / F. Galindo, V.Dmitrienko, A.Caruso, A. Rossodivita, A.A.Tikhomirov, A. I.Trufanov, E. V. Shubnikov // Information Security Technologies, Moscow – 2010. - N3. - P.115-121.
- Albert, R., Barabasi, A.-L. (2002). Statistical mechanics of complex networks. Reviews of Modern Physics, 47-97.
- Albert, R., Barabasi, A.-L. (1999). Emergence of scaling in random networks. Science, 286, 509-512.
- Nikolsky, Y., Pasechnik, V., Shcherbina, Y. (2009). Discrete Mathematics Lviv, Ukraine: Magnolia.
- Newman, M.E.J. (2003). The Structure and Function of Complex Networks. SIAM Review, 45(2), 167-256.
- Erdős, P., Renyi, A. (1960). On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences, 5, 17-61.
- Frank, O., Strauss, D. (1986). Markov graphs. Journal of the American Statistical Association, 81, 832-842.
- Watts, D.J., Strogatz, S.H.(1998). Collective dynamics of “small-world” networks. Nature, 393, 440-442.
- Price, D.J. de S. (1976). A general theory of bibliometric and other cumulative advantage processes. Journal of the American Society for Information Science, 27, 292-306.
- Albert, R., Jeong, H., Barabasi, A.-L. (2000). Error and attack tolerance of complex networks. Nature (London), 406, 378-381.
- Tu, Y. (2000). How robust is the Internet? Nature (London), 406, 353-354.
- Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., Barabasi, A.- L. (2000). The large-scale organization of metabolic networks. Nature (London), 407, 651-654.
- Sole, R.V., Montoya, J.M. (2001). Complexity and fragility in ecological networks. Proc. R. Soc. Lond, 268, 2039-2045.
- Galindo, F., Dmitrienko, V., Caruso, A., Rossodivita, A., Tikhomirov, A.A., Trufanov, A. I., Shubnikov, E. V. (2010). Modeling of Aggregate Attacks on Complex Networks. Information Security Technologies, Moscow, 3, 115-121.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2014 Володимир Володимирович Пасічник, Наталія Михайлівна Іванущак
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.