I defined a path as symmetric only for a given level of abstraction and added IP routing symmetric paths as an example.
But I'm not convinced that covers all cases, as the order might not be relevant for certain service functions as Gorry pointed out.
What we could do is phrase the definition more generally:
"Two paths are symmetric if the path and its reverse path consist of the same path elements on the same level of abstraction, buttypically in reverse order"
I defined a path as symmetric only for a given level of abstraction and added IP routing symmetric paths as an example.
But I'm not convinced that covers all cases, as the order might not be relevant for certain service functions as Gorry pointed out. What we could do is phrase the definition more generally: "Two paths are symmetric if the path and its reverse path consist of the same path elements on the same level of abstraction,
buttypically in reverse order"