WO2023138256A1

WO2023138256A1 - Communication method and communication apparatus

Info

Publication number: WO2023138256A1
Application number: PCT/CN2022/137884
Authority: WO
Inventors: 许培
Original assignee: 华为技术有限公司
Priority date: 2022-01-24
Filing date: 2022-12-09
Publication date: 2023-07-27

Abstract

The present application provides a communication method and a communication apparatus, for use in realizing automatic allocation of hierarchical addresses by means of interaction between upper and lower nodes in a tree network topology scenario to avoid the situation of network paralysis caused by manual configuration errors and improve network stability. In the method, a first node sends a first discover packet, the first discover packet being used for requesting allocation of an address; the first node receives a first offer packet from a second node, the first offer packet comprising a first address allocated to the first node by the second node; the first node receives a second discover packet from a third node, the second discover packet being used for requesting allocation of an address; and the first node sends a second offer packet to the third node, the second offer packet comprising a second address allocated to the third node by the first node.

Description

A communication method and communication device

This application claims the priority of the Chinese patent application submitted to the State Intellectual Property Office of China on January 24, 2022, with the application number 202210082179.4, and the invention name is "A method for end-to-end dynamic allocation of NewIP tree topology hierarchical addresses", and the Chinese patent application submitted to the State Intellectual Property Office of China on March 30, 2022, with the application number 202210327033.1, and the invention name is "A Communication Method and Communication Device" priority, the entire contents of which are incorporated by reference into this application.

technical field

The present application relates to the technical field of communication, and in particular, to a communication method and a communication device.

Background technique

Hierarchical addresses are an addressing method used in tree-type network topology scenarios, which can reduce the number of device forwarding entries and improve service convergence performance.

At present, in the tree-type network topology scenario, there are two types of devices. One type of device is a device with lower-level nodes, which can be called a network device; the other is a device without a lower-level node, which can be called a terminal device. Wherein, for network devices, their hierarchical addresses need to be manually configured.

However, in the above-mentioned implementation manner, manual configuration needs to be laborious. In particular, when the network topology changes, such as adding or removing devices, due to the large workload of device modification and configuration, manual configuration may also cause configuration errors and cause network paralysis.

Therefore, how to optimize the address allocation method in the tree-type network topology scene is a technical problem to be solved urgently.

Contents of the invention

The present application provides a communication method and a communication device, which are used to realize automatic allocation of hierarchical addresses through interaction between upper and lower nodes in a tree-type network topology scene, so as to avoid network paralysis caused by manual configuration errors and improve network stability.

The first aspect of the embodiments of the present application provides a communication method, the method is executed by the first node, or the method is executed by some components in the first node (such as a processor, chip or chip system, etc.), or the method is implemented by a logic module or software that can realize all or part of the functions of the first node. In the first aspect and possible implementation manners thereof, description is made by taking the communication method executed by a first node as an example, where the first node may be a device such as a router, a switch, or a virtual machine. In the method, the first node sends a first discovery message, and the first discovery message is used to request an address allocation; the first node receives a first provision message from a second node, and the first provision message includes a first address allocated by the second node to the first node; wherein, the first address includes a first field and a second field, the value of the first field is the value of the address of the second node and the second node is a superior node of the first node, and the value of the second field is an identifier of the first node; the first node receives a second discovery message from a third node, the second discovery message The text is used to request an address allocation, and the third node is a subordinate node of the first node; the first node sends a second providing message to the third node, the second providing message includes a second address allocated by the first node to the third node, the second address includes a third field and a fourth field, the value of the third field is the value of the first address, and the value of the fourth field is an identifier of the third node.

Based on the above technical solution, the first providing message received by the first node includes a first address, the value of the first field in the first address is the value of the address of the second node and the value of the second field in the first address is the identifier of the first node; and the second providing message sent by the first node includes a second address, the value of the third field in the second address is the value of the address of the first node and the value of the fourth field in the second address is the identifier of the third node. Wherein, the second node is a superior node of the first node and the third node is a subordinate node of the first node, that is, the first node can not only receive the hierarchical address assigned by the superior node, but also assign a hierarchical address to the subordinate node. In other words, in a tree-type network topology scenario including the second node, the first node, and the third node, the first node can serve as a terminal device to receive an automatically assigned hierarchical address from a superior node, and can also serve as a network device to automatically assign a hierarchical address to a subordinate node. Therefore, in the tree-type network topology scene, the automatic allocation of hierarchical addresses is realized through the interaction between the upper and lower nodes, so as to avoid the occurrence of network paralysis due to manual configuration errors and improve the stability of the network.

It should be understood that the hierarchical address is one of the characteristics of the New Internet Protocol (NewIP). For this reason, the above-mentioned technical effect can also be expressed as the automatic allocation of the hierarchical address in the NewIP protocol through the interaction between the upper and lower nodes in the tree-type network topology scene.

It should be noted that the discovery messages involved in the embodiments of the present application (such as the first discovery message, and the second discovery message, the third discovery message, the fourth discovery message, etc.) are used to request address allocation, that is, the discovery message is a message sent when the sender of the discovery message does not have an address. For this reason, the sender may send the discovery message in a flooding manner, hoping that the discovery message can be received by multiple receivers and obtain responses to the discovery message (that is, provide a message).

Optionally, when the sending end of the discovery message has an interface for communicating with the upper node (which may be called a northbound interface) and an interface for communicating with the lower node (which may be called a southbound interface), since generally only the upper node has the ability to allocate addresses, for this reason, the discovery message may also be sent by flooding the interface for communicating with the upper node to save overhead.

It can be seen that the sender of the discovery message can flexibly select the above sending method in different scenarios. For example, in the case that the sender (due to no configuration) cannot determine which nodes among the connected nodes are upper-level nodes, the sender may send the discovery message in a manner of collective flooding. For another example, when the sender can perceive which nodes among the connected nodes are upper-level nodes, the discovery message may be sent in a selective flooding manner to save overhead.

In addition, in the embodiment of the present application, the address assigned by the upper-level node to the lower-level node includes a field whose value is the identifier of the lower-level node (for example, the second field in the first address assigned by the second node to the first node, the fourth field in the second address assigned by the first node to the third node, and other assigned fields in the following).

Optionally, the field that takes the value as the identifier of the lower-level node can have a variety of value situations. It can be a value configured by the upper-level node (for example, the value is the serial number configured by the upper-level node according to the time sequence in which multiple lower-level nodes send discovery messages, and the value is the time stamp when the upper-level node receives discovery messages from multiple lower-level nodes, etc.), or it can be different values pre-configured for multiple lower-level nodes (for example, the value is a media access control (MAC) of multiple lower-level nodes. ) address, which is the device number of multiple subordinate nodes, etc.), or other implementation methods, which are not limited here.

In a possible implementation of the first aspect, after the first node sends the second offer message to the third node, the method further includes: after determining to disconnect from the second node, the first node sends a first change message to the third node to instruct the third node to clear the second address.

Based on the above technical solution, when the first node determines to be disconnected from the second node, the first node determines that the first address allocated by the second node to the first node is invalid and the second address allocated by the first node based on the first address is invalid. To this end, the first node sends a first change message to the third node to instruct the third node to clear the second address, so that the third node knows that the second address is invalid and clears the second address. Therefore, when the network topology changes (for example, the first node is disconnected from the second node), the dynamic update of the hierarchical addresses is realized through negotiation among different nodes.

In a possible implementation of the first aspect, after the first node sends the second offer message to the third node, the method further includes: after determining to disconnect from the second node, the first node sends a third discovery message, where the third discovery message is used to request address allocation; the first node receives a third offer message from the fourth node, and the third offer message includes the third address allocated by the fourth node to the first node; The value of the address of the node, the value of the sixth field is the identifier of the first node.

Based on the above technical solution, when the first node determines to be disconnected from the second node, the first node determines that the first address allocated by the second node to the first node is invalid. To this end, the first node may send a third discovery message for requesting address allocation to the other superior node (for example, the fourth node), and obtain the third address allocated to the first node from the fourth node. Therefore, when the network topology changes (for example, the first node is disconnected from the second node), the dynamic update of the hierarchical addresses is realized through negotiation among different nodes.

Optionally, the value of the sixth field in the third address and the value of the second field in the first address are both identifiers of the first node. As shown above, there may be multiple implementations for the identifier of the first node as a subordinate node. For this reason, the value of the sixth field in the third address and the value of the second field in the first address can be the same value, or the value of the sixth field in the third address and the value of the second field in the first address can also be different values, that is, the identifiers assigned to the first node by different upper-level nodes can be the same or different, which is not limited here.

In a possible implementation manner of the first aspect, after the first node receives the first offer message from the second node, the method further includes: after determining to disconnect from the second node, the first node clears the first address.

Based on the above technical solution, after the first node determines to disconnect from the second node, the first node determines that the first address assigned by the second node to the first node will become invalid. For this reason, the first node may clear the first address locally, and then obtain a new address from the upper node through a discovery message.

In a possible implementation manner of the first aspect, the determination by the first node to disconnect from the second node includes at least one of the following: the first node determines that the port status with the second node is down; or, the first node determines that the lease renewal of the first address has timed out; or, the first node receives a second change message from the second node to instruct the first node to clear the first address.

It should be understood that the disconnection between the first node and the second node may include disconnection of the link between the first node and the second node, may also include dormancy of the link between the first node and the second node, and may also include failure of the second node (or a superior node of the second node), etc., which are not limited herein.

Based on the above technical solution, for the first node, the first node may confirm that the second node is disconnected through the above-mentioned various methods, and further clarify that the first address allocated by the second node to the first node is invalid.

In a possible implementation manner of the first aspect, before the first node receives the first offer message from the second node, the method further includes: the first node receives a fourth discovery message, where the fourth discovery message is used to request address allocation; the first node sends a first non-confirmation message, where the first non-confirmation message is used to indicate refusal to allocate an address.

Based on the above technical solution, before the first node receives the first providing message from the second node, that is, before the first node receives the address assigned by the upper-level node, the first node does not have the ability to assign addresses to lower-level nodes (or the current hierarchical address of the first node is invalid). For this reason, after the first node receives the fourth discovery message for requesting address allocation, the first node sends a first non-confirmation message for indicating refusal of address allocation, so that the receiver of the first non-confirmation message knows that the first node currently does not have the ability to allocate addresses.

In a possible implementation manner of the first aspect, before the first node receives the first offer message from the second node, the method further includes: the first node receives a second non-confirmation message from the third node, where the second non-confirmation message is used to indicate refusal to allocate an address.

Based on the above technical solution, before the first node receives the first providing message, that is, before the first node receives the address assigned by the superior node, the first node does not know its own address, and correspondingly, the subordinate nodes (such as the third node) of the first node do not know its own address. Wherein, the number of the first discovery message sent by the first node may be multiple. After a certain first discovery message is received by the third node, because the third node does not have the ability to allocate addresses (or the current hierarchical address of the third node is invalid), the third node will send to the first node a second non-confirmation message for indicating refusal to allocate addresses, so that the first node determines based on the second non-confirmation message that the third node currently does not have the ability to allocate addresses.

In addition, the aforementioned non-confirmation messages (including the first non-confirmation message, the second non-confirmation message, and the third non-confirmation message, fourth non-confirmation message, and fifth non-confirmation message that may appear later) used to indicate the refusal to allocate addresses are messages based on the feedback of the discovery message. Wherein, the discovery message sent by the sender of the discovery message may be sent in a manner of flooding (full flooding or selective flooding). For this reason, the receiving end of the discovery message may receive the discovery message in various situations. Wherein, in the case where the receiving end of the discovery message has not received the address assigned by the upper-level node (that is, the receiving end does not have the address allocation capability, or the current hierarchical address of the receiving end is invalid), after receiving the discovery message, the message fed back by the receiving end is a non-confirmation message for indicating that the address is rejected; After the discovery message, the message fed back by the receiving end is an offer message for address allocation. Therefore, for any upper-level node, if the current hierarchical address of the upper-level node is invalid, it will feed back a non-confirmation message based on the received discovery message. Therefore, based on the non-confirmation message and the feedback of the provided message, in the tree network, the automatic allocation of hierarchical addresses is realized by sequentially allocating addresses from upper-level nodes to lower-level nodes, so as to avoid network paralysis caused by manual configuration errors and improve network stability.

In a possible implementation of the first aspect, after the first node receives the first offer message from the second node and before the first node sends the second offer message to the third node, the method further includes: the first node sends a first request message to the second node, where the first request message is used to indicate a request to use the first address; and the first node receives a first confirmation message from the second node, where the first confirmation message is used to indicate permission to use the first address.

Based on the above technical solution, after the first node receives the first provision message from the second node, the first node sends to the second node a first request message indicating that the first address is requested to be used, and receives a first confirmation message from the second node indicating that the first address is allowed to be used. In the case that the first node can clearly allocate an address based on the first address based on the first confirmation message, the first node sends a second offer message including the second address allocated based on the first address to the third node.

In addition, the second node may have multiple lower-level nodes, and the multiple lower-level nodes may all send discovery messages to the second node for requesting address allocation, and the second node may not only allocate the first address to the first node, but may also allocate the first address to other lower-level nodes. For this reason, the first node may clarify that the second node allows the first node to use the first address through the interaction of the first request message and the first confirmation message, that is, it is clear that other nodes other than the first node are not allowed to use the first address, so as to avoid address allocation conflicts.

In a possible implementation manner of the first aspect, before the first node receives the first confirmation message from the second node, the method further includes: the first node receives a fifth discovery message, where the fifth discovery message is used to request address allocation; the first node sends a third non-confirmation message, where the third non-confirmation message is used to indicate refusal to allocate an address.

Based on the above technical solution, before the first node receives the first confirmation message from the second node, since the first node does not know whether the second node allows the first node to use the first address, that is, the first node does not know whether the first node can assign addresses to subordinate nodes based on the first address. For this reason, after the first node receives the fifth discovery message for requesting address allocation, the first node sends a third non-confirmation message for indicating refusal of address allocation, so that the recipient of the third non-confirmation message knows that the first node currently does not have the ability to allocate addresses.

In a possible implementation manner of the first aspect, after the first node sends the second offer message to the third node, the method further includes: the first node receives a second request message from the third node, where the second request message is used to indicate a request to use the second address; the first node sends a second confirmation message to the third node, where the second confirmation message is used to indicate that the second address is allowed to be used.

Based on the above technical solution, after the first node sends a second offer message to the third node, and after the first node receives a second request message from the third node indicating a request to use the second address, the first node sends to the third node a second confirmation message indicating permission to use the second address. The third node can determine that the second address is an address allowed to be used based on the second confirmation message.

In addition, the first node may have multiple lower-level nodes, and the multiple lower-level nodes may all send discovery messages to the first node to request address allocation, and the first node may not only allocate the second address to the third node, but may also allocate the second address to other lower-level nodes. For this reason, the second node can clarify that the first node allows the second node to use the second address through the interaction of the second request message and the second confirmation message, that is, it is clear that other nodes other than the second node are not allowed to use the second address, so as to avoid address allocation conflicts.

In a possible implementation manner of the first aspect, the first address and the second address are NewIP addresses.

Based on the above-mentioned technical solution, the hierarchical address is one of the characteristics of the New Internet Protocol (NewIP). Therefore, in this implementation, different nodes (including the first node, the second node and the third node, etc.) can communicate based on the NewIP protocol. On this basis, the addresses allocated by the above-mentioned nodes (including the first address, the second address, and the possible third address, etc.) are NewIP addresses.

In a possible implementation manner of the first aspect, the first discovery message, the first offer message, the second discovery message, and the second offer message are all dynamic host configuration protocol (dynamic host configuration protocol, DHCP) messages.

Based on the foregoing technical scheme, the first discovery message, the first provision message, the second discovery message and the second provision message are all DHCP messages, that is, the first discovery message and the second discovery message can be a Dynamic Host Configuration Protocol discovery (DHCP discover) message in DHCP, and the first provision message and the second provision message can provide a (DHCP offer) message for a Dynamic Host Configuration Protocol in DHCP. This enables the realization method to multiplex the message processing mechanism of DHCP to realize the automatic allocation of hierarchical addresses.

Optionally, other discovery messages involved in the present application (such as the third discovery message, the fourth discovery message, the fifth discovery message, etc.) can all be DHCP discover messages, and other provision messages involved in the present application can all be DHCP offer messages. Similarly, the request message involved in the application (such as the first request message, the second request message, etc.) can also be a dynamic host configuration protocol request (DHCP request) message in DHCP, the confirmation message involved in the application (such as the first confirmation message, the second confirmation message, etc.) Dynamic Host Configuration Protocol non-acknowledgement (DHCP NAK) message.

It should be understood that the hierarchical address is one of the characteristics of the New Internet Protocol (NewIP). Therefore, the above technical solution can also be described as extending the DHCP protocol to support the automatic allocation of the hierarchical address in the NewIP protocol.

It should be noted that, in the above technical solutions, the messages involved in this application (such as the first discovery message, the first offer message, the second discovery message, and the second offer message) are taken as examples for description. In practical applications, when each node in the network topology uses other address allocation protocols different from DHCP, such as a bootstrap protocol (bootstrap protocol, BOOTP), a privatized address allocation protocol, or other address allocation protocols, the messages involved in this application can also be messages in the other address allocation protocols.

In a possible implementation manner of the first aspect, in the first address, the first field is located before the second field; and/or, in the second address, the third field is located before the fourth field.

Based on the above technical solution, in the first address, the first field whose value is the address of the upper-level node (that is, the second node) may be located before the second field whose value is the identifier of the first node, so as to clarify based on the first address of the first node the address of the upper-level node of the first node and the network topology relationship of the network where the first node is located.

Similarly, in the second address, the third field whose value is the address of the upper-level node (that is, the first node) may be located before the fourth field whose value is the identifier of the third node, so as to clarify the address of the upper-level node of the third node based on the second address of the third node and the network topology relationship of the network where the third node is located.

In a possible implementation manner of the first aspect, the method is applied to a tree network, and the second node is a root node of the tree network or an intermediate node of the tree network.

Based on the above technical solution, as the upper node of the first node, the second node can be the root node in the network topology (that is, only have the lower nodes and not have the upper nodes), and the second node can also be an intermediate node in the network topology (that is, have the lower nodes and have the upper nodes), which is not limited here.

In a possible implementation manner of the first aspect, the method is applied to a tree network, and the third node is a leaf node of the tree network or an intermediate node of the tree network.

Based on the above technical solution, as a subordinate node of the first node, the third node can be a leaf node in the network topology (that is, only have a superior node but not a subordinate node), and the third node can also be an intermediate node in the network topology (that is, have a subordinate node and have a superior node), which is not limited here.

The second aspect of the embodiments of the present application provides a communication method, which is implemented by a communication system. For example, the method is executed by each node (including the first node, the second node, and the third node, etc.) in the communication system, or, the method is executed by some components (such as a processor, a chip, or a chip system, etc.) in each node (including the first node, the second node, and the third node, etc.), or, the method is implemented by a logic module or software that can realize all or part of the functions of each node (including the first node, the second node, and the third node, etc.). In the second aspect and possible implementations thereof, the communication method is described as an example performed by various nodes (including the first node, the second node, and the third node, etc.), where each node (including the first node, the second node, and the third node, etc.) may be a device such as a router, a switch, or a virtual machine. Wherein, the second node is a superior node of the first node and the third node is a subordinate node of the first node.

In the method, the first node sends a first discovery message, and the first discovery message is used to request an address allocation; the second node receives the first discovery message, and sends a first provision message to the first node, and the first provision message includes a first address allocated by the second node to the first node; wherein, the first address includes a first field and a second field, the value of the first field is the value of the address of the second node, and the value of the second field is an identifier of the first node; the first node receives the first provision message; the third node sends a second discovery message, the second The discovery message is used to request address allocation; the first node receives the second discovery message and sends a second offer message to the third node, the second offer message includes a second address allocated by the first node to the third node, the second address includes a third field and a fourth field, the value of the third field is the value of the first address, and the value of the fourth field is an identifier of the third node; the third node receives the second offer message.

Based on the above technical solution, the first providing message received by the first node from the second node includes a first address, the value of the first field in the first address is the value of the address of the second node and the value of the second field in the first address is the identifier of the first node; and the second providing message sent by the first node to the third node includes a second address, the value of the third field in the second address is the value of the address of the first node and the value of the fourth field in the second address is the identifier of the third node. Wherein, the second node is a superior node of the first node and the third node is a subordinate node of the first node, that is, the first node can not only receive the hierarchical address assigned by the superior node, but also assign a hierarchical address to the subordinate node. In other words, in a tree-type network topology scenario including the second node, the first node, and the third node, the first node can serve as a terminal device to receive an automatically assigned hierarchical address from a superior node, and can also serve as a network device to automatically assign a hierarchical address to a subordinate node. Therefore, in the tree-type network topology scene, the automatic allocation of hierarchical addresses is realized through the interaction between the upper and lower nodes, so as to avoid the occurrence of network paralysis due to manual configuration errors and improve the stability of the network.

It can be seen that the sender of the discovery message can flexibly select the above sending method in different scenarios. For example, in the case that the sender (due to no configuration) cannot determine which nodes among the connected nodes are upper-level nodes, the sender may send the discovery message in a manner of collective flooding. For another example, when the sender can perceive which nodes among the connected nodes are upper-level nodes, the discovery message can be sent in a selective flooding manner to save overhead.

In a possible implementation of the second aspect, after the first node sends the second offer message to the third node, the method further includes: after the first node determines to disconnect from the second node, the first node sends a first change message to the third node to instruct the third node to clear the second address; the third node receives the first change message and clears the second address.

In a possible implementation manner of the second aspect, the method further includes: the third node sending the first change message to a subordinate node of the third node.

Based on the above technical solution, when the third node also includes subordinate nodes, after the third node receives the first change message, the third node may also send the first change message to the subordinate nodes of the third node to instruct the subordinate nodes of the third node to clear the address allocated by the third node, so that the subordinate nodes of the third node clearly invalidate the allocated address and clear the address. Therefore, when the network topology changes (for example, the first node is disconnected from the second node), the dynamic update of the hierarchical addresses is realized in the multi-layer network topology through negotiation among different nodes.

In a possible implementation manner of the second aspect, the system further includes a fourth node, where the fourth node is an upper-level node of the first node. After the first node sends the second offer message to the third node, the method further includes: after determining to disconnect from the second node, the first node sends a third discovery message, where the third discovery message is used to request address allocation; the fourth node receives the third discovery message, and sends a third offer message to the first node, where the third offer message includes a third address allocated by the fourth node to the first node; The third address includes a fifth field and a sixth field, the value of the fifth field is the value of the address of the fourth node, the value of the sixth field is the identifier of the first node; the first node receives the third providing message.

Based on the above technical solution, when the first node determines to be disconnected from the second node, the first node determines that the first address allocated by the second node to the first node is invalid. To this end, the first node may send a third discovery message for requesting address allocation to other upper-level nodes (such as the fourth node), and obtain the third address allocated to the first node from the fourth node; in other words, after the first node determines that the upper-level node of the first node is changed from the second node to the fourth node, the first node obtains a new address from the fourth node. Therefore, when the network topology changes (for example, the first node is disconnected from the second node), the dynamic update of the hierarchical addresses is realized through negotiation among different nodes.

In a possible implementation manner of the second aspect, the method further includes: the third node receiving the third discovery message; the third node sending a fourth non-confirmation message to the first node, where the fourth non-confirmation message is used to indicate refusal to allocate an address; and the first node receives the fourth non-confirmation message.

Based on the above technical solution, before the first node receives the third providing message from the fourth node, that is, before the first node receives the address assigned by the upper-level node, the first node does not have the ability to assign addresses to lower-level nodes (or the current hierarchical address of the first node is invalid). For this reason, after the first node receives the fourth discovery message for requesting address allocation, the first node sends a fourth non-confirmation message for indicating refusal of address allocation, so that the receiver of the fourth non-confirmation message knows that the first node currently does not have the ability to allocate addresses.

In a possible implementation manner of the second aspect, after the first node receives the first provision message from the second node, the method further includes: after determining to disconnect from the second node, the first node clears the first address.

In a possible implementation manner of the second aspect, the determination by the first node to disconnect from the second node includes at least one of the following: the first node determines that the state of the port with the second node is down; or, the first node determines that the lease renewal of the first address has timed out; or, the first node receives a second change message from the second node to instruct the first node to clear the first address.

Based on the above technical solution, for the first node, the first node can explicitly disconnect from the second node through the above-mentioned various methods, and further clarify that the first address allocated by the second node to the first node is invalid.

In a possible implementation of the second aspect, before the first node receives the first provision message, the method further includes: the third node sends a fourth discovery message, where the fourth discovery message is used to request address allocation; the first node receives the fourth discovery message, and sends a first non-confirmation message to the third node, where the first non-confirmation message is used to indicate refusal to allocate an address; the third node receives the first non-confirmation message.

In a possible implementation manner of the second aspect, before the first node receives the first provision message, the method further includes: the third node receives the first discovery message; the third node sends a second non-confirmation message to the first node, and the second non-confirmation message is used to indicate refusal to allocate an address; the first node receives the second non-confirmation message.

In addition, the above non-confirmation messages (including the first non-confirmation message, the second non-confirmation message, and the third non-confirmation message, fourth non-confirmation message, and fifth non-confirmation message that may appear later) used to indicate the refusal to allocate addresses are messages based on the feedback of the discovery message. Wherein, the discovery message sent by the sender of the discovery message may be sent in a manner of flooding (full flooding or selective flooding). For this reason, the receiving end of the discovery message may receive the discovery message in various situations. Wherein, in the case where the receiving end of the discovery message has not received the address assigned by the upper-level node (that is, the receiving end does not have the address allocation capability, or the current hierarchical address of the receiving end is invalid), after receiving the discovery message, the message fed back by the receiving end is a non-confirmation message for indicating that the address is rejected; After the discovery message, the message fed back by the receiving end is an offer message for address allocation. Therefore, for any upper-level node, if the current hierarchical address of the upper-level node is invalid, it will feed back a non-confirmation message based on the received discovery message. Therefore, based on the non-confirmation message and the feedback of the provided message, in the tree network, the automatic allocation of hierarchical addresses is realized by sequentially allocating addresses from upper-level nodes to lower-level nodes, so as to avoid network paralysis caused by manual configuration errors and improve network stability.

In a possible implementation of the second aspect, after the first node receives the first offer message and before the first node sends the second offer message, the method further includes: the first node sends a first request message, where the first request message is used to indicate a request to use the first address; the second node receives the first request message, and sends a first confirmation message to the first node, where the first confirmation message is used to indicate permission to use the first address; and the first node receives the first confirmation message.

In addition, the second node may have multiple lower-level nodes, and the multiple lower-level nodes may all send discovery messages to the second node for requesting address allocation, and the second node may not only allocate the first address to the first node, but may also allocate the first address to other lower-level nodes. For this reason, the first node can clarify that the second node allows the first node to use the first address through the interaction of the first request message and the first confirmation message, that is, it is clear that other nodes other than the first node are not allowed to use the first address, so as to avoid address allocation conflicts.

In a possible implementation of the second aspect, before the first node receives the first confirmation message, the method further includes: the third node sends a fifth discovery message, where the fifth discovery message is used to request address allocation; the first node receives the fifth discovery message, and sends a third non-confirmation message to the third node, where the third non-confirmation message is used to indicate refusal to allocate an address; and the third node receives the third non-confirmation message.

In a possible implementation manner of the second aspect, after the first node sends the second offer message, the method further includes: the third node sends a second request message, where the second request message is used to indicate a request to use the second address; the first node receives the second request message, and sends a second confirmation message to the third node, where the second confirmation message is used to indicate permission to use the second address; and the third node receives the second confirmation message.

