3 ms·
OK, it's 4am, so presumably part of my brain is asleep, but I'm missing something here. If the latencies were unconstrained, I would agree that it is impossibl
by tempestn 14y ago
OK, it's 4am, so presumably part of my brain is asleep, but I'm missing something here. If the latencies were unconstrained, I would agree that it is impossible to solve the initial riddle. However, since it states that there are only two possibilities, 2s:2s or 3s:1s, it sure seems solvable to me. You have two equations and three variables, but you don't need to solve for the three variables. You can eliminate the skew and end up with a single equation and two variables - the two latencies. That allows you to solve for the difference between the latencies. And since the possibilities are constrained, that is sufficient to solve the problem.
Of course, in a real world scenario the possible latencies would not be discrete, so indeed the problem would not be solvable. But that's not how it was presented. So either the puzzle was poorly constructed as an analogy for the real-world scenario, or (more likely) my sleepy brain is missing something fundamental. Somebody help me out.
- Strilanc 14y agoPick some simple protocol. Draw a sequence diagram of what it does for the 2s:2s case, using a clock skew of 0s. Now draw sequence diagram of what happens for the 3s:1s case, using a clock skew of 1s or -1s (depending on which direction you put the asymmetry in). Both diagrams contain the exact same interactions. The protocol will return the same thing in both cases.
- tempestn 14y agoAh yes, and looking at it in the morning, my resulting single equation is degenerate. I had a sign wrong last night, which suggested I'd solved for the difference between the two latencies. Actually (of course) I'd solved for the sum of the two latencies, which as the article mentioned, is all you can really determine. facepalm