CN117439935A

CN117439935A - Information processing method, apparatus, and computer-readable storage medium

Info

Publication number: CN117439935A
Application number: CN202210832632.9A
Authority: CN
Inventors: 陈然; 赵德涛
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2022-07-15
Filing date: 2022-07-15
Publication date: 2024-01-23
Also published as: WO2024011950A1

Abstract

The application provides an information processing method, an information processing device and a computer readable storage medium, wherein the method comprises the following steps: the method comprises the steps that a first device receives a message carrying first slice information sent by a second device; the first device determines a first segment identification, SID, from the first slice information, the first SID representing a SID associated with the first slice information. According to the scheme of the embodiment of the application, when the first equipment receives the message carrying the first slice information sent by the second equipment, the first equipment determines the SID associated with the slice information according to the first slice information carried by the message, and the SID which is translated into the corresponding slice based on the acquired first slice information is realized, so that the SID is uniquely identified from the dimension of the slice.

Description

Information processing method, apparatus, and computer-readable storage medium

Technical Field

The present invention relates to communication technology, and more particularly, to an information processing method, apparatus, and computer-readable storage medium.

Background

In network communications, segment Routing (SR) is a source Routing technique. The principle of SR is to divide the path between nodes in the network into individual segments (segments) and assign Segment IDs (SIDs) to the segments. In the specific implementation, the starting node of the SR forwarding path presses the SID list into the data packet, and the intermediate node of the forwarding path is indicated to forward the message through the SID list carried by the data packet.

Network slicing refers to customizing different logical networks according to different service requirements on a physical or virtual network infrastructure. Under the slice scene, SIDs are required to be allocated to each slice to realize the isolation of forwarding surfaces and the slice selection of forwarding messages. However, in the related art, neither the node nor the controller has the capability of translating the slice SID, so that the forwarding plane isolation of the slice cannot be achieved based on the slice information.

Disclosure of Invention

Embodiments of the present application provide an information processing method, apparatus, computer-readable storage medium, and computer program product capable of translating into a SID of a corresponding slice based on acquired slice information to enable unique identification of the SID from the slice dimension.

In a first aspect, an embodiment of the present application provides an information processing method, including:

the method comprises the steps that a first device receives a message carrying first slice information sent by a second device;

the first device determines a first segment identification, SID, from the first slice information, the first SID representing a SID associated with the first slice information.

In a second aspect, an embodiment of the present application provides an information processing method, including:

the second device sends a message carrying first slice information to the first device so that the first device determines a first segment identification SID according to the first slice information, wherein the first SID represents the SID associated with the first slice information.

In a third aspect, an embodiment of the present application provides an electronic device, including:

a processor and a memory;

the memory has stored thereon program instructions which, when executed by the processor, cause the processor to perform the method as described in the first or second aspect above.

In a fourth aspect, embodiments of the present application provide a computer readable storage medium storing program instructions which, when executed by a computer, implement the method as described in the first or second aspect above.

In a fifth aspect, embodiments of the present application provide a computer program product storing program instructions that when run on a computer cause the computer to perform the method as described above in the first or second aspect.

In the information processing method, the device, the computer readable storage medium and the computer program product provided by the embodiment of the application, when the first device receives the message carrying the first slice information sent by the second device, the first device determines the SID associated with the slice information according to the first slice information carried by the message, so that the SID is translated into the SID of the corresponding slice based on the acquired first slice information, and the SID is uniquely identified from the slice dimension.

Drawings

FIG. 1 is a schematic diagram of a communication network to which embodiments of the present application are applicable;

fig. 2 is a schematic flow chart of an information processing method according to an embodiment of the present application;

FIG. 3 is a flowchart of another information processing method according to an embodiment of the present disclosure;

FIGS. 4 a-4 i are schematic diagrams of encapsulation formats of Segment Sub-TLVs provided by embodiments of the present application;

FIG. 5 is a schematic diagram of an encapsulation format of an SR-ERO sub-object provided by an embodiment of the disclosure;

FIG. 6 is a schematic diagram of a package format of SRv6-ERO sub object provided by an embodiment of the present application;

fig. 7 is a schematic diagram of an encapsulation format of a PCE capability Sub-TLV provided in an embodiment of the present application;

fig. 8 is a schematic diagram of an encapsulation format of a PCC capability Sub-TLV provided by an embodiment of the present application;

FIGS. 9 a-9 l are schematic diagrams of package formats of Segment descriptors according to embodiments of the present application;

fig. 10 is a schematic structural diagram of an electronic device according to an embodiment of the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.

It should be appreciated that in the description of the embodiments of the present application, if any, the descriptions of "first," "second," etc. are used for the purpose of distinguishing between technical features only, and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated or implicitly indicating the precedence of the technical features indicated. "at least one" means one or more, and "a plurality" means two or more. "and/or", describes an association relation of association objects, and indicates that there may be three kinds of relations, for example, a and/or B, and may indicate that a alone exists, a and B together, and B alone exists. Wherein A, B may be singular or plural. The character "/" generally indicates that the context-dependent object is an "or" relationship. "at least one of the following" and the like means any of these items, including any group of single or plural items. For example, at least one of a, b, and c may represent: a, b, c, a and b, a and c, b and c, or a and b and c, wherein a, b and c may be single or multiple.

In addition, the technical features described below in the various embodiments of the present application may be combined with each other as long as they do not form a conflict with each other.

Before introducing the technical solution of the embodiment of the present application, an application scenario of the embodiment of the present invention is first described in an exemplary manner. Fig. 1 is a schematic diagram of a communication network applicable to the embodiment of the present application. The communication network in fig. 1 includes a controller and a plurality of network nodes, each of which is communicatively coupled to the controller. The network node according to the embodiment of the present application is a forwarding device that performs a routing forwarding function, and may be a device such as a router, a switch, or a repeater, where the router, the switch, or the repeater may be a physical device, or may be a virtual device (e.g., a virtual server, a virtual router, a virtual switch, or a virtual repeater) implemented based on a virtualization technology. The controller related to the embodiment of the application can control and manage a plurality of network nodes, and generates a forwarding policy of each network node according to the topology of the plurality of network nodes in the network, so as to instruct the network node to forward a message including a destination address corresponding to the forwarding policy. Wherein the controller may be, but is not limited to, a Software Defined Network (SDN) controller or the like.

In the technical scheme of the embodiment of the application, a controller determines a forwarding path between a source node and a destination node, wherein the forwarding path comprises N network nodes, and N is a positive integer greater than or equal to 2. For example, based on the communication network shown in fig. 1, it is assumed that a forwarding path between a head node and a destination node includes a network node a, a network node B, and a network node C, where the network node a is a source node (may also be referred to as a head node, a start node) in the forwarding path, the network node B is an intermediate node in the forwarding path, and the network node C is a destination node (may also be referred to as a tail node, an end node) in the forwarding path.

