WO2011109986A1

WO2011109986A1 - Method, system and equipment for generating node identity

Info

Publication number: WO2011109986A1
Application number: PCT/CN2010/075485
Authority: WO
Inventors: 于游洋; 胡伟华
Original assignee: 华为技术有限公司
Priority date: 2010-07-27
Filing date: 2010-07-27
Publication date: 2011-09-15
Also published as: CN102369749B; CN102369749A

Abstract

A method, system and equipment for generating a node identity is disclosed in the present invention. Said method includes: receiving a join request message of a newly joining node; determining the available address space range which the new node identity of the newly joining node is in; obtaining the state information of at least one node in the available address space range, wherein the state information includes a node identity, or an inherent load capacity parameter and a node identity; generating at least one new node identity according to a first strategy and the state information, or sending the state information to the newly joining node so that the newly joining node can generate at least one new node identity according to the state information and the first strategy, wherein the first strategy includes that the new node identity is the node identity which has a specific distance behind the node identity of the first node. Said device includes a determining unit, a state-obtaining unit, and a first identity-generating unit. Said system includes a network node and the newly joining node. The generation of the new node identity of the newly joining node is implemented in the present invention.

Description

Node identification generation method, system and device

Technical field

The present invention relates to the field of communications technologies, and in particular, to a method, system, and device for generating a node identifier. Background technique

