The Gossip protocol visualization illustrates a group of machines creating and maintaining a list of network connections.
Each machine is represented by a node and each link represents a network connection between those machines. The network is maintained and dead links are removed even in the face of multiple hard failures.
The visualization uses the log output of a network gossip protocol program created in the Coursera course: Cloud Computing Concepts. The log file is parsed and Graph representation is created in a Redux state store. This state is used to construct a graph in D3. Because the graph is constructed from the Redux state at distinct events the graph can be inspected using the "time travel" scrubber.