Building a Plaxton grove
Incremental node addition algorithm
For new node Nn to be added with nodeID D:
- Do a hop by hop search for D
- At each hop, visit X closest nodes
- For each node Ni in set X:
- Integrate next neighbor map from Ni neighbor map
- Take referrer list from Ni
- Measure distance between each referrer and Nn
- If new distance shorter, notify referrer to point to Nn
- Stop: when no exact match for each digit of ID found
- Redirect those referrers that are looking for IDs closer to you to point to you
neighbor and referrer maps