Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Dynamic routing
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|A router process}} {{More citations needed|date=December 2009}} In [[computer networking]], '''dynamic routing''' ('''DR'''), also called '''adaptive routing''' ('''AR'''),<ref> Terrence Mak; Peter Y. K. Cheung; Kai-Pui Lam; and Wayne Luk. [http://www.doc.ic.ac.uk/~wl/papers/11/tie11tm.pdf "Adaptive Routing in Network-on-Chips Using a Dynamic-Programming Network"]. 2011. {{doi | 10.1109/TIE.2010.2081953}} p. 1. </ref><ref> {{cite journal|first1=Diego|last1=Lugones|first2=Daniel|last2=Franco|first3=Emilio|last3=Luque|title=Dynamic Routing Balancing On InfiniBand Networks|journal=Journal of Computer Science and Technology|volume=8|issue=2|year=2008|archive-date=6 May 2015|archive-url=https://web.archive.org/web/20150506055433/http://journal.info.unlp.edu.ar/journal/journal23/papers/JCST-Jul08-8.pdf|url=http://journal.info.unlp.edu.ar/journal/journal23/papers/JCST-Jul08-8.pdf}} </ref> 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.<ref>Haiyong Xie; [[Lili Qiu]]; Yang Richard Yang; and Yin Zhang. [http://www-net.cs.yale.edu/publications/XQYZ04.pdf "On Self Adaptive Routing in Dynamic Environments β An Evaluation and Design Using a Simple, Probabilistic Scheme"] {{Webarchive|url=https://web.archive.org/web/20110902190331/http://www-net.cs.yale.edu/publications/XQYZ04.pdf |date=2011-09-02 }}. 2004.</ref> 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.<ref>{{Cite web | url = https://www.pcmag.com/encyclopedia/term/42195/dynamic-routing | title = Definition of | publisher = PC}}</ref> 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.<ref>{{Cite web | url = https://technet.microsoft.com/en-us/library/cc957844.aspx | title = Static and Dynamic Routers | publisher = TechNet}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)