Fuzzy Adaptive Routing in Multi-service Computer Networks under Cyber Attack Implementation

Multi-service computer networks (MSCN) play an important role in the modern society life. However, design of MSCN is a rather complex challenge. Development of adaptive routing algorithms, which consider the failures of nodes and communication lines because of the impact of the computer attacks, holds a specific place in MSCN design. The paper offers a new approach to adaptive routing in MSCN based on a combined use of the multi-path routing of data streams and the integral criterion, which is based on fuzzy assessment of network states. The algorithm based on this approach considers additional routing metrics, i.e. the level of information security, the technical state of network elements and the packet loss probability. The experimental assessment of the offered algorithm of fuzzy adaptive routing showed that in the conditions of high level impact of computer attacks the gain in the time of message delay is improved by 2–4 times. It testifies about higher performance of the proposed algorithm in comparison with known algorithms.

[1]  David D. Clark,et al.  Policy routing in Internet protocols , 1989, RFC.

[2]  Douglas E. Comer,et al.  Internetworking with TCP/IP - Principles, Protocols, and Architectures, Fourth Edition , 1988 .

[3]  Torsten Hoefler,et al.  Adaptive Routing Strategies for Modern High Performance Networks , 2008, 2008 16th IEEE Symposium on High Performance Interconnects.

[4]  Grenville Armitage.  Quality of Service in IP Networks , 2000 .

[5]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[6]  Igor V. Kotenko,et al.  Countermeasure Security Risks Management in the Internet of Things Based on Fuzzy Logic Inference , 2015, 2015 IEEE Trustcom/BigDataSE/ISPA.

[7]  Igor V. Kotenko,et al.  Detection of traffic anomalies in multi-service networks based on a fuzzy logical inference , 2016, IDC.

[8]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[9]  Baruch Awerbuch,et al.  Provably competitive adaptive routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[10]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[11]  Hannes Gredler,et al.  The complete IS-IS routing protocol , 2005 .

[12]  J. J. Moré,et al.  Quasi-Newton Methods, Motivation and Theory , 1974 .

[13]  Uyless D. Black,et al.  IP Routing Protocols: RIP, OSPF, BGP, PNNI and Cisco Routing Protocols , 2000 .

[14]  Gerald R. Ash,et al.  Dynamic Routing in Telecommunications Networks , 1997 .

[15]  Lionel M. Ni,et al.  The turn model for adaptive routing , 1992, ISCA '92.

[16]  Mario Gerla,et al.  On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..

[17]  Robert B. Cooper,et al.  Queueing systems, volume II: computer applications : By Leonard Kleinrock. Wiley-Interscience, New York, 1976, xx + 549 pp. , 1977 .

[18]  William J. Dally,et al.  Adaptive Routing in High-Radix Clos Network , 2006, ACM/IEEE SC 2006 Conference (SC'06).

[19]  Yin Zhang,et al.  On self adaptive routing in dynamic environments - an evaluation and design using a simple, probabilistic scheme , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[20]  J. Daniel.  On the approximate minimization of functionals , 1969 .

[21]  Jörg Ott,et al.  Adaptive routing in mobile opportunistic networks , 2010, MSWIM '10.

[22]  Hans-Werner Braun,et al.  Models of policy based routing , 1989, RFC.