
I know this is just one datapoint, but here are some results for the
comparison of the two PLSN algorithms for a real world network having a few
asymmetric cost links (14 out of a total of 340).
The numbers give the number of source destination pairs which are subject
to looping for each of the links which generate a nonzero number of loops.
There are 187 nodes in this network, and hence 34782 possible source
destination pairs.
As you can see, the results for the symmetric algorithm are (as expected)
much better than the asymmetric, even though there will be some loops extra
loops caused by the use of the "wrong" algorithm. But note that in no case
is the symmetric algorithm worse than the asymmetric.
Clearly a network with more asymmetric links (or perhaps links having more
asymmetry, or both) would be more likely to give a result in favour of the
asymmetric algorithm. But this network is fairly typical of the real world
collection I have.
asymsym
49200
12140
11411141
10200
5160
4720
452352
4260
3900
3270
18385
1800
175174
157138
157138
157138
12417
1200
1100
9415
9415
8915
5620
5454
500
360
300
280
278
1414
70
60
00
00
_______________________________________________
Rtgwg mailing list
[email protected]
https://www1.ietf.org/mailman/listinfo/rtgwg

