Dynamic routing
 | This article needs additional citations for verification. (December 2009) |
Dynamic routing, also called adaptive routing,[1][2] 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.[3] The term is most commonly associated with data networking 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.[4] Dynamic routing allows as many routes as possible to remain valid in response to the change.
Systems that do not implement dynamic routing are described as using static routing, 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.[5]
All protocols
[edit]There are several routing protocols that can be used for dynamic routing. Routing Information Protocol (RIP) is a distance-vector routing protocol that prevents routing loops by implementing a limit on the number of hops allowed in a path from source to destination.[6] Open Shortest Path First (OSPF) uses a link state routing (LSR) algorithm and falls into the group of interior gateway protocols (IGPs).[7] Intermediate System to Intermediate System (IS-IS) determines the best route for data through a packet-switched network.[7] Interior Gateway Routing Protocol (IGRP) and its advanced form Enhanced Interior Gateway Routing Protocol (EIGRP) are used by routers to exchange routing data within an autonomous system.[7]
Alternate paths
[edit]Many systems use some next-hop 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.
Routers that use some adaptive protocols, such as the Spanning Tree Protocol, in order to "avoid bridge loops and routing loops", 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.
Routers that use other adaptive protocols, such as grouped adaptive routing, find a group of all 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 link aggregation of that group of links effectively becomes a single high-bandwidth connection.[8]
Outside of computer networks
[edit]Contact centres 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 omnichannel.[9]
Dynamic routing in found the brain in relation between sensory and mnemonic signals and decision making, and is a subject of studies in neuroscience.[10]
People using public transport 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.
See also
[edit]References
[edit]- ^ Terrence Mak; Peter Y. K. Cheung; Kai-Pui Lam; and Wayne Luk. "Adaptive Routing in Network-on-Chips Using a Dynamic-Programming Network". 2011. doi:10.1109/TIE.2010.2081953 p. 1.
- ^ Lugones, Diego; Franco, Daniel; Luque, Emilio (2008). "Dynamic Routing Balancing On InfiniBand Networks" (PDF). Journal of Computer Science and Technology. 8 (2). Archived from the original (PDF) on 6 May 2015.
- ^ Haiyong Xie; Lili Qiu; Yang Richard Yang; and Yin Zhang. "On Self Adaptive Routing in Dynamic Environments — An Evaluation and Design Using a Simple, Probabilistic Scheme" Archived 2011-09-02 at the Wayback Machine. 2004.
- ^ "Definition of". PC.
- ^ "Static and Dynamic Routers". TechNet.
- ^ "Dynamic routing with RIP". Tech Republic.
- ^ a b c "Comparing Dynamic Routing Protocols". Network Computing.
- ^ Stefan Haas. "The IEEE 1355 Standard: Developments, Performance and Application in High Energy Physics". 1998. p. 91.
- ^ "Best Practices for Contact Center Routing". Genesys. Archived from the original on 2018-05-02. Retrieved 2017-11-18.
- ^ "Dynamic routing of task-relevant signals for decision making in dorsolateral prefrontal cortex". Nature.