It should be appreciated that the communication network to which embodiments of the present application relate employs Segment Routing (SR) techniques. The principle of SR is to divide the path between nodes in the network into individual segments (segments) and assign Segment IDs (SIDs) to the segments. When SR is applied to a multiprotocol label switching (multi-protocol label switching, MPLS) data plane, then it is referred to as MPLS-based segment routing (MPLS-SR or SR-MPLS), and when SR is applied to an Internet protocol version 6 (Internet Protocol Version, IPv 6) data plane, then it is referred to as IPv 6-based segment routing (SRv 6).

In the specific implementation, the starting node of the SR forwarding path presses the SID list into the data packet, and the intermediate node of the forwarding path is indicated to forward the message through the SID list carried by the data packet. The Segment routing technology enables a node to assign a forwarding path for a specific message instead of forwarding according to a general shortest path, and the state information of each path does not need to be maintained on an intermediate node through adding Segment List related information composed of SIDs in the message.

Segment List encodes any forwarding path of the data packet in the network. Each Segment List represents a forwarding path that contains multiple segments representing each Segment in the path. The segments currently defined include the following types:

Type A SR-MPLS Label (Label);

Type B:SRv6 SID；

type C, internet protocol version 4 (Internet Protocol Version, IPv 4) Prefix information carrying SR algorithm, the head node needs to translate the corresponding Prefix SID according to IPv4 Prefix and SR algorithm.

Type D, carrying the global IPv6 Prefix information of the SR algorithm, wherein the head node needs to translate the corresponding Prefix SID according to the global IPv6 Prefix information and the SR algorithm.

Type E IPv4 Prefix information carrying IPv4 address and local interface ID information, the head node needs to translate corresponding Adjacency (SR-MPLS label) SIDs according to Prefix and Local Interface ID.

Type F, carrying link node information based on a local IPv4 address pair and a remote IPv4 address pair, wherein the head node needs to translate the corresponding Adjacency SID according to the local IPv4 address and the remote IPv4 address.

Type G, carrying local and remote IPv6 addresses and interface ID information, for SR-MPLS scene, the head node needs to translate corresponding Adjacent SIDs according to the local IPv6 addresses, the remote IPv6 addresses, the local interface ID and the remote interface ID.

Type H carries local and remote IPv6 address information and is used for SR-MPLS scenes, and the head node needs to translate corresponding Adjacent SIDs according to the local IPv6 address and the remote IPv6 address.

Type I, carrying local and remote IPv6 addresses and interface ID information, for SRv scene, the head node needs to translate corresponding END SIDs according to the local and remote IPv6 addresses, interface ID information and algorithm.

Type J, carrying local and remote IPv6 address and interface ID information, for SRv scenario, the head node needs to translate corresponding END.X SIDs according to the local and remote IPv6 address and interface ID information and algorithm.

Type K carries local/remote IPv6 address information, and is used for SRv scene head nodes to translate corresponding SRv END.X SIDs according to global IPv6 addresses and algorithms.

It should be understood that network slicing refers to customizing different logical networks according to different service requirements on a physical or virtual network infrastructure. Under the slice scene, SIDs are required to be allocated to each slice to realize the isolation of forwarding surfaces and the slice selection of forwarding messages. For example, based on the communication network shown in fig. 1, the path between network node a and network node B includes slice a and slice B, which should be assigned different SIDs first in order to determine through which slice to implement the transmission of a message from network node a to network node B. In the Segment types described above, since the types a and B carry SIDs, different SIDs are directly allocated to different slices, but types C to K must be based on some association information (such as Prefix/Interface) to translate the SIDs, but at present, translation into different SIDs based on different slice information cannot be achieved. On the other hand, if Type C to Type K carry optional SID information, the method may be further used for SID verification of the head node, that is, the head node translates to obtain a SID based on some associated information (such as prefix/interface information), and then verifies the translated SID with the SID of the Segment itself. However, in the slice scene, a scheme of adding slice information as translation information does not exist, so that the SID of each slice cannot be translated, and SID verification finally plays no role.

In view of this, embodiments of the present application provide an information processing method, apparatus, computer-readable storage medium, and computer program product that at least address the problem of translating SIDs into corresponding slices based on acquired slice information to enable unique identification of SIDs from slice dimensions.

Referring to fig. 2, a flow chart of an information processing method according to an embodiment of the present application is provided, and the method includes, but is not limited to, the following steps S110 to S120:

s110, the first device receives a message carrying first slice information sent by the second device;

s120, the first device determines a first segment identification SID according to the first slice information, wherein the first SID represents the SID associated with the first slice information.

According to the scheme, when the first device receives the message carrying the first slice information sent by the second device, the first device determines the SID associated with the slice information according to the first slice information carried by the message, and the SID which is translated into the corresponding slice based on the acquired first slice information is realized, so that the SID is uniquely identified from the slice dimension.

It should be noted that, the message carrying the first slice information described above may also carry the associated information. When the message from the second device received by the first device carries the first slice information and the associated information at the same time, the first device in step S120 determines a first segment identification SID according to the first slice information, which specifically includes: the first device determines a first SID from the first slice information and the association information.

By way of example, the association information described above may include at least one of: segment routing algorithm information, internet protocol IP prefix, local IP node address information, remote IP node address information, local interface ID information, remote interface ID information, local IP address information, remote IP address information.

It should be appreciated that when the message carries the first clip information and the associated information, then the first device translates the first SID based on the first clip information and the associated information.

It should be noted that the message carrying the first slice information described above may also carry the second SID. As shown in fig. 3, when the message further carries the second SID, the method provided in the embodiment of the present application further includes the following steps:

s130, checking the first SID and the second SID to determine a checking result.

As an example, a message received by a first device from a second device carries first slice information and a second SID, the first device first translates the first SID according to the first slice information in the message, and then verifies the translated first SID with the second SID to determine a verification result of the SID. If the verification result indicates that the verification is successful, the SID list is valid; if the check result indicates a check failure, it indicates that the SID list is invalid.

As another example, a message received by the first device from the second device carries first slice information, association information and a second SID, the first device first translates the first slice information and the association information in the message to obtain a first SID, and then verifies the translated first SID with the second SID to determine a verification result of the SID. If the verification result indicates that the verification is successful, the SID list is valid; if the check result indicates a check failure, it indicates that the SID list is invalid.

Based on the scheme provided by the embodiment of the application, on one hand, the first SID can be determined according to the first slice information carried by the message, and the first SID is associated with the slice mapped by the first slice information, so that the purpose of translating the SID into the corresponding slice based on the acquired slice information is achieved; on the other hand, when the message also carries the second SID, the second SID can be used to verify the translated first SID, and the validity of the SID list can be checked.