In a possible implementation manner of the second aspect, the first address and the second address are NewIP addresses.

In a possible implementation manner of the second aspect, the first discovery message, the first offer message, the second discovery message, and the second offer message are all Dynamic Host Configuration Protocol DHCP messages.

Based on the foregoing technical scheme, the first discovery message, the first provision message, the second discovery message and the second provision message are all DHCP messages, that is, the first discovery message and the second discovery message can be a Dynamic Host Configuration Protocol discovery (DHCP discover) message in DHCP, and the first provision message and the second provision message can be a Dynamic Host Configuration Protocol (DHCP offer) message in DHCP. This enables the realization method to multiplex the message processing mechanism of DHCP to realize the automatic allocation of hierarchical addresses.

Optionally, other discovery messages involved in the present application (such as the third discovery message, the fourth discovery message, the fifth discovery message, etc.) can all be DHCP discover messages, and other provision messages that the application involves can be DHCP offer messages. Similarly, the request message involved in the application (such as the first request message, the second request message, etc.) can also be a dynamic host configuration protocol request (DHCP request) message in DHCP, the confirmation message involved in the application (such as the first confirmation message, the second confirmation message, etc.) Dynamic Host Configuration Protocol non-acknowledgement (DHCP NAK) message.

In a possible implementation manner of the second aspect, in the first address, the first field is located before the second field; and/or, in the second address, the third field is located before the fourth field.

In a possible implementation manner of the second aspect, the method is applied to a tree network, and the second node is a root node of the tree network or an intermediate node of the tree network.

Similarly, as the upper node of the first node, the fourth node can be the root node in the network topology (that is, it only has a lower node and does not have a higher node), and the fourth node can also be an intermediate node in the network topology (that is, it has a lower node and a higher node), which is not limited here.

In a possible implementation manner of the second aspect, the method is applied to a tree network, and the third node is a leaf node of the tree network or an intermediate node of the tree network.

A third aspect of the embodiments of the present application provides a communications device, which can implement the method in the foregoing first aspect or any possible implementation manner of the first aspect. The apparatus includes corresponding units or modules for performing the above method. The units or modules included in the device can be realized by software and/or hardware. For example, the device may be a communication device, or the device may be a component of the communication device (such as a processor, a chip or a chip system, etc.), or the device may also be a logic module or software capable of realizing all or part of the functions of the communication device.

The communication device includes a processing unit and a transceiver unit;

The sending unit is used to send a first discovery message, and the first discovery message is used to request address allocation;

The receiving unit is configured to receive a first provision message from a second node, the first provision message includes a first address assigned by the second node to the first node; wherein, the second node is a superior node of the first node, the first address includes a first field and a second field, the value of the first field is the value of the address of the second node, and the value of the second field is the identifier of the first node;

The receiving unit is also used to receive a second discovery message from the third node, where the third node is a subordinate node of the first node, and the second discovery message is used to request address allocation;

The sending unit is further configured to send a second providing message to the third node, the second providing message includes a second address assigned by the first node to the third node, the second address includes a third field and a fourth field, the value of the third field is the value of the first address, and the value of the fourth field is an identifier of the third node.

In a possible implementation manner of the third aspect, the device further includes a processing unit; the sending unit is further configured to send a first change message to the third node after the processing unit determines to disconnect from the second node, to instruct the third node to clear the second address.

In a possible implementation of the third aspect, after the processing unit determines to disconnect from the second node, the sending unit is further configured to send a third discovery message, the third discovery message is used to request an address allocation; the receiving unit is also used to receive a third provision message from the fourth node, the third provision message includes a third address allocated by the fourth node to the first node; wherein, the third address includes a fifth field and a sixth field, the value of the fifth field is the value of the address of the fourth node and the fourth node is the superior node of the first node, and the value of the sixth field is The value is the ID of the first node.

In a possible implementation manner of the third aspect, after the processing unit determines to disconnect from the second node, the processing unit is further configured to clear the first address.

In a possible implementation manner of the third aspect, the determining by the processing unit to disconnect from the second node includes at least one of the following:

The processing unit determines that the state of the port with the second node is down; or,

The processing unit determines that the lease renewal of the first address is timed out; or,

The processing unit determines that the receiving unit receives the second change message from the second node, so as to instruct the first node to delete the first address.

In a possible implementation manner of the third aspect, the receiving unit is further configured to receive a fourth discovery message, where the fourth discovery message is used to request address allocation; the sending unit is also used to send a first non-confirmation message, where the first non-confirmation message is used to indicate refusal to allocate an address.

In a possible implementation manner of the third aspect, the receiving unit is further configured to receive a second non-confirmation message from the third node, where the second non-confirmation message is used to indicate refusal to allocate an address.

In a possible implementation manner of the third aspect, the sending unit is further configured to send a first request message to the second node, where the first request message is used to indicate that the first address is requested to be used; the receiving unit is also used to receive a first confirmation message from the second node, where the first confirmation message is used to indicate that the first address is allowed to be used.

In a possible implementation of the third aspect, the receiving unit is further configured to receive a fifth discovery message, where the fifth discovery message is used to request address allocation; the sending unit is also used to send a third non-confirmation message, where the third non-confirmation message is used to indicate refusal to allocate an address.

In a possible implementation manner of the third aspect, the receiving unit is further configured to receive a second request message from the third node, where the second request message is used to indicate that the second address is requested to be used; the sending unit is also used to send a second confirmation message to the third node, where the second confirmation message is used to indicate that the second address is allowed to be used.

In a possible implementation manner of the third aspect, both the first address and the second address are NewIP addresses.

In a possible implementation manner of the third aspect, the first discovery message, the first offer message, the second discovery message, and the second offer message are all Dynamic Host Configuration Protocol DHCP messages.

In a possible implementation manner of the third aspect, in the first address, the first field is located before the second field; and/or, in the second address, the third field is located before the fourth field.

In a possible implementation manner of the third aspect, the device is applied to a tree network, and the second node is a root node of the tree network or an intermediate node of the tree network.

In a possible implementation manner of the third aspect, the method is applied to a tree network, and the third node is a leaf node of the tree network or an intermediate node of the tree network.

In the third aspect of the embodiment of the present application, the components of the communication device can also be used to execute the steps executed in each possible implementation manner of the first aspect, and achieve corresponding technical effects. For details, please refer to the first aspect, and details will not be repeated here.

The fourth aspect of the embodiment of the present application provides a communication system, the system includes a plurality of communication devices, and the plurality of communication devices respectively correspond to different nodes (including a first node, a second node, a third node, etc., and the second node is a superior node of the first node and the third node is a subordinate node of the first node).

In the communication system, any communication device of the plurality of communication devices includes a sending unit and a receiving unit. In addition, any device may implement the above-mentioned second aspect or the method in any possible implementation manner of the second aspect. Any of the apparatuses includes corresponding units or modules for performing the above method. The units or modules included in any device may be realized by software and/or hardware. For example, any of the devices may be a communication device, or any device may be a component of a communication device (such as a processor, a chip, or a chip system, etc.), or any device may also be a logic module or software that can realize all or part of the functions of the communication device.

In the communication system, the sending unit of the first node is used to send a first discovery message, and the first discovery message is used to request an address allocation; the receiving unit of the second node is used to receive the first discovery message, and the sending unit of the second node is used to send a first offer message to the first node, and the first offer message includes a first address allocated by the second node to the first node; wherein, the first address includes a first field and a second field, and the value of the first field is the value of the address of the second node and the second node is a superior node of the first node, and the value of the second field is The identifier of the first node; the receiving unit of the first node is used to receive the first provision message; the sending unit of the third node is used to send a second discovery message, and the second discovery message is used to request an address allocation; the receiving unit of the first node is also used to receive the second discovery message, and the sending unit of the first node is also used to send a second provision message to the third node, the second provision message includes a second address allocated by the first node to the third node, the second address includes a third field and a fourth field, the value of the third field is the value of the first address, and the value of the fourth field is The identifier of the third node and the third node is a subordinate node of the first node; the receiving unit of the third node is configured to receive the second providing message.

In a possible implementation manner of the fourth aspect, the first node further includes a processing unit; after the processing unit of the first node determines to disconnect from the second node, the sending unit of the first node is further configured to send a first change message to the third node to instruct the third node to clear the second address; the receiving unit of the third node is also configured to receive the first change message and clear the second address.

In a possible implementation manner of the fourth aspect, the sending unit of the third node is further configured to send the first change message to a subordinate node of the third node.

In a possible implementation manner of the fourth aspect, the system further includes a fourth node, and the fourth node is an upper-level node of the first node; after the processing unit of the first node determines to disconnect from the second node, the sending unit of the first node is further configured to send a third discovery message, and the third discovery message is used to request an address allocation; the receiving unit of the fourth node is used to receive the third discovery message, and the sending unit of the fourth node is used to send a third providing message to the first node, and the third providing message includes a third address allocated by the fourth node to the first node; The third address includes a fifth field and a sixth field, the value of the fifth field is the value of the address of the fourth node, the value of the sixth field is the identifier of the first node; the receiving unit of the first node is also used to receive the third providing message.

In a possible implementation manner of the fourth aspect, the receiving unit of the third node is further configured to receive the third discovery message; the sending unit of the third node is further configured to send a fourth non-confirmation message to the first node, where the fourth non-confirmation message is used to indicate refusal to allocate an address.

In a possible implementation manner of the fourth aspect, after the processing unit of the first node determines to disconnect from the second node, the processing unit of the first node is further configured to clear the first address.

In a possible implementation manner of the fourth aspect, the determination by the processing unit of the first node to disconnect from the second node includes at least one of the following:

The processing unit of the first node determines that the state of the port with the second node is down; or,

The processing unit of the first node determines that the lease renewal of the first address is timed out; or,

The processing unit of the first node determines that the receiving unit of the first node receives the second change message from the second node, so as to instruct the first node to clear the first address.

In a possible implementation manner of the fourth aspect, the sending unit of the third node is further configured to send a fourth discovery message, where the fourth discovery message is used to request address allocation; the receiving unit of the first node is also used to receive the fourth discovery message, and send a first non-confirmation message to the third node, where the first non-confirmation message is used to indicate refusal to allocate an address.

In a possible implementation manner of the fourth aspect, the receiving unit of the first node is further configured to receive a second non-confirmation message from the third node, where the second non-confirmation message is used to indicate refusal to allocate an address.

In a possible implementation manner of the fourth aspect, the sending unit of the first node is further configured to send a first request message, where the first request message is used to indicate that the first address is requested to be used; the receiving unit of the second node is also used to receive the first request message, and send a first confirmation message to the first node, where the first confirmation message is used to indicate that the first address is allowed to be used; the receiving unit of the first node is also used to receive the first confirmation message.

In a possible implementation manner of the fourth aspect, the sending unit of the third node is further configured to send a fifth discovery message, where the fifth discovery message is used to request address allocation; the receiving unit of the first node is also used to receive the fifth discovery message, and send a third non-confirmation message to the third node, where the third non-confirmation message is used to indicate refusal to allocate an address; the receiving unit of the third node is also used to receive the third non-confirmation message.

In a possible implementation manner of the fourth aspect, the sending unit of the third node is further configured to send a second request message, where the second request message is used to indicate that the second address is requested to be used; the receiving unit of the first node is also used to receive the second request message, and the sending unit of the first node is also used to send a second confirmation message to the third node, where the second confirmation message is used to indicate that the second address is allowed to be used; the receiving unit of the third node is also used to receive the second confirmation message.

In a possible implementation manner of the fourth aspect, both the first address and the second address are NewIP addresses.

In a possible implementation manner of the fourth aspect, the first discovery message, the first offer message, the second discovery message, and the second offer message are all Dynamic Host Configuration Protocol DHCP messages.

In a possible implementation manner of the fourth aspect, in the first address, the first field is located before the second field; and/or, in the second address, the third field is located before the fourth field.

In a possible implementation manner of the fourth aspect, the communication system is applied to a tree network, and the second node is a root node of the tree network or an intermediate node of the tree network.

In a possible implementation manner of the fourth aspect, the communication system is applied to a tree network, and the third node is a leaf node of the tree network or an intermediate node of the tree network.

In the fourth aspect of the embodiment of the present application, the components of the communication device can also be used to execute the steps executed in each possible implementation manner of the second aspect, and achieve corresponding technical effects. For details, please refer to the second aspect, and details will not be repeated here.

A fifth aspect of the embodiment of the present application provides a communication device, including at least one processor, and the at least one processor is coupled to a memory;

The memory is used to store programs or instructions;

The at least one processor is configured to execute the program or instruction, so that the device implements the method described in the foregoing first aspect or any possible implementation manner of the first aspect.

The sixth aspect of the embodiment of the present application provides a communication device, including at least one processor, and the at least one processor is coupled to a memory;

The memory is used to store programs or instructions;

The at least one processor is used to execute the program or instructions, so that the device implements the method described in the second aspect or any possible implementation manner corresponding to any node (including the first node, the second node, the third node, the fourth node, or other nodes, etc.) in the communication system in the second aspect.

The seventh aspect of the embodiments of the present application provides a computer-readable storage medium, where the storage medium is used to store one or more computer-executable instructions. When the computer-executable instructions are executed by a processor, the processor executes the method described in the above-mentioned first aspect or any possible implementation manner of the first aspect.

The eighth aspect of the embodiment of the present application provides a computer-readable storage medium. The storage medium is used to store multiple computer-executable instructions. The multiple computer-executable instructions correspond to the nodes (including the first node, the second node, the third node, the fourth node, and other nodes, etc.) included in the communication system in the second aspect or the second aspect.

A ninth aspect of the embodiments of the present application provides a computer program product (or called a computer program). When the computer program product is executed by a processor, the processor executes the method of the above-mentioned first aspect or any possible implementation manner of the first aspect.

The tenth aspect of the embodiments of the present application provides a computer program product (or called a computer program). When the computer program product is executed by a processor, the processor executes the method of the above-mentioned second aspect or any possible implementation manner of the second aspect.

