The Polymorph P2P network algorithm is based on my own, new P2P polyring topology designed especially with media routing in mind. I believe it is better suited at media routing than Chord, Kademlia, Pastry and Taspestry.
The Chord P2P network algorithm was one of the early P2P algorithms to appear. This Chord tutorial explains the core of the Chord P2P algorithm.
I have updated my Java Annotations tutorial to also explain the built-in annotation @Contended.
False sharing is a situation that can cause performance degradations when two or more threads write to different variables located within the same CPU cache line.
In this short tutorial I correct my statements about how Java synchronized and volatile variables effect how thread visible variables are flushed to main RAM.
Compare and swap functionality is an alternative to synchronized blocks in Java when designing high throughput, non-blocking concurrent algorithms in Java.
The peer findability and message routability challenges of P2P networks are typically addressed in similar ways. This tutorial covers common solutions to peer findability and message routability in peer-to-peer networks.
Peers in a peer-to-peer network need to be able to address each other uniquely. That it was peer addressability refers to. This tutorial explains how common P2P algorithms approaches peer addressability.
Peers in a peer-to-peer network need to be able to connect to each other in order to communicate with each other. I explain common solutions to overcoming NAT and firewall problems in this peer connectivity tutorial.
A lot has happened in the world of Peer-to-Peer (P2P) networks since I wrote the first version of this tutorial - so I have started updating it. First step was updating the introduction.