# US 2025/0211516 A1 · Bgp route sending method and device, storage medium, and electronic device

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

- Number: US 2025/0211516 A1
- Document ID: US20250211516A1
- Status: Published application
- Kind: A1
- Application number: 18/847,387
- Filed: 2022-12-14
- Published: 2025-06-26
- Earliest claimed: 2022-03-16
- Assignees: Zte Corporation
- Applicants: ZTE Corporation
- Inventors: Yubao WANG; Chunning DAI; Zheng ZHOU
- Web page: https://patentgrep.com/patent/US20250211516A1

## CPC

- H04L 45/04: {Interdomain routing, e.g. hierarchical routing}
- H04L 45/00: Routing or path finding of packets in data switching networks (routing or path finding in wireless networks H04W40/00)
- H04L 45/033: by updating distance vector protocols
- H04L 45/50: using label swapping, e.g. multi-protocol label switch [MPLS]
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A BGP route sending method includes: receiving, by a second node, a first BGP route advertised by a third node, wherein the first BGP route carries a first attribute and a second attribute; performing, by the second node, first processing on the second attribute to obtain a second BGP route, wherein the second node is unable to recognize the first attribute, but has a capability of recognizing the second attribute; and in response to the second node being unable to recognize the first attribute, adding, by the second node, first indication information to the second BGP route while retaining the first attribute in the second BGP route, and sending, by the second node, the second BGP route to the first node, wherein the first indication information is indication information used for indicating whether the first processing affects the first attribute.

## Claims

### Claim 1

A Border Gateway Protocol (BGP) route sending method, comprising:
receiving, by a second node, a first BGP route advertised by a third node, wherein the first BGP route carries a first attribute and a second attribute;
performing, by the second node, first processing on the second attribute to obtain a second BGP route, wherein the second node is located between the third node and a first node, the second node is unable to recognize the first attribute, but has a capability of recognizing the second attribute, and the first processing is modifying the second attribute by the second node; and
in response to the second node being unable to recognize the first attribute, adding, by the second node, first indication information to the second BGP route while retaining the first attribute in the second BGP route, and sending, by the second node, the second BGP route to the first node, wherein the first indication information is indication information used for indicating whether the first processing affects the first attribute.

### Claim 2 (depends on 1)

The BGP route sending method according to claim 1, wherein
in a case where the first processing affects the first attribute, the first indication information further comprises second indication information, and in a case where the first processing does not affect the first attribute, the first indication information further comprises third indication information, wherein the second indication information is different from the third indication information, the second indication information is indication information used for instructing the first node to execute second processing, and the third indication information is indication information used for instructing the first node to perform third processing;
wherein the second processing comprises that:
in a case where the second BGP route carries the second indication information, the first node does not add a first forwarding plane entity to a data packet corresponding to the second BGP route,
wherein the first forwarding plane entity is a forwarding plane entity corresponding to the first attribute; and
the third processing comprises that:
in a case where the second BGP route carries the third indication information, the first node adds the first forwarding plane entity to the data packet corresponding to the second BGP route,
wherein the first forwarding plane entity is the forwarding plane entity corresponding to the first attribute.

### Claim 3 (depends on 2)

The BGP route sending method according to claim 2, wherein the first attribute, the first forwarding plane entity, and the second attribute satisfy one of a third condition, a fourth condition, and a fifth condition, wherein
the third condition comprises: the first attribute being an Entropy Label Capability Attribute (ELCA), the first forwarding plane entity being an Entropy Label Indicator (ELI) label corresponding to the ELCA, and the second attribute being a Multi-Protocol Label Switching (MPLS) label attribute of the first BGP route;
the fourth condition comprises: the first attribute being a Flow Label Capability Attribute (FLCA), the first forwarding plane entity being a flow label corresponding to the FLCA, and the second attribute being the MPLS label attribute of the first BGP route;
the fifth condition comprises: the first attribute being a Control Word Capability Attribute (CWCA), the first forwarding plane entity is a control word corresponding to the CWCA, and the second attribute is the MPLS label attribute of the first BGP route.

