210:
25:
159:
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
154:
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
160:
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.
251:
35:
146:. This represents "a significant improvement over currently used algorithms, solutions of a quality competitive with other, much slower procedures."
93:
65:
244:
72:
280:
50:
79:
270:
237:
134:. It was developed in 1991 by Aaron Kershenbaum, Parviz Kermani, and George A. Grove and was published by the IEEE.
61:
275:
173:
165:
86:
177:
143:
221:
190:
217:
131:
209:
42:
142:
Empirical observation has shown the complexity class of this algorithm to be O(N²), or
264:
127:
24:
191:"MENTOR: An Algorithm for Mesh Network Topological Optimization and Routing"
169:
119:
123:
155:
capacity; and that "long, high-capacity links whenever possible."
18:
225:
46:
189:
245:
168:on which traffic flows in the latter case is
16:Algorithm for use in routing of mesh networks
8:
51:introducing citations to additional sources
130:, specifically pertaining to their initial
252:
238:
197:, April 1991. Accessed November 4, 2007.
41:Relevant discussion may be found on the
7:
206:
204:
195:IEEE Transactions on Communications
224:. You can help Knowledge (XXG) by
14:
208:
34:relies largely or entirely on a
23:
1:
297:
203:
62:"MENTOR routing algorithm"
116:MENTOR routing algorithm
281:Computer network stubs
162:
166:minimum spanning tree
157:
174:Dijkstra's algorithm
47:improve this article
218:computer networking
271:Routing algorithms
233:
232:
112:
111:
97:
288:
254:
247:
240:
212:
205:
178:Prim's algorithm
107:
104:
98:
96:
55:
27:
19:
296:
295:
291:
290:
289:
287:
286:
285:
276:Mesh networking
261:
260:
259:
258:
201:
186:
152:
140:
108:
102:
99:
56:
54:
40:
28:
17:
12:
11:
5:
294:
292:
284:
283:
278:
273:
263:
262:
257:
256:
249:
242:
234:
231:
230:
213:
199:
198:
185:
182:
151:
148:
139:
136:
110:
109:
45:. Please help
31:
29:
22:
15:
13:
10:
9:
6:
4:
3:
2:
293:
282:
279:
277:
274:
272:
269:
268:
266:
255:
250:
248:
243:
241:
236:
235:
229:
227:
223:
220:article is a
219:
214:
211:
207:
202:
196:
192:
188:
187:
183:
181:
179:
175:
171:
170:heuristically
167:
161:
156:
149:
147:
145:
137:
135:
133:
129:
128:mesh networks
125:
121:
117:
106:
103:December 2020
95:
92:
88:
85:
81:
78:
74:
71:
67:
64: –
63:
59:
58:Find sources:
52:
48:
44:
38:
37:
36:single source
32:This article
30:
26:
21:
20:
226:expanding it
215:
200:
194:
163:
158:
153:
141:
115:
113:
100:
90:
83:
76:
69:
57:
33:
172:defined by
150:Methodology
122:for use in
265:Categories
184:References
138:Complexity
73:newspapers
144:quadratic
120:algorithm
43:talk page
132:topology
124:routing
87:scholar
118:is an
89:
82:
75:
68:
60:
216:This
94:JSTOR
80:books
222:stub
176:and
164:The
114:The
66:news
126:of
49:by
267::
193:,
180:.
253:e
246:t
239:v
228:.
105:)
101:(
91:·
84:·
77:·
70:·
53:.
39:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