The eleventh aspect of the embodiments of the present application provides a chip, where the chip includes at least one processor, configured to support the first node to implement the functions involved in the first aspect or any possible implementation manner of the first aspect. In a possible design, the system-on-a-chip may further include a memory, and the memory is used for storing necessary program instructions and data of the communication device. The system-on-a-chip may consist of chips, or may include chips and other discrete devices. Optionally, the chip system further includes an interface circuit, and the interface circuit provides program instructions and/or data for the at least one processor.

The twelfth aspect of the embodiment of the present application provides a chip, the chip includes at least one processor, configured to support nodes in the communication system (including the first node, the second node, the third node, the fourth node, or other nodes, etc.) to implement the functions involved in the second aspect or any possible implementation of the second aspect. In a possible design, the system-on-a-chip may further include a memory, and the memory is used for storing necessary program instructions and data of the communication device. The system-on-a-chip may consist of chips, or may include chips and other discrete devices. Optionally, the chip system further includes an interface circuit, and the interface circuit provides program instructions and/or data for the at least one processor.

The thirteenth aspect of the embodiment of the present application provides a communication system, the communication system includes the communication device in the above third aspect and any possible implementation thereof, and/or, the communication system includes multiple communication devices in the fourth aspect and any possible implementation thereof, and/or, the communication system includes the communication device in the fifth aspect and any possible implementation thereof, and/or, the communication system includes the nodes (including the first node, the second node, the third node, and a possible fourth node or other nodes, etc.) in the sixth aspect and any possible implementation thereof.

Wherein, the technical effects brought about by any one of the design methods from the third aspect to the thirteenth aspect can refer to the technical effects brought about by the different implementation methods in the above-mentioned first aspect or the second aspect, and will not be repeated here.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the accompanying drawings that are required in the description of the embodiments or prior art. Obviously, the accompanying drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, other accompanying drawings can also be obtained according to these drawings without paying creative labor.

Fig. 1 is a schematic diagram of the application scenario of the present application;

Fig. 2 is another schematic diagram of the application scenario of the present application;

Fig. 3 is another schematic diagram of the application scenario of the present application;

Fig. 4 is a schematic diagram of the communication method provided by the present application;

FIG. 5 is another schematic diagram of the communication method provided by the present application;

Fig. 6a is another schematic diagram of the application scenario of the present application;

Fig. 6b is another schematic diagram of the application scenario of the present application;

FIG. 6c is another schematic diagram of the communication method provided by the present application;

Fig. 6d is another schematic diagram of the communication method provided by the present application;

FIG. 6e is another schematic diagram of the communication method provided by the present application;

Fig. 7a is another schematic diagram of the application scenario of the present application;

Fig. 7b is another schematic diagram of the application scenario of the present application;

Fig. 7c is another schematic diagram of the application scenario of the present application;

FIG. 8 is another schematic diagram of the communication method provided by the present application;

Fig. 9a is another schematic diagram of the application scenario of the present application;

Fig. 9b is another schematic diagram of the application scenario of the present application;

Fig. 9c is another schematic diagram of the application scenario of the present application;

Fig. 9d is another schematic diagram of the application scenario of the present application;

FIG. 10 is a schematic diagram of a communication device provided by the present application;

Fig. 11 is a schematic diagram of the communication system provided by the present application;

Fig. 12 is another schematic diagram of the communication device provided by the present application.

Detailed ways

The technical solutions in the embodiments of the present invention will be described below with reference to the drawings in the embodiments of the present invention.

The terms "system" and "network" in the embodiments of the present application may be used interchangeably. "At least one" means one or more, and "plurality" means two or more. "And/or" describes the association relationship of the associated objects, indicating that there may be three types of relationships, for example, A and/or B, which may indicate: the existence of A alone, the existence of A and B at the same time, and the existence of B alone, where A and B can be singular or plural. The character "/" generally indicates that the contextual objects are an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example "at least one of A, B and C" includes A, B, C, AB, AC, BC or ABC. And, unless otherwise specified, ordinal numerals such as "first" and "second" mentioned in the embodiments of the present application are used to distinguish multiple objects, and are not used to limit the order, timing, priority or importance of multiple objects.

It should be noted that, in this application, words such as "exemplary" or "for example" are used as examples, illustrations or illustrations. Any embodiment or design described herein as "exemplary" or "for example" is not to be construed as preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "such as" is intended to present related concepts in a concrete manner.

Referring to FIG. 1 , it is a schematic structural diagram of a communication system provided by an embodiment of the present application. As shown in FIG. 1 , the system includes multiple network devices, such as network device 101 , network device 102 , network device 103 , network device 104 and network device 105 , and possibly other network devices. In the communication system shown in FIG. 1, a network device close to a terminal device may be called a customer edge (customer edge, CE) device, and the CE device may be a router, a switch or other forwarding devices.

Exemplarily, taking the network device 101 on the leftmost side and the network device 102 on the rightmost side in FIG. 1 connecting terminal device 1 and terminal device 2 respectively as an example, network device 101 and network device 102 serve as CE devices. Wherein, during the communication process between the terminal device 1 and the terminal device 2, forwarding through the network device 101 to the network device 105 is required respectively. For example, the message sent by the terminal device 1 to the network device 2 needs to be forwarded by the network device 101, the network device 103, the network device 105, the network device 104, and the network device 102 respectively; In other words, the terminal device can join the network through the CE device.

It should be noted that the connection between the terminal device and the CE device may be in a direct connection mode, or may be implemented in a transfer mode through other devices. For example, the other devices may include an access point (access point, AP), a base station, etc., which are not specifically limited here.

It should be understood that a terminal device, which may also be referred to as a user equipment (UE), a mobile station (MS), a mobile terminal (MT), or a terminal, is a device that provides voice and/or data connectivity to a user, or a chip disposed in the device, for example, a handheld device with a wireless connection function, a vehicle-mounted device, and the like. At present, examples of some terminal devices are: mobile phones, desktop computers, tablet computers, notebook computers, PDAs, mobile internet devices (mobile internet device, MID), wearable devices, virtual reality (virtual reality, VR) devices, augmented reality (augmented reality, AR) devices, wireless terminals in industrial control, wireless terminals in self driving, remote medical Wireless terminals in surgery, wireless terminals in smart grid, wireless terminals in transportation safety, wireless terminals in smart city, wireless terminals in smart home, and home gateway devices (5G-residential gateway, 5G-RG) that support 5G access, etc.

Optionally, in FIG. 1 , the network device 103 , the network device 104 and the network device 105 are routers (routers), switches (switches), virtual machines (capable of forwarding) and other devices.

It should be noted that, when network device 1 and network device 2 are used as CE devices, the connection between the CE device shown in FIG. 1 and the network device in the forwarding network (for example, CE device 101 and network device 103, or CE device 102 and network device 104) can be a wired connection/wireless connection, and the connection can also be transferred through other devices. For example, the other device may include a radio access network (radio access network, RAN) node (or device), which may also be called a base station. Currently, some examples of RAN equipment are: generation Node B (gNodeB), transmission reception point (TRP), evolved Node B (evolved Node B, eNB), radio network controller (radio network controller, RNC), node B (Node B, NB), base station controller (base station controller, BSC), base transceiver station in the 5G communication system. (base transceiver station, BTS), home base station (for example, home evolved Node B, or home Node B, HNB), base band unit (base band unit, BBU), or wireless fidelity (wireless fidelity, Wi-Fi) access point (access point, AP), etc.

Exemplarily, in the system shown in FIG. 1 , the network device connected to the user edge device is a provider edge (provider edge, PE) device. The PE device is used to transmit messages between the user edge device 101 and the user edge device 102 . For example, in FIG. 1 , both the network device 103 and the network device 104 are PE devices, the user edge device 101 is connected to the operator edge device 103 , and the user edge device 102 is connected to the operator edge device 104 . Other network devices include operator (provider, P) devices, such as the network device 105 . Wherein, the provider edge device 103 and the provider edge device 104 are connected through one or more provider (provider, P) devices 105 .

In the communication system shown in FIG. 1 , the network topology formed between different nodes (such as one or more network devices, one or more terminal devices, etc.) can be formed in various ways, and this application is mainly applied to a tree-type network topology. Among them, the hierarchical address is an addressing method used in the tree-type network topology scenario, which can reduce the number of device forwarding entries and improve service convergence performance.

It should be noted that, in this application, the hierarchical address is one of the characteristics of the New Internet Protocol (NewIP), and the hierarchical address can also be called a variable address, an IP address under the variable-length IP address system, a variable-length address, a flexible (flexible) address, a flexible IP address or other names, which are not limited here.

At present, in the tree-type network topology scenario, there are two types of devices. One type of device is a device with lower-level nodes. In actual network scenarios, this type of device is usually a network device; the other type of device does not have a lower-level node. In actual network scenarios, this type of device is usually a terminal device.

As an example, take the network topology scenario including layer 4 devices shown in FIG. 2 as an example. Wherein, the network topology scenario shown in FIG. 2 may be a part of the communication system shown in FIG. 1 . For example, network device 103 in FIG. 1 can be marked as network device A in FIG. 2 , network device 101 in FIG. 1 can be marked as network device B in FIG. 2 , and terminal device 1 connected to network device 101 in FIG. 1 can be marked as terminal device A in FIG. 2 . In addition, in the case that the network device 101 in FIG. 1 can also access other network devices, the other network devices can further access other terminal devices, wherein the other network devices can be denoted as network device C in FIG. 2 , and the terminal device that accesses the other network devices can be denoted as terminal device B in FIG. 2 . As shown in FIG. 2 , the first layer includes network device A, the second layer includes network device B, the third layer includes network device C and terminal A, and the fourth layer includes terminal B. Moreover, addresses of network devices (including network device A, network device B, and network device C, etc.) are generated by manual configuration.

In addition, in the attribute network topology scenario shown in Figure 2, except for network device A in the first layer of devices (since network device A does not have a parent node, network device A can also be called the root node), each node has only one directly connected parent node (or parent node). Moreover, the hierarchical address means that in addition to the root node, the node address of each node includes the address of the upper node; that is, the node address of each node can include two parts, one part is the address (or prefix address) of the node's parent node, and the other part is the identifier (identifier, ID) of the node. In other words, except for the root node, the node address composition of other nodes can be expressed as "prefix address+ID". In addition, the address of each node may be called the node's own address or the locator address. For the convenience of description, the address of the node will be recorded as the locator address as an example for illustration.

For example, for network device B, the locator address representing the network device B can be recorded as "1/2", wherein "1" in "1/2" is the address of the parent node (i.e. network device A), and "2" in "1/2" is the ID of network device B. As another example, for terminal A, it means that the locator address of the terminal device A can be recorded as "1/2/2", wherein "1/2" in "1/2/2" is the address of the parent node (i.e. network device B), and the last digit "2" in "1/2/2" is the ID of the terminal device A.

Furthermore, in the implementation process of the current hierarchical address, for the network device, its hierarchical address needs to be manually configured, which will be further described below with an example shown in FIG. 3 .

As shown in Figure 3, the network device A in Figure 2 can be the convergence switch (switch, SW) in Figure 3, and the included Gigabit Ethernet (Gigabit Ethernet, ge) interface is marked as ge0; The network device B in Figure 2 can be the access SW in Figure 3, and the included northward ge interface is marked as ge1, and the included southward ge interfaces are marked as ge2 and ge3; Network device C in Figure 2 can be an access point (access point, AP) in Figure 3. In the network topology scenario shown in Figure 3, the hierarchical addresses of all network devices are manually configured. In addition, as a terminal device (for example, terminal A and terminal B), the address of the terminal device can be dynamically assigned by an access network device (for example, access SW or AP).

It should be understood that the network topology scenarios shown in FIG. 2 and FIG. 3 are only an implementation example. In practical applications, taking FIG. 2 as an example, the network device A shown in FIG. 2 can also access other upper-level nodes, or the network device A shown in FIG. 2 can also access other lower-level nodes different from network device B, or the network device B shown in FIG.

In order to solve the above problems, the present application provides a communication method and a communication device, which are used to realize the automatic allocation of hierarchical addresses through the interaction between the upper and lower nodes in the tree-type network topology scene, so as to avoid the occurrence of network paralysis due to manual configuration errors and improve the stability of the network. The solutions provided by the present application will be described in detail below with reference to the accompanying drawings.

Please refer to FIG. 4 , which is a schematic diagram of a communication method 100 provided by an embodiment of the present application. The method includes the following steps.

Exemplarily, the communication method 100 shown in FIG. 4 may be applied to the aforementioned network topology scenarios shown in FIG. 2 and FIG. 3 . In this communication method 100, the first node can be a node that has both upper-level nodes and lower-level nodes in the network topology, such as network device B or network device C in FIG. 2 , and access SW or AP in FIG. C. Terminal A or terminal B, and access SW, AP, terminal A or terminal B as shown in FIG. 3 .

S101. The first node sends a first discovery packet.

In this embodiment, the first node sends a first discovery message in step S101, and correspondingly, the second node receives the first discovery message in step S101. Wherein, the first discovery message is used to request address allocation.

It should be noted that the discovery messages involved in the embodiments of the present application (such as the first discovery message in step S101, and the second discovery message, the third discovery message, the fourth discovery message, etc. below) are used to request address allocation, that is, the discovery message is a message sent when the sender of the discovery message does not have an address. For this reason, the sender may send the discovery message in a flooding manner, hoping that the discovery message can be received by multiple receivers and obtain responses to the discovery message (that is, provide a message).

As an implementation example, taking the application of the communication method 100 shown in FIG. 4 to the network topology shown in FIG. 2 as an example, the first node may be network device B in FIG. 2 , the second node may be network device A in FIG. 2 , and the third node may be network device C in FIG. 2 . At this time, in the network topology shown in FIG. 2, the first node as network device B can send the discovery message in a flooded manner to all connected nodes, that is, network device B sends the first discovery message to network device A, network device C and terminal A in step S101.

