Subject: [Roll] A paper on routing loops in DAGs

From: Mukul Goyal <[email-masked]>
Date: Wed, 25 Nov 2009 12:36:16 -0600 (CST)

Hi all,

Here is a simulations-based paper on transient routing loops in DAGs and the efficacy of loop avoidance (advertise infinite rank before increasing rank) in dealing with routing loops:

http://www.cs.uwm.edu/~mukul/dag_loops.pdf

We basically make the point that, in most cases, the routing loops get resolved quickly on their own and any extra loop avoidance (involving advertising an infinite rank and consequent dismantling of the sub-DAG) may cause more turmoil in the network than the routing loops themselves.

Thanks
Mukul