Always Acyclic Distributed Path Computation

10.1109/TCOM.1981.1094876

10.1109/TCOM.1979.1094552

10.1109/TCOM.1982.1095632

10.1109/90.222913

vutukury, 1999, a simple approximation to minimum-delay routing, Proc ACM Sigcomm, 227, 10.1145/316194.316227

vutukury, 2001, mdva: a distance-vector multipath routing protocol, Proc IEEE InfoCom, 1, 557

10.1109/INFOCOM.2006.229

0, Transparent interconnection of lots of links (trill)

0, 802 1aqShortest path bridging

bertsekas, 1991, Data Networks

10.1109/35.809387

myers, 2004, rethinking the service model: scaling ethernet to a million nodes, ACM SIGCOMM HotNets

10.17487/rfc2328

10.1109/INFCOM.2005.1497895

10.17487/rfc2453

10.1145/505202.505218

shankar, 1995, transient and steady-state performance of routing protocols: distance-vector versus link-state, Internetw Res Exper, 6, 59

albrightson, 1994, eigrp a fast routing protocol based on distance vectors, Netw /Interop

10.1145/1016707.1016709

zaumen, 1991, dynamics of distributed shortest path routing algorithms, Proc ACM Sigcomm, 31, 10.1145/115994.115997

10.1016/0020-0190(80)90021-6

10.1109/26.87189

barabsi, 1999, emergence of scaling in random networks, Science, 286, 509, 10.1126/science.286.5439.509

10.1109/INFCOM.1997.631180

10.1109/INFCOM.2000.832225