25:
140:, where routes through a network are described by fixed paths. A change, such as the loss of a node, or loss of a connection between nodes, is not compensated for. This means that anything that wishes to take an affected path will either have to wait for the failure to be repaired before restarting its journey, or will have to fail to reach its destination and give up the journey.
239:", calculate a tree that indicates the one "best" link for a packet to get to its destination. Alternate "redundant" links not on the tree are temporarily disabled—until one of the links on the main tree fails, and the routers calculate a new tree using those links to route around the broken link.
132:
to describe the capability of a network to 'route around' damage, such as loss of a node or a connection between nodes, as long as other path choices are available. Dynamic routing allows as many routes as possible to remain valid in response to the change.
265:
employ dynamic routing based on the customer's enquiry and agent's skills to increase the operational efficiency of the call handling by agents, which boosts both agent and customer satisfaction. This adaptive strategy is known as
128:, is a process where a router can forward data via a different route for a given destination based on the current conditions of the communication circuits within a system. The term is most commonly associated with
288:
also exhibit dynamic routing behaviour. For example, if a local railway station is closed, people can alight from the train at a different station and use a bus to reach their destination.
224:
forwarding protocol—when a packet arrives at some node, that node decides on-the-fly which link to use to push the packet one hop closer to its final destination.
250:
the links that could be used to get the packet one hop closer to its final destination. The router sends the packet out any link of that group which is idle. The
197:
181:
349:
521:
307:
193:
108:
157:
42:
388:
452:
89:
46:
61:
209:
153:
68:
173:
479:
386:"On Self Adaptive Routing in Dynamic Environments — An Evaluation and Design Using a Simple, Probabilistic Scheme"
35:
177:
75:
169:
165:
364:
189:
57:
228:
302:
277:
in relation between sensory and mnemonic signals and decision making, and is a subject of studies in
161:
149:
433:
201:
505:"Dynamic routing of task-relevant signals for decision making in dorsolateral prefrontal cortex"
405:
504:
466:
82:
536:
419:
331:
285:
251:
221:
467:"The IEEE 1355 Standard: Developments, Performance and Application in High Energy Physics"
392:
129:
297:
137:
530:
385:
327:
278:
236:
267:
262:
232:
24:
254:
of that group of links effectively becomes a single high-bandwidth connection.
335:
483:
328:"Adaptive Routing in Network-on-Chips Using a Dynamic-Programming Network"
381:
205:
185:
136:
Systems that do not implement dynamic routing are described as using
274:
326:
Terrence Mak; Peter Y. K. Cheung; Kai-Pui Lam; and Wayne Luk.
18:
522:
Session-based routing holds the key to the
Internet’s future
348:
Lugones, Diego; Franco, Daniel; Luque, Emilio (2008).
227:
Routers that use some adaptive protocols, such as the
242:Routers that use other adaptive protocols, such as
49:. Unsourced material may be challenged and removed.
447:
445:
443:
350:"Dynamic Routing Balancing On InfiniBand Networks"
168:allowed in a path from source to destination.
8:
176:(LSR) algorithm and falls into the group of
480:"Best Practices for Contact Center Routing"
357:Journal of Computer Science and Technology
198:Enhanced Interior Gateway Routing Protocol
182:Intermediate System to Intermediate System
164:by implementing a limit on the number of
109:Learn how and when to remove this message
319:
152:that can be used for dynamic routing.
453:"Comparing Dynamic Routing Protocols"
7:
384:; Yang Richard Yang; and Yin Zhang.
308:Routing in delay-tolerant networking
47:adding citations to reliable sources
14:
194:Interior Gateway Routing Protocol
158:distance-vector routing protocol
23:
34:needs additional citations for
1:
273:Dynamic routing in found the
196:(IGRP) and its advanced form
420:"Static and Dynamic Routers"
258:Outside of computer networks
184:(IS-IS) determines the best
154:Routing Information Protocol
553:
434:"Dynamic routing with RIP"
178:interior gateway protocols
482:. Genesys. Archived from
336:10.1109/TIE.2010.2081953
244:grouped adaptive routing
170:Open Shortest Path First
190:packet-switched network
229:Spanning Tree Protocol
220:Many systems use some
303:Convergence (routing)
231:, in order to "avoid
455:. Network Computing.
200:(EIGRP) are used by
43:improve this article
363:(2). Archived from
188:for data through a
391:2011-09-02 at the
246:, find a group of
174:link state routing
148:There are several
210:autonomous system
119:
118:
111:
93:
58:"Dynamic routing"
544:
509:
508:
501:
495:
494:
492:
491:
476:
470:
463:
457:
456:
449:
438:
437:
436:. Tech Republic.
430:
424:
423:
416:
410:
409:
402:
396:
378:
372:
371:
369:
354:
345:
339:
324:
286:public transport
252:link aggregation
126:adaptive routing
114:
107:
103:
100:
94:
92:
51:
27:
19:
16:A router process
552:
551:
547:
546:
545:
543:
542:
541:
527:
526:
518:
513:
512:
503:
502:
498:
489:
487:
478:
477:
473:
464:
460:
451:
450:
441:
432:
431:
427:
418:
417:
413:
406:"Definition of"
404:
403:
399:
393:Wayback Machine
379:
375:
367:
352:
347:
346:
342:
325:
321:
316:
294:
263:Contact centres
260:
218:
216:Alternate paths
208:data within an
146:
130:data networking
122:Dynamic routing
115:
104:
98:
95:
52:
50:
40:
28:
17:
12:
11:
5:
550:
548:
540:
539:
529:
528:
525:
524:
517:
516:External links
514:
511:
510:
496:
471:
469:. 1998. p. 91.
458:
439:
425:
411:
397:
373:
370:on 6 May 2015.
340:
318:
317:
315:
312:
311:
310:
305:
300:
298:Static routing
293:
290:
259:
256:
217:
214:
172:(OSPF) uses a
160:that prevents
145:
142:
138:static routing
124:, also called
117:
116:
31:
29:
22:
15:
13:
10:
9:
6:
4:
3:
2:
549:
538:
535:
534:
532:
523:
520:
519:
515:
506:
500:
497:
486:on 2018-05-02
485:
481:
475:
472:
468:
465:Stefan Haas.
462:
459:
454:
448:
446:
444:
440:
435:
429:
426:
421:
415:
412:
407:
401:
398:
394:
390:
387:
383:
380:Haiyong Xie;
377:
374:
366:
362:
358:
351:
344:
341:
337:
333:
329:
323:
320:
313:
309:
306:
304:
301:
299:
296:
295:
291:
289:
287:
284:People using
282:
280:
276:
271:
269:
264:
257:
255:
253:
249:
245:
240:
238:
237:routing loops
234:
230:
225:
223:
215:
213:
211:
207:
203:
199:
195:
191:
187:
183:
179:
175:
171:
167:
163:
162:routing loops
159:
155:
151:
144:All Protocols
143:
141:
139:
134:
131:
127:
123:
113:
110:
102:
99:December 2009
91:
88:
84:
81:
77:
74:
70:
67:
63:
60: –
59:
55:
54:Find sources:
48:
44:
38:
37:
32:This article
30:
26:
21:
20:
499:
488:. Retrieved
484:the original
474:
461:
428:
414:
400:
376:
365:the original
360:
356:
343:
322:
283:
279:neuroscience
272:
261:
247:
243:
241:
233:bridge loops
226:
219:
204:to exchange
147:
135:
125:
121:
120:
105:
96:
86:
79:
72:
65:
53:
41:Please help
36:verification
33:
268:omnichannel
156:(RIP) is a
490:2017-11-18
422:. TechNet.
314:References
69:newspapers
507:. Nature.
150:protocols
531:Category
389:Archived
382:Lili Qiu
330:. 2011.
292:See also
222:next-hop
180:(IGPs).
537:Routing
395:. 2004.
206:routing
202:routers
83:scholar
85:
78:
71:
64:
56:
408:. PC.
368:(PDF)
353:(PDF)
338:p. 1.
275:brain
186:route
90:JSTOR
76:books
235:and
166:hops
62:news
332:doi
248:all
45:by
533::
442:^
359:.
355:.
281:.
270:.
212:.
192:.
493:.
361:8
334::
112:)
106:(
101:)
97:(
87:·
80:·
73:·
66:·
39:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