In a network system, each entity such as a Mobility Management Entity (Mobility Management Entity,

The MME, the Serving Gateway (SGW), and the PDN Gate Way (PGW) all have their own NE identifiers, such as the node identifier (Identity, ID).

Different types of nodes in the network system have different complete forms of node identifiers. For example, the node identifier of the MME is <GUMMEI> = <MCC><MNC><MME Group IDxMME Code>, where <MCC> is the mobile country number. It consists of three digits; <MNC> is the mobile network number, which consists of two digits; <MME Group ID> is the identifier of the MME group where the node is located, and <MME Code> is the unique identifier in the MME group where the node is located. The node identifier of the GPRS Serving GPRS Support Node (SGSN) is <MCC><MNC><LAC><RAC><NRI>, where <LAC><RAC> defines the location information of the area, and <NRI> is the node. A unique identifier within a defined area.

In the existing network system, when a new node joins the network, the node identifier of the new node is manually configured. This configuration mode is inefficient, and the node identification may be incorrectly configured due to human error, thereby affecting the entire network. normal operation.

Summary of the invention

The embodiment of the invention provides a method, a system and a device for generating a node identifier, which simplifies the configuration of the node identifier.

A method for generating a node identifier according to an embodiment of the present invention includes:

Receiving a join request message of the newly joined node, determining a range of available address spaces in which the new node identifier of the newly joined node is located;

Obtaining state information of at least one node in the range of available address spaces;

Generating at least one new node identifier according to the first policy and the state information, and sending the new node identifier to the new joining node; the first policy includes: the new node identifier is after the node identifier of the first node Node ID for a specific distance; or,

Transmitting the status information to the new joining node, so that the new joining node generates at least one new node identifier according to the status information and the first policy, where the first policy includes: the new node identifier is The node of the first node identifies the node identifier of a specific distance. An embodiment of the present invention provides another method for generating a node identifier, including:

Send a join request message for the newly joined node;

Receiving status information returned according to the join request message, where the status information includes status information of at least one node within a range of available address spaces in which the new node identifier of the newly joined node is located; according to the first policy and the status information Generating at least one new node identifier; the first policy includes: the new node identifier is a node identifier of a specific distance after the node identifier of the first node.

Another method for generating a node identifier provided by the embodiment of the present invention includes:

Receiving a join request message of the newly joined node, determining a range of available address spaces in which the new node identifier of the newly joined node is located, where the join request message includes a node keyword of the newly joined node; according to the second policy and at least two hashes The function calculates an alternate node identifier of the at least two candidate nodes, where the second policy includes: the candidate node identifier is a starting point of the available address space range, and the hash calculation hash corresponding to the node keyword of the newly joined node The sum of values;

Selecting a successor node of the at least two candidate nodes, a static load weight parameter and/or a successor node having a maximum dynamic load weight parameter as a third node, or a static load weight parameter and/or a dynamic load weight parameter having at least a larger parameter Two successor nodes as the third node;

The node identifier of the candidate node corresponding to the third node is used as the new node identifier of the newly joined node.

A node device provided by the embodiment of the present invention includes:

a determining unit, configured to receive a join request message of the newly joined node, and determine a range of available address spaces in which the new node identifier of the newly joined node is located;

a state obtaining unit, configured to acquire state information of at least one node in the available address space range;

a first identifier generating unit, configured to generate at least one new node identifier according to the first policy and the state information; the first policy includes: the new node identifier is a node identifier of a specific distance after the first node, and the Sending the new node identifier to the new joining node; or, for sending the status information to the new joining node, so that the newly joining node generates at least one new node identifier according to the status information and the first policy.

Another node device provided by the embodiment of the present invention includes: a sending unit, configured to send a join request message of the newly joined node;

a status receiving unit, configured to receive status information returned according to the join request message, where the status information includes status information of at least one node within a range of available address spaces in which the new node identifier of the newly joined node is located;

And a second identifier generating unit, configured to generate at least one new node identifier according to the first policy and the state information; the first policy includes: the new node identifier is a node identifier of a specific distance after the node identifier of the first node.

The embodiment of the invention provides another node device, including:

a receiving determining unit, configured to receive a join request message of the newly joined node, determine a range of available address spaces in which the new node identifier of the newly joined node is located, where the join request message includes a node keyword of the newly joined node;

An alternative calculation unit, configured to calculate an alternate node identifier of the at least two candidate nodes according to the second policy and the at least two hash functions, where the second policy includes: the candidate node identifier is the available address space range The starting point, the hash corresponding to the node keyword of the newly joined node, calculates the sum of the hash values;

a selecting unit, configured to select a successor node of the at least two candidate nodes, a static load weight parameter and/or a successor node with a maximum dynamic load weight parameter as a third node, or a static load weight parameter and/or a dynamic load weight At least two successor nodes having larger parameters are used as the third node;

And an identifier determining unit, configured to use a node identifier of the candidate node corresponding to the third node as a new node identifier of the newly added node.

An embodiment of the present invention further provides a system for generating a node identifier, including: a network node and a newly added node;

The network node is configured to receive a join request message of the newly joined node, determine a range of available address spaces in which the new node identifier of the newly joined node is located, and obtain state information of at least one node in the available address space range; Sending the status information to the newly joined node;

The new joining node is configured to send a join request message of the newly joined node; receive state information returned according to the join odd request message, and generate at least one new node identifier according to the first policy and the state information; A policy includes: The new node is identified as a node identifier of a specific distance after the node identification of the first node.

The method for generating a node identifier in the embodiment of the present invention includes: receiving a join request of a newly joined node a message, determining a range of available address spaces in which the new node identifier of the newly joined node is located; and obtaining state information of at least one node in the available address space; finally generating at least one new node identifier according to the first policy and the state information, or The status information is sent to the newly joined node, so that the new joining node generates at least one new node identifier according to the state information and the first policy, where the first policy includes: the new node identifier is a node identifier of a specific distance after the node identifier of the first node. After receiving the join request message, the new join node is configured with a certain distance after the first node existing in the network system by using the newly joined node and the existing node in the network system, so that the configuration of the new node identifier is not required. Human involvement simplifies the configuration process.

DRAWINGS

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings to be used in the embodiments or the description of the prior art will be briefly described below. Obviously, the drawings in the following description are only It is a certain embodiment of the present invention, and other drawings can be obtained from those skilled in the art without any inventive labor.

1 is a flowchart of a method for generating a node identifier according to Embodiment 1 of the method of the present invention; FIG. 2 is a flowchart of a method for obtaining state information of a node in an available address space according to an embodiment of the method of the present invention;

3 is a flow chart of another method for obtaining state information of nodes in an available address space in an embodiment of the method of the present invention;

4 is a flow chart of another method for obtaining state information of nodes in an available address space in an embodiment of the method of the present invention;

5 is a flowchart of a method for generating a node identifier according to Embodiment 2 of the method of the present invention; FIG. 6 is a flowchart of a method for generating a node identifier according to Embodiment 3 of the method of the present invention; FIG. 8 is a flowchart of a method for generating a node identifier according to Embodiment 5 of the method of the present invention; FIG. 9 is a flowchart of a method for generating a node identifier according to Embodiment 6 of the method of the present invention; Schematic diagram of the structure of the node device provided in the first embodiment of the device;

11 is a schematic structural diagram of another node device according to Embodiment 1 of the present invention; FIG. 12 is a schematic structural diagram of another node device according to Embodiment 1 of the present invention; FIG. 13 is another node provided in Embodiment 1 of the device of the present invention. Schematic diagram of equipment structure; 14 is a schematic structural diagram of a node device according to Embodiment 2 of the device of the present invention;

FIG. 15 is a schematic structural diagram of a node device according to Embodiment 3 of the device of the present invention.

detailed description

BRIEF DESCRIPTION OF THE DRAWINGS The technical solutions in the embodiments of the present invention will be described in detail below with reference to the accompanying drawings. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present invention without creative work are within the scope of the present invention.

Method embodiment 1

A method for generating a node identifier, the method of the embodiment of the present invention is when a new node joins a network system, and a centralized management node of the node information in the centralized management network system, or an entry node that receives the join request message in the network system The method of executing, as shown in FIG. 1 , includes: Step 101: Receive a join request message of a newly joined node, and determine a range of available address spaces in which the new node identifier of the newly joined node is located;

When a new node joins the network system, it sends a join request message to the centralized management node or any node in the network system, that is, the ingress node, and may include at least one of the following information in the join request message: a network protocol of the newly joined node (IP) address, inherent load capacity, Media Access Control (MAC) address, and authentication authentication information;

After the central management node or the ingress node receives the join request message, it first determines the range of address spaces that may exist in the new node identifier of the newly joined node, that is, the available address space range. Specifically, the node of the same type as the newly joined node may be determined. The range of the address space is the range of available address space, where the same type means that the functional attributes of the node are the same, as for the MME node, the same as the SGW node, the same as the PGW node, the same as the SGSN node, etc.; or, determine the network The entire address space of the system or part of the address space in the entire address space is a range of available address spaces.

When obtaining the address space range of the same type of node as the newly added node, for the centralized management node, the node that manages the node information in the network system can directly read the local storage; and for the ingress node, the ingress node needs to be new. Join a node of the same type as the node to send the odd request.

Step 102: Obtain status information of at least one node in the available address space; after performing step 102, step 103a may be performed, or step 103b may be performed;

The status information may include at least one of the following information: node identifier, node address information, Information such as inherent load capacity parameters, static or dynamic load weight parameters;

If the execution entity of the method is a centralized management node, since the centralized management node is a node in the management network system, state information such as a node type, a node identifier, a node IP address, and the like of all nodes in the management network system are stored locally. When the state information of the at least one node is obtained, the reading may be directly performed in the local storage space. If the execution entity of the method is the ingress node, when the state information of the node is acquired, the node state information query message needs to be sent through the ingress node. The node being queried is obtained by requesting the state information of the queried node.

Step 103a: Generate at least one new node identifier according to the first policy and status information, and send the new node identifier to the newly joined node.

The first strategy here includes: the new node identifier is a node identifier of a specific distance X after the node identifier of the first node, and the specific distance may be a distance preset locally or may be a successor node of the first node (hereinafter referred to as The difference between the second node and the node identifier of the first node; the difference between the node identifier of the second node and the first node, and the inherent load capacity parameter of the newly joined node and the second node and the newly joined node The product of the ratio of the sum of the inherent load capacity parameters; the specific distance may also be any distance from the node identifier of the first node, the specific content of which does not constitute a limitation of the present invention.

That is to say, according to the first policy and the state information generation, X is added mainly on the node identifier of the first node, that is, the new node identifier is obtained. It will be understood that the first node and the second node herein, and the first and second mentioned in the following documents do not describe the order associated with any step, but merely to illustrate that the two nodes are different. And the first node here is the node of at least one node acquired in step 102.

For example: the first node is Q, the second node is P, then the new node ID = node ID of node Q + (node ID of node P - node ID of node Q) /2; or node of new node ID = node Q Identification + (node ID of node P - node ID of node Q) X newly added node inherent load capacity / (node P inherent load capacity + newly added node inherent load capacity). The newly added node has a load capacity that can be obtained from the received join request message.

After the new node identifier is generated by step 103a, the new node identifier may be sent to the newly joined node to configure the node identifier of the complete form.

Step 103b: Send the status information acquired in step 102 to the newly joined node, so as to be new. Join node #> generates at least one new node identifier according to the status information and the first policy.

The foregoing state information is configuration information for generating a new node identifier, including a node identifier of at least two nodes, or an inherent load capability parameter and a node identifier, and the newly added node generates the new node identifier according to the first policy. That is, it is consistent with the method in the above step 103a.

The embodiment of the present invention is applicable to the generation of a node identifier in a Public Land Mobile-Communication Network (PLMN). The complete form of the node identifier may adopt the following structure < 0 < 0 <node identifier>, which is implemented by the method. After the node identifier is formed, the complete node identifier can be configured through the structure, and the generated node identifier is an integer from 0 to N.

It can be understood that, in general, 0 ~ N is defined as the address space, and the size is determined by the network size. Each address in the address space 0 ~ N forms an address space ring in a clockwise direction, and nodes in the network press the node. The identifier values are distributed on the address space ring. The nodes in the same PLMN can share the same address space, or different address spaces can be divided according to the difference of the area or node type.

It can be seen that the method for generating a node identifier in the embodiment of the present invention includes: when receiving a join request message of a newly joined node, determining a range of available address spaces in which the new node identifier of the newly joined node is located; and acquiring at least a range of available address spaces The state information of one node; finally, generating at least one new node identifier according to the first policy and the state information, or sending the state information to the newly joined node, so that the newly joining node generates at least one new node identifier according to the state information and the first policy, where The first policy includes: the new node identifier is a node identifier of a specific distance after the node identifier of the first node. After receiving the join request message, the new join node is configured with a certain distance after the first node existing in the network system by using the newly joined node and the existing node in the network system, so that the configuration of the new node identifier is not required. Human involvement simplifies the configuration process.

It can be understood that, as shown in FIG. 2, in a specific embodiment, when the foregoing step 102 is performed, the following steps can be implemented:

A1: Compare the static load weight parameter and/or the dynamic load weight parameter of all nodes in the available address space range; after performing step A1, step B1 may be performed, or step C1 may be performed; where the static load weight parameter of the node is node The ratio of the responsible address space segment to its inherent load capacity; the dynamic load weight parameter of the node is the ratio of the current load condition of the node to its inherent load capacity. For a new node that has no current load, the dynamic load weight parameter is zero. Each of them is negative The address space segment responsible for the node is the difference between the node identifier of the node and the node identifier of the predecessor node, and in the address space of the network, the adjacent nodes are the precursor successor nodes, specifically, the node identifiers of the two adjacent nodes. A small node is a predecessor node of a node that identifies a large node, and a node with a large node identification is a successor node of a node with a small node identifier. If it is a non-adjacent node, the node with the largest node ID is the subsequent node of the node with the smaller node ID.

If a device corresponds to multiple node identifiers, each node identifies the intrinsic load capacity of the corresponding node as part of the load capacity of the device, and the proportion of the node is allocated according to the size of the address space that is responsible for the node corresponding to each node identifier, or by the operator. Direct allocation.

B1: reading the state information of the node with the largest static load weight parameter and/or the dynamic load weight parameter and its precursor node;

At this time, the second node is a node with a static load weight parameter and/or a dynamic load weight parameter, and the first node is its precursor node.

It can be understood that the static load weight parameter of the node indicates that the address space segment that the node is responsible for is relatively large, and the inherent load capacity is relatively small; and the dynamic load weight parameter of the node indicates that the current load rate of the node is large. Configuring the node ID of the newly added node in the vicinity of these nodes can share some of the service capabilities of the node with a relatively large current load rate or a small intrinsic load capacity and a relatively large address, so that the load of each node in the configured network is more uniform. .

C1: Read status information of at least two nodes with a large static load weight parameter and/or a dynamic load weight parameter and corresponding predecessor nodes.

At this time, the second node is at least two nodes having a static load weight parameter and/or a dynamic load weight parameter, and the first node is a corresponding predecessor node.

In this embodiment, a number of node identifiers may be generated for the newly joined node, so that the service processing may be shared for several nodes in the network. As for the generation, a port that can be set by the user may be provided in the device, and the user may use the device according to the device. And the actual situation of the current network is set.

As shown in FIG. 3, in another specific embodiment, when the foregoing step 102 is performed, the following steps may be implemented:

A2: calculating, by using at least two hash functions and the second policy, candidate node identifiers of the at least two candidate nodes, where the second policy includes: the candidate node identifier is a starting point of the available address space range, and the newly added node key The word corresponds to the hash to calculate the sum of the hash values; Assuming Start is the starting point of the available address space range, and End is the ending point of the available address space range, the candidate node identifier is Start + Hash ( key ), where the node key (Key ) can be the state information of the newly added node. , such as the IP address or MAC address or load parameter of the newly added node, can be obtained from the received join request message.

There are a variety of hash functions. The hash function selected here is a hash function that can hash values to the [0,End-Start] interval of the same length as the available address space range, and such a hash function can Select multiple. By calculating Hash (key) through various hash functions, multiple hashes corresponding to the newly added node keywords can be used to calculate the hash value, and then at least one candidate node identifier can be obtained by the second strategy.

B2: The static load weight parameter and/or the dynamic load weight parameter of the successor node of the at least two candidate nodes are compared; after step B2 is performed, step C2 may be performed, or step D2 may be performed;

C2: obtaining state information of a node with a static load weight parameter and/or a dynamic load weight parameter and a predecessor node thereof;

At this time, the second node is a node with at least two candidate nodes, a static load weight parameter and/or a node with the largest dynamic load weight parameter, and the first node is its predecessor node;

D2: Obtain status information of at least two nodes with a static load weight parameter and/or a dynamic load weight parameter and corresponding predecessor nodes. At this time, the second node has a static load weight parameter and/or a dynamic load weight parameter. At least two nodes, the first node is a corresponding predecessor node.

As shown in FIG. 4, in still another specific embodiment, when the foregoing step 102 is performed, the following steps may be implemented:

A3: Calculating the cut-in node identifier of the cut-in node by using a hash function and the second policy, where the second strategy includes: the cut-in node identifier is a starting point of the available address space range, and the hash corresponding to the newly added node keyword is used to calculate the hash value. with;

The hand-in node calculated here is not an existing one in the actual node, but the result calculated by the second policy, which is used as the starting point for selecting a node within the available address space.

In this embodiment, the node corresponding to the node identifier calculated by the second policy is used as the entry point, ^^ sets Start as the starting point of the available address space range, and End is the ending point of the available address space range, and the cut-in node identifier is Start. + Hash ( key ), where the node keyword Key is the newly added node The status information, such as the IP address or MAC address or load parameter of the newly added node, can be obtained from the received join request message. The hash function selected here is a hash function that can hash the value to the [0, End-Start] interval of the same length as the range of available address spaces.

A Hash (key) of a function can be used to obtain a hash value corresponding to the newly added node keyword, and then a second node can obtain a hand-in node identifier.

B3: Comparing the available load address space, the static load weight parameter and/or the dynamic load weight parameter of the successor node of the node and its subsequent nodes; after performing step B3, step C3 may be performed, or step D3 may be performed;

C3: obtaining state information of a node with a static load weight parameter and/or a dynamic load weight parameter and a predecessor node thereof;

At this time, the second node is a node of the cut-in node and all subsequent nodes, the node with the largest static load weight parameter and/or the dynamic load weight parameter, and the first node is its predecessor node;

D3: obtaining state information of at least two nodes with a static load weight parameter and/or a dynamic load weight parameter and corresponding predecessor nodes;

Method embodiment two

A method for generating a node identifier, the method embodiment is a node identifier generation method performed by the newly joined node when a node newly joins the network system, and the structure diagram is as shown in FIG. 5, including:

Step 201: The new joining node sends a join request message of the newly joined node.

When a new node joins the network system, it sends a join request message to the centralized management node or any node in the network system, that is, the ingress node. The join request message may include the IP address of the newly joined node, the inherent load capacity, and the MAC. Information such as address and authentication information;

After receiving the join request message, the centralized management node or the ingress node first determines the range of address spaces that may exist in the new node identifier of the newly joined node, that is, the available address space range, and obtains state information of at least one node in the available address space range, For example, the node identifier of at least one node, or the status information of the intrinsic load capability parameter and the node identifier of at least two nodes. The specific method for determining and obtaining is as shown in the first embodiment of the method, and details are not described herein again.

Step 202: The new joining node receives status information returned according to the join request message. The status information includes the available address space in which the new node identifier of the newly joined node is located, and the status information of at least one node, such as a node identifier, an inherent load capability parameter, and the like;

The available address space ranges specifically: the address space range of the node of the same type as the newly joined node is the available address space range; or, the entire address space of the network system or the partial address space in the entire address space.

Step 203: The new joining node generates at least one new node identifier according to the first policy and the state information.

The first policy includes: the new node identifier is a node identifier of a specific distance after the node identifier of the first node, where the specific distance may be a local preset distance, or may be a node identifier of the second node and the first node. Half of the difference; can also be the product of the difference between the node identification of the second node and the first node, and the ratio of the inherent load capacity parameter of the newly added node to the sum of the inherent load capacity parameters of the second node and the newly added node, For any other distance.

The newly joined node configures the complete form of the new node identifier after generating the new node identifier, as in

The complete form of the node identifier of the PLMN is <MCC><MNC><node identification>, and the generated new node is identified on the central management node.

Method embodiment three

A method for generating a node identifier, the method of the embodiment of the present invention is when a new node joins a network system, and is executed by a centralized management node of a node in the centralized management network system, or an entry node that receives a join request message in the network system. The method, the flow chart shown in Figure 6, includes:

Step 301: Receive a join request message of a newly joined node, where the join request message includes a node keyword of the newly added node;

When a new node joins the network system, it sends a join request message to the centralized management node or any node in the network system, that is, the ingress node. The join request message may include the IP address, intrinsic load capacity, and MAC address of the newly joined node. And authentication information, etc.;

The node keyword of the newly added node here is the status information of the newly added node, such as the IP address of the newly added node, or the inherent load capacity, or the MAC address and the authentication information.

Step 302: Determine a range of available address spaces in which the new node identifier of the newly joined node is located. After receiving the join request message, the centralized management node or the ingress node first determines a range of address spaces that may exist in the new node identifier of the newly joined node, that is, Available address space range, specifically, can be The address space range of the node of the same type as the newly added node is the range of available address space. Here, the same type means that the function attributes of the node are the same, as for the MME node, the same as the SGW node, and the same as the PGW node. SGSN node or the like; or, determine that the entire address space of the network system or a part of the address space in the entire address space is a range of available address spaces.

Step 303: Calculate an candidate node identifier of the at least two candidate nodes according to the second policy and the at least two hash functions, where the second policy includes: the candidate node identifier is a starting point of the available address space range, and the newly added node key The word corresponds to the hash to calculate the sum of the hash values;

Assuming Start is the starting point of the available address space range, and End is the ending point of the available address space range, the candidate node identifier is Start + Hash ( key ), where the node key Key can be the IP address or MAC of the newly joined node. Address or load parameters, etc., can be obtained from the received join request message. The hash function selected here is a hash function that can hash the value to the [0, End-Start] interval of the same length as the range of available address spaces.

Step 304: Select a successor node with at least two candidate nodes, a static load weight parameter and/or a successor node with a maximum dynamic load weight parameter as the third node, or a static load weight parameter and/or a dynamic load weight parameter. At least two successor nodes as the third node;

Step 305: The node identifier of the candidate node corresponding to the third node is used as the new node identifier of the newly added node. After the new node identifier is determined, the new node identifier may be sent to the newly joined node for configuration.

The method for generating a node identifier in this embodiment includes: determining, after receiving the join request message, a range of available address spaces; calculating an candidate node identifier of the at least two candidate nodes according to the second policy and the at least two hash functions, where The second strategy includes: the candidate node identifier is a starting point of the available address space range, and the sum of the hash values is calculated corresponding to the node keyword of the newly joined node; the static load of the succeeding nodes of the at least two candidate nodes The candidate node identifier corresponding to the successor node with the largest or larger weight parameter and/or dynamic load weight parameter is used as the new node identifier. After receiving the join request message, the new join node is configured in front of the existing third node in the network system by the cooperation of the newly added node and the existing node in the network system, so that the configuration of the new node identifier does not need to be manually participated. , simplifies the configuration process.

Method embodiment four

A method for generating a node identifier, which is shown in Figure 7, includes: Step 401: The newly added node obtains the central management node address, which can be obtained by static configuration of the operator or by querying other network elements. The newly added node sends a join request message to the centralized management node, and includes the newly added node in the join request message. IP address, MAC address, inherent load capacity, and authentication information.

Step 402: The centralized management node sends the information of the newly added node to the authentication server to complete the security authentication of the newly added node. If the authentication succeeds, step 403 is performed. If the authentication fails, the new node identifier is not configured.

Step 403: The centralized management node determines a range of address spaces in which the new node identifier of the newly joined node may be located, that is, an available address space range, and may determine an address space range in which the same type of network element as the newly joined node is located, or the entire network system. The address space, or part of the address space in the entire address space.

Step 404: After the centralized management node obtains the configuration information of the newly added node, the new node identifier may be generated, and the configuration information may be carried in the join response response message in step 405 and sent to the newly joined node, so that the newly added node generates a new one. Node ID.

The configuration information of the newly added node is the parameter required for generating the new node identifier, which is specific to the state information of at least two nodes in the available address space, wherein the state information includes: a node identifier, or an inherent load capability parameter and a node identifier, The status information may also include the current load parameters of the node and the like.

At least two nodes may be the node with the largest static and/or dynamic load weight parameter in the available address space range and its predecessor node, assuming that the node is node P, and its predecessor node is node Q; At least two nodes with a large static and/or dynamic load weight parameter and corresponding predecessor nodes assume that a node with a larger parameter is a node P, and a precursor node thereof is a node Q. The configuration information that the centralized management node can obtain locally includes: node identifiers of nodes P and Q; or node identifiers of nodes P and Q, and the inherent load capacity of the node P.

After obtaining the configuration information, the new node identifier may be generated according to the first policy, that is, the new node identifier = the node identifier of the node Q + (the node identifier of the node P - the node identifier of the node Q) /2; or the new node identifier = the node Q Node ID + (node ID of node P - node ID of node Q) X new node inherent load capacity / (node P inherent load capacity + new node inherent load capacity).

Step 405: The central management node sends a join request response message to the newly joined node. If the new node identifier is generated in step 404, the new node identifier is carried; if only the configuration is obtained in step 404 Information, you can carry configuration information.

It can be understood that the new joining node receives the join request response message, including the configuration information, and then generates a new node identifier according to the method in the above step 404, and can report the generated new node identifier to the centralized management node.

It can be seen that, in this embodiment, the centralized management node is not only responsible for generating the newly added node identifier or obtaining configuration information; but also for storing state information of all nodes in the network system, such as node type, node identifier, node IP address, and node inherent. Load capacity parameters and static/dynamic load weight parameters.

Method embodiment five

A method for generating a node identifier, the flowchart shown in Figure 8, includes:

Step 501: The newly added node obtains the ingress node address, which can be obtained by static configuration of the operator or by querying other network elements, and any node in the network system can be an ingress node; the newly joining node sends a join request message to the ingress node. The join request message includes the IP address, MAC address, inherent load capacity, and authentication authentication information of the newly joined node.

Step 502: The ingress node sends the information of the newly added node to the authentication server to complete the security authentication of the newly added node. If the authentication is passed, step 503 is performed. If the authentication fails, the new node identifier is not configured.

Step 503: The ingress node determines a range of address spaces in which the new node identifier of the newly joined node may be located, that is, an available address space range, and may determine an address space range in which the network element of the same type as the newly joined node is located, or an entire address of the network system. Space, or part of the address space in the entire address space.

Step 504: The ingress node calculates the candidate node identifiers of the multiple candidate nodes by using multiple hash functions. First, the key of the newly added node is obtained from the join request message, and multiple candidate node identifiers are calculated by using the second policy. Select the new node ID = Start + Hash ( key ), where the Start value is the starting point of the address space range and End is the end point of the available address space range. The Hash function selected here is a Hash function that can hash the value to the [0, End-Start] interval of the same length as the alternate address space.

Step 505: The ingress node sends a node status information query message to a successor node of the multiple candidate nodes to obtain status information of the multiple succeeding nodes.

Step 506: The subsequent node performs a query of the status of the neighbor node, and returns a status query response message to the ingress node, where the response message may include: a node identifier of the successor node and the corresponding predecessor node, a static load weight parameter, an inherent load capacity, and a current Information such as load conditions. Step 507: After obtaining the configuration information of the newly added node, the ingress node may generate a new node identifier according to the received multiple status query response message, or may send the status information in the join request response message sent in step 508 to the new node. Join the node, so that the newly joined node generates a new node identifier by itself; or the ingress node performs step 509 according to the received multiple status query response messages.

The ingress node may obtain static load weight parameters and/or dynamic load weight parameters of the subsequent nodes according to the plurality of status query response messages, and compare, and obtain at least two nodes may be the successor nodes of the candidate nodes, static and / or the node with the largest dynamic load weight parameter and its precursor node, the node is node P, and the precursor node is node Q; or the successor parameters of these candidate nodes are static and/or dynamic load weight parameters. The at least two nodes and the corresponding predecessor nodes are large, assuming that a node with a larger parameter is the node P and the precursor node is the node Q. Then, the configuration information acquired by the ingress node includes: node identifiers of nodes P and Q; or node identifiers of nodes P and Q, and the inherent load capacity of the node P.

If a new node identifier is generated after obtaining the configuration information, it is generated according to the first policy, that is, the new node identifier = the node identifier of the node Q + (the node identifier of the node P - the node identifier of the node Q) /2; or the new node identifier = Node ID of node Q + (node ID of node P - node ID of node Q) X new node inherent load capacity / (node P inherent load capacity + new node inherent load capacity).

Step 508: The ingress node sends a join response message to the new joining node. If the new node identifier is generated in step 507, the new node identifier is carried. If only the configuration information is obtained in step 507, the configuration information is carried.

It can be understood that, when the new joining node receives the join request response message, including the configuration information, the new node identifier is generated according to the method in step 507 above. Further, the newly added node may also send the generated node identifier to the centralized management node. .

Step 509: The ingress node selects a static load weight parameter and/or a successor node with a maximum dynamic load weight parameter as the third node, or a static load weight parameter and/or a dynamic load according to the status information in the returned multiple status query response message. At least two successor nodes with larger weight parameters as the first The node is identified as the new node identifier of the newly added node. After the new node identifier is determined, the new node identifier can be sent to the newly joined node for configuration.

Method Embodiment 6

A method for generating a node identifier, which is shown in Figure 9, includes:

Step 601: The newly added node obtains the address of the ingress node, which can be obtained by static configuration of the operator or by querying other network elements, and any node in the network system can be an ingress node; the newly added node sends a join request message to the ingress node. The keyword (Key) of the newly joined node, such as an IP address, a MAC address, an inherent load capacity, and authentication authentication information, is included in the join request message.

Step 602: The ingress node sends the information of the newly added node to the authentication server to complete the security authentication of the newly added node. If the authentication succeeds, step 603 is performed. If the authentication fails, the new node identifier is not configured.

Step 603: The ingress node determines a range of address spaces in which the new node identifier of the newly joined node may be located, that is, an available address space range, and may determine an address space range in which the same type of network element as the newly joined node is located, or an entire address of the network system. Space, or part of the address space in the entire address space.

Step 604: The ingress node calculates the cut-in node identifier of the cut-in node by using a hash function, first obtains the key of the newly joined node from the join request message, and calculates the cut-in node identifier by using the second policy, and then the cut-in node identifier = Start + Hash ( Key ), where the Start value is the starting point of the range of available address spaces, and End is the ending point of the range of available address spaces. The Hash function selected here is a Hash function that can hash the value to the [0, End-Start] interval of the same length as the alternate address space.

Step 605: The ingress node sends a node status information query message to the successor node P1 of the cut-in node to obtain the status information of the successor node P1, and includes a search depth parameter M in the node status information query message, indicating that the node P1 searches backward. The node identifiers of the M subsequent nodes do not exceed the available address space range; when M>0, the successor node P1 continues the node state query message to the successor node P2 of the node P1, including the search depth parameter being M - 1, and so on, It is not sent until the value of M is 0.

Step 606: The subsequent nodes assume that the node status information query message is received from the P1 to the PN, and the neighbor node status is queried, and the status query response message is returned to the ingress node, where the response message may include: the successor node and the corresponding The node ID of the precursor node, the static load weight parameter, the inherent load capacity, and the current load condition.

Step 607: The ingress node obtains a new joining section according to the received multiple status query response messages. After the configuration information of the point, the new node identifier may be generated, or the configuration information may be carried in the join request response message in step 608 and sent to the newly joined node, so that the newly joined node generates the new node identifier by itself.

The ingress node may obtain static load weight parameters and/or dynamic load weight parameters of the subsequent nodes from the plurality of status query response messages, and compare, and obtain at least two nodes may be within the available address space range, after the node is cut in Among the nodes, the node with the largest static and/or dynamic load weight parameter and its precursor node, assuming that the node is node P, and its precursor node is node Q; it can also be within the available address space, in the node after the node is switched in. At least two nodes with a large static and/or dynamic load weight parameter and corresponding predecessor nodes, a node having a larger parameter is a node P, and a precursor node thereof is a node Q. Then, the configuration information acquired by the ingress node includes: a node identifier of the nodes P and Q; or a node identifier of the nodes P and Q, and an inherent load capacity of the node P.

Step 608: The ingress node sends a join response message to the new joining node. If the new node identifier is generated in step 607, the new node identifier is carried. If only the configuration information is obtained in step 607, the configuration information is carried.

It can be understood that, when the new joining node receives the join request response message, including the configuration information, the new node identifier is generated according to the method in step 607 above. Further, the generated new node identifier may be sent to the centralized management node.

Equipment Embodiment 1

A node device, the structure diagram is shown in Figure 10, including:

The determining unit 10 is configured to receive a join request message of the newly joined node, and determine a range of available address spaces in which the new node identifier of the newly joined node is located; When determining the range of available address spaces, the determining unit 10 specifically determines the address space range in which the node of the same type as the newly joined node is located, or the entire address space of the network system, or a part of the address space in the entire address space is the available address space. range.

The state obtaining unit 11 is configured to obtain state information of at least one node in the range of available address space determined by the determining unit 10, where the state information may include: a node identifier, an inherent load capability parameter, a current load parameter of the node, and the like;

It can be understood that if the node device is a centralized management node, the state obtaining unit 11 can directly read in the local storage space; if the node device is an ingress node, the state obtaining unit 11 needs to pass through the portal when acquiring the state information of the node. The node sends the node status information query message to the queried node to obtain.

The first identifier generating unit 12 is configured to generate at least one new node identifier according to the state information acquired by the first policy and the state acquiring unit 11, and send the new node identifier to the new joining node. The first policy includes: the new node identifier is a node identifier of a specific distance after the first node;

Or, the status information acquired by the state obtaining unit 11 is sent to the newly joined node, so that the newly added node generates the at least one new node identifier according to the state information and the first policy.

The specific distance may be half of the difference between the node identifier of the second node and the first node; or may be the difference between the node identifier of the second node and the first node, and the inherent load capacity parameter of the newly added node and the second node The product of the ratio of the sum of the new intrinsic load capacity parameters of the node; it can also be any other distance. The second node is a successor node of the first node.

It can be seen that, in the node device of the embodiment of the present invention, the determining unit 10 receives the join request message of the newly joined node, determines the available address space range in which the new node identifier of the newly joined node is located, and obtains the available address space range by the state acquiring unit 11. The status information of the at least one node in the first; the first first identifier generating unit 12 generates at least one new node identifier according to the first policy and the status information, or sends the status information to the newly joined node, so that the newly joined node is based on the status information and the first The policy generates at least one new node identifier, where the first policy includes: the new node identifier is a node identifier of a specific distance after the node identifier of the first node. In this way, through the cooperation of the newly added node and the existing node in the network system, after receiving the join request message, the newly added node is configured at a certain distance after the first node existing in the network system, so that the configuration of the new node identifier is not required. Human participation, the configuration process is streamlined.

Referring to FIG. 11, in a specific embodiment, the foregoing state acquiring unit 11 may include: The first parameter comparison unit 110 is configured to compare static load weight parameters and/or dynamic load weight parameters of all nodes in the available address space range after the determining unit 10 determines the available address space range;

The reading unit 111 is configured to read the static load weight parameter and/or the state information of the node with the largest dynamic load weight parameter and the precursor node of the first parameter comparison unit 110, where the first node is a static load weight parameter and And a predecessor node corresponding to the node with the largest dynamic load weight parameter; or at least two nodes and corresponding predecessors for reading the static load weight parameter and/or the dynamic load weight parameter that are compared by the first parameter comparison unit 110 State information of the node; the first node is a predecessor node corresponding to at least two nodes having a static load weight parameter and/or a dynamic load weight parameter.

After the reading unit 111 reads the status information, the first identifier generating unit 12 performs the generation of the new node identifier according to the first policy and the status information.

Referring to FIG. 12, in another specific embodiment, the foregoing state acquiring unit 11 may further include:

The candidate calculation unit 112 is configured to: after the determining unit 10 determines the available address space range, calculate the candidate node identifiers of the at least two candidate nodes by using at least two hash functions and the second policy, where the second policy includes: The node identifier is the starting point of the range of available address spaces, and the hash corresponding to the newly added node keyword is calculated as the sum of the hash values;

The second parameter comparison unit 113 is configured to compare the static load weight parameter and/or the dynamic load weight parameter of the successor node of the at least two candidate nodes calculated by the candidate calculation unit 112;

The first obtaining unit 114 is configured to retrieve the static load weight parameter and/or the state information of the node with the largest dynamic load weight parameter and the status of the precursor node that are compared by the second parameter comparing unit 113, and the first node is at least two devices. Among the successor nodes of the selected node, the static load weight parameter and/or the node with the largest dynamic load weight parameter correspond to its precursor node;

Or for obtaining the static load weight parameter and/or the dynamic load weight parameter of the second parameter comparison unit 113 for comparing at least two nodes and the state information of the corresponding precursor node; at this time, the first node is a static load weight parameter. And/or a predecessor node corresponding to at least two nodes having a large dynamic load weight parameter.

After the first obtaining unit 114 acquires the state information, the first identifier generating unit 12 follows the first Policy and status information for the generation of new node IDs.

Referring to FIG. 13, in another specific embodiment, the foregoing state acquiring unit 11 may further include:

The cut-in calculation unit 115 is configured to calculate a cut-in node identifier of the cut-in node by using a hash function and a second policy after the determining unit 10 determines the available address space range, where the second policy includes: the cut-in node identifier is a range of available address space Starting point, the hash corresponding to the newly added node keyword is calculated as the sum of the hash values;

The third parameter comparison unit 116 is configured to compare the static load weight parameter and/or the dynamic load weight parameter of the successor node of the cut-in node and the successor node calculated by the calculation unit 115 within the available address space range;

The second obtaining unit 117 is configured to acquire the static load weight parameter and/or the state information of the node with the largest dynamic load weight parameter and the precursor node thereof, and the first node is at least one of the cut-in nodes. Among the consecutive subsequent nodes, the static load weight parameter and/or the predecessor node corresponding to the node with the largest dynamic load weight parameter;

Or, used to obtain the state information of the at least two nodes and the corresponding precursor nodes that are obtained by comparing the static load weight parameter and/or the dynamic load weight parameter compared by the third parameter comparison unit 116; at this time, the first node is a static load. The at least two nodes corresponding to the weight parameter and/or the dynamic load weight parameter are corresponding to the precursor node.

After the second obtaining unit 117 acquires the status information, the first identifier generating unit 12 performs the generation of the new node identifier according to the first policy and the status information.

Equipment Embodiment 2

A node device, the structure diagram shown in Figure 14, includes:

The sending unit 20 is configured to send a join request message of the newly joined node;

The status receiving unit 21 is configured to receive status information returned according to the join request message sent by the join sending unit 20, where the status information includes a range of available address spaces in which the new node identifier of the newly joined node is located, and status information of the at least one node, such as a node. Identification, current load capacity parameter node current load parameters, etc.;

The available address space ranges specifically: the address space range of the same type of node as the newly joined node is the available address space range; or, the entire address space of the network system or the entire address space Sub-address space.

The second identifier generating unit 22 is configured to generate at least one new node identifier according to the first policy and the state information received by the state receiving unit 21; the first policy includes: the new node identifier is a node at a specific distance after the node identifier of the first node Logo.

Here, the specific distance may be half of the difference between the node identifier of the second node and the first node; the difference between the node identifier of the second node and the first node, and the inherent load capacity parameter of the newly joined node with the second node and the new node The product of the ratio of the sum of the nodes' inherent load capacity parameters can also be any other distance.

It can be understood that, in the node device of this embodiment, after the join sending unit 20 sends the join request message, when the state receiving unit 21 receives the returned state information, the second identifier generating unit 22 performs the generation of the new node identifier. When the new node joins the network system, by joining the sending unit 20, the state receiving unit 21, and the second identifier generating unit 22, the new node identifier can be configured without manual participation, which simplifies the configuration process.

Equipment Embodiment 3

A node device, the structure diagram is shown in Figure 15, including:

The receiving determining unit 30 is configured to receive a join request message of the newly joined node, and determine a range of available address spaces in which the new node identifier of the newly joined node is located, where the join request message includes a node keyword of the newly joined node;

Here, the node keyword of the newly added node may be information such as the IP address, the inherent load capacity, the MAC address, and the authentication authentication information of the newly added node.

The candidate calculation unit 31 is configured to calculate an candidate node identifier of the at least two candidate nodes according to the second policy and the at least two hash functions, where the second policy includes: the candidate node identifier is an available address determined by the receiving determining unit 30 The starting point of the spatial range, corresponding to the node keyword of the newly joined node, hashes the sum of the hash values;

The selecting unit 32 is configured to select, in the successor node of the at least two candidate nodes calculated by the candidate calculating unit 31, the static load weight parameter and/or the successor node with the largest dynamic load weight parameter as the third node Point, or at least two successor nodes having a static load weight parameter and/or a dynamic load weight parameter as a third node;

The identifier determining unit 33 is configured to use the node identifier of the candidate node corresponding to the third node selected by the selecting unit 32 as the new node identifier of the newly joined node.

In the node device of this embodiment, the receiving determining unit 30 determines the available address space range after receiving the join request message; the candidate calculating unit 31 calculates the at least two candidate nodes according to the second policy and the at least two hash functions. An alternative node identifier, where the second policy includes: the candidate node identifier is a starting point of the available address space range, and the sum of the hash values is calculated corresponding to the node keyword of the newly joined node; the selecting unit 32 will at least two In the successor node of the selected node, the succeeding node with the largest or larger static load weight parameter and/or the dynamic load weight parameter is selected as the third node, and the identifier determining unit 33 determines the candidate node identifier corresponding to the third node as the new node identifier. . After receiving the join request message, the new join node is configured in front of the existing third node in the network system by the cooperation of the newly added node and the existing node in the network system, so that the configuration of the new node identifier does not need to be manually participated. , simplifies the configuration process.

System embodiment

A system for generating a node identifier, comprising: a network node and a newly joined node, where: a network node, configured to receive a join request message of the newly joined node, determine a range of available address spaces in which the new node identifier of the newly joined node is located; Status information of at least one node in the available address space; sending status information to the newly joined node;

The status information here includes: a node identifier, an inherent load capability parameter, a current load parameter of the node, and the like;

a new joining node, configured to send a join request message of the newly joined node; receiving the status information returned according to the join request message, generating at least one new node identifier according to the first policy and the status information; the first policy includes: the new node identifier is: The node identifier of a specific distance after the node of the first node is identified.

Here, the specific distance may be half of the difference between the node identifier of the second node and the first node; or may be the difference between the node identifier of the second node and the first node, and the inherent load capacity parameter of the newly joined node and the second node and The product of the ratio of the new node's inherent load capacity parameters; it can also be any other distance.

In the system of this embodiment, when a network node and a newly joined node generate a node identifier, they may follow The method of the foregoing method embodiment is performed, and details are not described herein again.

It can be seen that the node identifier generation method, system, and device provided by the embodiment of the present invention receive the join request message of the newly joined node, determine the available address space range in which the new node identifier of the newly joined node is located, and obtain the available address space range. At least one node's state information; finally generating at least one new node identifier according to the first policy and the state information, or sending the state information to the newly joined node, so that the new joining node #> generates the at least one according to the state information and the first policy The new node identifier, where the first policy includes: the new node identifier is a node identifier of a specific distance after the node identifier of the first node. After receiving the join request message, the new join node is configured with a certain distance after the first node existing in the network system by using the newly joined node and the existing node in the network system, so that the configuration of the new node identifier is not required. Human involvement simplifies the configuration process. The program may be executed by instructing related hardware, and the program may be stored in a computer readable storage medium, and the storage medium may include: a ROM, a RAM, a magnetic disk or an optical disk.

The foregoing description of the method, system and device for generating the node identifier provided by the embodiment of the present invention is only for assisting in understanding the method and core idea of the present invention. Meanwhile, for those skilled in the art, based on The present invention is not limited by the scope of the present invention.

Claims

Rights request

A method for generating a node identifier, comprising:

Transmitting the status information to the new joining node, so that the newly joining node generates at least one new node identifier according to the status information and the first policy, where the first policy includes: the new node identifier is a node at the first node A node identifier that identifies a specific large distance.

2. The method according to claim 1, wherein the specific distance is a preset distance; or

The specific distance is half of a difference between a successor node of the first node and a node identifier of the first node; or

The specific distance is a difference between a successor node of the first node and a node identifier of the first node, and an inherent load capacity parameter of the newly added node and a successor parameter of the first node and a new node intrinsic load capacity parameter The product of the ratio of the sum.

The method according to claim 1 or 2, wherein the determining the available address space range in which the new node identifier of the newly joined node is located specifically includes:

Determining an address space range in which a node of the same type as the newly joined node is in an available address space range; or

Determine the entire address space of the network system or part of the address space in the entire address space as a range of available address spaces.

The method of claim 2, wherein the obtaining the status information of the at least one node in the range of the available address space comprises:

Comparing static load weight parameters and/or dynamic load weight parameters of all nodes in the available address space range;

Read the node with the largest static load weight parameter and/or dynamic load weight parameter and its precursor node Status information, the first node is a predecessor node corresponding to the node with the static load weight parameter and/or the dynamic load weight parameter being the largest; or

Reading at least one node of the static load weight parameter and/or the dynamic load weight parameter and status information of the corresponding precursor node; the first node is at least two of a static load weight parameter and/or a dynamic load weight parameter The corresponding predecessor node of each node.

Calculating the candidate node identifiers of the at least two candidate nodes by using at least two hash functions and the second policy, where the second policy includes: the candidate node identifier is a starting point of the available address space range, and the newly joined node The keyword corresponds to the hash to calculate the sum of the hash values;

Comparing static load weight parameters and/or dynamic load weight parameters of successor nodes of the at least two candidate nodes;

Obtaining state information of a node with a static load weight parameter and/or a dynamic load weight parameter and a precursor node thereof, wherein the first node is a successor of the at least two candidate nodes, a static load weight parameter and/or a dynamic a predecessor node corresponding to a node having the largest load weight parameter;

Or,

Obtaining state information of at least two nodes and corresponding predecessor nodes with a static load weight parameter and/or a dynamic load weight parameter; the first node is at least two of a static load weight parameter and/or a dynamic load weight parameter The corresponding predecessor node of each node.

The method of claim 2, wherein the obtaining the status information of the at least two nodes in the range of the available address space comprises:

Computing a cut-in node identifier of the cut-in node by using a hash function and a second policy, where the second policy includes: the cut-in node identifier is a starting point of the available address space range, and the hash calculation hash corresponding to the newly added node keyword The sum of values;

Comparing the static load weight parameter and/or the dynamic load weight parameter of the successor node and subsequent nodes of the node into the range of available address space;

Obtaining state information of a node with a static load weight parameter and/or a dynamic load weight parameter and a precursor node thereof, the first node being a successor node of the hand-cut node and all subsequent, static load weight parameters and/or dynamic load a predecessor node corresponding to the node with the largest weight parameter; or,

Obtaining state information of at least two nodes and corresponding predecessor nodes having a large static load weight parameter and/or a dynamic load weight parameter; or the first node is at least a static load weight parameter and/or a dynamic load weight parameter The corresponding precursor node of the two nodes.

A method for generating a node identifier, comprising:

Send the join request message of the newly joined node;

8. The method according to claim 7, wherein the specific distance is a preset distance; or

The specific distance is the difference between the successor node of the first node and the node identifier of the first node, and the sum of the inherent load capacity parameter of the newly joined node and the successor parameter of the successor node of the first node and the newly added node. The product of the ratio.

The method according to claim 7 or 8, wherein the range of available address spaces is specifically: an address space range in which a node of the same type as the newly joined node is in an available address space range; or The entire address space of the network system or part of the address space in the entire address space.

A method for generating a node identifier, comprising:

Receiving a join request message of the newly joined node, determining a range of available address spaces in which the new node identifier of the newly joined node is located, where the join request message includes a node keyword of the newly joined node; according to the second policy and at least two The hash function calculates an alternate node identifier of the at least two candidate nodes, and the second policy includes: the candidate node identifier is a starting point of the available address space range, and the hash calculation corresponding to the node keyword of the newly joined node The sum of the hash values;

Selecting a successor node of the at least two candidate nodes, a static load weight parameter and/or a successor node having a maximum dynamic load weight parameter as a third node, or a static load weight parameter and/or a dynamic load weight parameter having at least a larger parameter Two successor nodes as the third node; The node identifier of the candidate node corresponding to the third node is used as the new node identifier of the newly joined node.

The method according to claim 10, wherein the determining the range of available address spaces in which the new node identifier of the newly joined node is located comprises: determining an address of a node of the same type as the newly joined node The spatial extent is the range of available address spaces; or,

12. A node device, comprising:

The device according to claim 12, wherein the state obtaining unit comprises: a first parameter comparing unit, configured to compare static load weight parameters and/or dynamic loads of all nodes in the available address space range Weight parameter

a reading unit, configured to read status information of a node with a maximum static load weight parameter and/or a dynamic load weight parameter and a precursor node thereof, where the first node is the static load weight parameter and/or the dynamic load weight parameter is the largest The node corresponding to its predecessor node;

Or for reading status information of at least two nodes and corresponding predecessor nodes having a large static load weight parameter and/or a dynamic load weight parameter, wherein the first node is a static load weight parameter and/or a dynamic load weight parameter A larger predecessor node of at least two nodes.

The device according to claim 12, wherein the state obtaining unit comprises: an alternative calculating unit, configured to calculate an candidate of the at least two candidate nodes by using at least two hash functions and the second policy a node identifier, where the second policy includes: the candidate node identifier is the available address space a starting point of the range, a hash corresponding to the newly added node keyword to calculate a sum of hash values; a second parameter comparing unit, configured to compare static load weight parameters and/or dynamics of the successor nodes of the at least two candidate nodes Load weight parameter

a first acquiring unit, configured to acquire state information of a node with a static load weight parameter and/or a dynamic load weight parameter and a precursor node thereof, wherein the first node is a successor node of the at least two candidate nodes, and is static a predecessor node corresponding to a node having a load weight parameter and/or a dynamic load weight parameter;

Or for obtaining state information of at least two nodes and corresponding predecessor nodes having a large static load weight parameter and/or a dynamic load weight parameter; wherein the first node is a static load weight parameter and/or a dynamic load weight parameter Larger at least two nodes corresponding to the precursor nodes.

The device according to claim 12, wherein the state obtaining unit comprises: a cut-in computing unit, configured to calculate a cut-in node identifier of the cut-in node by using a hash function and a second policy, the second policy The method includes: a cut-in node identifier is a starting point of the available address space range, and a hash corresponding to the newly added node keyword is used to calculate a sum of hash values;

a third parameter comparison unit, configured to compare static load weight parameters and/or dynamic load weight parameters of the successor node and all subsequent nodes within the available address space;

a second acquiring unit, configured to acquire state information of a node with a maximum static load weight parameter and/or a dynamic load weight parameter and a precursor node thereof, where the first node is a successor node of the cut-in node and all subsequent nodes, and is static a predecessor node corresponding to a node having a load weight parameter and/or a dynamic load weight parameter;

16. A node device, comprising:

a sending unit, configured to send a join request message of the newly joined node;

a second identifier generating unit, configured to generate at least one new section according to the first policy and the state information Point identification; the first policy includes: the new node identifier is a node identifier of a specific distance after the node identifier of the first node.

17. A node device, comprising:

18. A system for generating a node identifier, comprising: a network node and a newly added node;

The new joining node is configured to send a join request message of the newly joined node; receive the status information returned according to the join request message, and generate at least one new node identifier according to the first policy and the state information; The policy includes: The new node is identified as a node identifier of a certain distance after the node identifier of the first node.