In one illustrative example, the first device is a head node in a network, the second device is a controller in the network, and the message carrying the first slice information is a border gateway protocol ((Border Gateway Protocol, BGP) message sent by the controller to the head node.

Specifically, the BGP message includes a Segment List TLV carrying a Segment List, and the first slice information is located in a Segment Sub-TLV in the Segment List TLV.

Illustratively, the Segment Sub-TLV includes a first field for carrying first slice information.

The Segment Sub-TLV may further include a second field for carrying association information for instructing the first device to determine the first SID according to the first slice information and the association information.

The Segment Sub-TLV may also include a third field for carrying a second SID for the first device to verify the first SID, for example.

Referring to fig. 4a, a package format of a Segment Sub-TLV is provided in an embodiment of the present application. In the example of fig. 4a, the first field is an NRP-ID field, and the first slice information is located in the NRP-ID field; the second field comprises an SR Algor ith field and an IPv4 Node Address field, and is applied to carrying SR algorithm information and IPv4 Node Address information; the third field is an SR-MPLS SID field, used to carry an optional second SID. Based on the example of fig. 4a, after receiving BGP messages from the controller, the head Node obtains first slice information from NRP-ID fields of BGP messages, obtains SR algorithm information from SR algorithm fields, obtains IPv4 Node Address information from IPv4 Node Address fields, and translates the first slice information, SR algorithm information, and IPv4 Node Address information to obtain a first SID. And if the SR-MPLS SID field carries the second SID, checking the translated first SID and the second SID.

Referring to fig. 4b, a Segment Sub-TLV encapsulation format is provided in an embodiment of the present application. In the example of fig. 4b, the first field is an NRP-ID field, and the first slice information is located in the NRP-ID field; the second field comprises an SR Algorithm field and an IPv6 Node Address field, and is applied to carrying SR Algorithm information and IPv6 Node Address information; the third field is an SR-MPLS SID field, used to carry an optional second SID. Based on the example of fig. 4b, after receiving BGP message from the controller, the head Node obtains first slice information from NRP-ID field of BGP message, obtains SR Algorithm information from SR Algorithm field, obtains IPv6 Node Address information from IPv6 Node Address field, and obtains first SID by translating according to the first slice information, SR Algorithm information, and IPv6 Node Address information. And if the SR-MPLS SID field carries the second SID, checking the translated first SID and the second SID.

Referring to fig. 4c, a Segment Sub-TLV encapsulation format is provided in an embodiment of the present application. In the example of fig. 4c, the first field comprises an NRP-ID field in which the first slice information is located; the second field comprises LocalInterface ID field and IPv4 Node Address field, and carries local interface ID information and IPv4 Node Address information correspondingly; the third field includes an SR-MPLS SID field for carrying an optional second SID. Based on the example of fig. 4c, after receiving BGP message from the controller, the head Node obtains first slice information from NRP-ID field of BGP message, obtains local interface ID information and IPv4 Node Address information from LocalInterface ID field and IPv4 Node Address field, and translates to obtain first SID according to the first slice information, the local interface ID information and the IPv4 Node Address information. And if the SR-MPLS SID field carries the second SID, checking the translated first SID and the second SID.

Referring to fig. 4d, a package format of a Segment Sub-TLV is provided in an embodiment of the present application. In the example of fig. 4d, the first field includes an NRP-ID field in which the first slice information is located; the second field comprises a Local IPv4Address field and a Remote IPv4Address field, and correspondingly carries Local IPv4Address information and Remote IPv4Address information; the third field includes an SR-MPLS SID field for carrying an optional second SID. Based on the example of fig. 4d, after receiving BGP message from the controller, the head node obtains first slice information from NRP-ID field of BGP message, obtains Local IPv4Address information and Remote IPv4Address information from Local IPv4Address field and Remote IPv4Address field, and translates to obtain first SID according to the first slice information, the Local IPv4Address information and the Remote IPv4Address information. And if the SR-MPLS SID field carries the second SID, checking the translated first SID and the second SID.

Referring to fig. 4e, a Segment Sub-TLV encapsulation format is provided in an embodiment of the present application. In the example of fig. 4e, the first field includes an NRP-ID field in which the first slice information is located; the second field comprises LocalInterface ID field, IPv6 Local Node Address field, remote Interface ID field and IPv6 RemoteNode Address field, and correspondingly carries local interface ID information, IPv6 local node address information, remote interface ID information and IPv6 remote node address information; the third field includes an SR-MPLS SID field for carrying an optional second SID. Based on the example of fig. 4e, after the head node receives the BGP message from the controller, the head node obtains first slice information from NRP-ID field of the BGP message, obtains local interface ID information, IPv6 local node address information, remote interface ID information, and IPv6 remote node address information from Local Interface ID field, IPv6 Local Node Address field, remote Interface ID field, and IPv6 Remote Node Address field, and translates the first slice information, the local interface ID information, the IPv6 local node address information, the remote interface ID information, and the IPv6 remote node address information to obtain the first SID. And if the SR-MPLSID field carries the second SID, checking the translated first SID and the second SID.

Referring to fig. 4f, a Segment Sub-TLV encapsulation format is provided in an embodiment of the present application. In the example of fig. 4f, the first field includes an NRP-ID field in which the first slice information is located; the second field comprises a Local IPv6Address field and a Remote IPv6Address field, and correspondingly carries Local IPv6Address information and Remote IPv6Address information; the third field includes an SR-MPLS SID field for carrying an optional second SID. Based on the example of fig. 4f, after receiving BGP message from the controller, the head node obtains first slice information from NRP-ID field of BGP message, obtains Local IPv6Address information and Remote IPv6Address information from Local IPv6Address field and Remote IPv6Address field, and translates to obtain first SID according to the first slice information, local IPv6Address information and Remote IPv6Address information. And if the SR-MPLS SID field carries the second SID, checking the translated first SID and the second SID.

Referring to fig. 4g, a Segment Sub-TLV encapsulation format is provided in an embodiment of the present application. In the example of fig. 4g, the first field includes an NRP-ID field in which the first slice information is located; the second field comprises an SRAlgor ith field and an IPv6 Node Address field, and is applied to carrying SR algorithm information and IPv6 Node Address information; the third field includes a SRv SID field for carrying the optional second SID. Based on the example of fig. 4g, after receiving BGP message from the controller, the head Node obtains first slice information from NRP-ID field of BGP message, obtains SR algorithm information from SR Algor ithm field, obtains IPv6 Node Address information from IPv6 Node Address field, and translates to obtain first SID according to the first slice information, SR algorithm information, and IPv6 Node Address information. If the second SID is carried in the SRv SID field, the translated first SID is checked against the second SID.

Referring to fig. 4h, a package format of a Segment Sub-TLV is provided in an embodiment of the present application. In the example of fig. 4h, the first field includes an NRP-ID field in which the first slice information is located; the second field comprises an SRAlgor ith field, a Local Interface ID field, an IPV6 Local Node Address field, a Renote InterfaceID field and an IPv6 Remote Node Address field, and is applied to carry SR algorithm information, local interface ID information, local IPv6 node address information, remote interface ID information and remote IPv6 node address information; the third field includes a SRv SID field for carrying the optional second SID. Based on the example of fig. 4h, after the head node receives the BGP message from the controller, the head node obtains SR algorithm information from the SRAlgorithm field, obtains first slice information from the NRP-ID field of the BGP message, obtains SR algorithm information, local interface ID information, local IPV6 node address information, remote interface ID information, and remote IPV6 node address information from the Local Interface ID field, IPV6 Local Node Address field, renote Interface ID field, and IPV6 Remote Node Address field, and then translates the first SID according to the first slice information, SR algorithm information, local interface ID information, local IPV6 node address information, remote interface ID information, and remote IPV6 node address information. If the second SID is carried in the SRv SID field, the translated first SID is checked against the second SID.

Referring to fig. 4i, an encapsulation format of a Segment Sub-TLV provided in an embodiment of the present application is shown. In the example of fig. 4i, the first field includes an NRP-ID field in which the first slice information is located; the second field comprises an SRAlgorithm field, a Local IPV6Address field and a remote IPv6Address field, and the SRAlgorithm field, the Local IPV6Address field and the remote IPv6Address field correspondingly carry SR routing information; the third field includes a SRv SID field for carrying the optional second SID. Based on the example of fig. 4i, after receiving BGP message from the controller, the head node obtains first slice information from NRP-ID field of BGP message, obtains SR Algorithm information from SR algoritm field, obtains Local IPV6Address information and remote IPV6Address information from Local IPV6Address field and Renote IPV6Address field, and translates the Local IPV6Address information and the remote IPV6Address information to obtain the first SID according to the first slice information, SR Algorithm information, the first slice information, and the first SID. If the second SID is carried in the SRv SID field, the translated first SID is checked against the second SID.

As an example, assuming that the controller issues a segment sub-TLV carrying first slice information to the head node through BGP protocol, the issued information only carries node or link related information, and does not carry SID information (i.e. does not carry the second SID), the embodiment of the present application includes the following steps S211-S212:

In step S211, the controller sends a segment sub-TLV carrying the first slice information to the head node through BGP protocol.

Specifically, the controller sends SR Policy to the head node through BGP protocol, and the segment sub-TLV under the segment list in the tunnel encapsulation attribute in the SR Policy NLRI carries the first slice information. The Segment list comprises a plurality of segments, each Segment represents a Segment in the path, and the format is as follows: segment List < Segment1, segment2. >, each Segment employs a new Segment sub-TLV encapsulation format defined in any one of fig. 4 a-4 i.

In step S212, after receiving the segment list carrying the slice information, the head node translates the corresponding first SID based on the first slice information and the associated information carried by each segment sub-TLV in the segment list.

For example, a corresponding first SID is translated based on the first slice information, the IPv4 address information, and the SR algorithm information.

As another example, assuming that the controller issues a segment sub-TLV carrying first slice information to the head node through BGP protocol, the issued information carries not only node or link related information but also SID information, and in this case, the embodiment of the present application includes the following steps S221-S223:

In step 221, the controller sends a segment sub-TLV carrying the first slice information to the head node through BGP protocol.

Specifically, the controller sends SR Policy to the head node through BGP protocol, and the first slice information is carried in a segment sub-TLV under a segment list in a tunnel encapsulation attribute in the SR Policy NLRI. The Segment list comprises a plurality of segments, each Segment represents a Segment in the path, and the format is as follows: segment List < Segment1, segment2. >, each Segment employs a new Segment sub-TLV encapsulation format defined in any one of fig. 4 a-4 i. In this example, optional parameters in each segment sub-TLV are also carried, i.e., the segment sub-TLV carries the second SID.

In step 222, after receiving the segment list carrying the slice information, the head node translates the corresponding first SID based on the first slice information and the association information carried by each segment sub-TLV in the segment list.

Step 223, the head node checks the translated first SID with the second SID carried by the segment sub-TLV, after the check is successful, presses the corresponding SID into the SID list, and if the check fails, reports an error to the controller.

In one illustrative example, the first device is a path computation client (path computation client, PCC) and the second device is a path computation element (Path Computation Element, PCE). The PCC may be any network node in the communication network shown in fig. 1 and the PCE may be a controller in the communication network shown in fig. 1.

Specifically, the above-described message carrying the first slice information is a path advertisement message sent by the PCE to the PCC, where the path advertisement message includes a path object sub-object ERO sub-object, and the first slice information is located in the ERO sub-object.

Illustratively, the ERO sub object includes a first field for carrying first slice information.

Fig. 5 is a schematic diagram of an ERO sub object package format in an SR scenario according to an embodiment of the present application. The SR-ERO sub object shown in fig. 5 includes an NRP-ID field, which is the first field described in the embodiment of the present application, and the first slice information is carried in the NRP-ID field.

Please refer to fig. 6, which is a schematic diagram of an ERO sub-object package format in a SRv scenario according to an embodiment of the present application. SRv6-ERO sub-object shown in FIG. 6 includes an NRP-ID field, which is the first field described in the embodiment of the present application, in which the first slice information is carried.

Illustratively, the ERO sub object further includes a second field for carrying association information for instructing the first device to determine the first SID based on the first slice information and the association information.

The SR-ERO sub object shown in fig. 5 includes an Algorithm field, which is the second field described in the embodiment of the present application, and the carried associated information is Algorithm information.

SRv6-ERO sub-object shown in FIG. 6 includes an Algorithm field, which is the second field described in the embodiment of the present application, and the carried associated information is Algorithm information.

Illustratively, the ERO sub object further includes a third field for carrying a second SID for instructing the first device to verify the first SID.

The SR-ERO sub object shown in fig. 5 includes a SID field, which is the third field described in the embodiment of the present application, and the second SID is carried in the SID field.

SRv6-ERO sub-object shown in FIG. 6 includes a SID field, which is the third field described in the embodiments of the present application, in which the second SID is carried.

Illustratively, the ERO SubObject carries a first flag that identifies whether the ERO SubObject carries first slice information.

The SR-ERO sub-object shown in fig. 5 includes a flag R that, when set, indicates that the ERO sub-object carries the first slice information, and that, by default, indicates that the ERO sub-object does not carry the first slice information.

SRv6-ERO sub-object as shown in FIG. 6 includes a flag R which, when set, indicates that ERO sub-object carries first slice information, and which, by default, indicates that ERO sub-object does not carry first slice information.

In some embodiments, the ERO Subobject may also carry a second flag that identifies whether the ERO Subobject carries a second SID.

Illustratively, before the first device receives the message carrying the first slice information sent by the second device, the method further comprises: the first device sends a path computation request message to the second device carrying second slice information, the path computation request message including an LSPA Object, the second slice information being located in the LSPA Object.

It should be appreciated that the PCC sends a path computation request message to the PCE to request the PCE to compute a path. The LSPA Object in the path calculation request message carries second slice information, so that the PCE calculates a corresponding path according to the second slice information carried by the LSPA Object, and adds the calculated path to the path notification message and returns the path notification message to the PCC.

Illustratively, when the ERO sub object carries the second SID, the method of the embodiment of the present application further includes: the first device determines whether the path calculated by the second device is in a slice associated with the second slice information according to the second SID carried by the ERO sub object and the first slice information.

For example, the SR-ERO/SRv6-ERO subobject received by the PCC carries the second SID and the association information in addition to the first slice information, and then the PCC first translates the corresponding first SID according to the first slice information and the association information, and verifies the first SID with the second SID carried by the SR-ERO/SRv6-ERO subobject, and further verifies whether the path obtained by PCE calculation is in the slice associated with the second slice information carried by the LSPA subobject.

Illustratively, before the first device receives the message carrying the first slicing information sent by the second device, the method further comprises at least one of:

the first device receives a first capability negotiation message sent by the second device, wherein the first capability negotiation message comprises a PCE capability Sub-TLV, and the PCE capability Sub-TLV carries a third mark which is used for identifying that the second device has the first capability; and/or the number of the groups of groups,

the first device sends a second capability negotiation message to the second device, wherein the second capability negotiation message comprises a PCC capability Sub-TLV, and the PCC capability Sub-TLV carries a fourth mark, and the fourth mark is used for identifying that the first device has the second capability.

Illustratively, the first capability includes at least one of: the ability to calculate paths within a slice based on the second slice information in the path calculation request message, the ability to actively calculate paths within a slice, the ability to carry the first slice information at the ERO sub-object.

Illustratively, the second capability includes at least one of: the second device is requested to calculate the capabilities of the path within the slice, the capabilities of parsing the first slice information carried by the ERO sub object.

It should be understood that, before performing information interaction with the PCC, for example, before sending a path advertisement message to the PCC, the PCE performs capability negotiation with the PCC, and sends a first capability negotiation message to the PCC, where the first capability negotiation message includes a PCE capability Sub-TLV, an encapsulation format of the PCE capability Sub-TLV in an SR scenario may refer to fig. 7, and a new flag bit R is defined in the SR PCE capability Sub-TLV, to identify the capability of the PCE supporting carrying first slice information in the SR-ERO Sub-object, the capability of the PCE supporting actively calculating a path in a slice, and the capability of the PCE supporting calculating a path based on slice information; the encapsulation format of the PCC capability PCE capability Sub-TLV in the SRv scenario may be seen in fig. 8, where a new flag bit R is defined in SRv PCE capability Sub-TLV for identifying that the PCE supports the capability of carrying the first slice information in SRv-ERO Sub-object, the PCE supports the capability of actively calculating paths within the slice, and the PCE supports the capability of calculating paths based on the slice information.

It should be understood that, before sending the path computation request to the PCE, the PCC also performs capability negotiation with the PCE, and the PCC sends a second capability negotiation message to the PCE, where the second capability negotiation message includes an SR/SRv6PCC capability Sub-TLV, and a new flag bit R is defined in the SR/SRv PCC capability Sub-TLV, to identify that the capability of carrying the second slice information in the SR/SRv LSPA Object and the capability of carrying the slice information message sent by the PCE are supported.

In one possible example, an embodiment of the present application includes the steps of:

in step S310, the PCE and PCC perform capability negotiation with each other.

Specifically, a mark R in a PCE capability Sub-TLV sent by the PCE to the PCC is set, so that the PCC knows that ERO Sub object support carries first slice information, the PCE supports calculating a path based on slice information, and the PCE supports actively calculating a path in a slice; the PCC sets a flag R in a PCC capability Sub-TLV sent to the PCE, so that the PCE knows that the LSPA Object supports carrying the second slice information and that the PCC has the capability of analyzing the message carrying the slice information sent by the PCE.

Step S320, the PCC sends a path computation request message carrying the second slice information to the PCE;

specifically, the second slice information is located in the LSPA Object of the path computation request message.

Step S330, the PCE receives the path calculation request message from the PCC and calculates a path according to the second slice information in the path calculation request message;

step S340, after the PCE encapsulates the path notification message, the PCE sends the path notification message to the PCC;

specifically, the path advertisement message includes an ERO sub object.

Step S350, the PCC receives the path notification message from the PCE, judges whether the ERO Subobject carries the first slice information according to the first mark in the ERO Subobject of the path notification message, and/or judges whether the ERO Subobject carries the second SID according to the second mark in the ERO Subobject;

step S360, when the ERO sub-object is determined to carry first slice information, the PCC calculates and obtains a first SID according to the first slice information and the associated information in the ERO sub-object;

in step S370, when it is determined that the ERO sub-object carries the second SID, the PCC checks the calculated first SID with the second SID carried by the ERO sub-object to determine whether the path calculated by the PCE is in the slice associated with the second slice information.

In another possible example, an embodiment of the present application includes the steps of:

in step S410, the PCE and PCC perform capability negotiation with each other.

Specifically, a mark R in a PCE capability Sub-TLV sent by the PCE to the PCC is set, so that the PCC knows that ERO Sub object support carries first slice information, the PCE supports calculating a path based on the first slice information, and the PCE supports actively calculating the path in the slice; the PCC sets a flag R in a PCC capability Sub-TLV sent to the PCE, so that the PCE knows that the LSPA Object supports carrying the second slice information and that the PCC has the capability of analyzing the message carrying the slice information sent by the PCE.

Step S420, the PCE actively calculates a path in a certain slice and sends a path notification message carrying first slice information to the PCC;

step S430, the PCC receives the path notification message sent by the PCE, judges whether the ERO Subobject carries the first slice information according to the first mark in the ERO Subobject of the path notification message, and/or judges whether the ERO Subobject carries the second SID according to the second mark in the ERO Subobject;

step S440, when it is determined that the ERO sub-object carries the first slice information, the PCC calculates the first SID according to the first slice information and the associated information in the ERO sub-object;

in step S450, when it is determined that the ERO Subobject carries the second SID, the PCC checks the calculated first SID with the second SID carried by the ERO Subobject.

In an exemplary embodiment of the present application, the first device is a controller, and the second device is a node in the network; the message carrying the first slice information described above is a border gateway protocol Link State (BGP-LS) message sent by the node to the controller.

Illustratively, the BGP-LS message includes SR Policy State TLVs, SR Policy State TLVs includes SR Segment Sub-TLVs including Segment descriptors including a first field for carrying the first slice information. A node in the network advertises to the controller a Segment descriptor carrying the first slice information.

The Segment descriptor further includes a second field for carrying association information for instructing the first device to determine the first SID based on the first slice information and the association information.

Referring to fig. 9a, a schematic diagram of a package format of a Segment descriptor applied to an SR-MPLS scenario is provided in an embodiment of the present application, where in the example of fig. 9a, the Segment descriptor includes an NRP-ID field, and first slice information is carried through the NRP-ID field.

Referring to fig. 9b, a schematic diagram of a package format of a Segment descriptor applied to a SRv scene according to an embodiment of the present application is provided, where in the example of fig. 9b, the Segment descriptor includes an NRP-ID field, and the NRP-ID field carries first slice information.

Referring to fig. 9c, a schematic diagram of an encapsulation format of a Segment descriptor applied to an SR-MPLS scenario is provided in an embodiment of the present application, where in the example of fig. 9c, the Segment descriptor includes an NRP-ID field for carrying first slice information, and includes an IPv4 Node Address field for carrying association information, and association information carried by the IPv4 Node Address field is IPv4 Node Address information.

Referring to fig. 9d, a schematic diagram of an encapsulation format of a Segment descriptor applied to an SR-MPLS scenario is provided in an embodiment of the present application, where in the example of fig. 9d, the Segment descriptor includes an NRP-ID field for carrying first slice information, and includes an IPv6 Node Address field for carrying association information, and association information carried by the IPv6 Node Address field is IPv6 Node Address information.

Referring to fig. 9e, a schematic diagram of an encapsulation format of a Segment descriptor applied to an SR-MPLS scenario is provided in this embodiment, where in the example of fig. 9e, the Segment descriptor includes an NRP-ID field for carrying first slice information, and includes an IPv4 Node Address field and a Local Interface ID field for carrying association information, association information carried by the IPv4 Node Address field is IPv4 Node Address information, and association information carried by the Local Interface ID field is local interface ID information.

Referring to fig. 9f, a schematic diagram of an encapsulation format of a Segment descriptor applied to an SR-MPLS scenario is provided in an embodiment of the present application, where in the example of fig. 9f, the Segment descriptor includes an NRP-ID field for carrying first slice information, and includes an IPv4 Node Address field and a Remote Interface ID field for carrying association information, association information carried by the IPv4 Node Address field is IPv4 Node Address information, and association information carried by the Remote Interface ID field is remote interface ID information.

Referring to fig. 9g, a schematic diagram of an encapsulation format of a Segment descriptor applied to an SR-MPLS scenario is provided in this embodiment, where in the example in fig. 9g, the Segment descriptor includes an NRP-ID field for carrying first Segment information, and includes an IPv6Local Node Global Address field, local Node Interface ID field, an IPv6 Remote Node Global Address field, and a Remote Node Interface ID field for carrying association information, association information carried by the IPv6Local Node Global Address field is global address information of an IPv6local node, association information carried by the Local Node Interface ID field is local node interface ID information, association information carried by the IPv6 Remote Node Global Address field is global address information of an IPv6 remote node, and association information carried by the Remote Node Interface ID field is remote node interface ID information.

Referring to fig. 9h, a schematic diagram of an encapsulation format of a Segment descriptor applied to an SR-MPLS scenario is provided in an embodiment of the present application, where in the example in fig. 9h, the Segment descriptor includes an NRP-ID field for carrying first slice information, and includes an IPv6 Local Interface Address field and an IPv6 Remote Interface Address field for carrying association information, association information carried by the IPv6 Local Interface Address field is IPv6 local interface address information, and association information carried by the IPv6 Remote Interface Address field is IPv6 remote interface address information.

Referring to fig. 9i, a schematic diagram of an encapsulation format of a Segment descriptor applied to a SRv scenario is provided in an embodiment of the present application, where in the example of fig. 9i, the Segment descriptor includes an NRP-ID field for carrying first slice information, and includes an IPv6 Node Global Address field for carrying association information, and the association information carried by the IPv6 Node Global Address field is IPv6 node global address information.

Referring to fig. 9j, a schematic diagram of an encapsulation format of a Segment descriptor applied to a SRv scenario is provided in an embodiment of the present application, where in the example of fig. 9j, the Segment descriptor includes an NRP-ID field for carrying first slice information, and includes IPV6 Local Node Global Address fields, local Node Interface ID fields, IPV6 Remote Node Global Address fields, and Remote Node Interface ID fields for carrying association information, where the association information carried correspondingly is IPV6 local node global address information, local node interface ID information, IPV6 remote node global address information, and remote node interface ID information.

Referring to fig. 9k, a schematic diagram of an encapsulation format of a Segment descriptor applied to a SRv scenario is provided in this embodiment of the present application, where in the example of fig. 9k, the Segment descriptor includes an NRP-ID field for carrying first slice information, and includes a Global IPv6 Local Interface Address field and a Global IPv6Remote Interface Address field for carrying association information, association information carried by the Global IPv6 Local Interface Address field is Global IPv6 local interface address information, and association information carried by the Global IPv6Remote Interface Address field is Global IPv6remote interface address information.

Referring to fig. 9l, a schematic diagram of a package format of a Segment descriptor applied to a SRv scene is provided in an embodiment of the present application, in the example of fig. 9l, slice information of the Segment descriptor is carried in a newly defined NRP SRv6 endpoint behavior TLV, the Segment descriptor includes an NRP-ID field for carrying first slice information, and includes an algoritm field for carrying associated information, where the associated information carried by the algoritm field is Algorithm information.

Illustratively, the SR Segment Sub-TLV may carry a fourth flag for identifying whether the Segment descriptor carries the first slice information.

It should be appreciated that the controller may receive a message carrying the first slice information from a node in the network and then derive the SID of the associated slice of the first slice information from the first slice information.

It should be appreciated that the controller may also receive a message carrying the first slice information and the association information from a node in the network and then derive the SID of the associated slice of the first slice information from the first slice information and the association information.

The embodiment of the application also provides an information processing method, which includes, but is not limited to, the following step S510:

in step S510, the second device sends a message carrying the first slice information to the first device, so that the first device determines a first segment identifier SID according to the first slice information, where the first SID represents a SID associated with the first slice information.

The first SID is determined by the first device according to the first slice information and the association information.

Wherein the association information includes at least one of: segment routing algorithm information, internet protocol IP prefix, local IP node address information, remote IP node address information, local interface ID information, remote interface ID information, local IP address information, remote IP address information.

The message carrying the first slicing information also carries a second SID, which is used to instruct the first device to verify the first SID according to the second SID.

In an exemplary embodiment of the present application, the first device is a head node in a network, the second device is a controller, and the message carrying the first slice information is a border gateway protocol BGP message sent by the controller to the head node.

Illustratively, the BGP message includes a Segment List TLV carrying a Segment List, with the first slice information located in a Segment Sub-TLV of the Segment List TLV.

The Segment Sub-TLV further includes a second field, where the second field is configured to carry association information, and the association information is configured to instruct the first device to determine the first SID according to the first slice information and the association information.

The Segment Sub-TLV also includes a third field for carrying a second SID, which is used by the head node to verify the first SID, for example.

In an exemplary embodiment of the present application, the first device is a path computation client PCC, the second device is a path computation element PCE, the message carrying the first slice information is a path advertisement message sent by the PCE to the PCC, the path advertisement message includes a path object sub-object ERO sub-object, and the first slice information is located in the ERO sub-object.

Illustratively, the ERO sub-object may also carry a second flag identifying whether the ERO sub-object carries a second SID.

The method further comprises, prior to the second device sending the message carrying the first slice information to the first device, at least one of:

the second device sends a first capability negotiation message to the first device, wherein the first capability negotiation message comprises a PCE capability Sub-TLV, and the PCE capability Sub-TLV carries a third mark which is used for identifying that the second device has the first capability; and/or the number of the groups of groups,

the second device receives a second capability negotiation message sent by the first device, wherein the second capability negotiation message comprises a PCC capability Sub-TLV, and the PCC capability Sub-TLV carries a fourth flag, and the fourth flag is used for identifying that the first device has the second capability.

Wherein the first capability includes at least one of: the ability to calculate paths within the slice based on the second slice information in the path calculation request message, the ability to actively calculate paths within the slice, the ability to carry the first slice information at the ERO sub-object;

the second capability includes at least one of: the second device is requested to calculate the capabilities of the path within the slice, the capabilities of parsing the first slice information carried by the ERO sub object.

Illustratively, before the second device sends the message carrying the first slice information to the first device, the method further comprises:

the second device receives a path computation request message carrying second slice information sent by the first device, where the path computation request message includes an LSPA Object, and the second slice information is located in the LSPA Object.

Illustratively, the ERO sub-object further includes a third field for carrying a second SID, where the second SID is used to instruct the first device to determine, according to the second SID carried by the ERO sub-object and the first slice information, whether the path calculated by the second device is within the slice associated with the second slice information.

In an exemplary embodiment of the present application, the first device is a controller, and the second device is a node in the network; the message carrying the first slice information is a BGP-LS message sent by the node to the controller.

Illustratively, the BGP-LS message includes SR Policy State TLVs, SR Policy State TLVs includes SR Segment Sub-TLVs including Segment descriptors including a first field for carrying the first slice information.

Illustratively, the SR Segment Sub-TLV carries a fourth flag for identifying whether the Segment descriptor carries the first slice information.

The embodiment of the application further provides an electronic device, as shown in fig. 10, where the electronic device 900 includes, but is not limited to:

a processor 910 and a memory 920;

the memory 920 has stored thereon program instructions that, when executed by the processor 910, cause the processor 910 to perform the information processing method as described in any of the embodiments above.

In a specific embodiment, the electronic device may be configured to implement each step of the information processing method corresponding to the first device in the method embodiment.

In another specific embodiment, the electronic device may be configured to implement each step of the information processing method corresponding to the second device in the method embodiment.

It should be appreciated that the processor 910 and the memory 920 described above may be connected by a bus or other means.

It should be appreciated that the processor 910 may employ a central processing unit (Central Processing Unit, CPU). The processor may also be other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), field programmable gate arrays (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. Or the processor 910 may employ one or more integrated circuits for executing associated programs to perform the techniques provided in the embodiments of the present application.

The memory 920 is used as a non-transitory computer readable storage medium for storing a non-transitory software program and a non-transitory computer executable program, such as an information processing method executed on the electronic device side as described in any embodiment of the present application. The processor 910 implements the information processing method described above by running a non-transitory software program and instructions stored in the memory 920.

Memory 920 may include a storage program area that may store an operating system, at least one application required for functionality, and a storage data area; the storage data area may store training methods that perform the information processing methods or spectrum sensing models described above. In addition, memory 920 may include high-speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid state storage device. In some implementations, the memory 920 may optionally include memory located remotely from the processor 910, which may be connected to the processor 910 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The non-transitory software programs and instructions required to implement the information processing methods described above are stored in memory 920, which when executed by one or more processors 910, perform the information processing methods provided by any of the embodiments of the present application.

The embodiment of the application also provides a computer readable storage medium, and the computer readable storage medium stores program instructions, which when executed by a computer, implement the method for receiving a reference signal as described in any embodiment above, or implement the method for processing information as described in any embodiment above.

In a specific embodiment, the above-mentioned computer readable storage medium may be used to implement the steps of the information processing method corresponding to the first device in the above-mentioned method embodiment.

In another specific embodiment, the above-mentioned computer readable storage medium may be used to implement the steps of the information processing method corresponding to the second device in the above-mentioned method embodiment.

Any combination of one or more computer readable media may be employed as the computer storage media of the embodiments herein. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

The computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Computer program code for carrying out operations for the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, sma l lta l k, C++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).

