Hi all, I’d like to expound a bit more on a point that I made at the mike in Bangkok.
The figures of merit for a flooding algorithm are the resulting diameter of the flooding topology and the maximum degree of the nodes in the topology. The diameter is important because it says how many hops an link state update will have to traverse before it covers the topology. This dictates what the convergence time of the network will be. The degree is important because it is the measure of the amount of replication that a node will have to do during flooding, and, more importantly, it is also a bound on the number of times that a node can receive replicas of the same update. If the degree is too high, then the node can be overwhelmed by an influx of flooding, resulting in instability. For a flooding algorithm to be seriously considered, it is important to characterize these results and understand how they grow under scale. In particular, I’m concerned about tree based algorithms because they typically have a large diameter because the tree is tall and spindly, or they end up with a large degree, because the tree is quite bushy. I would very much like to see candidate algorithms present how they perform. Here’s a few data points from our algorithm simulations, just for comparison: Graph Diameter Degree K4,17 4 10 K4,40 4 23 K8,80 4 22 K8,200 4 53 K16,200 6 28 K20,400 5 45 K40,800 6 43 Thanks, Tony
_______________________________________________ Lsr mailing list [email protected] https://www.ietf.org/mailman/listinfo/lsr