### Claim 4 (depends on 2)

The BGP route sending method according to claim 2, wherein
the first BGP route further carries fourth indication information, and the second node determines, according to the fourth indication information, that the third indication information is fifth indication information, wherein
the fifth indication information comprises a Partial flag bit with a value of 0;
or,
the first BGP route further carries fourth indication information; the second node determines, according to the fourth indication information, that the second indication information comprises one of sixth indication information or seventh indication information, or determines, according to the fourth indication information, that the third indication information comprises eighth indication information, wherein the sixth indication information comprises a No-Partial flag bit with a value of 0, and the fourth indication information is kept unchanged; the seventh indication information comprises a New-Partial flag bit with a value of 1, and the fourth indication information is kept unchanged; the eighth indication information comprises a Partial flag bit with a value of 0, and the fourth indication information is kept unchanged.

### Claim 5

(canceled)

### Claim 6 (depends on 4)

The BGP route sending method according to claim 4, wherein before receiving, by the second node, the first BGP route advertised by the third node, the method further comprises:
adding, by the third node, the fourth indication information into the first BGP route.

### Claim 7 (depends on 4)

The BGP route sending method according to claim 4, wherein only when all modifications performed on attributes other than the first attribute in the first BGP route do not affect validity of the first attribute,
the second node adds the third indication information to the second BGP route when sending the second BGP route to the first node.

### Claim 8 (depends on 4)

The BGP route sending method according to claim 4, wherein the fourth indication information is ninth indication information, wherein
the ninth indication information is formed by a Transitive flag bit located in the first attribute and having a value of 1 and a Smart-Partial flag bit located in the first attribute and having a value of 1.

### Claim 9 (depends on 4)

The BGP route sending method according to claim 4, wherein the fourth indication information is tenth indication information, wherein
the tenth indication information is formed by a Transitive flag bit located in the first attribute and having a value of 0 and a New-Transitive flag bit located in the first attribute and having a value of 1.

### Claim 10 (depends on 1)

The BGP route sending method according to claim 1, wherein in a case where a first condition is not satisfied, it is determined that the first processing affects the first attribute; or in a case where the first condition is satisfied, it is determined that the first processing does not affect the first attribute, wherein the first condition comprises one of the following:
the second node does not modify a next hop of the first BGP route;
the second node modifies an address of the next-hop of the first BGP route to an IP address of the second node, and the second attribute carried by the second BGP route satisfies a second condition.

### Claim 11 (depends on 2)

The BGP route sending method according to claim 2, wherein the second condition comprises that the second attribute does not cause the first forwarding plane entity to be exposed on the second node.

### Claim 12 (depends on 2)

The BGP route sending method according to claim 2, wherein the second condition comprises that the second attribute does not cause a second forwarding plane entity to be stripped off on the second node, wherein the second forwarding plane entity is a forwarding plane entity adjacent to the first forwarding plane entity in an outer layer of the first forwarding plane entity.

### Claim 13 (depends on 2)

The BGP route sending method according to claim 2, wherein the second attribute is a first Multi-Protocol Label Switching (MPLS) label of the first BGP route, the first processing is modifying, by the second node, the first MPLS label of the first BGP route to a second MPLS label allocated by the second node, and the method further comprises:
in a case where a label operation corresponding to the second MPLS label on a forwarding plane is Swap, adding the third indication information before the second node advertises the second BGP route to the first node;
in a case where the label operation corresponding to the second MPLS label in the forwarding plane is Pop, adding the second indication information before the second node advertises the second BGP route to the first node.

### Claim 14 (depends on 13)

The BGP route sending method according to claim 13, wherein
the third indication information comprises a Partial flag bit with a value of 0 in the first attribute.

### Claim 15 (depends on 4)

The BGP route sending method according to claim 4, wherein
the fourth indication information is a New-Transitive flag bit in the first attribute, and the method further comprises:
setting, by the third node, the value of the No-Partial flag bit to 1 before advertising the first BGP route;
in response to a value of the New-Transitive flag bit being 1, determining, by the second node, that the third indication information comprises the No-Partial flag bit with the value of 1 in the first attribute and a Transitive flag bit with a value of 0;
or,
the fourth indication information is a Smart-Partial flag bit in the first attribute, and the method further comprises: in response to a value of the Smart-Partial flag bit being 1, determining that the second indication information comprises the Partial flag bit with the value of 1 in the first attribute.

### Claim 16

(canceled)

### Claim 17 (depends on 4)

The BGP route sending method according to claim 4, wherein the first processing is processing not affecting the first attribute, there is a fourth node between the first node and the third node, the fourth node is a node which is unable to recognize a New-Transitive flag bit, a Smart-Partial flag bit, a New-Partial flag bit, a No-Partial flag bit and the first attribute, the fourth node sends a fifth BGP route to the first node, the second node and the fourth node both modify the second attribute without affecting the first attribute, and the third indication information is different from a value of a corresponding field in the fifth BGP route.

### Claim 18

(canceled)

### Claim 19

A non-transitory computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and the computer program, when running on a processor, causes the processor to execute the following operations:
receiving, by a second node, a first BGP route advertised by a third node, wherein the first BGP route carries a first attribute and a second attribute;
performing, by the second node, first processing on the second attribute to obtain a second BGP route, wherein the second node is located between the third node and a first node, the second node is unable to recognize the first attribute, but has a capability of recognizing the second attribute, and the first processing is modifying the second attribute by the second node; and
in response to the second node being unable to recognize the first attribute, adding, by the second node, first indication information to the second BGP route while retaining the first attribute in the second BGP route, and sending, by the second node, the second BGP route to the first node, wherein the first indication information is indication information used for indicating whether the first processing affects the first attribute.

### Claim 20

An electronic device, comprising a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to execute the following operations:
receiving, by a second node, a first BGP route advertised by a third node, wherein the first BGP route carries a first attribute and a second attribute;
performing, by the second node, first processing on the second attribute to obtain a second BGP route, wherein the second node is located between the third node and a first node, the second node is unable to recognize the first attribute, but has a capability of recognizing the second attribute, and the first processing is modifying the second attribute by the second node; and
in response to the second node being unable to recognize the first attribute, adding, by the second node, first indication information to the second BGP route while retaining the first attribute in the second BGP route, and sending, by the second node, the second BGP route to the first node, wherein the first indication information is indication information used for indicating whether the first processing affects the first attribute.

### Claim 21 (depends on 10)

The BGP route sending method according to claim 10, wherein the second condition comprises that the second attribute does not cause the first forwarding plane entity to be exposed on the second node.

### Claim 22 (depends on 10)

The BGP route sending method according to claim 10, wherein the second condition comprises that the second attribute does not cause a second forwarding plane entity to be stripped off on the second node, wherein the second forwarding plane entity is a forwarding plane entity adjacent to the first forwarding plane entity in an outer layer of the first forwarding plane entity.

### Claim 23 (depends on 13)

The BGP route sending method according to claim 13, wherein
the fourth indication information is a New-Transitive flag bit in the first attribute, and the method further comprises: setting, by the third node, the value of the No-Partial flag bit to 1 before advertising the first BGP route; in response to a value of the New-Transitive flag bit being 1, determining, by the second node, that the third indication information comprises the No-Partial flag bit with the value of 1 in the first attribute and a Transitive flag bit with a value of 0;
or,
the fourth indication information is a Smart-Partial flag bit in the first attribute, and the method further comprises: in response to a value of the Smart-Partial flag bit being 1, determining that the second indication information comprises the Partial flag bit with the value of 1 in the first attribute.