The present embodiments provide a computer program product storing program instructions that, when run on a computer, cause the computer to implement the information processing method described in any of the above embodiments.

In a specific embodiment, the above-mentioned computer program product may be used to implement the steps of the information processing method corresponding to the first device in the above-mentioned method embodiment.

In another specific embodiment, the computer program product may be used to implement the steps of the information processing method corresponding to the second device in the method embodiment.

While the preferred embodiments of the present application have been described in detail, the present application is not limited to the above embodiments, and various equivalent modifications and substitutions can be made by those skilled in the art without departing from the spirit and scope of the present application, and these equivalent modifications and substitutions are intended to be included in the scope of the present application.

Claims

1. An information processing method, the method comprising:

2. The method of claim 1, wherein the message carrying the first slice information further carries associated information;

the first device determines a first segment identification SID according to the first slice information, including:

the first device determines the first SID according to the first slice information and the association information;

wherein the association information includes at least one of: algorithm information, internet protocol IP prefix, local IP node address information, remote IP node address information, local interface ID information, remote interface ID information, local IP address information, remote IP address information.

3. The method of claim 2, wherein the message carrying the first slicing information further carries a second SID; the method further comprises the steps of:

and checking the first SID and the second SID to determine a SID checking result.

4. The method of claim 1, wherein the first device is a head node in a network, the second device is a controller, and the message carrying the first slice information is a border gateway protocol BGP message sent by the controller to the head node.

