Design And Simulation Of A Structured P2P Search Model Based On Improved B-Tree

The appearence of P2P network makes the working mode of the Internet change from centralized to distributed, and the hole network begin to focus on every single point rather than the server. The P2P network goes through a process from hybrid P2P to unstructured P2P network, and becomes structured P2P network.The dissertation studies the topology and search mechanism of structured P2P network, improves the search method of B-tree, and put forth the structured P2P search model that based on the improved B-tree. for the network architecture, the dissertation provides a conception of "heap network", in which the super node is selected by Heap sort and administer upon nodes. Then, these super nodes form themselves into a larger B-tree network. based on the model, the corresponding algorithms are presented. The routing goes only between super nodes. The improved B-tree topological structure is superior to adaptability and fault tolerant ability. And it has a high efficiency on searching. At last, the paper makes a simulation on PC, verified the feasibility and correctness of the model.The innovations in the dissertation as bellow:first, improves the search method of B-tree, and put forth the structured P2P search model that based on the improved B-tree; sencend, it provides a conception of double network and isomerous nodes division so that we can use the network bandwidth more reasonably. At the same time,we can tap the potential of the nodes to the full extent.