Yaakov Stein wrote:
Stewart
What you did was to discretize the area of possible solutions
by looking for them using a brute force method, and to average them.
Yaakov, the reason that I took this approach was a practical one - there
are a lot of triangular loops in a network, particularly and enterprise
network, so with some very simple network technology we can determine
the asymmetry in a large number of sub-networks within the network as a
whole. So we can mechanistically determine these paths and probe them.
I also not that in the second example the information gathered at node 1
is essentially the next neighbour delays for all nodes plus the three
shortest indirect paths back to 1 via the next hop, which could be
approached mechanistically.
In general what you need is the time on your own SPF tree, not the whole
set of times that exist in the network. So it would be logical for 1 to
work with the loops 1-2-3-5-6 and 1-10-9-8-6 and for 1 to gather the
2-4-7-9 times from the measurements taken by one of those nodes.
Also note that if 4-7 did not exist and the clock was at 4 of 7 all
nodes would have to make the standard symmetry assumption for the 4-2
and the 9-7 hops.
- Stewart
_______________________________________________
TICTOC mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/tictoc
