Improved Approach of Address Propagation for F2F Networks

In a distributed hash table (DHT) peer-to-peer (P2P) network, members of the P2P network communicate with each other using unique identifiers that are used to fetch the actual addresses from a DHT. The node lookup is used to find the equivalent communication address of a given identifier. The lookup time of finding the communication address of a node cause delay on P2P networks. This issue becomes more important in friend-to-friend (F2F) networks in which the nodes have to be able to access a set of trusted friend nodes at any time. In this paper, we propose an address propagation model in order to ensure propagating the addresses in a way that a node has the current up-to-date address of the required nodes at any time during system operation. The proposed model also minimizes the added traffic overhead to the network. Some test results are presented as well.