Fully distributed services
From HacDC Wiki
Assumptions
- Each service assumes at the outset that it's the only one in existence.
- Each service periodicially probes for the existence of other services.
- If two services of the same type find one another, they'll link up and synchronize.
Problems
- Service foo wants to search for services of the same type on other nodes that may or may not exist.
- Service foo wants to use another piece of software running on the same node to search for other instances.,