5. The method of claim 4, wherein the BGP message includes a Segment List TLV that carries a Segment List, and wherein the first Segment information is located in a Segment Sub-TLV of the Segment List TLV.

6. The method of claim 5, wherein the Segment Sub-TLV includes a first field for carrying the first slice information.

7. The method of claim 6, wherein the Segment Sub-TLV further comprises a second field, the second field for carrying association information, the association information for instructing the first device to determine the first SID based on the first slice information and the association information.

8. The method of claim 6, wherein the Segment Sub-TLV further comprises a third field for carrying a second SID for the first device to verify the first SID.

9. The method of claim 1, wherein the first device is a path computation client PCC, the second device is a path computation element PCE, and the message carrying first slice information is a path advertisement message sent by the PCE to the PCC, the path advertisement message including a path object sub-object ERO sub-object, the first slice information being located in the ERO sub-object.

10. The method of claim 9, wherein the ERO sub object comprises a first field for carrying the first slice information.

11. The method of claim 10, wherein the ERO sub-object further comprises a second field for carrying association information for instructing the first device to determine the first SID based on the first slice information and the association information.

12. The method of claim 10, wherein the ERO sub-object further comprises a third field for carrying a second SID, the second SID for instructing the first device to verify the first SID.

13. The method of claim 9, wherein the ERO sub-object carries a second flag that identifies whether the ERO sub-object carries a second SID.

