Duty-Oriented Hybrid Peer-to-Peer Network Based on Metadata

Abstract

The topology structure of the peer-to-peer overlay network is a critical factor in dominating performance of resource discovery. In the paper, we consider that nodes have their duty or function in the real world, and we take full advantage of the characteristic of unstructured peer-to-peer network. According to these, a duty-oriented hybrid peer-to-peer network based on metadata (DHPM) is proposed. DHPM organizes nodes into a tree-structure hierarchical overlay network. Its nodes are divided into domains according to the duty or the function of these nodes, and into groups according to the semantic similarity in one domain. The DHPM overlay network consists of two types of nodes, super peers (SPs) and peers. A super peer is a node that acts as a centralized server submitting and answering requests on behalf of peers. A peer submits queries to its super peer, searches for the location of queries according to the metadata directory in the super peers and receives results from the real resource location. The super-peer architecture adopted in DHPM exploits the heterogeneity of nodes by assigning additional responsibilities to higher-capacity nodes. The classification of nodes helps to increase searching efficiency during routing messages in the network. In DHPM, peers query resources via metadata directory which is in the super peers. Metadata directory in the 1st level SPs manages the information of shared resources in their domains, while metadata directory in the 2nd level SPs manages the shared information in their groups. The metadata directory is a tree-like distributed infrastructure. In the first layer of the metadata directory there are all the 1st level SPs and replica directory. 1st level SPs manage all the metadata of shared resources in the domain. The metadata of shared resources include databases, files, monitoring information, and 2nd level SPs in the domain. In order to construct and maintain DHPM, node join algorithm, node departure algorithm, and query searching algorithm are presented to ensure running of the network. Duty or function is the important factor in selecting the super peers. In addition, high bandwidth, sufficient searching process power, longer online time etc. are the considered factors. In node departure algorithm, we describe two kinds of node departure cases: normal departure and abnormal departure. By means of metadata directory, query searching can be gotten in DHPM. Finally, experiments are made to show the performance of query searching with DHPM, Gnutella, and Freenet.