Published Paper Details:

Peer-to-peer (P2P) formless networks are in vogue in a massive network. These networks can be built very efficiently without specific rules and, therefore, are considered appropriate for the online environment. But the scanning techniques used in these networks are usually compromised with a large network size. To optimize search queries in unstructured P2P networks, use the connection between network participants. The search protocol was designed to accelerate the search process through self-organized P2P networks in a small world. Both theoretical and experimental analyzes are carried out, which show the effectiveness and effectiveness of this approach. Based on the file exchange model, which shows the power-right property, we present a query construction algorithm, in which any non-structured G (V, E) P2P network, where V is a set of participating counterparts, and E is a set of superposed connections with even elements in V. The equations in G can be combined with each other in a random way. The objective is to restructure G with the following characteristics: 1. High grouping, 2. Low diameter, 3. Progressive.