Exemplarily, in the above implementation example, in the network topology shown in FIG. 2, the first node as network device B may send the discovery message to the connected upper node in a selective flooding manner, that is, network device B sends the first discovery message to network device A in step S101, but does not send the first discovery message to network device C and terminal A.

S102. The second node sends the first provision message.

In this embodiment, the second node sends the first provision message in step S102, and correspondingly, the first node receives the first provision message in step S102. Wherein, the first providing message includes the first address allocated by the second node to the first node; the first address includes a first field and a second field, the value of the first field is the value of the address of the second node and the second node is the superior node of the first node, and the value of the second field is the identifier of the first node.

In a possible implementation manner, the method shown in FIG. 4 may be applied to a tree network, and the second node is a root node of the tree network or an intermediate node of the tree network. Specifically, as the upper-level node of the first node, the second node can be the root node in the network topology (that is, it only has a lower-level node and does not have a higher-level node), and the second node can also be an intermediate node in the network topology (that is, it has a lower-level node and a higher-level node), which is not limited here.

S103. The third node sends a second discovery packet.

In this embodiment, the third node sends the second discovery message in step S103, and correspondingly, the first node receives the second discovery message in step S103. Wherein, the second discovery message is used to request address allocation.

In a possible implementation manner, the third node is a leaf node or an intermediate node. Specifically, as a lower-level node of the first node, the third node can be a leaf node in the network topology (that is, it only has a higher-level node and does not have a lower-level node), and the third node can also be an intermediate node in the network topology (that is, it has a lower-level node and a higher-level node), which is not limited here.

S104. The first node sends the second offer message.

In this embodiment, the first node sends the second provision message in step S104, and correspondingly, the third node receives the second provision message in step S104. Wherein, the second providing message includes the second address assigned by the first node to the third node, the second address includes a third field and a fourth field, the value of the third field is the value of the first address, the value of the fourth field is the identifier of the third node and the third node is a subordinate node of the first node.

In a possible implementation manner, in the first address carried in the first provision message sent by the second node in step S102, the first field is located before the second field; and/or, in the second address carried in the second provision message sent by the first node in step S104, the third field is located before the fourth field.

Specifically, in the first address, the first field whose value is the address of the upper-level node (that is, the second node) may be located before the second field whose value is the identifier of the first node, so as to clarify based on the first address of the first node the address of the upper-level node of the first node and the network topology relationship of the network where the first node is located. Similarly, in the second address, the third field whose value is the address of the upper-level node (that is, the first node) may be located before the fourth field whose value is the identifier of the third node, so as to clarify the address of the upper-level node of the third node based on the second address of the third node and the network topology relationship of the network where the third node is located.

In a possible implementation manner, the first discovery message, the first offer message, the second discovery message and the second offer message are all dynamic host configuration protocol DHCP messages. Specifically, the first discovery message, the first offer message, the second discovery message and the second offer message are all DHCP messages, that is, the first discovery message and the second discovery message may be DHCP discover (DHCP discover) messages in DHCP, and the first offer message and the second offer message may be dynamic host configuration protocol (DHCP offer) messages in DHCP. This enables the realization method to multiplex the message processing mechanism of DHCP to realize the automatic allocation of hierarchical addresses.

Optionally, other discovery messages involved in the present application (such as the third discovery message mentioned later, the fourth discovery message, the fifth discovery message, etc.) can be DHCP discover messages, and other providing messages involved in the present application can be DHCP offer messages. Similarly, the request message involved in the present application (such as the first request message mentioned later, the second request message, etc.) can also be a Dynamic Host Configuration Protocol request (DHCP request) message in DHCP, and the confirmation message involved in this application (such as the first confirmation message mentioned in the following text, the second confirmation message, etc.) confirmation message, etc.) can also be the Dynamic Host Configuration Protocol Non-Acknowledgment (DHCP NAK) message in DHCP.

Based on the technical solution shown in Figure 4, the first node provided the first address from the first node in the steps S102 contains the first address. The value of the first field in the first address is the value of the address of the second node and the value of the second field in the first address is the logo of the first node; and the second node provides the second address of the second address in the third address of the third address in the step S104. The value of the address of the first node and the value of the fourth field in the second address is the identification of the third node. Wherein, the second node is a superior node of the first node and the third node is a subordinate node of the first node, that is, the first node can not only receive the hierarchical address assigned by the superior node, but also assign a hierarchical address to the subordinate node. In other words, in a tree-type network topology scenario including the second node, the first node, and the third node, the first node can serve as a terminal device to receive an automatically assigned hierarchical address from a superior node, and can also serve as a network device to automatically assign a hierarchical address to a subordinate node. Therefore, in the tree-type network topology scene, the automatic allocation of hierarchical addresses is realized through the interaction between the upper and lower nodes, so as to avoid the occurrence of network paralysis due to manual configuration errors and improve the stability of the network.

It should be noted that, in this application, a hierarchical address may also be called a variable address, a variable-length address, a flexible (flexible) address, a flexible IP address or other names, which are not limited here.

As an implementation example, taking the application of the communication method 100 shown in FIG. 4 to the network topology shown in FIG. 2 as an example, the first node may be network device B in FIG. 2 , the second node may be network device A in FIG. 2 , and the third node may be network device C in FIG. 2 . Now, in the network topology shown in FIG. 2, after the first node as network device B sends the first discovery message to network device A in step S101, the network device B receives in step S102 from the network device A. The first provision message contains a first address, the value of the first field in the first address is the value of the address of the network device A and the value of the second field in the first address is the identifier of the network device B; and, the network device B sends the second provision to the network device C in step S104 The message includes a second address, the value of the third field in the second address is the value of the address of the first node, and the value of the fourth field in the second address is the identifier of the network device C. Wherein, the network device A is the upper-level node of the network device B and the network device C is the lower-level node of the network device B, that is, the network device B can receive the hierarchical address assigned by the network device A, and can also assign a hierarchical address to the network device C. In other words, in the tree-type network topology scenario shown in FIG. 2 , the network device B can not only receive the automatically assigned hierarchical address of the network device A as a terminal device, but also can automatically assign a hierarchical address to the network device C as a network device. Therefore, in the tree-type network topology scene, the automatic allocation of hierarchical addresses is realized through the interaction between the upper and lower nodes, so as to avoid the occurrence of network paralysis due to manual configuration errors and improve the stability of the network.

Please refer to FIG. 5 , which is a schematic diagram of a communication method 200 provided by an embodiment of the present application. The method includes the following steps.

S201. The first node sends a first discovery packet.

In this embodiment, the first node sends a first discovery message in step S201, and correspondingly, the second node receives the first discovery message in step S201. Wherein, the first discovery message is used to request address allocation.

S202. The second node sends the first provision message.

In this embodiment, the second node sends the first provision message in step S202, and correspondingly, the first node receives the first provision message in step S202. Wherein, the first providing message includes the first address allocated by the second node to the first node; the first address includes a first field and a second field, the value of the first field is the value of the address of the second node and the second node is the superior node of the first node, and the value of the second field is the identifier of the first node.

It should be noted that, the implementation process of step S201 and step S202 can refer to the implementation process of step S101 and step S102, and achieve corresponding technical effects, which are not limited here.

In a possible implementation, in the implementation process described in FIG. 5, before step S202, the method further includes step S20A and step S20B:

S20A. The third node sends a discovery message.

S20B. The first node sends a non-confirmation message.

Specifically, before the first node receives the first provision message in step S202, the third node may also send a fourth discovery message in step S20A, where the fourth discovery message is used to request address allocation; the first node receives the fourth discovery message in S20A, and the first node sends a first non-confirmation message to the third node in step S20B, where the first non-confirmation message is used to indicate refusal to allocate an address. In this implementation process, before the first node receives the first providing message from the second node, that is, before the first node receives the address assigned by the upper-level node, the first node does not have the ability to assign addresses to lower-level nodes (or the current hierarchical address of the first node is invalid). For this reason, after the first node receives the fourth discovery message for requesting address allocation, the first node sends a first non-confirmation message for indicating refusal of address allocation, so that the receiver of the first non-confirmation message knows that the first node currently does not have the ability to allocate addresses.

In a possible implementation manner, before the first node receives the first provision message in step S202, the first node may also receive a second non-confirmation message from the third node, where the second non-confirmation message is used to indicate refusal to allocate an address. Specifically, before the first node receives the first provision message, that is, before the first node receives the address assigned by the superior node, the first node does not know its own address, and correspondingly, the subordinate nodes (such as the third node) of the first node do not know its own address. Wherein, the number of the first discovery message sent by the first node may be multiple. After a certain first discovery message is received by the third node, because the third node does not have the ability to allocate addresses (or the current hierarchical address of the third node is invalid), the third node will send to the first node a second non-confirmation message for indicating refusal to allocate addresses, so that the first node determines based on the second non-confirmation message that the third node currently does not have the ability to allocate addresses.

S203. The first node sends a first request message.

In this embodiment, the first node sends the first request message in step S203, and correspondingly, the second node receives the first request message in step S203. Wherein, the first request message is used to request to use the first address.

S204. The second node sends a first confirmation message.

In this embodiment, the second node sends the first confirmation message in step S204, and correspondingly, the first node receives the first confirmation message in step S204. Wherein, the first confirmation message is used to indicate that the first address is allowed to be used.

Specifically, after receiving the first message in the first node in the step S203, the first node can also send the first request message to the second node in the step S203. The first request message is used to indicate the request to use the first address; the second node receives the first request message in the step S203. The second node sends the first confirmation message to the first node in the step S204. Allow the first address; the first node receives the first confirmation message in step S204.

Specifically, after the first node receives the first provision message from the second node, the first node sends to the second node a first request message indicating that the first address is requested to be used, and receives a first confirmation message from the second node indicating that the first address is allowed to be used. In the case that the first node can clearly allocate an address based on the first address based on the first confirmation message, the first node sends a second offer message including the second address allocated based on the first address to the third node.

As an implementation example, taking the application of the communication method 200 shown in FIG. 5 to the network topology shown in FIG. 2 as an example, the first node may be network device B in FIG. 2 , the second node may be network device A in FIG. 2 , and the third node may be network device C in FIG. 2 . Since the lower-level nodes of network device A include network device B as the first node, it may also include other nodes (such as terminal C), so that network device A may also assign the first address to terminal C. Therefore, network device B as the first node can clarify that network device A allows network device B to use the first address through the interactive process of step S203 and step S204, that is, it is clear that other nodes other than network device B (such as terminal C) are not allowed to use the first address, so as to avoid address allocation conflicts.

In a possible implementation, in the implementation process described in FIG. 5, before step S204, the method further includes step S20C and step S20D:

S20C. The third node sends a discovery message.

S20D. The first node sends a non-confirmation message.

Specifically, before the first node receives the first confirmation message in step S204, the third node may also send a fifth discovery message in step S20C, where the fifth discovery message is used to request address allocation; the first node receives the fifth discovery message in step S20C, and the first node sends a third non-confirmation message to the third node in step S20D, where the third non-confirmation message is used to indicate refusal to allocate an address; the third node receives the third non-confirmation message. In this implementation process, before the first node receives the first confirmation message from the second node, since the first node does not know whether the second node allows the first node to use the first address, that is, the first node does not know whether the first node can assign addresses to subordinate nodes based on the first address. For this reason, after the first node receives the fifth discovery message for requesting address allocation, the first node sends a third non-confirmation message for indicating refusal of address allocation, so that the recipient of the third non-confirmation message knows that the first node currently does not have the ability to allocate addresses.

In addition, the above-mentioned non-confirmation message used to indicate refusal to allocate an address (including the non-confirmation message in step S20B, the non-confirmation message in step S20D, and the third non-confirmation message, fourth non-confirmation message, and fifth non-confirmation message that may appear later) are messages based on the feedback of the discovery message. Wherein, the discovery message sent by the sender of the discovery message may be sent in a manner of flooding (full flooding or selective flooding). For this reason, the receiving end of the discovery message may receive the discovery message in various situations. Wherein, in the case where the receiving end of the discovery message has not received the address assigned by the upper-level node (that is, the receiving end does not have the address allocation capability, or the current hierarchical address of the receiving end is invalid), after receiving the discovery message, the message fed back by the receiving end is a non-confirmation message for indicating that the address is rejected; After the discovery message, the message fed back by the receiving end is an offer message for address allocation. Therefore, for any upper-level node, if the current hierarchical address of the upper-level node is invalid, it will feed back a non-confirmation message based on the received discovery message. Therefore, based on the non-confirmation message and the feedback of the provided message, in the tree network, the automatic allocation of hierarchical addresses is realized by sequentially allocating addresses from upper-level nodes to lower-level nodes, so as to avoid network paralysis caused by manual configuration errors and improve network stability.

S205. The third node sends a second discovery packet.

In this embodiment, the third node sends the second discovery message in step S205, and correspondingly, the first node receives the second discovery message in step S205. Wherein, the second discovery message is used to request address allocation.

S206. The first node sends the second offer message.

In this embodiment, the first node sends the second provision message in step S206, and correspondingly, the third node receives the second provision message in step S206. Wherein, the second providing message includes the second address assigned by the first node to the third node, the second address includes a third field and a fourth field, the value of the third field is the value of the first address, the value of the fourth field is the identifier of the third node and the third node is a subordinate node of the first node.

It should be noted that, the implementation process of step S205 and step S206 can refer to the implementation process of step S103 and step S104, and achieve corresponding technical effects, which are not limited here.

S207. The third node sends a second request message.

In this embodiment, the third node sends the second request message in step S207, and correspondingly, the first node receives the second request message in step S207. Wherein, the second request message is used to request to use the second address.

S208. The first node sends a second confirmation message.

In this embodiment, the first node sends the second confirmation message in step S208, and correspondingly, the third node receives the second confirmation message in step S208. Wherein, the second confirmation message is used to indicate that the second address is allowed to be used.

