# US 2024/0205185 A1 · Address Assignment Method, Node Determining Method and Apparatus, and Storage Medium

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0205185 A1
- Document ID: US20240205185A1
- Status: Published application
- Kind: A1
- Application number: 18/405,265
- Filed: 2024-01-05
- Published: 2024-06-20
- Earliest claimed: 2021-07-06
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Delei Yu
- Web page: https://patentgrep.com/patent/US20240205185A1

## CPC

- H04L 61/50: Address allocation
- H04L 61/5038: for local use, e.g. in LAN or USB networks, or in a controller area network [CAN]
- H04L 61/5061: Pools of addresses
- H04L 45/74: Address processing for routing
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method includes: a first node obtains an address of a second node based on an address of the first node, where the address of the first node includes m bits, where the address of the second node includes m+n bits, where high-order m bits of the address of the second node are the same as low-order m bits of the address of the first node, and where m and n each are an integer greater than 0; and the first node sends the address of the second node to the second node.

## Claims

### Claim 1

A method, comprising:
obtaining, by a first node and based on a first address of the first node, a second address of a second node, comprises m bits, wherein the second address comprises m+n bits, wherein m first high-order of the second address node are the same as m low-order bits of the first address, and wherein m and n are integers greater than 0; and
sending, by the first node and to the second node, the second address.

### Claim at position 2

-6. (canceled)

### Claim 7 (depends on 1)

The method of claim 1, wherein sending the second address comprises sending, by the first node and to the second node, a first message, wherein the first message comprises a field having a length of x bytes, wherein the field carries the second address, and wherein x is an integer greater than 0.

### Claim 8 (depends on 1)

The method of claim 1, further comprising selecting, by the first node and from a first address pool, one idle address as n low-order bits of the second address when the first address pool comprises the one idle address, wherein the first node comprises the first address pool, wherein a quantity of bits comprised in each address in the first address pool is equal to p, wherein p is a specified integer greater than 0, and wherein n=p.

### Claim 9 (depends on 8)

The method of claim 8, wherein selecting the one idle address comprises selecting, by the first node, the one idle address when a type of the second node is a non-leaf node.

### Claim 10 (depends on 8)

The method of claim 8, further comprising selecting, by the first node and from a second address pool, the one idle address as the n low-order bits when the first address pool does not comprise the idle address, wherein the first node comprises the second address pool, wherein the second address pool comprises a first-type address or a second-type address, wherein a first quantity of bits comprised in the first-type address is less than p, wherein a second quantity of bits comprised in the second-type address is greater than p, and wherein p first bits of the second-type address are a specified address in the first address pool.

### Claim 11 (depends on 1)

The method of claim 1, further comprising selecting, by the first node and from a second address pool, one idle address as n low-order bits of the second address when a type of the second node is a leaf node, wherein the second address pool comprises a first-type address or a second-type address, wherein a first quantity of bits comprised in the first-type address is less than p, wherein a second quantity of bits comprised in the second-type address is greater than p, wherein p first bits of the second-type address are a specified address, and wherein p is a specified integer greater than 0.

### Claim 12 (depends on 1)

The method of claim 1, wherein the first node is a parent node of the second node.

### Claim 13 (depends on 1)

The method of claim 1, further comprising requesting, by the first node, to assign a third address, wherein the third address is the first address.

### Claim 14 (depends on 13)

The method of claim 13, further comprising updating, by the first node, second m high-order bits of a fourth address of each node in a node set to the third address, wherein the node set comprises a subnode of the first node.

### Claim 15

A method, comprising:
receiving, by a first node, a first message, wherein the first message comprises a destination address, wherein the destination address comprises x bits, and wherein x is an integer greater than 0; and
determining, by the first node and based on a first address of the first node and the destination address, a next-hop node of the first message,
wherein the first address of the first node comprises y bits, and
wherein y is an integer greater than 0.

### Claim 16 (depends on 15)

The method of claim 15, wherein determining the next-hop node comprises determining, by the first node when x is less than y, that the next-hop node is a parent node of the first node.

### Claim 17 (depends on 15)

The method of claim 15, wherein determining the next-hop node comprises determining, by the first node and based on the first address and a second address, the next-hop node when x is greater than or equal to y, and wherein the second address is y high-order bits of the destination address.

### Claim 18 (depends on 17)

The method of claim 17, wherein determining the next-hop node further comprises determining, by the first node when the first address is different from the second address, that the next-hop node is a parent node of the first node.

### Claim 19 (depends on 17)

The method of claim 17, wherein determining the next-hop node further comprises determining, by the first node and based on a third address, the next-hop node when the first address is the same as the second address and x is greater than y, and wherein the third address is a part of the destination address other than the second address.

### Claim 20 (depends on 19)

The method of claim 19, wherein determining the next-hop node further comprises:
determining, by the first node and when a quantity of bits comprised in the third address is less than or equal to p or when p first bits of the third address are a first specified address, that a third node corresponding to the destination address is a child node of the first node and that the next-hop node is the child node, wherein p is a specified integer greater than 0; or
determining, by the first node and when the quantity is greater than p and the p first bits are not a second specified address, that the next-hop node is a fourth node corresponding to a fourth address,
wherein the fourth address comprises the second first address and the p first bits.

### Claim 21 (depends on 19)

