The focus of this demonstrator is on the study of algorithms for implementing transactions on peer-to-peer networks. Their visualization contributes to the analysis and test of the protocols, verifying their tolerance to failures. In particular, we show a DHT running two-phase commit and the Paxos consensus algorithm.
Mejias Candia, B. C., Högqvist, M., & Van Roy, P. (2008). Visualizing transactional algorithms for DHTs. In Wehrle, K.; Kellerer, W.; Singhal, S.K.; Steinmetz, R.; (ed.), 2008 Eighth International Conference on Peer-to-Peer Computing (P2P) (p. p. 79-80). IEEE. https://doi.org/10.1109/P2P.2008.48