Based on the above technical solution, after the first node sends the second provision message in step S206, the third node may also send a second request message in step S207, the second request message is used to indicate the request to use the second address; the first node receives the second request message in step S207, the first node sends a second confirmation message to the third node in step S208, the second confirmation message is used to indicate permission to use the second address; the third node receives the second confirmation message in step S208, so that the third node Based on the second confirmation message, the node can determine that the second address is an address allowed to be used.

As an implementation example, taking the application of the communication method 200 shown in FIG. 5 to the network topology shown in FIG. 2 as an example, the first node may be network device B in FIG. 2 , the second node may be network device A in FIG. 2 , and the third node may be network device C in FIG. 2 . Since the subordinate nodes of the network device B include not only the network device C as the third node, but also the terminal A, the network device B may also assign the second address to the terminal A. For this reason, the network device C as the third node can make it clear that the network device B allows the network device C to use the second address through the interactive process of steps S207 and S208, that is, it is clear that other nodes (such as terminal A) other than the network device C are not allowed to use the second address, so as to avoid address allocation conflicts.

It should be understood that the third node may be an intermediate node in a tree network topology scenario, that is, the third node may also have subordinate nodes. Similar to the implementation process of the aforementioned steps S20A to S20D, before step S206 or step S208, the third node may also receive a "discovery message" sent from a subordinate node of the third node. Since the third node does not yet have the ability to allocate addresses (or the current hierarchical address of the third node is invalid), the third node may reply with a "non-confirmation message" to indicate that the third node currently does not have the ability to allocate addresses. In addition, after step S206 or step S208, that is, when the third node obtains the second address or the third node determines that the first node allows the third node to use the second address, if the third node receives the "send message" from the subordinate node again, the third node can further assign an address to the subordinate node of the third node based on the second address. Similarly, the address assigned by the third node may include two fields, one field is the address of the third node, and the other field is the ID of the subordinate node of the third node.

The implementation process of the embodiment described in FIG. 4 and FIG. 5 will be described exemplarily below in conjunction with more drawings.

It should be understood that, in the following examples, the implementation of DHCP-related messages between different nodes is taken as an example for illustration. In practical applications, other messages, such as BOOTP, a private address allocation protocol, or other protocols may also be used.

The network topology scenarios of different nodes shown in FIG. 3 above can be applied to the embodiments described in FIG. 4 and FIG. 5 , and the implementation process can be shown in FIG. 6 a .

In Fig. 6 a, network device A can be a convergence switch (switch, SW), and the included Gigabit Ethernet (Gigabit Ethernet, ge) interface is marked as ge0, and network device A can be used as the second node in the embodiment described in Fig. 4 and Fig. 5; The first node in; the network device C can be an access point (access point, AP), and any one of the network device C and the terminal A can be used as the third node in the embodiment described in FIG. 4 and FIG. 5 .

As shown in Figure 6a, except network device A (being the root node), each node is in the initial state of locator invalid (invalid), and each node can send a dhcp discover message for requesting an address to other devices through the communication interface, that is, the sending and receiving process of the discovery message (comprising the first discovery message, the second discovery message, etc.) in the embodiment described in Figures 4 and 5. After the dhcp discover message is sent, the implementation process of each node is shown in Figure 6b.

As shown in Figure 6b, since the network device A has pre-configured the address (marked as "locator 1"), the network device A has the ability to allocate addresses, so that the network device A receives the dhcp discover message of the network device B, and sends to the network device B a dhcp offer message carrying the address (marked as "1/2") of the network device B (distributed by the network device A), that is, the sending and receiving process of discovering messages (including the first providing message, etc.) in the embodiments described in Fig. 4 and Fig. 5 .

For network device B, after network device B sends a dhcp discover message in a flooding manner in the process shown in Figure 6a, before network device B receives the address assigned by network device A in Figure 6b, after network device B receives a dhcp discover message from a lower-level node (including network device C and terminal A), then network device B will send a dhcp nak message to the lower-level node (including network device C and terminal A) to indicate that the lower-level node is currently the network device B It does not have the ability to assign addresses (or the current hierarchical address of network device B is invalid). Similarly, since the network device C has not received the address assigned by the network device, the network device C will send a dhcp nak message to the lower-level nodes (including the terminal B) to indicate that the lower-level node currently does not have the ability to assign addresses to the network device C (or the current hierarchical address of the network device C is invalid). That is, the sending and receiving process of non-confirmation messages (including the first non-confirmation message, the second non-confirmation message, etc.) in the embodiment described in FIG. 4 and FIG. 5 .

It should be noted that network device A, as the root node, can obtain the pre-configured address in a variety of ways, such as receiving instructions from the server to obtain the pre-configured address in the way of an external server, obtaining the pre-configured address by manual configuration, or other implementation methods, which are not limited here.