14. The method of claim 9, wherein the ERO sub-object carries a first flag that identifies whether the ERO sub-object carries the first slice information.

15. The method of claim 9, wherein before the first device receives the message carrying the first slice information sent by the second device, the method further comprises at least one of:

The first device receives a first capability negotiation message sent by the second device, wherein the first capability negotiation message comprises a PCE capability Sub-TLV, the PCE capability Sub-TLV carries a third mark, and the third mark is used for identifying that the second device has the first capability; and/or the number of the groups of groups,

the first device sends a second capability negotiation message to the second device, wherein the second capability negotiation message comprises a PCC capability Sub-TLV, the PCC capability Sub-TLV carries a fourth mark, and the fourth mark is used for identifying that the first device has the second capability;

wherein the first capability includes at least one of: the method comprises the steps of calculating the capacity of a path in a slice based on second slice information in a path calculation request message, the capacity of actively calculating the path in the slice, and the capacity of carrying first slice information at the ERO sub object;

the second capability includes at least one of: requesting a second device to calculate the capability of a path within a slice, and resolving the first slice information carried by the ERO sub-object.

16. The method of claim 9, wherein before the first device receives the message carrying the first slice information sent by the second device, the method further comprises:

The first device sends a path computation request message to the second device carrying second slice information, the path computation request message including an LSPA Object, the second slice information being located in the LSPA Object.