The method of claim 19, wherein determining the next-hop node further comprises determining, when a first value of each bit comprised in the third address is 1, or when a second value of a least significant bit in the third address is 0 and a third value of each bit other than the least significant bit in the third address is 1, that a third node corresponding to the destination address is a child node of the first node and that the next-hop node is the child node.

### Claim 22 (depends on 19)

The method of claim 19, wherein determining the next-hop node further comprises:
obtaining, by the first node, a fourth address when a bit having a first value of 0 is in bits other than the least significant bit in the third second address, wherein the fourth address is z first bits of the third address, wherein z is an integer greater than 0, wherein a second value of a least significant bit of the fourth address is 0, and wherein third values of z−1 first bits of the fourth address are all 1; and
determining, by the first node, that the next-hop node is a third node corresponding to a fifth address,
wherein the fifth address comprises the second address and the fourth address.

### Claim 23 (depends on 19)

The method of according to claim 19, further comprising processing, by the first node, the first message when the first address is the same as the second address and x=y.

### Claim 24 (depends on 15)

The method of claim 15, wherein m high-order bits of the destination address are the same as a second address of a parent node of a second node, wherein the second node corresponds to the destination address, and wherein m is an integer greater than 0 and less than x.

### Claim 25

An apparatus, comprising:
a memory configured to store instructions; and
one or more processors coupled to the memory and configured to execute the instructions to:
obtain, based on a first address of the apparatus, a second address of a second node, wherein the first address comprises m bits, wherein the second address comprises m+n bits, wherein m high-order bits of the second address are the same as m low-order bits of the first address, and wherein m and n are integers greater than 0; and
send, to the second node, the second address.

### Claim at position 22

-29. (canceled)

### Claim 30

An apparatus, comprising
a memory configured to store instructions; and
one or more processors coupled to the memory and configured to execute the instructions to:
receive a first message, wherein the first message comprises a destination address, wherein the destination address comprises x bits, and wherein x is an integer greater than 0; and
determine, based on a first address of the apparatus and the destination address, a next-hop node of the first message,
wherein the first address comprises y bits, and
wherein y is an integer greater than 0.

### Claim 31 (depends on 30)

The apparatus of claim 30, wherein the one or more processors are further configured to further determine, when x is less than y, that the next-hop node is a parent node of the apparatus.

### Claim 32 (depends on 30)

The apparatus of claim 30, wherein the one or more processors are further configured to further determine, based on the first address and a second address, the next-hop node when x is greater than or equal to y, and wherein the second address is y high-order bits of the destination address.

### Claim 33 (depends on 32)

The apparatus of claim 32, wherein the one or more processors are further configured to further determine, when the first address is different from the second address, that the next-hop node is a parent node of the apparatus.

### Claim 34 (depends on 32)

The apparatus of claim 32, wherein the one or more processors are further configured to further determine, based on a third address, the next-hop node when the first address is the same as the second address and x is greater than y, and wherein the third address is a part of the destination address other than the second address.

### Claim 35 (depends on 34)

The apparatus of claim 34, wherein the one or more processors are further configured to:
further determine, when a quantity of bits comprised in the third address is less than or equal to p or when p first bits of the third address are a first specified address, that a third node corresponding to the destination address is a child node of the apparatus and that the next-hop node is the child node, wherein p is a specified integer greater than 0; or
further determine, when the quantity is greater than p and the p first bits are not a second specified address, that the next-hop node is a fourth node corresponding to a fourth address,
wherein the fourth address comprises the second address and the p first bits.

### Claim 36 (depends on 25)

The apparatus of claim 25, wherein the one or more processors are further configured to execute the instructions to further send, to the second node, a first message, wherein the first message comprises a field having a length of x bytes, wherein the field carries the second address, and wherein x is an integer greater than 0.

### Claim 37 (depends on 25)

The apparatus of claim 25, wherein the one or more processors are further configured to execute the instructions to select, from a first address pool, one idle address as n low-order bits of the second address when the first address pool comprises the one idle address, wherein the apparatus comprises the first address pool, wherein a quantity of bits comprised in each address in the first address pool is equal to p, wherein p is a specified integer greater than 0, and wherein n=p.

### Claim 38 (depends on 37)

The apparatus of claim 37, wherein the one or more processors are further configured to further select the one idle address when a type of the second node is a non-leaf node.

### Claim 39 (depends on 37)

The apparatus of claim 37, wherein the one or more processors are further configured to select, from a second address pool, the one idle address as the n low-order bits when the first address pool does not comprise the idle address, wherein the apparatus comprises the second address pool, wherein the second address pool comprises a first-type address or a second-type address, wherein a first quantity of bits comprised in the first-type address is less than p, wherein a second quantity of bits comprised in the second-type address is greater than p, and wherein p first bits of the second-type address are a specified address in the first address pool.

### Claim 40 (depends on 25)

The apparatus of claim 25, wherein the one or more processors are further configured to select, from a second address pool, one idle address as n low-order bits of the second address when a type of the second node is a leaf node, wherein the second address pool comprises a first-type address or a second-type address, wherein a first quantity of bits comprised in the first-type address is less than p, wherein a second quantity of bits comprised in the second-type address is greater than p, wherein p first bits of the second-type address are a specified address, and wherein p is a specified integer greater than 0.