In a possible implementation process, the interaction process of network device A (denoted as device A in FIG. 6c and FIG. 6e ), network device B (denoted as device B in FIG. 6c and FIG. 6e ), network device C (denoted as device C in FIG. 6c and FIG. 6e), and terminal A (denoted as terminal a in FIG. 6c and FIG.

In the aforementioned FIG. 6a and FIG. 6b , the interaction process between network device A and network device B may be as shown in FIG. 6c . Network device B first sends to network device A a dhcp discover message for requesting an address. After network device A receives the dhcp request message, it sends a dhcp offer message carrying the address (referred to as "1/2") of network device B (assigned) to network device B; B sends a dhcp ack message allowing the use of this address.

Further optionally, during the interaction process between network device A and network device B, network device C may also participate in it, as shown in FIG. 6c. Network device C can send a dhcp discover message to the upper node (ie, network device B) multiple times before receiving the dhcp offer message. Among them, before the network device B has the ability to assign addresses (that is, the network device B receives the dhcp ack message or the dhcp offer message), the network device B can send to the network device C a dhcp nak message for indicating that the address is rejected; and after the network device B has the ability to allocate addresses (that is, the network device B receives the dhcp ack message or the dhcp offer message), the network device B can send to the network device C. /2") dhcp offer message.

Further optionally, in the scenarios shown in FIG. 6a and FIG. 6b , message exchange in the communication process between various nodes may be implemented by referring to the manner shown in FIG. 6e . In Fig. 6e, the process in which each device determines that the local hierarchical address is valid and assigns an address to a lower-level node is marked as an "OP" process, and the process in which each device determines that a local hierarchical address is invalid and refuses to assign an address to a lower-level node is marked as a "loop" process.

It should be noted that, for any node (such as device B, device C and terminal a) with a superior node in Figure 6e, the node needs to execute the "OP" process in Figure 6e to obtain the address assigned by the superior node, and before the node executes the "OP" process in Figure 6e, since the node has not obtained a local address, the node can execute the "loop" process with the superior node before any time or the node can perform the "loop" process with the subordinate node before any time. Taking the device C in Figure 6e as an example, before the device C performs the "OP" process with the device B, the device B does not have the ability to assign addresses before the "OP" process between the device A and the device B. Therefore, the device B will execute the "loop" process between the device B and the device C after receiving the dhcp discover message from the device C; and before the device C performs the "OP" process with the device B, the device C does not have the ability to assign addresses. Therefore, the device C receives the terminal After the dhcp discover message of a, the "loop" process between device C and terminal a will be executed.

In addition, for any node (such as device B, device C, and terminal a) with a superior node in Figure 6e, the node needs to execute the "OP" process in Figure 6e to obtain the address assigned by the superior node, and after the node executes the "OP" process in Figure 6e, since the node has obtained a local address, the node does not need to execute the sending of the dhcp discover message, that is, the node (before it is determined to be disconnected from the superior node) will not perform "loop" with the superior node or the subordinate node process or "OP" process.

Exemplarily, the "OP" process between network device A and network device B can refer to the interaction process between network device A and network device B in Figure 6c, and the "loop" process between network device B and network device C can refer to the interaction process between network device B and network device C in Figure 6c.

It should be understood that, in the above example, since network device B and network device C have respective upper-level nodes and lower-level nodes, that is, both network device B and network device C can serve as DHCP server (Server) and DHCP terminal (Client) roles in the network, so that both network device B and network device C can be used as the first node to execute the aforementioned embodiments shown in FIG. 4 and FIG. 5 . Particularly, in this example, since the terminal device A in FIG. 6e is a leaf node and does not have the capability of being a DHCP server (Server), after receiving the dhcp discover message, the terminal device A ignores the dhcp discover message and does not process it.

It should be noted that, when the network device, network device A, and network device C are respectively used as the second node, the first node, and the third node, the implementation process shown in Figure 6c to Figure 6e can also refer to the implementation process of steps S201 to S209 in Figure 5 above, and achieve corresponding technical effects, which will not be repeated here.

In a possible implementation manner, after the hierarchical address allocation of each node in the scenarios shown in FIG. 6a and FIG. 6b, the implementation process of adding nodes in the network topology can also be implemented based on the embodiments shown in FIG. 4 and FIG.

As shown in FIGS. 7a to 7c, network device D intends to access the network through network device B, and network device D may act as the first node in the embodiments shown in FIGS. 4 and 5 to perform a response process.

In Fig. 7a, network device D sends a dhcp discover message for requesting an address to network device B (it should be understood that because the local hierarchical address of network device B is valid, network device B will not send a dhcp discover message to network device D);

In FIG. 7b, since the local hierarchical address of network device B is valid, network device B performs an address assignment process, that is, network device B sends to network device D a dhcp offer message carrying the address of network device D "marked as 1/2/3";

In Fig. 7c, after the network device D further receives the dhcp ack message (the process of sending the dhcp request message by the network device D is omitted in the figure), the address of the network device D becomes effective, and possesses the ability to assign addresses to the subordinate nodes of the network device D.

Based on Figures 6c to 6e, and the interaction process of the messages shown in Figures 7a to 7c, it can be seen that before network device B receives the dhcp ack message (or receives the dhcp offer message), the network device is in the locater invalid state, and after network device B receives the dhcp ack message (or receives the dhcp offer message), it is clear that the address of the network device B is "1/2", and it is determined that the network device B has the ability to assign addresses to the lower-level nodes of the network device B In addition, the network device B can also assign addresses to the newly added network device D in the network topology, and enable the network device D to have the ability to further assign addresses to the lower-level nodes of the network device D based on the assigned addresses. Therefore, in the tree-type network topology scene, the automatic allocation of hierarchical addresses is realized through the interaction between the upper and lower nodes, so as to avoid the occurrence of network paralysis due to manual configuration errors and improve the stability of the network.

During the long-term operation of the network, it is inevitable that there will be a link failure between two nodes or a node failure, or a node needs to be removed from the current network, or a node in the network needs to be sleep/wake up for energy saving purposes, which may cause other nodes in the network to perceive the disconnection of the node. The communication method provided by the present application can also support the process of dynamic address allocation in a scenario where a certain node is disconnected, which will be described in conjunction with more embodiments below.

Please refer to FIG. 8 , which is a schematic diagram of a communication method 300 provided by an embodiment of the present application, and the method includes the following steps.

S301. The first node sends a first discovery packet.

In this embodiment, the first node sends a first discovery message in step S301, and correspondingly, the second node receives the first discovery message in step S301. Wherein, the first discovery message is used to request address allocation.

S302. The second node sends the first provision message.

In this embodiment, the second node sends the first provision message in step S302, and correspondingly, the first node receives the first provision message in step S302. Wherein, the first providing message includes the first address allocated by the second node to the first node; the first address includes a first field and a second field, the value of the first field is the value of the address of the second node and the second node is the superior node of the first node, and the value of the second field is the identifier of the first node.

S303. The first node sends a first request packet.

In this embodiment, the first node sends the first request message in step S303, and correspondingly, the second node receives the first request message in step S303. Wherein, the first request message is used to request to use the first address.

S304. The second node sends a first confirmation message.

In this embodiment, the second node sends the first confirmation message in step S304, and correspondingly, the first node receives the first confirmation message in step S304. Wherein, the first confirmation message is used to indicate that the first address is allowed to be used.

It should be noted that the implementation process of steps S301 to S304 can refer to the implementation process of steps S201 to S204, and achieve corresponding technical effects, which are not limited here.

S305. The first node determines to disconnect from the second node.

In a possible implementation manner, after the first node sends the second offer message to the third node in step S302 (or after sending the second confirmation message to the third node in step S304), the method further includes: after the first node determines to disconnect from the second node in step S305, the first node sends a first change message to the third node to instruct the third node to clear the second address; the third node receives the first change message and clears the second address.

Specifically, when the first node determines to be disconnected from the second node, the first node determines that the first address allocated by the second node to the first node is invalid and the second address allocated by the first node based on the first address is invalid. To this end, the first node sends a first change message to the third node to instruct the third node to clear the second address, so that the third node knows that the second address is invalid and clears the second address. Therefore, when the network topology changes (for example, the first node is disconnected from the second node), the dynamic update of the hierarchical addresses is realized through negotiation among different nodes.

Optionally, after the first node determines to disconnect from the second node in step S205, the first node determines that the first address allocated by the second node to the first node will become invalid. For this reason, the first node may clear the first address locally, and then obtain a new address from the upper node through a discovery message.

Further optionally, in the case where the third node also includes subordinate nodes, after the third node receives the first change message, the third node may also send the first change message to the subordinate nodes of the third node to instruct the subordinate nodes of the third node to clear the address allocated by the third node, so that the subordinate nodes of the third node clearly invalidate the allocated address and clear the address. Therefore, when the network topology changes (for example, the first node is disconnected from the second node), the dynamic update of the hierarchical addresses is realized in the multi-layer network topology through negotiation among different nodes.

In a possible implementation, in step S305, the first node determining to disconnect from the second node includes at least one of the following: the first node determines that the port status with the second node is down; or, the first node determines that the lease renewal of the first address has timed out; or, the first node receives a second change message from the second node to instruct the first node to clear the first address. Based on the above technical solution, for the first node, the first node can confirm that the first node is disconnected from the second node through the above-mentioned various methods, and further clarify that the first address allocated by the second node to the first node is invalid.

It should be noted that, when the protocol applied between the different nodes shown in Figure 8 is DHCP, the change message (including the first change message, the second change message, etc.) can be an extended message of DHCP, for example, it is recorded as a dhcp change (change) message.

S306. The first node sends a third discovery packet.

In this embodiment, the first node sends the third discovery message in step S306, and correspondingly, the fourth node receives the third discovery message in step S306. Wherein, the third discovery message is used to request address allocation.

S307. The fourth node sends a third provision message.

In this embodiment, the fourth node sends the second provision message in step S307, and correspondingly, the first node receives the third provision message in step S307. Wherein, the third providing message includes a third address assigned by the fourth node to the first node; wherein, the third address includes a fifth field and a sixth field, the value of the fifth field is the value of the address of the fourth node, and the value of the sixth field is the identifier of the first node.

Specifically, the communication system where the first node is located also includes a fourth node and the fourth node is the upper node of the first node; after the first node determines to disconnect from the second node in step S305, the first node may also send a third discovery message in step S306, and the third discovery message is used to request an address allocation; A third address assigned by the first node; wherein the third address includes a fifth field and a sixth field, the value of the fifth field is the value of the address of the fourth node, and the value of the sixth field is the identifier of the first node; the first node receives the third providing message. Wherein, when the first node determines to be disconnected from the second node, the first node determines that the first address allocated by the second node to the first node is invalid. To this end, the first node may send a third discovery message for requesting address allocation to the other superior node (for example, the fourth node), and obtain the third address allocated to the first node from the fourth node. Therefore, when the network topology changes (for example, the first node is disconnected from the second node), the dynamic update of the hierarchical addresses is realized through negotiation among different nodes.

In a possible implementation manner, the method further includes: the third node receiving the third discovery message; the third node sending a fourth non-confirmation message to the first node, where the fourth non-confirmation message is used to indicate refusal to allocate an address. Specifically, before the first node receives the third providing message from the fourth node in step S307, that is, before the first node receives the address assigned by the upper node, the first node does not have the ability to assign addresses to lower nodes. For this reason, after the first node receives the fourth discovery message for requesting address allocation, the first node sends a fourth non-confirmation message for indicating refusal of address allocation, so that the receiver of the fourth non-confirmation message knows that the first node currently does not have the ability to allocate addresses.

S308. The first node sends a third request message.

In this embodiment, the first node sends the third request message in step S308, and correspondingly, the fourth node receives the third request message in step S308. Wherein, the third request message is used to request to use the third address.

S309. The fourth node sends a third confirmation message.

In this embodiment, the fourth node sends the third confirmation message in step S309, and correspondingly, the first node receives the third confirmation message in step S309. Wherein, the third confirmation message is used to indicate that the third address is allowed to be used.

It should be noted that step S308 and step S309 are optional steps, and the first node may not execute them.

The implementation process of the embodiment described in FIG. 8 will be described exemplarily below in conjunction with more drawings.

The above-mentioned network topology scenarios of different nodes shown in FIG. 7a to FIG. 7c can apply the embodiment described in FIG. 8, and the implementation process can be as shown in FIG. 9a to FIG. 9d. As shown in FIG. 9a to FIG.

In FIG. 9a, because network device B recycles the communication port with network device D (or network device B fails, or the link between network device and network device D fails, etc.), network device D detects that the upper node (i.e. network device B) is unreachable. In this case, the network device D will clear the address assigned by the network device B to the network device D, and if there are other lower-level nodes in the network device D, the network device D will also send a dhcp change message to the lower-level node (if it exists), so that the lower-level node will clear the local hierarchical address based on the dhcp change message and further send the dhcp change message to the next-level node (if it exists), until the leaf node in the network topology.

In FIG. 9b, network device D sends a dhcp discover message for requesting an address to an upper node (for example, network device F in FIG. 9b).

In FIG. 9c, before the network device D receives the dhcp offer message, a dhcp discover message and a dhcp nak message will be exchanged between the lower-level node of the network device D (if it exists) and the network device D.

In FIG. 9d, network device F and network device D exchange dhcp ack messages to realize the process of allocating addresses for network device D, wherein the address allocated for network device D can be recorded as "2/1/1". Similarly, network device D will also continue to exchange dhcp discover messages and dhcp nak messages with lower-level nodes (if they exist) during this process.

After Figure 9d, after the network device D obtains the address based on the dhcp offer message (or dhcp ack message) issued by the network device F, the network device D can further assign addresses to the lower-level nodes of the network device D.

It should be noted that, for the interaction process between network device D and network device F in FIG. 9b above, you can also refer to the description of the interaction process between network device D and network device B in the embodiments shown in FIGS.

Based on the above technical solution, it can be seen that in a tree-shaped network topology scenario, after a node leaves the original upper-level node, other devices attached to the node also need to update the local hierarchical address; moreover, the node can also connect to the upper-level node again, obtain an address from the upper-level node and further assign an address to the lower-level node based on the obtained address. Therefore, when the network topology changes (for example, the first node is disconnected from the second node), the dynamic update of the hierarchical addresses is realized through negotiation among different nodes.

The above describes the embodiment of the present application from the perspective of the method, and the following describes the communication device provided by the embodiment of the present application from the perspective of the device.

Please refer to FIG. 10 , the embodiment of the present application provides a communication device, the communication device 1000 can realize the function of the communication device (including the first node, the second node, the third node, the fourth node or other nodes) in the above method embodiment, so it can also realize the beneficial effects of the above method embodiment.

As shown in FIG. 10 , the communication device 1000 includes a receiving unit 1001 and a sending unit 1002 .

Optionally, the communication device 1000 further includes a processing unit 1003 .

In the case where the communication device 1000 is used to implement the function of the first node in the foregoing embodiments, the communication device 1000 includes the following implementation process.

The sending unit 1002 is used to send a first discovery message, and the first discovery message is used to request an address allocation; the receiving unit 1001 is used to receive a first provision message from a second node, and the first provision message includes a first address allocated by the second node to the first node; wherein, the first address includes a first field and a second field, the value of the first field is the value of the address of the second node and the second node is a superior node of the first node, and the value of the second field is an identifier of the first node; The second discovery message of the third node, the second discovery message is used to request address allocation; the sending unit 1002 is also used to send a second provision message to the third node, the second provision message includes the second address allocated by the first node to the third node, the second address includes a third field and a fourth field, the value of the third field is the value of the first address, the value of the fourth field is the identifier of the third node and the third node is a subordinate node of the first node.

In a possible implementation manner, the apparatus further includes a processing unit 1003; the sending unit 1002 is further configured to, after the processing unit 1003 determines to disconnect from the second node, send a first change message to the third node to instruct the third node to clear the second address.

In a possible implementation, after the processing unit 1003 determines to disconnect from the second node, the sending unit 1002 is further configured to send a third discovery message, where the third discovery message is used to request an address allocation; the receiving unit 1001 is also configured to receive a third offer message from the fourth node, the third offer message includes a third address allocated by the fourth node to the first node; wherein, the third address includes a fifth field and a sixth field, the value of the fifth field is the value of the address of the fourth node and the fourth node is the address of the first node For a superior node, the value of the sixth field is the identifier of the first node.

In a possible implementation manner, after the processing unit 1003 determines to disconnect from the second node, the processing unit 1003 is further configured to clear the first address.

In a possible implementation manner, the processing unit 1003 determining to disconnect from the second node includes at least one of the following:

The processing unit 1003 determines that the state of the port with the second node is down; or,

The processing unit 1003 determines that the lease renewal of the first address is timed out; or,

The processing unit 1003 determines that the receiving unit 1001 receives the second change message from the second node, so as to instruct the first node to delete the first address.

In a possible implementation manner, the receiving unit 1001 is further configured to receive a fourth discovery message, where the fourth discovery message is used to request address allocation; the sending unit 1002 is also configured to send a first non-confirmation message, where the first non-confirmation message is used to indicate refusal to allocate an address.

In a possible implementation manner, the receiving unit 1001 is further configured to receive a second non-confirmation message from the third node, where the second non-confirmation message is used to indicate refusal to allocate an address.

In a possible implementation manner, the sending unit 1002 is further configured to send a first request message to the second node, where the first request message is used to indicate that the first address is requested to be used; the receiving unit 1001 is also used to receive a first confirmation message from the second node, where the first confirmation message is used to indicate that the first address is allowed to be used.

In a possible implementation manner, the receiving unit 1001 is further configured to receive a fifth discovery message, where the fifth discovery message is used to request address allocation; the sending unit 1002 is also configured to send a third non-confirmation message, where the third non-confirmation message is used to indicate refusal to allocate an address.

In a possible implementation manner, the receiving unit 1001 is further configured to receive a second request message from the third node, where the second request message is used to indicate that the second address is requested to be used; the sending unit 1002 is also used to send a second confirmation message to the third node, where the second confirmation message is used to indicate that the second address is allowed to be used.

In a possible implementation manner, both the first address and the second address are NewIP addresses.

In a possible implementation manner, the first discovery message, the first offer message, the second discovery message and the second offer message are all dynamic host configuration protocol DHCP messages.

In a possible implementation manner, in the first address, the first field is located before the second field; and/or, in the second address, the third field is located before the fourth field.

In a possible implementation manner, the apparatus is applied to a tree network, and the second node is a root node of the tree network or an intermediate node of the tree network.

In a possible implementation manner, the apparatus is applied to a tree network, and the third node is a leaf node of the tree network or an intermediate node of the tree network.

It should be noted that, details such as the information execution process of each unit of the communication device 1000 may refer to the description in the foregoing method embodiment of the present application, and details are not repeated here.

An embodiment of the present application also provides a communication system, and the communication method provided in any of the foregoing embodiments may be applied to the communication system shown in FIG. 11 . As shown in FIG. 11 , the system includes a plurality of communication devices, and the plurality of communication devices respectively correspond to different nodes (including a first node, a second node, a third node, etc., and the second node is a superior node of the first node and the third node is a subordinate node of the first node).

In the communication system shown in Figure 11, in the network topology before the arrow points to it, the second node is located at the nth layer (n is a natural number) in the network topology, the first node is located at the n+1th layer in the network topology, and the third node is located at the n+2th layer in the network topology. In the network topology after the arrow points, the second node and the fourth node are located at the nth (n is a natural number) layer in the network topology, the first node is located at the n+1th layer in the network topology, and the third node is located at the n+2th layer in the network topology. The scenario indicated by the arrows in FIG. 11 is that, after the first node determines to be disconnected from the second node, the first node is connected to the fourth node.

Optionally, there are other nodes in layer n+1, layer n+2, and layer n+3 in the network topology, or there are no other nodes, which is not limited here.

Optionally, both the fourth node and the second node may be a root node (n takes a value of 0) or an intermediate node (n takes a value greater than 0).

Further optionally, when n is greater than 0, the fourth node and the second node may be connected to the same upper-level node, or to different upper-level nodes, which is not limited here.

In the communication system, for any communication device of the plurality of communication devices, the any communication device can be implemented in the manner shown in FIG. 10 , that is, any communication device includes a receiving unit 1001 and a sending unit 1002 .

Optionally, any communication device further includes a processing unit 1003 .

In the communication system, the sending unit of the first node is used to send a first discovery message, and the first discovery message is used to request an address allocation; the receiving unit of the second node is used to receive the first discovery message, and the sending unit of the second node is used to send a first offer message to the first node, and the first offer message includes a first address allocated by the second node to the first node; wherein, the first address includes a first field and a second field, and the value of the first field is the value of the address of the second node and the second node is a superior node of the first node, and the value of the second field is The identification of the first node; the receiving unit of the first node is used to receive the first provision message; the sending unit of the third node is used to send a second discovery message, and the second discovery message is used to request an address assignment; the receiving unit of the first node is also used to receive the second discovery message, and the sending unit of the first node is also used to send a second provision message to the third node, the second provision message includes the second address allocated by the first node to the third node, the second address includes a third field and a fourth field, the value of the third field is the value of the first address, and the value of the fourth field The value is an identifier of the third node and the third node is a subordinate node of the first node; the receiving unit of the third node is configured to receive the second providing message.

In a possible implementation manner, the first node further includes a processing unit; after the processing unit of the first node determines to disconnect from the second node, the sending unit of the first node is further configured to send a first change message to the third node to instruct the third node to clear the second address; the receiving unit of the third node is also configured to receive the first change message and clear the second address.

In a possible implementation manner, the sending unit of the third node is further configured to send the first change message to a subordinate node of the third node.

In a possible implementation manner, the system further includes a fourth node, and the fourth node is an upper-level node of the first node; after the processing unit of the first node determines to disconnect from the second node, the sending unit of the first node is further configured to send a third discovery message, and the third discovery message is used to request an address assignment; the receiving unit of the fourth node is used to receive the third discovery message, and the sending unit of the fourth node is used to send a third providing message to the first node, and the third providing message includes a third address allocated by the fourth node to the first node; The fifth field and the sixth field, the value of the fifth field is the value of the address of the fourth node, the value of the sixth field is the identifier of the first node; the receiving unit of the first node is also used to receive the third providing message.

In a possible implementation manner, the receiving unit of the third node is further configured to receive the third discovery message; the sending unit of the third node is further configured to send a fourth non-confirmation message to the first node, where the fourth non-confirmation message is used to indicate refusal to allocate an address.

In a possible implementation manner, after the processing unit of the first node determines to disconnect from the second node, the processing unit of the first node is further configured to clear the first address.

In a possible implementation manner, the determination by the processing unit of the first node to disconnect from the second node includes at least one of the following:

In a possible implementation manner, the sending unit of the third node is further configured to send a fourth discovery message, where the fourth discovery message is used to request address allocation; the receiving unit of the first node is also used to receive the fourth discovery message, and send a first non-confirmation message to the third node, where the first non-confirmation message is used to indicate refusal to allocate an address.

In a possible implementation manner, the receiving unit of the first node is further configured to receive a second non-confirmation message from the third node, where the second non-confirmation message is used to indicate refusal to allocate an address.

In a possible implementation manner, the sending unit of the first node is further configured to send a first request message, where the first request message is used to indicate that the first address is requested to be used; the receiving unit of the second node is also used to receive the first request message, and send a first confirmation message to the first node, where the first confirmation message is used to indicate that the first address is allowed to be used; the receiving unit of the first node is also used to receive the first confirmation message.

In a possible implementation manner, the sending unit of the third node is further configured to send a fifth discovery message, where the fifth discovery message is used to request address allocation; the receiving unit of the first node is also used to receive the fifth discovery message, and send a third non-confirmation message to the third node, where the third non-confirmation message is used to indicate refusal to allocate an address; the receiving unit of the third node is also used to receive the third non-confirmation message.

In a possible implementation manner, the sending unit of the third node is further configured to send a second request message, where the second request message is used to indicate that the second address is requested to be used; the receiving unit of the first node is also used to receive the second request message, and the sending unit of the first node is also used to send a second confirmation message to the third node, where the second confirmation message is used to indicate that the second address is allowed to be used; the receiving unit of the third node is also used to receive the second confirmation message.

In a possible implementation manner, the communication system is applied to a tree network, and the second node is a root node of the tree network or an intermediate node of the tree network.

In a possible implementation manner, the communication system is applied to a tree network, and the third node is a leaf node of the tree network or an intermediate node of the tree network.

It should be noted that, for details such as the execution process of each communication device in the communication system, refer to the description in the foregoing method embodiments of the present application, and details are not repeated here.

The embodiment of the present application also provides a communication device 1200 , as shown in FIG. 12 , which is a schematic structural diagram of the communication device 1200 provided in the embodiment of the present application.

Optionally, the communication device 1200 executes functions of the communication device in any of the foregoing embodiments (for example, the first node, the second node, and the third node in the implementation manner shown in FIG. 4 or FIG. 5 ).

Optionally, the communication device 1300 in FIG. 12 may be used to perform functions of other communication devices. For example, when the communication device 1200 is the first node, the communication device 1300 can be used to perform the function of the second node, and the communication device 1400 can be used to perform the function of the third node; for another example, when the communication device 1200 is the third node, the communication device 1300 can be used to perform the function of the first node, and the communication device 1300 can be used to perform the function of the subordinate node of the third node.

The communication device 1200 shown in FIG. 12 includes a memory 1202 and at least one processor 1201 .

Optionally, the processor 1201 implements the methods in the foregoing embodiments by reading instructions stored in the memory 1202, or, the processor 1201 may implement the methods in the foregoing embodiments through internally stored instructions. In the case that the processor 1201 implements the methods in the above embodiments by reading the instructions stored in the memory 1202, the memory 1202 stores the instructions for implementing the methods provided in the above embodiments of the present application.

Optionally, at least one processor 1201 is one or more CPUs, or a single-core CPU, or a multi-core CPU.

The memory 1202 includes, but is not limited to, RAM, ROM, EPROM, flash memory, or optical memory. Instructions of the operating system are stored in the memory 1202 .

After the program instructions stored in the memory 1202 are read by the at least one processor 1201, the communication device executes corresponding operations in the foregoing embodiments.

Optionally, the communication device shown in FIG. 12 further includes a network interface 1203 . The network interface 1203 may be a wired interface, such as FDDI or GE interface; the network interface 1203 may also be a wireless interface. The network interface 1203 is used to receive/transmit data in the foregoing embodiments.

After the processor 1201 reads the program instructions in the memory 1202, for other functions that the communication device 1200 can perform, please refer to the descriptions in the foregoing method embodiments.

Optionally, the communication device 1200 further includes a bus 1204, and the processor 1201 and the memory 1202 are usually connected to each other through the bus 1204, and may also be connected to each other in other ways.

Optionally, the communication device 1200 further includes an input and output interface 1205, and the input and output interface 1205 is used to connect to an input device and receive relevant configuration information (such as the value of m, the value of n, the time domain length corresponding to the third time domain position, the time domain length corresponding to the fourth time domain position, etc.) Input devices include, but are not limited to, keyboards, touch screens, microphones, and the like.

The communication device 1200 provided in the embodiments of the present application is configured to execute the methods performed by the communication device provided in the foregoing method embodiments, and achieve corresponding beneficial effects.

For the specific implementation manner of the communication device 1200 shown in FIG. 12 , reference may be made to the descriptions in the foregoing method embodiments, and corresponding technical effects may be achieved, so details will not be repeated here.

In the several embodiments provided in this application, it should be understood that the disclosed system, device and method can be implemented in other ways. For example, the device embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not implemented. In another point, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces, and the indirect coupling or communication connection of devices or units may be in electrical, mechanical or other forms.

As mentioned above, the above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them; although the present application has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: it can still modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements to some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the various embodiments of the application.

Claims

A communication method, characterized in that, comprising:

The first node sends a first discovery message, where the first discovery message is used to request address allocation;

The first node receives a first provision message from a second node, the first provision message includes a first address assigned by the second node to the first node; wherein, the second node is a superior node of the first node, the first address includes a first field and a second field, the value of the first field is the value of the address of the second node, and the value of the second field is an identifier of the first node;

The first node receives a second discovery message from a third node, the second discovery message is used to request address allocation, and the third node is a subordinate node of the first node;

The first node sends a second providing message to the third node, the second providing message includes a second address assigned by the first node to the third node, the second address includes a third field and a fourth field, the value of the third field is the value of the first address, and the value of the fourth field is an identifier of the third node.
The method according to claim 1, wherein after the first node sends the second provision message to the third node, the method further comprises:

After determining to disconnect from the second node, the first node sends a first change message to the third node to instruct the third node to clear the second address.
The method according to claim 1 or 2, wherein after the first node sends the second provision message to the third node, the method further comprises:

After determining to disconnect from the second node, the first node sends a third discovery message, where the third discovery message is used to request address allocation;

The first node receives a third providing message from a fourth node, the third providing message includes a third address allocated by the fourth node to the first node; wherein the fourth node is a superior node of the first node, and the third address includes a fifth field and a sixth field, the value of the fifth field is the value of the address of the fourth node, and the value of the sixth field is an identifier of the first node.
The method according to any one of claims 1 to 3, wherein after the first node receives the first providing message from the second node, the method further comprises:

After determining to disconnect from the second node, the first node clears the first address.
The method according to any one of claims 2 to 4, wherein the determining to disconnect from the second node includes at least one of the following:

determining that the state of the port with the second node is down; or,

determining that the lease renewal of the first address has timed out; or,

The first node receives a second change message from the second node to instruct the first node to clear the first address.
The method according to any one of claims 1 to 5, wherein before the first node receives the first providing message from the second node, the method further comprises:

The first node receives a fourth discovery message, where the fourth discovery message is used to request address allocation;

The first node sends a first non-confirmation message, where the first non-confirmation message is used to indicate refusal to allocate an address.
The method according to any one of claims 1 to 6, wherein before the first node receives the first providing message from the second node, the method further comprises:

The first node receives a second non-confirmation message from the third node, where the second non-confirmation message is used to indicate refusal to allocate an address.
The method according to any one of claims 1 to 7, wherein after the first node receives the first offer message from the second node and before the first node sends the second offer message to the third node, the method further comprises:

The first node sends a first request message to the second node, where the first request message is used to indicate a request to use the first address;

The first node receives a first confirmation message from the second node, where the first confirmation message is used to indicate that the first address is allowed to be used.
The method according to claim 8, wherein before the first node receives the first confirmation message from the second node, the method further comprises:

The first node receives a fifth discovery message, where the fifth discovery message is used to request address allocation;

The first node sends a third non-confirmation message, where the third non-confirmation message is used to indicate refusal to allocate an address.
The method according to any one of claims 1 to 9, wherein after the first node sends the second providing message to the third node, the method further comprises:

The first node receives a second request message from the third node, where the second request message is used to indicate a request to use the second address;

The first node sends a second confirmation message to the third node, where the second confirmation message is used to indicate that the second address is allowed to be used.
The method according to any one of claims 1 to 10, characterized in that,

The first discovery message, the first offer message, the second discovery message and the second offer message are all dynamic host configuration protocol DHCP messages.
The method according to any one of claims 1 to 10, characterized in that,

Both the first address and the second address are New IP addresses.
The method according to any one of claims 1 to 12, characterized in that,

In the first address, the first field precedes the second field;

and / or,

In the second address, the third field is located before the fourth field.
The method according to any one of claims 1 to 13, wherein the method is applied to a tree network, and the second node is a root node of the tree network or an intermediate node of the tree network.
The method according to any one of claims 1 to 14, wherein the method is applied to a tree network, and the third node is a leaf node of the tree network or an intermediate node of the tree network.
A communication method, wherein the method is applied to a communication system including a first node, a second node and a third node, the second node is a superior node of the first node and the third node is a subordinate node of the first node;

The methods include:

The first node sends a first discovery message, where the first discovery message is used to request address allocation;

The second node receives the first discovery message, and sends a first provision message to the first node, the first provision message includes a first address allocated by the second node to the first node; wherein the first address includes a first field and a second field, the value of the first field is the value of the address of the second node, and the value of the second field is the identifier of the first node;

The first node receives the first offer message;

The third node sends a second discovery message, where the second discovery message is used to request address allocation;

The first node receives the second discovery message, and sends a second provision message to the third node, the second provision message includes a second address allocated by the first node to the third node, the second address includes a third field and a fourth field, the value of the third field is the value of the first address, and the value of the fourth field is an identifier of the third node;

The third node receives the second offer message.
The method according to claim 16, wherein after the first node sends the second offer message to the third node, the method further comprises:

After determining to disconnect from the second node, the first node sends a first change message to the third node to instruct the third node to clear the second address;

The third node receives the first change message, and clears the second address.
The method according to claim 17, further comprising:

The third node sends the first change message to a subordinate node of the third node.
The method according to any one of claims 16 to 18, wherein the system further includes a fourth node, and the fourth node is a superior node of the first node; after the first node sends the second providing message to the third node, the method further includes:

After determining to disconnect from the second node, the first node sends a third discovery message, where the third discovery message is used to request address allocation;

The fourth node receives the third discovery message, and sends a third provision message to the first node, the third provision message includes a third address allocated by the fourth node to the first node; wherein, the third address includes a fifth field and a sixth field, the value of the fifth field is the value of the address of the fourth node, and the value of the sixth field is the identifier of the first node;

The first node receives the third offer message.
The method according to claim 19, further comprising:

The third node receives the third discovery message;

The third node sends a fourth non-confirmation message to the first node, where the fourth non-confirmation message is used to indicate refusal to allocate an address;

The first node receives the fourth non-confirmation message.
The method according to any one of claims 16 to 20, wherein after the first node receives the first providing message from the second node, the method further comprises:

After determining to disconnect from the second node, the first node clears the first address.
The method according to any one of claims 17 to 21, wherein the determining to disconnect from the second node includes at least one of the following:

determining that the state of the port with the second node is down; or,

determining that the lease renewal of the first address has timed out; or,

The first node receives a second change message from the second node to instruct the first node to clear the first address.
The method according to any one of claims 16 to 22, wherein before the first node receives the first provision message, the method further comprises:

The third node sends a fourth discovery message, where the fourth discovery message is used to request address allocation;

The first node receives the fourth discovery message, and sends a first non-confirmation message to the third node, where the first non-confirmation message is used to indicate refusal to allocate an address;

The third node receives the first non-confirmation message.
The method according to any one of claims 16 to 23, wherein before the first node receives the first provision message, the method further comprises:

The third node receives the first discovery packet;

The third node sends a second non-confirmation message to the first node, where the second non-confirmation message is used to indicate refusal to allocate an address;

The first node receives the second non-confirmation message.
The method according to any one of claims 16 to 24, wherein after the first node receives the first offer message and before the first node sends the second offer message, the method further comprises:

The first node sends a first request message, where the first request message is used to indicate a request to use the first address;

The second node receives the first request message, and sends a first confirmation message to the first node, where the first confirmation message is used to indicate that the first address is allowed to be used;

The first node receives the first confirmation message.
The method according to claim 25, wherein, before the first node receives the first confirmation message, the method further comprises:

The third node sends a fifth discovery message, where the fifth discovery message is used to request address allocation;

The first node receives the fifth discovery message, and sends a third non-confirmation message to the third node, where the third non-confirmation message is used to indicate refusal to allocate an address;

The third node receives the third non-confirmation message.
The method according to any one of claims 16 to 26, wherein after the first node sends the second offer message, the method further comprises:

The third node sends a second request message, where the second request message is used to indicate a request to use the second address;

The first node receives the second request message, and sends a second confirmation message to the third node, where the second confirmation message is used to indicate that the second address is allowed to be used;

The third node receives the second confirmation message.
A method according to any one of claims 16 to 27, wherein,

The first discovery message, the first offer message, the second discovery message and the second offer message are all dynamic host configuration protocol DHCP messages.
A method according to any one of claims 16 to 28, wherein

Both the first address and the second address are New IP addresses.
A method according to any one of claims 16 to 29, wherein

In the first address, the first field precedes the second field;

and / or,

In the second address, the third field is located before the fourth field.
The method according to any one of claims 16 to 30, wherein the method is applied to a tree network, and the second node is a root node of the tree network or an intermediate node of the tree network.
The method according to any one of claims 16 to 31, wherein the method is applied to a tree network, and the third node is a leaf node of the tree network or an intermediate node of the tree network.
A communication device, characterized by comprising a receiving unit and a sending unit, the receiving unit and the sending unit are configured to execute the method according to any one of claims 1 to 15.
A communication device, characterized by comprising at least one processor, and a memory coupled to the at least one processor;

The memory is used to store programs or instructions;

The at least one processor is configured to execute the program or instructions, so that the communication device implements the method according to any one of claims 1 to 15.
A communication system, characterized by comprising a first node, a second node and a third node, wherein the second node is a superior node of the first node and the third node is a subordinate node of the first node;

The communication system is used to implement the method according to any one of claims 16-32.
A computer-readable storage medium, which is characterized by including programs or instructions, and when the programs or instructions are run on a computer, the method according to any one of claims 1 to 32 is executed.