DEVELOPING A MIX ALGORYTHM FOR DYNAMIC ROUTING

Authors

  • H.A. TSHATSHAPANYAN National Polytechnic University of Armenia Author

Keywords:

route,, dynamic routing, algorithm, oriented graphs, protocol, namber of bops

Abstract

A mix algorithm of dynamic routing based on the determination of minimal numbers of hops is developed. A topological database is used as in case of Dijkstra’s algorythm, but the determination of minimal number of hops gives an opportunity to reduce the search space of the optimal route. The developed algorithm has all the advantages of Dijkstra’s algorithm and is devoid of DVA algorithm flaws.

Downloads

Published

30.07.2026

Issue

Section

Articles

Similar Articles

1-10 of 89

You may also start an advanced similarity search for this article.