diff options
| author | Donald Sharp <sharpd@nvidia.com> | 2023-10-10 16:43:07 -0400 |
|---|---|---|
| committer | Mergify <37929162+mergify[bot]@users.noreply.github.com> | 2023-10-11 05:02:50 +0000 |
| commit | 492d542ba01535a657e53344bbbd6b48c9d02da9 (patch) | |
| tree | 03dd632140ed0394188f0cb35bb8af2a609e8dad | |
| parent | 8a1f5422e26683fbdb3ec15db66d4d0e31f368cc (diff) | |
Revert "doc: move bgp references at the right place"
This reverts commit 709fe971fdd998687fdb9d1e36eca3fb9c8b3265.
(cherry picked from commit c27409358717ccf07076eb01a1c133c5802b6404)
| -rw-r--r-- | doc/user/bgp.rst | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/doc/user/bgp.rst b/doc/user/bgp.rst index 5ddaaffe1e..7a7f9863bb 100644 --- a/doc/user/bgp.rst +++ b/doc/user/bgp.rst @@ -827,10 +827,6 @@ from eBGP peers, :ref:`bgp-route-selection`. MED as an intra-AS metric to steer equal-length AS_PATH routes to, e.g., desired exit points. -.. [#med-transitivity-rant] For some set of objects to have an order, there *must* be some binary ordering relation that is defined for *every* combination of those objects, and that relation *must* be transitive. I.e.:, if the relation operator is <, and if a < b and b < c then that relation must carry over and it *must* be that a < c for the objects to have an order. The ordering relation may allow for equality, i.e. a < b and b < a may both be true and imply that a and b are equal in the order and not distinguished by it, in which case the set has a partial order. Otherwise, if there is an order, all the objects have a distinct place in the order and the set has a total order) -.. [bgp-route-osci-cond] McPherson, D. and Gill, V. and Walton, D., "Border Gateway Protocol (BGP) Persistent Route Oscillation Condition", IETF RFC3345 -.. [stable-flexible-ibgp] Flavel, A. and M. Roughan, "Stable and flexible iBGP", ACM SIGCOMM 2009 -.. [ibgp-correctness] Griffin, T. and G. Wilfong, "On the correctness of IBGP configuration", ACM SIGCOMM 2002 .. _bgp-graceful-restart: @@ -5236,6 +5232,10 @@ Show command json output: .. include:: flowspec.rst +.. [#med-transitivity-rant] For some set of objects to have an order, there *must* be some binary ordering relation that is defined for *every* combination of those objects, and that relation *must* be transitive. I.e.:, if the relation operator is <, and if a < b and b < c then that relation must carry over and it *must* be that a < c for the objects to have an order. The ordering relation may allow for equality, i.e. a < b and b < a may both be true and imply that a and b are equal in the order and not distinguished by it, in which case the set has a partial order. Otherwise, if there is an order, all the objects have a distinct place in the order and the set has a total order) +.. [bgp-route-osci-cond] McPherson, D. and Gill, V. and Walton, D., "Border Gateway Protocol (BGP) Persistent Route Oscillation Condition", IETF RFC3345 +.. [stable-flexible-ibgp] Flavel, A. and M. Roughan, "Stable and flexible iBGP", ACM SIGCOMM 2009 +.. [ibgp-correctness] Griffin, T. and G. Wilfong, "On the correctness of IBGP configuration", ACM SIGCOMM 2002 .. _bgp-fast-convergence: |