What are the knowledge points of P2P indexing algorithm based on Kademila protocol

This article mainly explains "what are the knowledge points of Kademila protocol P2P indexing algorithm", interested friends may wish to have a look. The method introduced in this paper is simple, fast and practical. Next let the editor to take you to learn "what are the knowledge points of the Kademila protocol P2P indexing algorithm?"

P2P network is different from the traditional C client/server (client / server) structure. Every node in P2P network can be both client and server.

Network Topology Model of P2P

1. Centralized 2. Pure distributed 3. Hybrid type

At present, most of them adopt the hybrid type.

Advantages: avoid large-scale flooding, low difficulty to achieve

P2P systems are classified according to resource organization structure.

1. Unstructured P2P system

A) the logical topological relationship of nodes is loose

B) Resource placement usually has little to do with the topology of P2P systems

Advantages: easy to implement and maintain, support flexible resource search conditions

two。 Structured P2P system

A) the logical topological relationship of nodes is controlled by deterministic algorithms

B) Resource placement is published to specific nodes by deterministic algorithms

Advantages: accurate location of resources, good expansibility, overcoming flooding search and improving the efficiency of information search.

DHT (Distributed Hash Table, distributed hash table)

At this point, I believe you have a deeper understanding of "what are the knowledge points of the Kademila protocol P2P indexing algorithm?" you might as well do it in practice. Here is the website, more related content can enter the relevant channels to inquire, follow us, continue to learn!