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

Inactive Publication Date: 2012-03-21
NAT UNIV OF DEFENSE TECH
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] The technical problem to be solved by the present invention is: Aiming at the problem that the existing distributed neighbor node search method cannot effectively realize K (K>1) neighbor node search, a distributed K neighbor node search method for large-scale network environment is proposed , low-cost and high-precision measurement of node proximity

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
  • Large-scale network environment-oriented distribution-type K neighbor node searching method
  • Large-scale network environment-oriented distribution-type K neighbor node searching method
  • Large-scale network environment-oriented distribution-type K neighbor node searching method

Examples

Experimental program
Comparison scheme
Effect test

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.

...

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 large-scale network environment-oriented distribution-type K neighbor node searching method which aims to solve the technical problems of providing a large-scale network environment-oriented distribution-type K neighbor node searching method, and realizing node neighborhood measurement with low cost and high precision. The technical scheme is as follows: a neighbor set is constructed for each node through a direct measurement method, and the network distance information between nodes is maintained; the neighbor sets of the nodes are updated through two methods, i.e. random updating and most neighbor updating; and based on the retroversion thought, the most neighbor node is searched from the node with the farthest network distance from a target node. The large-scale network environment-oriented distribution-type K neighbor node searching method can effectively reduce the search iterations, improve the searching efficiency, ensure the searching of the most neighbor node from the global scope, and realize node neighborhood measurement with low cost and high precision.

Description

technical field [0001] The invention relates to a search method for adjacent nodes in a large-scale network environment, in particular to a distributed K-adjacent node search method in a large-scale network environment. Background technique [0002] Neighbor node search is one of the core problems to be solved urgently in the field of network computing. Neighbor node search is one of the node proximity measurement methods widely used at present. It uses the network distance measurement results between all or part of the nodes to determine one or more neighbor nodes of a given target node. The execution strategy of many network application systems is based on node proximity. The accuracy, stability and efficiency of neighbor node search will directly affect the effect of node proximity measurement, thereby affecting the operating efficiency of network application systems. [0003] The existing typical methods of neighbor node search mainly include two categories: [0004] (...

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/28H04L12/26
Inventor 王意洁符永铨孙伟东李小勇马行空李东升褚瑞张一鸣陈振邦彭宇行车永刚徐传福王勇献
Owner NAT UNIV OF DEFENSE TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap