Hi Tony,
Thank you so much for the responses and changes! All of this sounds great.
One reply inline:
On 3/8/24 10:37, Tony Li wrote:
Are edges the same as links, in
which case please consider using consistent terms?
In general, edges and links are synonymous in graph theory and routing. However, in this document, we are making something of a subtle distinction that is described in section 4.6.
The distinction is relevant when you consider parallel links between nodes. The flooding topology is computed on edges, which we are defining as a pair of nodes. This can be instantiated by flooding on a given link. In the case of PTP links, we do not care that the nodes choose the same link for the edge, as they are functionally equivalent. However, if broadcast LANs are involved, the distinction becomes relevant as other nodes will become part of the flooding topology.
This makes a lot of sense, thank you for the clarification.
Please consider adding a short note about how you are using the term
edge in this case.
Best,
Reese
--
last-call mailing list
last-call@xxxxxxxx
https://www.ietf.org/mailman/listinfo/last-call