17. The method of claim 16, wherein the ERO sub object further comprises a third field for carrying a second SID, the method further comprising:

and the first device determines whether a path calculated by the second device is in a slice associated with the second slice information according to the second SID carried by the ERO sub object and the first slice information.

18. The method of claim 1, wherein the first device is a controller and the second device is a node in a network; the message carrying the first slice information is a border gateway protocol link state BGP-LS message sent by the node to the controller.

19. The method of claim 18, wherein the BGP-LS message includes SR Policy State TLVs, wherein the SR Policy State TLVs includes an SR Segment Sub-TLV that includes a Segment descriptor that includes a first field for carrying the first slice information.

20. The method of claim 19, wherein the Segment descriptor further comprises a second field for carrying association information for instructing the first device to determine the first SID based on the first slice information and the association information.

21. The method of claim 19, wherein the SR Segment Sub-TLV carries a fourth flag that identifies whether the Segment descriptor carries the first slice information.

22. An information processing method, the method comprising:

23. The method of claim 22, wherein the message carrying first slicing information further carries association information for instructing the first device to determine the first SID based on the first slicing information and the association information;

24. The method of claim 22, wherein the message carrying the first slicing information further carries a second SID, the second SID being used to instruct the first device to verify the first SID based on the second SID.

25. The method of claim 22, wherein the first device is a head node in a network, the second device is a controller, and the message carrying the first slice information is a border gateway protocol BGP message sent by the controller to the head node.

