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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com