MENTOR routing algorithm - Revision history

Kvng: stub

2024-08-27T15:01:48Z

stub

← Previous revision		Revision as of 15:01, 27 August 2024
Line 19:		Line 19:
	[[Category:Routing algorithms]]		[[Category:Routing algorithms]]
	[[Category:Mesh networking]]		[[Category:Mesh networking]]


			{{compu-network-stub}}

GreenC bot: Move 1 url. Wayback Medic 2.5 per WP:URLREQ#ieee.org

2024-07-31T04:22:51Z

Move 1 url. Wayback Medic 2.5 per WP:URLREQ#ieee.org

← Previous revision		Revision as of 04:22, 31 July 2024
Line 15:		Line 15:
	==References==		==References==
	{{Reflist}}		{{Reflist}}
	*Aaron Kershenbaum, Parviz Kermani, George A. Grover. [~~http~~://ieeexplore.ieee.org/~~iel1~~/~~26/2681/00081738~~.~~pdf~~?~~tp=&isnumber=2681&~~arnumber=81738~~&type=ref~~ "MENTOR: An Algorithm for Mesh Network Topological Optimization and Routing"], ''IEEE Transactions on Communications'', April 1991. Accessed November 4, 2007.		*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.

	[[Category:Routing algorithms]]		[[Category:Routing algorithms]]

Kvng: Adding short description: "Algorithm for use in routing of mesh networks" (Shortdesc helper)

2022-04-06T22:39:14Z

Adding short description: "Algorithm for use in routing of mesh networks" (Shortdesc helper)

← Previous revision		Revision as of 22:39, 6 April 2022
Line 1:		Line 1:
			{{Short description\|Algorithm for use in routing of mesh networks}}
	{{one source\|date=December 2020}}		{{one source\|date=December 2020}}
	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.		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.

JoeNMLC: Successfully de-orphaned!♦ Wikiproject Orphanage: You can help!♦

2022-03-11T20:05:24Z

Successfully de-orphaned!♦ Wikiproject Orphanage: You can help!♦

← Previous revision		Revision as of 20:05, 11 March 2022
Line 1:		Line 1:
	{{multiple issues\|
	{{one source\|date=December 2020}}		{{one source\|date=December 2020}}
	{{Orphan\|date=February 2009\|att=December 2020}}
	}}
	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.		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.

Kvng: avoid unnec redirect

2021-06-22T20:44:34Z

avoid unnec redirect

← Previous revision		Revision as of 20:44, 22 June 2021
Line 3:		Line 3:
	{{Orphan\|date=February 2009\|att=December 2020}}		{{Orphan\|date=February 2009\|att=December 2020}}
	}}		}}
	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.		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.

	==Complexity==		==Complexity==

Michaelwallace22: attempted de-orphan, couldn't find relevant place to link this

2020-12-13T04:28:23Z

attempted de-orphan, couldn't find relevant place to link this

← Previous revision		Revision as of 04:28, 13 December 2020
Line 1:		Line 1:
	{{multiple issues\|		{{multiple issues\|
	{{one source\|date=December 2020}}		{{one source\|date=December 2020}}
	{{Orphan\|date=February 2009\|att=~~February~~ 2020}}		{{Orphan\|date=February 2009\|att=December 2020}}
	}}		}}
	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.		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.

Michaelwallace22: one source

2020-12-13T04:28:08Z

one source

← Previous revision		Revision as of 04:28, 13 December 2020
Line 1:		Line 1:
			{{multiple issues\|
			{{one source\|date=December 2020}}
	{{Orphan\|date=February 2009\|att=February 2020}}		{{Orphan\|date=February 2009\|att=February 2020}}
			}}
	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.		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.

Mccapra: Attempted to de-orphan. Wikiproject Orphanage: You can help!

2020-02-25T08:18:56Z

Attempted to de-orphan. Wikiproject Orphanage: You can help!

← Previous revision		Revision as of 08:18, 25 February 2020
Line 1:		Line 1:
	{{Orphan\|date=February 2009}}		{{Orphan\|date=February 2009\|att=February 2020}}
	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.		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.

Fixuture: added Category:Mesh networking using HotCat

2017-01-06T16:35:26Z

added Category:Mesh networking using HotCat

← Previous revision		Revision as of 16:35, 6 January 2017
Line 17:		Line 17:

	[[Category:Routing algorithms]]		[[Category:Routing algorithms]]
			[[Category:Mesh networking]]

Yobot: /* Methodology */WP:CHECKWIKI error fixes + other fixes using AWB (10065)

2014-03-29T09:17:39Z

Methodology: WP:CHECKWIKI error fixes + other fixes using AWB (10065)

← Previous revision		Revision as of 09:17, 29 March 2014
Line 6:		Line 6:

	==Methodology==		==Methodology==
	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."		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."

	<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>		<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>

← Previous revision		Revision as of 22:39, 6 April 2022
Line 1:		Line 1:
			{{Short description\|Algorithm for use in routing of mesh networks}}
	{{one source\|date=December 2020}}		{{one source\|date=December 2020}}
	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.		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.

← Previous revision		Revision as of 20:05, 11 March 2022
Line 1:		Line 1:
	{{multiple issues\|
	{{one source\|date=December 2020}}		{{one source\|date=December 2020}}
	{{Orphan\|date=February 2009\|att=December 2020}}
	}}
	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.		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.

← Previous revision		Revision as of 04:28, 13 December 2020
Line 1:		Line 1:
	{{multiple issues\|		{{multiple issues\|
	{{one source\|date=December 2020}}		{{one source\|date=December 2020}}
	{{Orphan\|date=February 2009\|att=~~February~~ 2020}}		{{Orphan\|date=February 2009\|att=December 2020}}
	}}		}}
	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.		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.

← Previous revision		Revision as of 04:28, 13 December 2020
Line 1:		Line 1:
			{{multiple issues\|
			{{one source\|date=December 2020}}
	{{Orphan\|date=February 2009\|att=February 2020}}		{{Orphan\|date=February 2009\|att=February 2020}}
			}}
	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.		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.