Closed italobusi closed 3 years ago
k-shortest could do with a reference
- [ ] @italobusi , @sergiobelotti : check for a reference
I have found https://tools.ietf.org/html/rfc2386 which also references:
[T88] D. M. Topkis, "A k-Shortest-Path Algorithm for Adaptive Routing in Communications Networks", IEEE Trans. Communications, pp. 855-859, July, 1988.
compute-only mode in the config data-store which datastore? elsewhere you name the datastore
- [ ] @italobusi , @sergiobelotti : check NMDA terminology
- [ ] we used the tern "running" and "operational" datastore that are both correct. The state of each created "compute-only" TE tunnel are maintained in the running or intended as well and operational datastore.
It seems that we need to change 'config data-store' with 'running data-store' in the text
See: https://mailarchive.ietf.org/arch/msg/teas/xIc0tBnZ9AHhkXKC47UorRNwxss/
Authors> Ok. We have used the following conventions:
Please check if anything has been missed in the -12 version
Authors> Ok: please check if anything has been missed in the -12 version
Authors> Ok
Authors> We have looked for some references and found many papers which mainly described different algorithms that could be used for computing k-shorted paths as if the term is well-known.
Within IETF, we have found https://tools.ietf.org/html/rfc2386 which also references:
[T88] D. M. Topkis, "A k-Shortest-Path Algorithm for Adaptive Routing in Communications Networks", IEEE Trans. Communications, pp. 855-859, July, 1988.
We are not really sure that this IEEE paper or RFC2386 would be a good reference for the definition.
Any opinion?
Authors> Ok
Authors> Ok
Authors> Ok
Authors> Ok: we will use the term Path Delete RPC in -12 version
Authors> The term "YANG-based protocols" is used in section 1.1 of RFC7950.
Authors> This is stated some paragraph below when describing the content of the draft:
This document defines a YANG Data Model [RFC7950] for an RPC to request path computation, which complements the solution defined in [TE TUNNEL], to configure a TE Tunnel path in “compute-only” mode.
Authors> Ok: for consistency, done also in s.2.2
Authors> Ok
Authors> Ok: for consistency, done also in s.3.2 and s.3.2.2
Authors> Ok
Authors> Ok
Authors> Proposed to rephrase as:
there are more chances not to find a path or to get a suboptimal path that than performing multiple per-domain path computations and then stitch them
Authors> Ok
Authors> Ok: c/config data-store/running datastore/
Authors> Ok
Authors> Ok
Authors> Ok
Authors> Ok
Authors> Not sure the change would be consistent with the intended meaning. What about rephrasing the text as:
It also allows the client to request in the input of RPC which information (metrics, srlg and/or affinities) should be returned
Authors> Ok
Authors> Ok
Authors> It is a pity that pagination has been expunged. However, given the technical content of the draft and the diagrams, we think it is quite difficult to shorten the exiting sections.