Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Routing loop
open-in-new
<p>A routing loop is a common problem with various types of <a href="/facts/Network_theory/m6CQovwm">networks</a>, particularly <a href="/facts/Computer_network/3w5RM99p">computer networks</a>. They are formed when an error occurs in the operation of the <a href="/facts/Routing_algorithm/Ml6MVCaC">routing algorithm</a>, and as a result, in a group of nodes, the path to a particular destination forms a loop. </p><p>In the simplest version, a routing loop of size two, <a href="/facts/Node_(computer_science)/eYlvVE0z">node</a> A thinks that the path to some destination (call it C) is through its neighbouring node, node B. At the same time, node B thinks that the path to C starts at node A. </p><p>Thus, whenever traffic for C arrives at either A or B, it will loop endlessly between A and B, unless some mechanism exists to prevent that behaviour. </p>