Large-scale network environment-oriented distribution-type K neighbor node searching method
A network environment and search method technology, applied in the field of neighbor node search, can solve the problem of inability to effectively realize neighbor node search, and achieve the effect of reducing the number of search iterations, reducing system overhead, and low cost
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0054] figure 1 It is a general flow chart of the distributed K neighbor node search by the present invention. The specific process is as follows:
[0055] The first step is system initialization.
[0056] 1.1 Set the initial neighbor set of each node to all other nodes except this node, and obtain the network distance between nodes through direct measurement.
[0057] 1.2 Determine the entry node.
[0058] In the second step, a neighbor set is created for the newly joined node.
[0059] 2.1 The newly joined node sends a join request to the entry node.
[0060] 2.2 The entry node randomly selects I nodes from its neighbor set to send to the newly joined node as its initial neighbor set, I is a positive integer, usually the value of I is 5, and I should be dynamically adjusted according to the scalability and maintenance costs of the system.
[0061] 2.3 The newly joined node obtains the network distance between the node and the neighbor node through direct measurement.
...
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