26. The method of claim 25, wherein the BGP message includes a Segment List TLV that carries a Segment List, and wherein the first Segment information is located in a Segment Sub-TLV of the Segment List TLV.

27. The method of claim 26, wherein the Segment Sub-TLV includes a first field for carrying the first slice information.

28. The method of claim 27, wherein the Segment Sub-TLV further comprises a second field, the second field for carrying association information, the association information for instructing the first device to determine the first SID based on the first slice information and the association information.

29. The method of claim 27, wherein the Segment Sub-TLV further comprises a third field for carrying a second SID, the second SID being used by the head node to verify the first SID.

30. The method of claim 22, wherein the first device is a path computation client, PCC, and the second device is a path computation element, PCE, and the message carrying the first slice information is a path advertisement message sent by the PCE to the PCC, the path advertisement message including a path object sub-object, ERO sub-object, in which the first slice information is located.

31. The method of claim 30, wherein the ERO sub object comprises a first field for carrying the first slice information.

32. The method of claim 31, wherein the ERO sub-object further comprises a second field for carrying association information for instructing the first device to determine the first SID based on the first slice information and the association information.

33. The method of claim 32, wherein the ERO sub-object further comprises a third field for carrying a second SID, the second SID for instructing the first device to verify the first SID.

34. The method of claim 33, wherein the ERO sub-object carries a second flag that identifies whether the ERO sub-object carries a second SID.

35. The method of claim 34, wherein the ERO sub-object carries a first flag that identifies whether the ERO sub-object carries the first slice information.

36. The method of claim 30, wherein before the second device sends the message carrying the first slice information to the first device, the method further comprises at least one of:

the second device sends a first capability negotiation message to the first device, wherein the first capability negotiation message comprises a PCE capability Sub-TLV, the PCE capability Sub-TLV carries a third mark, and the third mark is used for identifying that the second device has the first capability; and/or the number of the groups of groups,

the second device receives a second capability negotiation message sent by the first device, wherein the second capability negotiation message comprises a PCC capability Sub-TLV, the PCC capability Sub-TLV carries a fourth mark, and the fourth mark is used for identifying that the first device has the second capability;

37. The method of claim 30, wherein before the second device sends the message carrying the first slice information to the first device, the method further comprises:

the second device receives a path computation request message carrying second slice information sent by the first device, wherein the path computation request message comprises an LSPA Object, and the second slice information is located in the LSPA Object.

38. The method of claim 37, wherein the ERO sub-object further comprises a third field for carrying a second SID for instructing the first device to determine whether a path calculated by the second device is within a slice associated with the second slice information based on the second SID carried by the ERO sub-object and the first slice information.

39. The method of claim 22, wherein the first device is a controller and the second device is a node in a network; the message carrying the first slice information is a BGP-LS message sent by the node to the controller.

40. The method of claim 39, wherein the BGP-LS message includes SR Policy State TLVs, wherein the SR Policy State TLVs includes an SR Segment Sub-TLV that includes a Segment descriptor that includes a first field for carrying the first slice information.

41. The method of claim 40, wherein the Segment descriptor further comprises a second field for carrying association information for instructing the first device to determine the first SID based on the first slice information and the association information.

42. The method of claim 40, wherein the SR Segment Sub-TLV carries a fourth flag for identifying whether the Segment descriptor carries the first slice information.

43. An electronic device, comprising:

A processor and a memory;

the memory has stored thereon program instructions that, when executed by the processor, cause the processor to perform:

the information processing method according to any one of claims 1 to 21; or,

the information processing method according to any one of claims 22 to 42.

44. A computer readable storage medium storing program instructions that when executed by a computer implement:

the information processing method according to any one of claims 1 to 21; or,

the information processing method according to any one of claims 22 to 42.

45. A computer program product, characterized in that the computer program product stores program instructions that, when executed by a computer, cause the computer to implement:

the information processing method according to any one of claims 1 to 21; or,

the information processing method according to any one of claims 22 to 42.