This example shows a case in which two nodes are off-line before the start of the second cycle, and these two nodes happen to form an exchange pair in the first cycle. This means that the two input contributions from these two nodes will never reach any other node in the network, while all other nodes easily find the maximum possible result (based on 30 contributions) after just one repair transaction in column E.

The reason why there is only one repair cycle, is that an entire accumulation cluster (namely, the pair 9, 25) has cleanly separated from the rest of the network before its result was shared with the rest of the network. The same would happens if a cluster of four separates before the third cycle (e.g. the nodes 9, 25, 17 and 1), etc.

Project details

Ultimate Browsers SupportThe GPS Dancer project started in 2007 as a voluntary project of a working group of the International Association of Geodesy.

Read more ...

Square dance algorithm

Great Docs and SupportThe GPS Dancer system was named after its "square dance" exchange algorithm. Of course, it also wants to to make the GPS reference frame denser.

Read more...

Here, there be pirates

The Dancer on-line network became immune against internet connection problems by leaving the US marines, and becoming a pirate.

Read more ...

Go to top