Applicability of Analytical Tree Search Algorithms in Network Routing
Ivan Ćavar, D. Valencic · Annals of DAAAM for ... & proceedings of the ... International DAAAM Symposium · 2011
Today's network routing protocols use various algorithms for finding the best path to other networks.For example, we have routing protocols that use Bellman-Ford, Dijsktra's Shortest Path First and Cisco's Diffusing Update Algorithm.In this article we will analyze if there are any other tree search algorithms that can be used in network routing and what to expect from them.