Thanks for the pointer. Alia
-----Original Message----- From: Yasuhiro Ohara [mailto:[email protected]] Sent: Wednesday, July 23, 2014 4:33 PM To: [email protected]; Alia Atlas; [email protected] Cc: [email protected] Subject: a MRT algorithm Hi, Regarding Maximally Redundant Trees algorithms, please take a look at my IEEE INFOCOM paper in 2009, which is titled "MARA: Maximum Alternative Routing Algorithm". It is a extended version of Dijkstra, and we've succeeded to extend the Dijkstra's shortest path tree. This means that the calculated DAG is compatible to the current SPF Tree, so you might not need multi-topology in the first place. http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=5061933&searchWithin%3Dp_Authors%3A.QT.Ohara%2C+Y..QT.%26searchWithin%3Dp_Author_Ids%3A37302386400 http://web.sfc.keio.ac.jp/~rdv/publications/ohara-mara-infocom09.pdf regards, Yasu _______________________________________________ rtgwg mailing list [email protected] https://www.ietf.org/mailman/listinfo/rtgwg
