Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Routing system constructing method in structuralized P2P (peer-to-peer) network

A P2P network and construction method technology, applied in the field of structured routing, can solve the problems of low efficiency of Chord network search, mismatch between logical network and physical network, uneven load, etc., to shorten the average query delay time and improve system stability and utilization, the effect of good performance

Active Publication Date: 2014-07-23
XIDIAN UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] (1) The search efficiency of the Chord network is not high, and the delay is serious;
[0010] (2) Due to the heterogeneity of the nodes in the Chord network, the load will be uneven;
[0011] (3) The logical network constructed by the Chord network does not match the physical network. There is no connection between the logical network and the actual network.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Routing system constructing method in structuralized P2P (peer-to-peer) network
  • Routing system constructing method in structuralized P2P (peer-to-peer) network
  • Routing system constructing method in structuralized P2P (peer-to-peer) network

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0088] Example 1: If the searched data object is not a popular object, then the routing process is:

[0089] Step 1: Perform routing on the high-level ring according to the R pointing table of the routing table:

[0090] 1a) Locate according to the location of data object k in the high-level ring: if data object k is stored in the current low-level ring, then directly find the low-level ring where data object k is located, and perform step 1c); if data object k is not stored in the current low-level ring ring, then perform step 1b);

[0091] 1b) Find the low-level ring on the high-level ring that is before the data object k and closest to k through the R pointing table of the routing table of the first node of the low-level ring, and return to step 1a);

[0092] 1c) Determine the low-level ring where the data object k is located, and continue routing according to the N pointing table of the routing table.

[0093] Step 2: Look up data through routing on the lower ring accord...

example 2

[0103] Example 2: The data object being looked up is a hot object:

[0104] Step a: Routing on the ring, if there is no node storing the information of the popular object, then execute step b and step c, if it encounters a node storing the information of the popular object, then execute step d;

[0105] Step b: Perform routing on the high-level ring according to the R pointing table of the routing table:

[0106] b1) Locate according to the location of data object k in the high-level ring: if data object k is stored in the current low-level ring, then directly find the low-level ring where data object k is located, and perform step b3); if data object k is not stored in the current low-level ring ring, then perform step b2);

[0107] b2) Find the low-level ring on the high-level ring that is before the data object k and closest to k through the R pointing table of the routing table of the first node of the low-level ring, and return to step b1);

[0108] b3) Determine the lo...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method for constructing a routing system in a structured P2P network, which mainly solves the problems of low search efficiency, uneven node load, and mismatch between a physical network and a logical network in the prior art. It includes: building a double-layer ring network, assigning nodes to data objects, constructing routing tables, storing popular objects, and node load balancing. Among them, the double-layer ring network is constructed based on node IP addresses and gateway addresses; The hash value of its related attributes is allocated by comparing the size in the two-tier network; the routing table is divided into two parts: the R pointing table and the N pointing table, storing routing information; storing popular objects is to add a list of popular objects and access counters to nodes; load balancing It is to set a status table for the node to record the load status sent by other nodes. The invention has the advantages of logical network and physical network matching, small search delay, high efficiency and node load balance, and can be used for resource sharing, instant communication, multimedia transmission and cooperative work in the network.

Description

technical field [0001] The invention belongs to the technical field of communication, and in particular relates to a structured routing method in P2P network transmission, which can be used for resource sharing, instant communication, multimedia transmission and collaborative work in the network. Background technique [0002] P2P is a distributed network. Participants in the network share some of their hardware resources, namely storage capacity, CPU capacity, and network connection capacity. Peers are directly accessed without going through an intermediate entity. P2P networks also have many different network structures. Due to the different network structures, the search methods for resources are also different. At present, P2P networks mainly have the following structures: [0003] (1) Centralized P2P network. This network structure mainly has a central server responsible for recording shared information. Once the central server crashes, the entire system will be paralyz...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/911H04L29/08H04L45/02
Inventor 樊凯李晖李杨孙宝华
Owner XIDIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products