Journal: Volume 21, No. 3, 2016
Pages: 11 – 16
520 Views

The analysis of methods of optmization of data flows routing

Anait Karapetyan

Abstract

The development of the data transformation networks and the problems of directing streams within them demand new methods of optimization of data flows routing processes. To solve this problem in the framework of modern science development it is possible to use models and methods of adaptive and neural network routing. The article studies the methods of optimization of adaptive information flows routing. The methods of adaptive routing of information streams and the existing approaches and methods of data processing are presented. The major specific features and tasks of data flows routing with changeable dynamics are analyzed. Due to increasing demands to the speed of data transmission and to the signal quality the task of increasing the efficiency of network resources grows more and more topical. Data routing is one of the key tasks up to date. The object of the study is to analyze the existing routing methods and to research the efficiency of the use of net resources in distributed networks by means of evolutionary algorithms. The use of genetic optimization algorithms for creating modern routing information protocols, which consider both network connections characteristics and equipment, is the promising direction. The established approaches allow to significantly simplify (and are the only variant in some individual cases) the solving of routing task in complex computer systems. The possibility of formalization of optimization task is studied. The necessity of the development of new adaptive routing methods is grounded. The possibility of the use of evolutionary methods for route optimization in the networks with adaptive routing is studied. The main problem in using these methods consists in big volume of calculations

Keywords

routing, adaptive routing, multiobjective optimization, neural networks, Hopfield net, genetic algorithm

References

  1. Hajek, B., & Sasaki, G. (1998). Scheduling in polynomial time. IEEE Transactions on Information Theory, 34, 910–917.
  2. Kleinrock, L. (1970). Communication networks: Stochastic flows and message delays. Moscow: Nauka.
  3. Kolesnikov, K. V., Karapetian, A. R., & Tsarenko, T. A. (2013). Genetic algorithms for multicriteria optimization tasks in adaptive data‑routing networks. Bulletin of NTU “KhPI”, 56(1029), 44–50.
  4. Kolesnikov, K. V., Nikulin, O. G., & Karapetian, A. R. (2013). Using neural network models to find the optimal path in networks with adaptive packet routing. Bulletin: New Solutions in Modern Technologies, (56), 50–56.
  5. Komashinsky, V. I., & Smirnov, D. A. (2003). Neural networks and their applications in control and communications systems. Moscow: Goryachaya liniya – Telecom.
  6. Pavlenko, M. A. (2011). Analysis of the capabilities of artificial neural networks for solving single‑path routing tasks in TKS. Problems of Telecommunications, 2(4), 118–127.
  7. Pogorily, S. D., & Bilous, R. V. (2010). Genetic algorithm for the network routing problem. Problems of Programming, (2‑3, special issue), 171–178.
  8. Rosenberg, R. S. (1989). Simulation of genetic populations with biochemical properties. Mathematical Biosciences, 95, 223–257.
  9. Schaffer, J. D. (1985). Multiple objective optimization with a vector‑evaluated genetic algorithm. In J. J. Grefenstette (Ed.), Genetic Algorithms and Their Applications: Proceedings of the First International Conference on Genetic Algorithms (pp. 93–100). Hillsdale, NJ: Lawrence Erlbaum.
  10. Wieselthier, J. E., Barnhart, C. M., & Ephremides, A. A. (1994). Neural networks approach to routing without interference in multihop networks. IEEE Transactions on Communications, 42(1), 166–177.
  11. Wossserman, F. (1990). Neurocomputer technology: Theory and practice. Moscow: Mir.

Suggested citation

Karapetyan, A. (2016). The analysis of methods of optmization of data flows routing. Bulletin of Cherkasy State Technological University, 21(3), 11-16.