http://debianws.lexgopc.com/wiki143/index.php?action=history&feed=atom&title=MENTOR_routing_algorithmMENTOR routing algorithm - Revision history2026-05-04T18:26:45ZRevision history for this page on the wikiMediaWiki 1.43.1http://debianws.lexgopc.com/wiki143/index.php?title=MENTOR_routing_algorithm&diff=5735288&oldid=previmported>Kvng: stub2024-08-27T15:01:48Z<p>stub</p>
<p><b>New page</b></p><div>{{Short description|Algorithm for use in routing of mesh networks}}<br />
{{one source|date=December 2020}}<br />
The '''MENTOR routing algorithm''' is an [[algorithm]] for use in [[routing]] of [[mesh networks]], specifically pertaining to their initial [[Network topology|topology]]. It was developed in 1991 by Aaron Kershenbaum, Parviz Kermani, and George A. Grove and was published by the IEEE.<br />
<br />
==Complexity==<br />
Empirical observation has shown the complexity class of this algorithm to be O(N²), or [[quadratic function|quadratic]]. This represents "a significant improvement over currently used algorithms, [while still yielding] solutions of a quality competitive with other, much slower procedures."<br />
<br />
==Methodology==<br />
The algorithm assumes three things are conducive to low-"cost" (that is, minimal in distance travelled and time between destinations) topology: that paths will tend to be direct, not circuitous; that links will have a "high utilization"—that is, they will be used to nearly their maximum operating capacity; and that "long, high-capacity links [will be used] whenever possible."<br />
<br />
<blockquote>The overall plan is to send traffic over a direct route between the source and destination whenever the magnitude of the requirement is sufficiently large and to send it via a path within a tree in all other cases. In the former case, we are satisfying all three of our goals--we are using a direct path of high utilization and high capacity. In the latter case we are satisfying at least the last two objectives as we are aggregating traffic as much as possible. </blockquote><br />
<br />
The [[minimum spanning tree]] on which traffic flows in the latter case is [[heuristic]]ally defined by [[Dijkstra's algorithm]] and [[Prim's algorithm]].<br />
<br />
==References==<br />
{{Reflist}}<br />
*Aaron Kershenbaum, Parviz Kermani, George A. Grover. [https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=81738 "MENTOR: An Algorithm for Mesh Network Topological Optimization and Routing"], ''IEEE Transactions on Communications'', April 1991. Accessed November 4, 2007.<br />
<br />
[[Category:Routing algorithms]]<br />
[[Category:Mesh networking]]<br />
<br />
<br />
{{compu-network-stub}}</div>imported>Kvng