Hi Tony,
> A prunner MUST build CDS only within its component, i.e. algorithm X will > only optimize the A1/B1/A2/B2 component and cannot start to "decide about > other parts of the network" like assuming what Y will do or tell nodes in Y > what to do. This would amount to give a simile something like "proxy purging" > and cannot work since prunners MUST not have any semantics about each other > (otherwise attempt to build algorithms independently and interoperate those > is impossible). I think we are making progress. Let me see if I can restate this: A distributed algorithm computing a flooding topology must only operate upon nodes running the same algorithm (and version). If multiple algorithms (and/or versions) are running in the same network, then any given algorithm and version defines a subgraph and the algorithm can only optimize flooding within its own subgraph. Legacy full flooding must be used between subgraphs of different algorithms or versions. Have I captured that accurately? Tony
_______________________________________________ Lsr mailing list -- [email protected] To unsubscribe send an email to [email protected]
