|
Our system is based upon unstructured P2P overlays. Unlike their structured
counterparts, unstructured overlays do not provide distributed hash table (DHT)
support. In these networks, content searching happens purely by ad-hoc messaging
among neighbors. In our architecture, a data-item and its replicas are viewed
as a logical tree. We build a networks configuration replication tree for each data-item in the system in
which the root would be the owner of the original copy of the data-item , and the
other nodes of the tree would have replicas. Fig. 1 illustrates the replication tree.
The replication tree is constructed using a scheme similar to the one proposed
by Zhang et al.
|
