About 8 years ago I described in this mailing list how to convert ALL network links to arcs which all are bound to a particular destination, and whereby each of these arcs might be classified to be a) best (=Dijkstra and ECMP, b) not best but leading to a neighbor node which is closer to the destination, c) leading to a neighbor node which has the same distance to the destination. Furthermore I have published how to use adjacent arcs towards their tails, eventually cranking back even to the ingress or even more remote routers, and also how to detect if some of them lead to a dead end network part.
I think you cannot do anything more than that. Who wants to verify might observe the network graph in www.hummel-research.de. Heiner -----Ursprüngliche Mitteilung----- Von: Alia Atlas <[email protected]> An: Yasuhiro Ohara <[email protected]>; egboeny <[email protected]>; eandcss <[email protected]> Cc: rtgwg <[email protected]> Verschickt: Mi, 23 Jul 2014 10:45 pm Betreff: RE: a MRT algorithm 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
_______________________________________________ rtgwg mailing list [email protected] https://www.ietf.org/mailman/listinfo/rtgwg
