The MENTOR routing algorithm is an algorithm for use in routing of mesh networks, specifically pertaining to their initial topology. It was developed in 1991 by Aaron Kershenbaum, Parviz Kermani, and George A. Grove and was published by the IEEE. == Complexity == Empirical observation has shown the complexity class of this algorithm to be O(N²), or quadratic.
The MENTOR routing algorithm is an algorithm for use in routing of mesh networks, specifically pertaining to their initial topology. It was developed in 1991 by Aaron Kershenbaum, Parviz Kermani, and George A. Grove and was published by the IEEE. == Complexity == Empirical observation has shown the complexity class of this algorithm to be O(N²), or quadratic.
Source: Wikipedia "MENTOR routing algorithm" · CC BY-SA 4.0
Share this article: X · Bluesky