11 Apr
2023
11 Apr
'23
2:21 a.m.
On Apr 10, 2023, at 8:16 PM, Johnny Billquist
<bqt(a)softjar.se> wrote:
On 2023-04-11 02:04, Paul Koning wrote:
Great.
I meant that it uses the information for the adjacency in forwarding table entry 0, in
other words the adjacency that points towards the nearest L2 router. So yes, it will
report whoever is the neighbor on that path.
paul
On Apr
10, 2023, at 6:30 PM, Johnny Billquist <bqt(a)softjar.se> wrote:
...
.ncp tell pyrtr sho nod a2rtr
Node summary as of 11-APR-23 00:27:30
Remote Active Next
Node State Links Delay Circuit Node
2.1023 (A2RTR)
Sadly PYRTR did not actually tell what the next node is here. Not sure if it's just
an old version of PYRTR, or if there is something for Paul to improve. But you should get
the idea...
This will be in the next drop of T1.1 -- I should get that wrapped up.
The right algorithm is to use the "nearest
L2 router" info if it's out of area and this is an L1 router, or the area routing
data if it's an L2 router. Also, if the destination is out of area, then
"status" should omit hops/cost since they are not accurately known. I have all
that coded.
Uh? Are you sure about that? If you are an L1 router, then it should be the next hop
towards the L2 router, and that isn't necessarily the same as the L2 router...