Child pages
  • Can

Versions Compared


  • This line was added.
  • This line was removed.
  • Formatting was changed.


The Content-Addressable Network (CAN) 1 is a framework for structured P2P systems based on a virtual d-dimensional Cartesian coordinate space on a d-torus. Nodes in a CAN graph have as an attribute the coordinates of a subspace of this space that are used in adding nodes and edges to the graph. Initially, the graph consists of one node and no edges. This initial node is assigned the entire virtual space. As nodes are added to the graph, they are assigned a subspace in the virtual space from a uniform distribution. So for a new node to join the CAN graph, it must find a node already in the graph and then using the routing mechanism, it should locate the node whose zone will be split. The system self-organizes to adjust to a new node by adding edges from the new node to adjacent nodes in the space. A typical CAN network graph is given below.