Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Turn restriction routing
open-in-new
<p> A <a href="/facts/Routing/Ml6MVCaC">routing algorithm</a> decides the path followed by a <a href="/facts/Network_packet/xCYf8SJu">packet</a> from the source to destination <a href="/facts/Router_(computing)/Nh5cIyVf">routers</a> in a <a href="/facts/Computer_network/3w5RM99p">network</a>. An important aspect to be considered while designing a routing algorithm is avoiding a <a href="/facts/Deadlock_(computer_science)/YDpdfnPP">deadlock</a>. Turn restriction routing is a routing algorithm for <a href="/facts/Mesh_networking/XnVSy5rK">mesh</a>-family of <a href="/facts/Network_topology/rBYE0kke">topologies</a> which avoids deadlocks by restricting the types of turns that are allowed in the algorithm while determining the route from source <a href="/facts/Node_(networking)/LBp2vNcJ">node</a> to destination node in a network.</p>