WO2021164402A1 - 路由方法、路由装置及计算机可读存储介质 - Google Patents

路由方法、路由装置及计算机可读存储介质 Download PDF

Info

Publication number
WO2021164402A1
WO2021164402A1 PCT/CN2020/137252 CN2020137252W WO2021164402A1 WO 2021164402 A1 WO2021164402 A1 WO 2021164402A1 CN 2020137252 W CN2020137252 W CN 2020137252W WO 2021164402 A1 WO2021164402 A1 WO 2021164402A1
Authority
WO
WIPO (PCT)
Prior art keywords
segment identifier
different
node
segment
algorithm type
Prior art date
Application number
PCT/CN2020/137252
Other languages
English (en)
French (fr)
Inventor
彭少富
赵德涛
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to EP20920203.5A priority Critical patent/EP4109831A4/en
Priority to US17/758,517 priority patent/US20230033298A1/en
Publication of WO2021164402A1 publication Critical patent/WO2021164402A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003—Managing SLA; Interaction between SLA and QoS
    • H04L41/5019—Ensuring fulfilment of SLA
    • H04L41/5022—Ensuring fulfilment of SLA by giving priorities, e.g. assigning classes of service
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/32—Flooding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0894—Policy-based network configuration management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/126—Shortest path evaluation minimising geographical or physical path length
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/302—Route determination based on requested QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation

Definitions

  • the embodiments of the present application relate to, but are not limited to, the field of communication technologies, and in particular, to a routing method, a routing device, and a computer-readable storage medium.
  • the core requirement of 5G network slices for the bearer network is that different network slices need to have their own dedicated bearer sub-networks. Different dedicated bearer sub-networks can have strict hard resource isolation or close to hard isolation. The effect of soft isolation. Since the packet network cannot support hard isolation, in order to support the 5G network slicing requirements, the packet network needs to be sliced on the underlying network resources to meet the needs of different upper-layer services.
  • the existing method is to use the Interior Gateway Protocol (IGP) flexible algorithm (Flex Algorithm, FA) technology to run multiple IGP algorithms in the same topology to calculate multiple FA planes, and each FA plane can represent one A network slice can carry different upper-layer service traffic on different FA planes.
  • IGP Interior Gateway Protocol
  • FA Flexible Algorithm
  • the current FA technology cannot support differentiated processing of quality of service (QoS) policies between different network slices on the same link.
  • QoS quality of service
  • the existing mechanism only the traditional QoS policy can be configured on the link.
  • the corresponding QoS policy can be implemented on the traffic sent to the link according to the flow classification result.
  • this flow classification method is only related to the link and is related to sharing.
  • the different network slices of the link are irrelevant, and the traffic of different network slices cannot be distinguished; in addition, the QoS policy implemented according to this flow classification method is also independent of the network slice, that is, the multiple network slices sharing the link are shared
  • the QoS policy configured on this link cannot implement differentiated QoS policies for different network slices.
  • embodiments of the present application provide a routing method, a routing device, and a computer-readable storage medium.
  • the embodiments of the present application provide a routing method, which includes: assigning segment identifiers corresponding to the corresponding algorithm types to each network slice corresponding to different algorithm types, and generalizing through the internal gateway protocol IGP protocol.
  • the segment identifier; each of the network slices is configured with a quality of service QoS policy corresponding to the corresponding algorithm type; and a message is forwarded based on the segment identifier and the QoS policy.
  • an embodiment of the present application also provides a routing method, including: receiving different segment identifiers flooded through the interior gateway protocol IGP protocol, wherein the different segment identifiers are associated with different algorithm types and different algorithm types.
  • Network slices correspond to each other, and different network slices correspond to different algorithm types; receiving packets forwarded based on different segment identifiers and different quality of service QoS policies, where the different QoS policies are It is configured in different network slices, and different QoS policies correspond to different algorithm types.
  • an embodiment of the present application also provides a routing device, including: a memory, a processor, and a computer program stored on the memory and running on the processor, wherein when the processor executes the computer program Implement the routing method of the second aspect as described above or implement the routing method of the third aspect as described above.
  • an embodiment of the present application also provides a computer-readable storage medium that stores computer-executable instructions, and the computer-executable instructions are used to execute the above routing method.
  • FIG. 1 is a schematic diagram of a network topology for executing a routing method according to an embodiment of the present application
  • FIG. 2 is a flowchart of a routing method provided by an embodiment of the present application.
  • FIG. 3A is a schematic diagram of a segment identifier substructure of a field used to indicate an algorithm type provided by an embodiment of the present application
  • FIG. 3B is a schematic diagram of a segment identifier substructure of a field indicating an algorithm type provided by another embodiment of the present application.
  • FIG. 4A is a schematic diagram of a segment identifier substructure of a field indicating an algorithm type provided by another embodiment of the present application.
  • 4B is a schematic diagram of a segment identifier substructure of a field used to indicate an algorithm type provided by another embodiment of the present application;
  • FIG. 5A is a schematic diagram of a segment identifier substructure used to indicate an algorithm type field provided by another embodiment of the present application.
  • FIG. 5B is a schematic diagram of a segment identifier substructure used to indicate an algorithm type field provided by another embodiment of the present application.
  • FIG. 6 is a flowchart of packet forwarding in the routing method provided by another embodiment of the present application.
  • FIG. 7 is a flowchart of packet forwarding in a routing method provided by another embodiment of the present application.
  • FIG. 8 is a flowchart of establishing a first label forwarding entry in a routing method provided by another embodiment of the present application.
  • FIG. 9 is a flowchart of establishing a routing forwarding entry in a routing method provided by another embodiment of the present application.
  • FIG. 10 is a flowchart of packet forwarding in a routing method provided by another embodiment of the present application.
  • FIG. 11 is a schematic diagram of a network topology for executing a routing method according to another embodiment of the present application.
  • FIG. 12 is a schematic diagram of a network topology for executing a routing method according to another embodiment of the present application.
  • FIG. 13 is a flowchart of a routing method provided by another embodiment of the present application.
  • Fig. 14 is a schematic diagram of a routing device provided by an embodiment of the present application.
  • the embodiments of the present application provide a routing method, a routing device, and a computer-readable storage medium.
  • Each network slice corresponding to different algorithm types is assigned a segment identifier corresponding to the corresponding algorithm type, and the segment is flooded through the IGP protocol.
  • the identifier can make each node in the current IGP protocol domain save the segment identifier corresponding to the corresponding algorithm type of all nodes in the current IGP protocol domain. Therefore, when the packets of different network slices are in the current IGP protocol domain according to the segment identifier When forwarding, it can be distinguished according to different algorithm types, that is, it can distinguish and isolate the traffic between different network slices.
  • the message is forwarded based on the segment identifier corresponding to the corresponding algorithm type, even if different network slices are shared When the same link is used, traffic differentiation and isolation between different network slices can also be realized; in addition, since each network slice is configured with a QoS policy corresponding to the corresponding algorithm type, different network slices can be made to correspond to different QoS policies.
  • the packets of different network slices when the packets of different network slices are forwarded according to the corresponding segment identifier in the current IGP protocol domain, the packets of each network slice can correspond to a QoS policy, so that differentiated QoS policies can be implemented for different network slices ; Since the packets of different network slices correspond to different segment identifiers and QoS policies, even if different network slices share the same link, different network slices can be implemented with differentiated QoS policies.
  • Fig. 1 is a schematic diagram of a network topology for executing a routing method according to an embodiment of the present application.
  • the network topology includes a first node 110, a second node 120, and a third node 130 connected in sequence, wherein two adjacent nodes are connected through a physical link.
  • the first node 110, the second node 120, and the third node 130 may be network devices such as routers or switches, which can forward packets.
  • the network topology may also include a network controller (not shown in FIG. 1), such as a software defined network (Software Defined Network, SDN) controller, etc.
  • SDN Software Defined Network
  • the first node 110, the second node 120, the third node 130, and the network controller respectively include a memory and a processor, where the memory and the processor may be connected by a bus or in other ways.
  • the memory can be used to store non-transitory software programs and non-transitory computer-executable programs.
  • the memory may include a high-speed random access memory, and may also include a non-transitory memory, such as at least one magnetic disk storage device, a flash memory device, or other non-transitory solid-state storage devices.
  • the memory may optionally include a memory remotely arranged with respect to the processor, and these remote memories may be connected to the processor through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.
  • FIG. 1 do not constitute a limitation to the embodiment of the present application, and may include more or fewer components than those shown in the figure, or combine certain components, or Different component arrangements.
  • each node can call its stored routing program to execute the routing method; or, the network controller can call its stored routing program and cooperate with each node to execute the routing method.
  • FIG. 2 is a flowchart of a routing method provided by an embodiment of the present application.
  • the routing method includes but is not limited to step S100, step S200, and step S300.
  • Step S100 Assign segment identifiers corresponding to the corresponding algorithm types to each network slice corresponding to different algorithm types, and flood the segment identifiers through the interior gateway protocol IGP protocol.
  • IGP FA technology can be used first, and multiple IGP algorithms are run in the same topology to calculate multiple FA planes, where each FA plane represents a network slice, and each network slice corresponds to one type. Algorithm type. On this basis, each network slice corresponding to different algorithm types is assigned a segment identifier corresponding to the corresponding algorithm type. Therefore, each network slice is assigned a segment identifier, and each segment identifier All correspond to an algorithm type; in addition, through the flooding segment identifier of the IGP protocol, each node in the current IGP protocol domain can save the segment identifier of all nodes in the current IGP protocol domain, and the segment identifier corresponding to each network slice Segment identifiers correspond to an algorithm type.
  • packets of different network slices are forwarded according to the segment identifier in the current IGP protocol domain, they can be distinguished according to different algorithm types, so that different network slices can be distinguished and isolated. Because the packets are forwarded based on the segment identifier corresponding to the corresponding algorithm type, even when different network slices share the same link, the traffic differentiation and isolation between different network slices can be realized.
  • the IGP FA technology is an algorithm applied to the IGP protocol.
  • a set of algorithm constraints can be defined as needed, and a forwarding path that satisfies the algorithm constraints can be generated based on the algorithm constraints. Based on these forwarding paths, a network slice dedicated to specific business traffic is generated.
  • the segment identification can have different implementations.
  • the application scenario is SR-MPLS (Segment Routing MPLS, segment routing is applied to the multi-protocol label switching forwarding plane) scenario
  • the segment identifier assigned to the network slice includes the prefix segment identifier (Prefix SID) corresponding to the node and the The adjacent segment identifier (Adjacency SID) corresponding to the link.
  • Prefix SID prefix segment identifier
  • Adjacency SID The adjacent segment identifier
  • the first node 110 1, for the first node 110, it belongs to the first network slice FA-128 and the second network slice FA-129, so it can target the first network slice FA-128 assigns the first prefix segment identifier Prefix-SID-128, and for the second network slice FA-129 assigns the second prefix segment identifier Prefix-SID-129, and then floods the first prefix segment identifier Prefix-SID- through the IGP protocol 128 and the second prefix segment identifier Prefix-SID-129; since the first link Link1 connecting the first node 110 also belongs to the first network slice FA-128 and the second network slice FA-129, the first node 110 can Assign the first adjacent segment identifier Adj-SID-128 and the second adjacent segment identifier Adj-SID-129 to the first link Link1 for the two network slices (or corresponding two algorithm types), and then flood through the IGP protocol The first adjacent segment identifier Adj-SID-128 and the second adjacent segment identifier Adj-SID-129.
  • the segment identifier assigned to the network slice includes the endpoint segment identifier (END SID) corresponding to the node and the link corresponding The three-layer cross-connect segment identifier (END.X SID).
  • END SID endpoint segment identifier
  • END.X SID The three-layer cross-connect segment identifier
  • the first node 110 belongs to the first network slice FA-128 and the second network slice FA-129, so it can target the first network slice FA-128 assigns the first endpoint segment identifier END-SID-128, and for the second network slice FA-129 assigns the second endpoint segment identifier END-SID-129, and then floods the first endpoint segment identifier END- through the IGP protocol.
  • the first node 110 can assign the first three-layer cross-connect segment identifier END.X-SID-128 and the second three-layer cross-connect segment identifier END for the two network slices (or corresponding two algorithm types) corresponding to the first link Link1.
  • X-SID-129 and then flood the first three-layer cross-connect segment identifier END.X-SID-128 and the second three-layer cross-connect segment identifier END.X-SID-129 through the IGP protocol.
  • each network slice corresponding to different algorithm types is assigned a segment identifier corresponding to the corresponding algorithm type, and the segment identifier is flooded through the interior gateway protocol IGP protocol, which may have different implementation manners.
  • ISIS Intermediate System to Intermediate System
  • OSPF Open Shortest Path First
  • the segment identifier corresponding to the corresponding algorithm type can be announced, or the Open Shortest Path First (OSPFv3) protocol that supports IPv6 can be extended to announce the segment identifier corresponding to the corresponding algorithm type.
  • OSPFv3 Open Shortest Path First
  • an extended ISIS protocol When an extended ISIS protocol, an extended OSPF protocol, or an extended OSPFv3 protocol is used to advertise the segment identifier corresponding to the corresponding algorithm type, it can be used in the ISIS protocol message, OSPF protocol message, or OSPFv3 protocol message through the new field
  • the method configures the segment identifier corresponding to the corresponding algorithm type, and floods the ISIS protocol message, OSPF protocol message, or OSPFv3 protocol message configured with the segment identifier corresponding to the corresponding algorithm type.
  • each network slice is configured with a quality of service QoS policy corresponding to the corresponding algorithm type.
  • the QoS strategy includes one or more of a bandwidth strategy, a traffic service level strategy, a queue scheduling strategy, and a discard strategy, etc., which can be configured in each network slice according to actual usage conditions. Since each network slice is configured with a QoS policy corresponding to the corresponding algorithm type, different network slices can be made to correspond to different QoS policies.
  • the packets of different network slices are processed in the current IGP protocol domain according to the corresponding segment identifier
  • the packets of each network slice can correspond to a QoS strategy, so that differentiated QoS strategies can be implemented for different network slices; because the packets of different network slices correspond to different segment identifiers and QoS strategies, so , Even if different network slices share the same link, different network slices can be implemented with differentiated QoS policies.
  • step S300 the message is forwarded based on the segment identifier and the QoS policy.
  • this embodiment adopts the above steps S100, S200, and S300, by assigning segment identifiers corresponding to the corresponding algorithm types to each network slice corresponding to different algorithm types, and flooding the segment identifiers through the IGP protocol, So that each node in the current IGP protocol domain can save the segment identifiers corresponding to the corresponding algorithm types of all nodes in the current IGP protocol domain; in addition, by configuring each network slice with a QoS policy corresponding to the corresponding algorithm type, so that Different network slices can correspond to different QoS policies; therefore, when packets of different network slices are forwarded according to the segment identifier in the current IGP protocol domain, they can not only distinguish and isolate different network slices according to different algorithm types.
  • Different network slices can also implement differentiated QoS strategies for different network slices according to the corresponding QoS strategy; because the network slice packets are forwarded based on the segment identifier corresponding to the corresponding algorithm type, and different network slices Each is configured with QoS policies corresponding to the corresponding algorithm types. Therefore, even if different network slices share the same link, traffic can be distinguished and isolated between different network slices, and differentiated QoS can be implemented for different network slices. Strategy.
  • the flooded ISIS message provided with the segment identifier substructure corresponding to the algorithm type is identified by the flooded segment, wherein the segment identifier substructure is provided with a field indicating the algorithm type .
  • the segment identifier substructure corresponding to the corresponding algorithm type is set in the ISIS message, and
  • the segment identifier substructure is provided with a field indicating the corresponding algorithm type, which enables the ISIS message to be able to notify each node of the segment identifier corresponding to the corresponding algorithm type during flooding, so that each node can store the corresponding
  • the node forwards the message according to the segment identification, it can be distinguished according to different algorithm types, so that the traffic between different network slices can be distinguished and isolated.
  • a segment identifier substructure corresponding to the algorithm type is newly added to the ISIS message structure, that is, an Adjacency Segment Identifier (Adj-SID) per Algorithm Sub-TLV is added, and It is included in the announcements in the existing TLV-22, TLV-222, TLV-23, TLV-223 and TLV-141 of the ISIS agreement.
  • Adj-SID Adjacency Segment Identifier
  • Type occupies 1 byte, used to indicate that the identifier substructure of this paragraph is a message structure with a field indicating the algorithm type;
  • Algorithm 1 byte, algorithm type field, used to indicate that the current adjacent segment identifier is allocated by the corresponding link for a specific algorithm type.
  • a segment identifier substructure corresponding to the algorithm type is newly set in the ISIS message structure, that is, an Adjacency Segment Identifier (LAN-Adj-SID) per Algorithm Sub-TLV is added , And included in the existing ISIS agreement TLV-22, TLV-222, TLV-23 and TLV-223 announced.
  • LAN-Adj-SID Adjacency Segment Identifier
  • TLV-22, TLV-222, TLV-23 and TLV-223 announced.
  • Type occupies 1 byte, used to indicate that the identifier substructure of this paragraph is a message structure with a field indicating the algorithm type;
  • Algorithm 1 byte, algorithm type field, used to indicate that the current adjacent segment identifier is allocated by the corresponding broadcast link for a specific algorithm type.
  • the flooded OSPF message provided with the segment identifier substructure corresponding to the algorithm type is identified by the flooded segment, wherein the segment identifier substructure is provided with a field indicating the algorithm type .
  • the segment identifier substructure corresponding to the corresponding algorithm type is set in the OSPF message, and The segment identifier substructure is provided with a field indicating the corresponding algorithm type, so that the segment identifier corresponding to the corresponding algorithm type can be notified to each node when the OSPF message is flooded, so that each node can save the corresponding
  • the segment identification of different algorithm types when the node forwards the message according to the segment identification, it can be distinguished according to different algorithm types, so that the traffic between different network slices can be distinguished and isolated.
  • a segment identifier sub-structure corresponding to the algorithm type is added to the OSPF message structure, that is, an Adj-SID per Algorithm Sub-TLV is added, and it is included in the OSPF protocol.
  • Some Announcements in Extended Link TLV Referring to the segment identifier substructure shown in Figure 4A, in the segment identifier substructure, there are newly added attribute fields used to indicate the algorithm type. In the segment identifier substructure, the explanation of each main field is as follows:
  • Type occupies 1 byte, used to indicate that the identifier substructure of this paragraph is a message structure with a field indicating the algorithm type;
  • Algorithm 1 byte, algorithm type field, used to indicate that the current adjacent segment identifier is allocated by the corresponding link for a specific algorithm type.
  • a segment identifier sub-structure corresponding to the algorithm type is added to the OSPF message structure, that is, a new LAN Adj-SID per Algorithm Sub-TLV is added, and it is included in the OSPF protocol Announced in the existing Extended Link TLV.
  • a new LAN Adj-SID per Algorithm Sub-TLV is added, and it is included in the OSPF protocol Announced in the existing Extended Link TLV.
  • Type occupies 1 byte, used to indicate that the identifier substructure of this paragraph is a message structure with a field indicating the algorithm type;
  • Algorithm 1 byte, algorithm type field, used to indicate that the current adjacent segment identifier is allocated by the corresponding broadcast link for a specific algorithm type.
  • OSPFv3 packets provided with a segment identifier substructure corresponding to the algorithm type are flooded with a flood segment identifier, wherein the segment identifier substructure is provided with a field indicating the algorithm type .
  • the segment identifier substructure corresponding to the corresponding algorithm type is set in the OSPFv3 message, and The segment identifier substructure is provided with a field indicating the corresponding algorithm type, so that the segment identifier corresponding to the corresponding algorithm type can be notified to each node when the OSPFv3 message is flooded, so that each node can save the corresponding
  • the segment identification of different algorithm types when the node forwards the message according to the segment identification, it can be distinguished according to different algorithm types, so that the traffic between different network slices can be distinguished and isolated.
  • a segment identifier sub-structure corresponding to the algorithm type is added to the OSPFv3 message structure, that is, an Adj-SID per Algorithm Sub-TLV is added, and it is included in the OSPFv3 protocol. Announced in some Router-Link TLVs.
  • Router-Link TLVs Referring to the segment identifier substructure shown in Figure 5A, in the segment identifier substructure, there are newly added attribute fields used to indicate the algorithm type. In the segment identifier substructure, the explanation of each main field is as follows:
  • Type occupies 1 byte, used to indicate that the identifier substructure of this paragraph is a message structure with a field indicating the algorithm type;
  • Algorithm 1 byte, algorithm type field, used to indicate that the current adjacent segment identifier is allocated by the corresponding link for a specific algorithm type.
  • a segment identifier substructure corresponding to the algorithm type is added to the OSPFv3 message structure, that is, a new LAN Adj-SID per Algorithm Sub-TLV is added, and it is included in the OSPFv3 protocol Announced in the existing Router-Link TLV.
  • a segment identifier substructure shown in Figure 5B in the segment identifier substructure, there are newly added attribute fields used to indicate the algorithm type.
  • the explanation of each main field is as follows:
  • Type occupies 1 byte, used to indicate that the identifier substructure of this paragraph is a message structure with a field indicating the algorithm type;
  • Algorithm 1 byte, algorithm type field, used to indicate that the current adjacent segment identifier is allocated by the corresponding broadcast link for a specific algorithm type.
  • step S200 includes but is not limited to the following steps:
  • each algorithm type corresponds to a QoS policy; in addition, it will be related to the corresponding algorithm type.
  • the corresponding QoS policy is applied to the link in the network slice corresponding to the corresponding algorithm type, so that different network slices sharing the same link can have different QoS policies, and achieve the purpose of implementing differentiated QoS policies for different network slices .
  • the first network slice FA-128 is Configure the first QoS policy, configure the second QoS policy for the second network slice FA-129, and apply the first QoS policy and the second QoS policy to the first link Link1 connected to the first node 110 at the same time. Therefore, the bearer is
  • the first network slice FA-128 and the second network slice FA-129 of the first link Link1 can correspond to the first QoS policy and the second QoS policy, so that the QoS policy between network slices can be differentiated.
  • the segment identifier includes a node segment identifier corresponding to a node and a link segment identifier corresponding to a link, and both the node segment identifier and the link segment identifier correspond to the corresponding algorithm type.
  • the node segment identifier corresponding to the node can have different implementations.
  • the node segment identifier is the prefix segment identifier; for the SRv6 scenario, the node segment identifier is the endpoint segment identifier.
  • the link segment identifier corresponding to the link can also have different implementations.
  • the link segment identifier is the adjacent segment identifier; for the SRv6 scenario, the link segment identifier is the three-layer cross-connect segment identifier. .
  • the specific types of node segment identifiers and link segment identifiers can be appropriately selected according to actual application scenarios, which are not specifically limited in this embodiment.
  • the node segment identifier and the link segment identifier correspond to the corresponding algorithm type
  • packets of different network slices are forwarded according to the node segment identifier and link segment identifier, it can be based on different algorithm types. Distinguish, so as to realize the distinction and isolation of the traffic between different network slices; when the message is transmitted in the link, because the message is forwarded based on the link segment identifier corresponding to the corresponding algorithm type, therefore, for When different network slices share the same link, this embodiment can also realize traffic differentiation and isolation between different network slices.
  • step S300 includes but is not limited to the following steps:
  • Step S310 according to different node segment identifiers, respectively establish a first label forwarding entry containing the corresponding algorithm type to the destination node;
  • Step S320 establish a second label forwarding entry related to the link in the corresponding network slice and containing the corresponding algorithm type
  • Step S330 Forward the message according to the first label forwarding entry, the second label forwarding entry and the QoS policy.
  • the routing method shown in Figure 6 can be applied to the SR-MPLS scenario.
  • the first label forwarding entry includes forwarding equivalence class to next hop label forwarding unit mapping (FEC to NHLFE Map, FTN) forwarding entries and Incoming Label Map (ILM) forwarding entries, and the forwarding information contained in the FTN forwarding entries and ILM forwarding entries includes the corresponding algorithm types;
  • the second label forwarding The entry includes a label forwarding entry related to the adjacent segment identifier, and the forwarding information contained in the label forwarding entry related to the adjacent segment identifier includes a corresponding algorithm type. Therefore, when the routing method of this embodiment is applied to an SR-MPLS scenario, it can realize packet forwarding while ensuring that the traffic of different network slices is distinguished and isolated.
  • step S300 includes but is not limited to the following steps:
  • Step S340 according to different node segment identifiers, respectively establish routing and forwarding entries containing corresponding algorithm types to the destination node;
  • Step S350 according to different link segment identifiers, establish a local segment identifier forwarding entry that is related to the link in the corresponding network slice and contains the corresponding algorithm type;
  • Step S360 forwarding the message according to the routing and forwarding entries, the local segment identifier forwarding entries and the QoS policy.
  • FIG. 6 and the embodiment shown in FIG. 7 are parallel embodiments, and respectively correspond to different application scenarios.
  • the routing method shown in FIG. 7 can be applied to the SRv6 scenario.
  • the routing forwarding table entry is a general routing table entry, but the forwarding information contained in the general routing table entry includes Corresponding algorithm type;
  • the local segment identifier forwarding entry is a local SID entry related to the three-layer cross-connect segment identifier, and the forwarding information contained in the local SID entry includes the corresponding algorithm type. Therefore, when the routing method of this embodiment is applied to an SRv6 scenario, it can realize packet forwarding while ensuring that the traffic of different network slices is distinguished and isolated.
  • step S310 includes but is not limited to the following steps:
  • Step S311 Establish a shortest path tree to the destination node according to different network slices
  • Step S312 according to the shortest path tree and the different node segment identifiers corresponding to the corresponding network slices, respectively establish a first label forwarding table entry containing the corresponding algorithm type to the destination node, wherein the first label forwarding table entry includes FTN forwarding entries and ILM forwarding entries, FTN forwarding entries and ILM forwarding entries all include corresponding algorithm types.
  • each node in the network slice uses itself as the root node and is created in the network slice.
  • the nodes in the network slice can obtain their paths to other destination nodes.
  • the different node segment identifiers can create FTN forwarding entries and ILM forwarding entries containing corresponding algorithm types for each node in the network slice.
  • packets of different network slices When packets of different network slices are forwarded according to FTN forwarding entries and ILM forwarding entries in the current IGP protocol domain, they can be distinguished according to different algorithm types, so that the traffic between different network slices can be distinguished and isolated; due to FTN
  • the forwarding information in the forwarding table entry and the ILM forwarding table entry contains the corresponding algorithm type. Therefore, when the packets of different network slices are forwarded along the same link according to the FTN forwarding table entry and the ILM forwarding table entry, it can also be forwarded. Realize traffic differentiation and isolation between different network slices.
  • step S340 includes but is not limited to the following steps:
  • Step S341 Establish a shortest path tree to the destination node according to different network slices
  • Step S342 according to the shortest path tree and the different node segment identifiers corresponding to the corresponding network slices, respectively establish routing and forwarding entries containing the corresponding algorithm types to the destination node.
  • each node in the network slice uses itself as the root node and is created in the network slice.
  • the nodes in the network slice can obtain their paths to other destination nodes.
  • the different node segment identifiers can create a routing and forwarding table entry containing the corresponding algorithm type for each node in the network slice.
  • packets of different network slices When packets of different network slices are forwarded according to routing and forwarding entries in the current IGP protocol domain, they can be distinguished according to different algorithm types, so that the traffic between different network slices can be distinguished and isolated; due to the routing and forwarding entries in the The forwarding information includes the corresponding algorithm type. Therefore, when the packets of different network slices are forwarded along the same link according to the routing and forwarding entries, the traffic differentiation and isolation between different network slices can also be realized.
  • step S300 includes but is not limited to the following steps:
  • Step S370 Create a segment identifier list for each network slice according to the segment identifier, and the segment identifier list includes node segment identifiers and link segment identifiers;
  • Step S380 forward the message based on the segment identifier list and the QoS policy.
  • the routing method shown in FIG. 10 may be applied to the forwarding behavior of Segment Routing Traffic Engineering (SR-TE).
  • SR-TE Segment Routing Traffic Engineering
  • a segment identifier list is established for each network slice according to the segment identifier, that is, a different SR-TE tunnel corresponding to each network slice is established.
  • the segment identifier list in the SR-TE tunnel contains the corresponding network slice The prefix segment identifier or adjacent segment identifier.
  • the message when a segment is a prefix segment, the message It will be forwarded according to the label forwarding entry corresponding to the corresponding prefix segment identifier; for another example, when a certain segment is an adjacent segment, the message will be forwarded according to the label forwarding entry corresponding to the corresponding adjacent segment identifier.
  • the QoS policy corresponding to the algorithm type when forwarding a message, according to the algorithm type contained in the forwarding information, the QoS policy corresponding to the algorithm type will be queried and the QoS policy will be applied to the message. Therefore, when the routing method of this embodiment is applied to the SR-MPLS scenario, it is possible to realize traffic differentiation and isolation between different network slices, and to implement differentiated QoS policies for different network slices.
  • a segment identifier list is established for each network slice according to the segment identifier, that is, a different SR-TE tunnel corresponding to each network slice is established.
  • the segment identifier list in the SR-TE tunnel contains the endpoints corresponding to the network slice. Segment identifier or three-level cross-connect segment identifier.
  • the routing and forwarding entry guidance message can be used to generate the endpoint segment identifier or three
  • the origin node identified by the layer cross-connection segment performs forwarding, and during the forwarding process, according to the algorithm type contained in the forwarding information, the QoS policy corresponding to the algorithm type is queried and the QoS policy is applied to the message.
  • the message arrives at the origin node that generates the endpoint segment identifier or the three-level cross-connect segment identifier, the corresponding local segment identifier forwarding entry will be queried.
  • the local segment identifier corresponding to the connection segment identifier forwards the entry, it will continue to instruct the message to be forwarded to a certain Layer 3 interface, and during the forwarding process, it will query the corresponding algorithm type according to the algorithm type contained in the forwarding information QoS policy and apply the QoS policy to the message. Therefore, when the routing method of this embodiment is applied to the SRv6 scenario, it is possible to realize traffic differentiation and isolation between different network slices, and to implement differentiated QoS policies for different network slices.
  • FIG. 11 there are a first node 110, a second node 120, a third node 130, a fourth node 140, and a fifth node 150, and the first node 110, the second node 120, and the third node 130 are connected in sequence, the fourth node 140, the second node 120, and the fifth node 150 are connected in sequence, and the first node 110, the fifth node 150, the third node 130, and the fourth node 140 are connected in sequence end to end.
  • a first network slice FA-128 and a second network slice FA-129 are constructed, where the value of the algorithm type corresponding to the first network slice FA-128 is defined as 128, and the first network slice FA-128 is defined as 128.
  • the value of the algorithm type corresponding to the second network slice FA-129 is defined as 129.
  • the first network slice FA-128 includes the first node 110, the second node 120, the third node 130, the fourth node 140 and the bidirectional links between these nodes
  • the second network slice FA-129 includes the first node 110, The second node 120, the third node 130, the fifth node 150, and the bidirectional links connecting these nodes.
  • the first network slice FA-128 and the second network slice FA-129 share the first link Link1 between the first node 110 and the second node 120 and share between the second node 120 and the third node 130.
  • the shortest forwarding path from the first node 110 as the source node to the third node 130 as the destination node is both The first node 110-the second node 120-the third node 130.
  • FTN forwarding entries to the third node 130 are established for the first network slice FA-128 and the second network slice FA-129, respectively, and the key values of these two FTN forwarding entries are respectively ⁇ Algorithm 128, prefix-D> and ⁇ Algorithm 129, prefix-D>, where Algorithm 128 means that the value of the algorithm type is 128, Algorithm 129 means that the value of the algorithm type is 129, and prefix-D means that the value of the algorithm type is 129.
  • the prefix segment identifier of the three nodes 130 it can be seen that the forwarding information contained in the two FTN forwarding entries contains the algorithm type with the value of 128 and the algorithm type with the value of 129.
  • the forwarding information contained in the forwarding table entry also includes the same outbound interface (first link Link1) and next hop (second node 120).
  • the ILM forwarding entries to the third node 130 are respectively established for the first network slice FA-128 and the second network slice FA-129, and the key values of these two ILM forwarding entries are respectively Label-B-128 and Label-B-129, the forwarding information contained in these two ILM forwarding entries also contains the algorithm type with the value of 128 and the algorithm type with the value of 129. In addition, these two The forwarding information contained in the ILM forwarding entry also includes the same outgoing interface (the second link Link2) and the next hop (the third node 130).
  • the ILM forwarding entries corresponding to the first network slice FA-128 and the second network slice FA-129 are respectively established in the third node 130 for itself, and the key values of the two ILM forwarding entries are Label respectively.
  • the forwarding information contained in these two ILM forwarding entries also correspondingly include an algorithm type with a value of 128 and an algorithm type with a value of 129.
  • the forwarding path from the first node 110 as the source node to the third node 130 as the destination node can be obtained in the first network slice FA-128 and the second network slice FA-129, respectively.
  • the forwarding path can be distinguished according to the different algorithm types. Therefore, even when different network slices share the same link, the traffic differentiation and isolation between different network slices can be realized.
  • the first node 110 configures corresponding QoS policies for the two algorithm types, and applies these two QoS policies to the first link Link1 at the same time, where the two QoS policies can be marked as qos-policy respectively -s-128 and qos-policy-s-129.
  • the second node 120 also configures corresponding QoS policies for the two algorithm types, and applies these two QoS policies to the second link Link2 at the same time, where the two QoS policies can be respectively marked as qos -policy-b-128 and qos-policy-b-129.
  • the third node 130 also configures corresponding QoS policies for the two algorithm types, and applies these two QoS policies to the third node 130, where the two QoS policies can be marked as qos-policy respectively -d-128 and qos-policy-d-129.
  • the QoS policies marked as qos-policy-s-128 and qos-policy-b-128 make the packets enter the high-priority queue of the outgoing link and are marked as qos-policy-s-129 and qos-policy-
  • the b-129 QoS policy makes the message enter the low priority queue of the outgoing link
  • the QoS policy marked qos-policy-d-128 makes the message enjoy a higher Networking Processing Unit (NPU) scheduling priority Level
  • NPU Networking Processing Unit
  • the packets will be encapsulated There is an outer MPLS label.
  • the first node 110 will obtain different QoS policies according to the different algorithm types contained in the corresponding FTN forwarding entries, and then apply the corresponding QoS policies to the message.
  • the packets belonging to the first network slice FA-128 will enter the high priority queue in the first link Link1 when forwarded, and the packets belonging to the second network slice FA-129 will enter the first link Link1 when forwarding.
  • the second node 120 will obtain different QoS policies according to the different algorithm types contained in the corresponding ILM forwarding entries, and then apply the corresponding QoS policies to the message, In this case, for example, the packets belonging to the first network slice FA-128 will enter the high-priority queue of the second link Link2 during forwarding, and the packets belonging to the second network slice FA-129 will be forwarded during forwarding.
  • the third node 130 will also obtain different QoS policies according to the different algorithm types contained in the corresponding ILM forwarding entries, and then set the corresponding QoS policies Applied to the message, in this case, for example, the message belonging to the first network slice FA-128 can enjoy a higher NPU processing priority, while the message belonging to the second network slice FA-129 enjoys a lower priority.
  • the NPU processing priority Therefore, even if the first network slice FA-128 and the second network slice FA-129 share the same link, the traffic can be distinguished and isolated between the two network slices, and differentiated QoS can be implemented on the two network slices. Strategy.
  • This example and the first example above are based on the same network topology, that is, this example is also applicable to the network topology shown in FIG. 11.
  • the difference between this example and the first example above is that this example is a routing method applied to the SRv6 scenario, while the example one is a routing method applied to the SR-MPLS scenario.
  • the routing method applied to the SRv6 scenario is executed based on the network topology shown in Figure 11, the specific process is as follows:
  • routing and forwarding entries to the third node 130 are established for the first network slice FA-128 and the second network slice FA-129, respectively, and the key values of the two routing forwarding entries are respectively ⁇ prefix-D-128> and ⁇ prefix-D-129>, the forwarding information contained in these two routing and forwarding entries also contains an algorithm type with a value of 128 and an algorithm type with a value of 129. In addition, The forwarding information contained in the two routing and forwarding entries also includes the same outbound interface (first link Link1) and next hop (second node 120).
  • routing and forwarding entries to the third node 130 are respectively established for the first network slice FA-128 and the second network slice FA-129, and the key values of the two routing forwarding entries are respectively ⁇ prefix-D-128> and ⁇ prefix-D-129>, the forwarding information contained in these two routing and forwarding entries also contains the algorithm type with the value of 128 and the algorithm type with the value of 129, in addition The forwarding information contained in the two routing and forwarding entries also includes the same outbound interface (second link Link2) and next hop (third node 130).
  • the third node 130 establishes local segment identifier forwarding entries corresponding to the first network slice FA-128 and the second network slice FA-129 for its own different endpoint segment identifiers, and these two local segment identifiers
  • the forwarding information contained in the forwarding table entry correspondingly includes an algorithm type with a value of 128 and an algorithm type with a value of 129.
  • the forwarding path from the first node 110 as the source node to the third node 130 as the destination node can be obtained in the first network slice FA-128 and the second network slice FA-129, respectively.
  • the forwarding path can be distinguished according to the different algorithm types. Therefore, even when different network slices share the same link, the traffic differentiation and isolation between different network slices can be realized.
  • the specific process of configuring the QoS policy on the network slice according to the algorithm type in this example is the same as the specific process of configuring the QoS policy on the network slice according to the algorithm type in the above example 1. In order to avoid redundancy, it will not be repeated here.
  • the message It will be encapsulated with an outer IPv6 header, and the destination IP will be set as the endpoint segment identifier of the destination node in the corresponding network slice.
  • the first node 110 will obtain different QoS policies according to the different algorithm types contained in the corresponding routing and forwarding entries, and then apply the corresponding QoS policies to the message.
  • the packets belonging to the first network slice FA-128 will enter the high priority queue in the first link Link1 when forwarded, and the packets belonging to the second network slice FA-129 will enter the first link Link1 when forwarding.
  • the second node 120 will obtain different QoS policies according to the different algorithm types contained in the corresponding routing and forwarding entries, and then apply the corresponding QoS policies to the message.
  • the message belonging to the first network slice FA-128 will enter the high-priority queue of the second link Link2 when forwarding, and the message belonging to the second network slice FA-129 will be forwarded Enter the low priority queue of the second link Link2; similarly, the third node 130 will also obtain different QoS policies according to the different algorithm types contained in the corresponding local segment identification forwarding entry, and then put the corresponding QoS policy is applied to the message.
  • the message belonging to the first network slice FA-128 can enjoy higher NPU processing priority, while the message belonging to the second network slice FA-129 enjoys Lower NPU processing priority. Therefore, even if the first network slice FA-128 and the second network slice FA-129 share the same link, the traffic can be distinguished and isolated between the two network slices, and differentiated QoS can be implemented on the two network slices. Strategy.
  • the network topology shown in FIG. 12 includes a first node 110, a second node 120, a third node 130, a fourth node 140, a fifth node 150, and a sixth node 160.
  • the first node 110, the second node 120, the third node 130, the fourth node 140, the fifth node 150, and the sixth node 160 are connected end to end in sequence, and the second node 120 and the fifth node 150 are connected.
  • a first network slice FA-128 and a second network slice FA-129 are constructed, where the value of the algorithm type corresponding to the first network slice FA-128 is defined as 128, and the first network slice FA-128 is defined as 128.
  • the value of the algorithm type corresponding to the second network slice FA-129 is defined as 129.
  • the first network slice FA-128 includes the first node 110, the second node 120, the fifth node 150, the fourth node 140 and the bidirectional links between these nodes, and the second network slice FA-129 includes the second node 120, The third node 130, the fifth node 150, the sixth node 160, and the bidirectional links connecting these nodes.
  • the first network slice FA-128 and the second network slice FA-129 share the first link Link1 between the second node 120 and the fifth node 150; in addition, in the first network slice FA-128 ,
  • the shortest forwarding path from the first node 110 as the source node to the second node 120 as the destination node is the first node 110-the second node 120, TI-LFA (Topology Independent Loop-Free Alternate, topology-independent loop-free alternative )
  • the backup path is ⁇ fifth node 150, fifth node 150-second node 120 ⁇ ; in the second network slice FA-129, the shortest from the third node 130 as the source node to the second node 120 as the destination node
  • the forwarding path is the third node 130-the second node 120, and the TI-LFA backup path is also ⁇ the fifth node 150, the fifth node 150-the second node 120 ⁇ .
  • the segment identifier list corresponding to the TI-LFA backup path ⁇ fifth node 150, fifth node 150-second node 120 ⁇ in the first node 110 can be expressed as ⁇ prefix-d -sid-128, adj-d-link1-sid-128 ⁇ ; and in the second network slice FA-129, the TI-LFA backup path in the third node 130 ⁇ fifth node 150, fifth node 150-th
  • the segment identifier list corresponding to the two nodes 120 ⁇ can be expressed as ⁇ prefix-d-sid-129, adj-d-link1-sid-129 ⁇ .
  • the fifth node 150 different ILMs are established for adj-d-link1-sid-128 in the first network slice FA-128 and adj-d-link1-sid-129 in the second network slice FA-129.
  • Forwarding table entries the forwarding information contained in these two ILM forwarding entries correspondingly contain the algorithm type with the value of 128 and the algorithm type with the value of 129.
  • the forwarding information contained in the two ILM forwarding entries It also contains the same outgoing interface (the first link Link1) and the next hop (the second node 120).
  • the QoS policy marked qos-policy-b-128 makes the message enter the high priority queue of the first link Link1
  • the QoS policy marked qos-policy-b-129 makes the message enter the first link Link1 If the packets of the same type are forwarded along the first network slice FA-128 and the second network slice FA-129 respectively according to the TI-LFA backup path, they will be forwarded according to the corresponding ILM entry
  • the different algorithm types contained in it obtain different QoS policies, and apply the corresponding QoS policies to the message.
  • the message belonging to the first network slice FA-128 will enter the first chain when forwarded
  • the high-priority queue in Link1 and the packet to which the second network slice FA-129 belongs will enter the low-priority queue in the first link Link1 when it is forwarded. Therefore, even if the first network slice FA-128 and the second network slice FA-129 share the same link, the traffic can be distinguished and isolated between the two network slices, and differentiated QoS can be implemented on the two network slices.
  • This example and the third example above are based on the same network topology, that is, this example is also applicable to the network topology shown in FIG. 12.
  • the difference between this example and the third example above is that this example is a routing method applied to the SRv6 scenario, while the example three is a routing method applied to the SR-MPLS scenario.
  • the routing method applied to the SRv6 scenario is executed based on the network topology shown in Figure 12, the specific process is as follows:
  • the segment identifier list corresponding to the TI-LFA backup path ⁇ fifth node 150, fifth node 150-second node 120 ⁇ in the first node 110 can be expressed as ⁇ end-b -sid-128, endx-b-link1-sid-128 ⁇ ; and in the second network slice FA-129, the TI-LFA backup path in the third node 130 ⁇ fifth node 150, fifth node 150-th
  • the segment identifier list corresponding to the two nodes 120 ⁇ can be expressed as ⁇ end-b-sid-129, endx-b-link1-sid-129 ⁇ .
  • the forwarding information contained in these two local segment identification forwarding entries correspondingly contains an algorithm type with a value of 128 and an algorithm type with a value of 129.
  • the two local segment identification forwarding tables The forwarding information contained in the item also includes the same outbound interface (first link Link1) and next hop (second node 120).
  • the QoS policy marked qos-policy-b-128 makes the message enter the high priority queue of the first link Link1
  • the QoS policy marked qos-policy-b-129 makes the message enter the first link Link1
  • the packets of the same type are forwarded along the first network slice FA-128 and the second network slice FA-129 respectively according to the TI-LFA backup path, they will be forwarded according to the corresponding local segment identifier.
  • the different algorithm types contained in the entry can obtain different QoS policies, and apply the corresponding QoS policies to the message. In this case, the message belonging to the first network slice FA-128 will enter the first network slice when forwarded.
  • the high-priority queue in one link Link1 and the packet to which the second network slice FA-129 belongs will enter the low-priority queue in the first link Link1 when it is forwarded. Therefore, even if the first network slice FA-128 and the second network slice FA-129 share the same link, the traffic can be distinguished and isolated between the two network slices, and differentiated QoS can be implemented on the two network slices. Strategy.
  • an embodiment of the present application also provides a routing method, as shown in FIG. 13, which is a flowchart of the routing method provided by an embodiment of the present application, and the routing method can be applied to FIGS. 1 and 11. Or different nodes in the embodiment shown in FIG. 12, the routing method includes but is not limited to the following steps:
  • Step S410 receiving different segment identifiers flooded through the IGP protocol, where different segment identifiers correspond to different algorithm types and different network slices, and different network slices correspond to different algorithm types;
  • Step S420 Receive packets forwarded based on different segment identifiers and different QoS policies, where different QoS policies are configured in different network slices, and different QoS policies correspond to different algorithm types.
  • receiving different segment identifiers flooded through the IGP protocol can make each node in the current IGP protocol domain save the segment identifiers of all nodes in the current IGP protocol domain.
  • the corresponding segment identifiers correspond to an algorithm type. Therefore, when packets from different network slices that are forwarded according to the segment identifier are received in the current IGP protocol domain, they can be distinguished according to different algorithm types, that is, they can be distinguished. And to isolate the traffic between different network slices, because the received message is forwarded based on the segment identifier corresponding to the corresponding algorithm type, so even when different network slices share the same link, it can realize the communication between different network slices. Traffic separation and isolation.
  • the IGP FA technology is an algorithm applied to the IGP protocol.
  • a set of algorithm constraints can be defined as needed, and a forwarding path that satisfies the algorithm constraints can be generated based on the algorithm constraints. Based on these forwarding paths, a network slice dedicated to specific business traffic is generated.
  • segment identifier in this embodiment can also have different implementations.
  • the specific implementation of the segment identification in this embodiment is the same as the specific implementation of the segment identification in the embodiment shown in FIG. 2.
  • the QoS strategy includes one or more of a bandwidth strategy, a traffic service level strategy, a queue scheduling strategy, and a discard strategy, etc., which can be configured in each network slice according to actual usage conditions. Since different QoS policies are configured in different network slices, and different QoS policies correspond to different algorithm types, when receiving in the current IGP protocol domain forwarded according to the corresponding segment identifier from different network slices, each message corresponds to a QoS policy, that is, it can implement differentiated QoS policies for different network slices; since the messages of different network slices correspond to different segment identifiers and QoS policies, even Different network slices share the same link and can also implement differentiated QoS policies for different network slices.
  • an ISIS message provided with a segment identifier substructure corresponding to the algorithm type is received to receive the segment identifier, wherein a field indicating the algorithm type is set in the segment identifier substructure.
  • the IGP protocol is the ISIS protocol
  • the segment identifier substructure corresponding to the algorithm type is set in the ISIS message, and the segment identifier substructure is provided with a field indicating the algorithm type
  • the current when a node receives the ISIS message flooded by each node, it can receive segment identifiers corresponding to different algorithm types. Therefore, by distinguishing according to different algorithm types, it can distinguish and isolate the traffic between different network slices. .
  • segment identifier substructure corresponding to the algorithm type set in the ISIS message can refer to the example shown in Figure 3A or the example shown in Figure 3B. In order to avoid redundant repetition, This will not be repeated here.
  • an OSPF message provided with a segment identifier substructure corresponding to the algorithm type is received to receive the segment identifier, wherein a field indicating the algorithm type is set in the segment identifier substructure.
  • the IGP protocol is the OSPF protocol
  • the segment identifier substructure corresponding to the algorithm type is set in the OSPF message, and the segment identifier substructure is provided with a field indicating the algorithm type
  • the current when a node receives OSPF packets flooded by each node, it can receive segment identifiers corresponding to different algorithm types. Therefore, by distinguishing according to different algorithm types, it can distinguish and isolate the traffic between different network slices. .
  • segment identifier substructure corresponding to the algorithm type set in the OSPF message can refer to the example shown in Figure 4A or the example shown in Figure 4B. In order to avoid redundant repetition, This will not be repeated here.
  • an OSPFv3 message provided with a segment identifier substructure corresponding to the algorithm type is received to receive the segment identifier, wherein a field indicating the algorithm type is set in the segment identifier substructure.
  • the IGP protocol is the OSPFv3 protocol
  • the segment identifier substructure corresponding to the algorithm type is set in the OSPFv3 message
  • the segment identifier substructure is set with a field indicating the algorithm type
  • segment identifier substructure corresponding to the algorithm type set in the OSPFv3 message can refer to the example shown in Figure 5A or the example shown in Figure 5B. In order to avoid redundant repetition, This will not be repeated here.
  • the segment identifier includes a node segment identifier corresponding to a node and a link segment identifier corresponding to a link, and both the node segment identifier and the link segment identifier correspond to the corresponding algorithm type.
  • the node segment identifier corresponding to the node may have different implementation manners.
  • the node segment identifier is the prefix segment identifier; for the SRv6 scenario, the node segment identifier is the endpoint segment identifier.
  • the link segment identifier corresponding to the link can also have different implementations.
  • the link segment identifier is the adjacent segment identifier; for the SRv6 scenario, the link segment identifier is the three-layer cross-connect segment identifier. .
  • the specific types of node segment identifiers and link segment identifiers can be appropriately selected according to actual application scenarios, which are not specifically limited in this embodiment.
  • both the node segment identifier and the link segment identifier correspond to the corresponding algorithm types
  • it can be Distinguish according to different algorithm types, that is, to realize the distinction and isolation of traffic between different network slices; because the transmission of packets in the link is based on the link segment identifier corresponding to the corresponding algorithm type for forwarding, therefore, Even if different network slices share the same link, this embodiment can realize the distinction and isolation of traffic between different network slices according to the distinction of different algorithm types.
  • the routing device includes a memory 1401, a processor 1402, and a computer program stored in the memory 1401 and running on the processor 1402.
  • the processor 1402 and the memory 1401 may be connected by a bus or in other ways.
  • routing device in this embodiment can be applied to different nodes or network controllers in the embodiments shown in FIG. 1, FIG. 11, or FIG.
  • the network controller can form a part of the network topology in the embodiment shown in FIG. 1, FIG. 11, or FIG. No more details.
  • the non-transitory software programs and instructions required to implement the routing method of the foregoing embodiment are stored in the memory.
  • the routing method of the foregoing embodiment is executed, for example, the method step S100 in FIG. 2 described above is executed.
  • step S300 method steps S310 to S330 in FIG. 6, method steps S340 to S360 in FIG. 7, method steps S311 to S312 in FIG. 8, method steps S341 to S342 in FIG. 9, and method step S370 in FIG.
  • S380 the method steps S410 to S420 in FIG. 13.
  • the device embodiments described above are merely illustrative, and the units described as separate components may or may not be physically separated, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules can be selected according to actual needs to achieve the objectives of the solutions of the embodiments.
  • an embodiment of the present application also provides a computer-readable storage medium, the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are executed by a processor or a controller, for example, by the aforementioned
  • the execution of a processor in the embodiment of the routing device can make the above-mentioned processor execute the routing method in the above-mentioned embodiment, for example, execute the above-described method steps S100 to S300 in FIG. 2 and method steps S310 to S330 in FIG. 6 , The method steps S340 to S360 in FIG. 7, the method steps S311 to S312 in FIG. 8, the method steps S341 to S342 in FIG. 9, the method steps S370 to S380 in FIG. 10, the method steps S410 to S420 in FIG. .
  • corresponding segment identifiers and QoS policies are configured according to corresponding algorithm types, which can realize traffic differentiation and isolation for different network slices sharing the same link, and can implement differentiated QoS policies for different network slices.
  • the embodiments of the present application provide a routing method, a routing device, and a computer-readable storage medium, which can realize traffic differentiation and isolation for different network slices sharing the same link, and can implement differentiated QoS policies for different network slices.
  • the embodiments of the application include: assigning segment identifiers corresponding to the corresponding algorithm types to each network slice corresponding to different algorithm types, flooding the segment identifiers through the IGP protocol, and configuring each network slice with QoS corresponding to the corresponding algorithm type. Policy, forwarding the message based on the segment identifier and the QoS policy.
  • each segment in the current IGP protocol domain can be made
  • the nodes all save the segment identifiers corresponding to the corresponding algorithm types of all nodes in the current IGP protocol domain; in addition, by configuring the QoS policies corresponding to the corresponding algorithm types for each network slice, different network slices and different QoS can be made Strategies correspond; therefore, when packets of different network slices are forwarded according to the segment identifier in the current IGP protocol domain, not only can they distinguish and isolate the traffic between different network slices according to different algorithm types, but also according to them According to the corresponding QoS strategy, different network slices are implemented with differentiated QoS strategies; because the packets of the network slice are forwarded based on the segment identifier corresponding to the corresponding algorithm type, and different network slices are configured with corresponding algorithm types. QoS strategy. Therefore
  • computer storage medium includes volatile and non-volatile data implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data).
  • Information such as computer-readable instructions, data structures, program modules, or other data.
  • Computer storage media include but are not limited to RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, magnetic disk storage or other magnetic storage devices, or Any other medium used to store desired information and that can be accessed by a computer.
  • communication media usually contain computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as carrier waves or other transmission mechanisms, and may include any information delivery media. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

一种路由方法、路由装置及计算机可读存储介质。其中，所述路由方法包括：对与不同算法类型对应的各个网络切片分别分配与相应算法类型对应的段标识，并通过IGP协议泛洪该段标识（S100），对各个网络切片分别配置与相应算法类型对应的QoS策略（S200），基于该段标识和该QoS策略转发报文（S300）。

Description

路由方法、路由装置及计算机可读存储介质
相关申请的交叉引用
本申请基于申请号为202010102220.0、申请日为2020年02月19日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本申请实施例涉及但不限于通信技术领域，尤其涉及一种路由方法、路由装置及计算机可读存储介质。
背景技术
5G网络切片(slice)对承载网的核心需求，就是不同的网络切片需要有其专属的承载子网络，不同的专属承载子网络之间可以是严格的资源硬隔离，也可以是达到近似硬隔离效果的软隔离。由于分组网络并不能支持硬隔离，为了支持5G网络切片的需求，分组网络需要在底层网络资源上做切片划分，以满足不同的上层业务的需求。现有的方式是采用内部网关协议(Interior Gateway Protocol，IGP)灵活算法(Flex Algorithm，FA)技术，在同一拓扑内运行多种IGP算法而计算得到多种FA平面，每个FA平面可表示一张网络切片，可将不同的上层业务流量承载在不同的FA平面上。
然而，在多个网络切片共享相同的链路时，当前FA技术无法支持在同一链路上对不同网络切片间的服务质量(Quality of Service，QoS)策略做差异化处理。现有机制中，仅可以在链路上配置传统的QoS策略，例如根据流分类结果对向该链路发送的流量实施相应的QoS策略，但这种流分类方法仅与链路相关，与共享该链路的不同网络切片之间无关，无法区分不同网络切片的流量；另外，根据这种流分类方法实施的QoS策略也是与网络切片无关的，即共享该链路的多个网络切片是共享该链路上配置的QoS策略的，无法对不同网络切片实施差异化的QoS策略。
发明内容
以下是对本文详细描述的主题的概述。本概述并非是为了限制权利要求的保护范围。
第一方面，本申请实施例提供了一种路由方法、路由装置及计算机可读存储介质。
第二方面，本申请实施例提供了一种路由方法，包括：对与不同的算法类型对应的各个网络切片分别分配与相应的所述算法类型对应的段标识，并通过内部网关协议IGP协议泛洪所述段标识；对各个所述网络切片分别配置与相应的所述算法类型对应的服务质量QoS策略；基于所述段标识和所述QoS策略转发报文。
第三方面，本申请实施例还提供了一种路由方法，包括：接收通过内部网关协议IGP协议泛洪的不同的段标识，其中，不同的所述段标识分别与不同的算法类型及不同的网络切片相对应，且不同的所述网络切片与不同的所述算法类型相对应；接收基于不同的所述段标识和不同的服务质量QoS策略转发的报文，其中，不同的所述QoS策略被配置于不同的所述网络切片，且不同的所述QoS策略与不同的所述算法类型相对应。
第四方面，本申请实施例还提供了一种路由装置，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，所述处理器执行所述计算机程序时实现如上所述第二方面的路由方法或实现如上所述第三方面的路由方法。
第五方面，本申请实施例还提供一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行如上的路由方法。
本申请的其它特征和优点将在随后的说明书中阐述，并且，部分地从说明书中变得显而易见，或者通过实施本申请而了解。本申请的目的和其他优点可通过在说明书、权利要求书以及附图中所特别指出的结构来实现和获得。
附图说明
附图用来提供对本申请技术方案的进一步理解，并且构成说明书的一部分，与本申请的实施例一起用于解释本申请的技术方案，并不构成对本申请技术方案的限制。
图1是本申请一个实施例提供的用于执行路由方法的网络拓扑的示意图；
图2是本申请一个实施例提供的路由方法的流程图；
图3A是本申请一个实施例提供的用于表示算法类型的字段的段标识子结构的示意图；
图3B是本申请另一实施例提供的用于表示算法类型的字段的段标识子结构的示意图；
图4A是本申请另一实施例提供的用于表示算法类型的字段的段标识子结构的示意图；
图4B是本申请另一实施例提供的用于表示算法类型的字段的段标识子结构的示意图；
图5A是本申请另一实施例提供的用于表示算法类型的字段的段标识子结构的示意图；
图5B是本申请另一实施例提供的用于表示算法类型的字段的段标识子结构的示意图；
图6是本申请另一实施例提供的路由方法中转发报文的流程图；
图7是本申请另一实施例提供的路由方法中转发报文的流程图；
图8是本申请另一实施例提供的路由方法中建立第一标签转发表项的流程图；
图9是本申请另一实施例提供的路由方法中建立路由转发表项的流程图；
图10是本申请另一实施例提供的路由方法中转发报文的流程图；
图11是本申请另一实施例提供的用于执行路由方法的网络拓扑的示意图；
图12是本申请另一实施例提供的用于执行路由方法的网络拓扑的示意图；
图13是本申请另一实施例提供的路由方法的流程图；
图14是本申请一个实施例提供的路由装置的示意图。
具体实施方式
为了使本申请的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处所描述的具体实施例仅用以解释本申请，并不用于限定本申请。
需要说明的是，虽然在装置示意图中进行了功能模块划分，在流程图中示出了逻辑顺序，但是在某些情况下，可以以不同于装置中的模块划分，或流程图中的顺序执行所示出或描述的步骤。说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
本申请实施例提供了一种路由方法、路由装置及计算机可读存储介质，通过对与不同算法类型对应的各个网络切片分别分配与相应算法类型对应的段标识，并通过IGP协议泛洪该段标识，可以使得当前IGP协议域内的每个节点均保存有当前IGP协议域内所有节点的与相应的算法类型对应的段标识，因此，当不同网络切片的报文在当前IGP协议域内根据该段标识进行转发时，能够根据不同的算法类型进行区分，即能够区分及隔离不同网络切片之间的流量，由于报文是基于与相应的算法类型对应的段标识进行转发的，因此即使不同网络切片共享相同链路时，也能够实现不同网络切片间的流量区分与隔离；另外，由于对各个网络切片分别配置与相应的算法类型对应的QoS策略，因此可以使得不同的网络切片与不同的QoS策略相对应，当不同网络切片的报文在当前IGP协议域内根据相应的段标识进行转发时，每个网络切片的报文均能对应于一个QoS策略，从而能够对不同网络切片实施差异化的QoS策略；由于不同网络切片的报文都对应于不同的段标识和QoS策略，因此，即使不同网络切片共享相同链路，也能够对不同的网络切片实施差异化的QoS策略。
下面结合附图，对本申请实施例作进一步阐述。
如图1所示，图1是本申请一个实施例提供的用于执行路由方法的网络拓扑的示意图。在图1的示例中，该网络拓扑包括依次连接的第一节点110、第二节点120和第三节点130，其中，相邻两个节点之间通过一个物理链路进行连接。第一节点110、第二节点120和第三节点130可以是路由器或者交换机等网络设备，能够对报文进行转发。另外，该网络拓扑中还可以包括有网络控制器(图1中未示出)，例如软件定义网络(Software  Defined Network，SDN)控制器等，该网络控制器分别与第一节点110、第二节点120和第三节点130连接，能够分别对第一节点110、第二节点120和第三节点130进行控制。
第一节点110、第二节点120、第三节点130和网络控制器，分别包括有存储器和处理器，其中，存储器和处理器可以通过总线或者其他方式连接。
存储器作为一种非暂态计算机可读存储介质，可用于存储非暂态软件程序以及非暂态性计算机可执行程序。此外，存储器可以包括高速随机存取存储器，还可以包括非暂态存储器，例如至少一个磁盘存储器件、闪存器件、或其他非暂态固态存储器件。在一些实施方式中，存储器可选包括相对于处理器远程设置的存储器，这些远程存储器可以通过网络连接至该处理器。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
本申请实施例描述的网络拓扑以及应用场景是为了更加清楚的说明本申请实施例的技术方案，并不构成对于本申请实施例提供的技术方案的限定，本领域技术人员可知，随着网络拓扑的演变和新应用场景的出现，本申请实施例提供的技术方案对于类似的技术问题，同样适用。
本领域技术人员可以理解的是，图1中示出的各个节点及拓扑结构并不构成对本申请实施例的限定，可以包括比图示更多或更少的部件，或者组合某些部件，或者不同的部件布置。
在图1所示的网络拓扑中，各个节点可以分别调用其储存的路由程序，以执行路由方法；或者，网络控制器可以调用其储存的路由程序，并与各个节点相互配合以执行路由方法。
基于上述网络拓扑以及上述网络拓扑中各个节点和网络控制器的结构，提出本申请描述的路由方法的各个实施例。
如图2所示，图2是本申请一个实施例提供的路由方法的流程图，该路由方法包括但不限于步骤S100、步骤S200和步骤S300。
步骤S100，对与不同的算法类型对应的各个网络切片分别分配与相应的算法类型对应的段标识，并通过内部网关协议IGP协议泛洪段标识。
在一实施例中，可以先采用IGP FA技术，在同一拓扑内运行多种IGP算法而计算得到多种FA平面，其中，每个FA平面表示一个网络切片，并且每个网络切片分别对应有一种算法类型，在此基础上，对与不同的算法类型对应的各个网络切片分别分配与相应的算法类型对应的段标识，因此，每个网络切片均被分配有一个段标识，并且每个段标识均对应于一种算法类型；此外，通过IGP协议泛洪段标识，可以使得当前IGP协议域内的每个节点均可以保存有当前IGP协议域内所有节点的段标识，并且与每个网络切片对应的段标识均对应于一个算法类型，所以，当不同网络切片的报文在当前IGP协议域内根据该段标识进行转发时，能够根据不同的算法类型进行区分，从而能够区分及隔离不同网络切片之间的流量，由于报文是基于与相应的算法类型对应的段标识进行转发的，因此即使不同网络切片共享相同链路时，也能够实现不同网络切片间的流量区分与隔离。
本领域技术人员可以理解的是，IGP FA技术是应用于IGP协议的一种算法，可以根据需要定义一组算法约束条件，并基于该算法约束条件生成满足该算法约束条件的转发路径，从而可以根据这些转发路径生成专属于特定业务流量的网络切片。
在一实施例中，段标识可以有不同的实施方式。例如，当应用场景为SR-MPLS(Segment Routing MPLS，分段路由应用于多协议标签交换转发平面)场景时，对网络切片分配的段标识包括与节点对应的前缀段标识(Prefix SID)和与链路对应的邻接段标识(Adjacency SID)。以一个具体例子进行说明，在如图1所示的网络拓扑中，对于第一节点110，其归属于第一网络切片FA-128和第二网络切片FA-129，因此可以针对第一网络切片FA-128分配第一前缀段标识Prefix-SID-128，针对第二网络切片FA-129分配第二前缀段标识Prefix-SID-129，接着通过IGP协议泛洪第一前缀段标识Prefix-SID-128和第二前缀段标识Prefix-SID-129；由于连接第一节点110的第一链路Link1也归属于第一网络切片FA-128和第二网络切片FA-129，因此第一节点110可以为第一链路Link1针对两个网络切片(或对应的两个算法类型)对应分配第一邻接段标识Adj-SID-128和第二邻接段标识Adj-SID-129，接着通过IGP协议泛洪第一邻接段标识Adj-SID-128和第二邻接段标识Adj-SID-129。又如，当应用场景为SRv6(Segment Routing IPv6，分段路由应用于IPv6转发平面)场景时， 对网络切片分配的段标识包括与节点对应的端点段标识(END SID)和与链路对应的三层交叉连接段标识(END.X SID)。以一个具体例子进行说明，在如图1所示的网络拓扑中，对于第一节点110，其归属于第一网络切片FA-128和第二网络切片FA-129，因此可以针对第一网络切片FA-128分配第一端点段标识END-SID-128，针对第二网络切片FA-129分配第二端点段标识END-SID-129，接着通过IGP协议泛洪第一端点段标识END-SID-128和第二端点段标识END-SID-129；由于连接第一节点110的第一链路Link1也归属于第一网络切片FA-128和第二网络切片FA-129，因此第一节点110可以为第一链路Link1针对两个网络切片(或对应的两个算法类型)对应分配第一三层交叉连接段标识END.X-SID-128和第二三层交叉连接段标识END.X-SID-129，接着通过IGP协议泛洪第一三层交叉连接段标识END.X-SID-128和第二三层交叉连接段标识END.X-SID-129。
在一实施例中，对与不同的算法类型对应的各个网络切片分别分配与相应的算法类型对应的段标识，并通过内部网关协议IGP协议泛洪段标识，可以有不同的实施方式。例如，可以通过扩展中间系统到中间系统(Intermediate System to Intermediate System，ISIS)协议以通告与相应的算法类型对应的段标识，或者可以通过扩展开放式最短路径优先(Open Shortest Path First，OSPF)协议以通告与相应的算法类型对应的段标识，或者可以通过扩展支持IPv6的开放式最短路径优先(Open Shortest Path First Version 3，OSPFv3)协议以通告与相应的算法类型对应的段标识，本实施例对此不作具体限定。当通过扩展ISIS协议、扩展OSPF协议或者扩展OSPFv3协议以通告与相应的算法类型对应的段标识时，可以在ISIS协议报文中、OSPF协议报文中或者OSPFv3协议报文中通过新增字段的方式配置与相应的算法类型对应的段标识，并对配置了与相应的算法类型对应的段标识的ISIS协议报文、OSPF协议报文或者OSPFv3协议报文进行泛洪扩散。
步骤S200，对各个网络切片分别配置与相应的算法类型对应的服务质量QoS策略。
在一实施例中，QoS策略包括带宽策略、流量服务等级策略、队列调度策略和丢弃策略等中的一个或多个，可以根据实际使用情况而配置于各个网络切片中。由于对各个网络切片分别配置与相应的算法类型对应的QoS策略，因此可以使得不同的网络切片与不同的QoS策略相对应，当不同网络切片的报文在当前IGP协议域内根据相应的段标识进行转发时，每个网络切片的报文均能对应于一个QoS策略，从而能够对不同网络切片实施差异化的QoS策略；由于不同网络切片的报文都对应于不同的段标识和QoS策略，因此，即使不同网络切片共享相同链路，也能够对不同的网络切片实施差异化的QoS策略。
步骤S300，基于段标识和QoS策略转发报文。
当前，在不同的网络切片承载于不同的链路的场景下，由于链路之间的相互独立，因此可以对不同网络切片间的流量及QoS策略实现差异化处理，但是，当多个网络切片共享同一个的链路时，当前FA技术无法支持在同一个链路上对不同网络切片实现流量区分与隔离，并且现有的QoS策略机制也无法针对同一个链路上的不同网络切片实施差异化的QoS策略。针对这个问题，本实施例采用上述步骤S100、步骤S200和步骤S300，通过对与不同算法类型对应的各个网络切片分别分配与相应算法类型对应的段标识，并通过IGP协议泛洪该段标识，使得当前IGP协议域内的每个节点均可以保存有当前IGP协议域内所有节点的与相应的算法类型对应的段标识；另外，通过对各个网络切片分别配置与相应的算法类型对应的QoS策略，使得不同的网络切片能够与不同的QoS策略相对应；因此，当不同网络切片的报文在当前IGP协议域内根据该段标识进行转发时，不仅能够根据不同的算法类型而区分及隔离不同网络切片之间的流量，还能够根据与之对应的QoS策略而对不同网络切片实施差异化的QoS策略；由于网络切片的报文是基于与相应算法类型对应的段标识进行转发的，而且不同的网络切片分别配置有与相应算法类型对应的QoS策略，因此，即使不同的网络切片共享相同的链路，也能够实现不同网络切片间的流量区分与隔离，并且能够对不同的网络切片实施差异化的QoS策略。
在一实施例中，当IGP协议为ISIS协议，泛洪设置有与算法类型对应的段标识子结构的ISIS报文以泛洪段标识，其中，段标识子结构中设置有表示算法类型的字段。
在一实施例中，在对网络切片分配与相应的算法类型对应的段标识后，当IGP协议为ISIS协议时，通过在ISIS报文中设置与相应的算法类型对应的段标识子结构，并且该段标识子结构中设置有表示相应的算法类型的字段，可以使得ISIS报文在泛洪时能够把与相应的算法类型对应的段标识向各个节点进行通告，使得各 个节点均可保存有对应于不同算法类型的段标识，因此，当节点根据段标识进行报文转发时，能够根据不同的算法类型进行区分，从而能够区分及隔离不同网络切片之间的流量。
下面以具体的示例进行说明：
在一示例中，针对非局域网的使用场景，ISIS报文结构中新增设置有与算法类型对应的段标识子结构，即新增一个Adjacency Segment Identifier(Adj-SID)per Algorithm Sub-TLV，并且包含在ISIS协议现有的TLV-22、TLV-222、TLV-23、TLV-223和TLV-141中通告。参照如图3A所示的段标识子结构，在该段标识子结构中，新增有用于表示算法类型的属性字段，在该段标识子结构中，各主要字段的解释如下：
Type：占1字节，用于表示本段标识子结构是设置有表示算法类型的字段的报文结构；
Algorithm：占1字节，算法类型字段，用于表示当前邻接段标识是相应的链路针对特定的算法类型而分配的。
值得注意的是，该段标识子结构中其它字段的解释，和现有ISIS报文结构中Adjacency Segment Identifier(Adj-SID)Sub-TLV所包含的相应字段的解释相同，因此此处不再赘述。
在另一示例中，针对局域网的使用场景，ISIS报文结构中新增设置有与算法类型对应的段标识子结构，即新增一个Adjacency Segment Identifier(LAN-Adj-SID)per Algorithm Sub-TLV，并且包含在ISIS协议现有的TLV-22、TLV-222、TLV-23和TLV-223中通告。参照如图3B所示的段标识子结构，在该段标识子结构中，新增有用于表示算法类型的属性字段，在该段标识子结构中，各主要字段的解释如下：
Type：占1字节，用于表示本段标识子结构是设置有表示算法类型的字段的报文结构；
Algorithm：占1字节，算法类型字段，用于表示当前邻接段标识是相应的广播链路针对特定的算法类型而分配的。
值得注意的是，该段标识子结构中其它字段的解释，和现有ISIS报文结构中Adjacency Segment Identifier(LAN-Adj-SID)Sub-TLV所包含的相应字段的解释相同，因此此处不再赘述。
在一实施例中，当IGP协议为OSPF协议，泛洪设置有与算法类型对应的段标识子结构的OSPF报文以泛洪段标识，其中，段标识子结构中设置有表示算法类型的字段。
在一实施例中，在对网络切片分配与相应的算法类型对应的段标识后，当IGP协议为OSPF协议时，通过在OSPF报文中设置与相应的算法类型对应的段标识子结构，并且该段标识子结构中设置有表示相应的算法类型的字段，可以使得OSPF报文在泛洪时能够把与相应的算法类型对应的段标识向各个节点进行通告，使得各个节点均可保存有对应于不同算法类型的段标识，因此，当节点根据段标识进行报文转发时，能够根据不同的算法类型进行区分，从而能够区分及隔离不同网络切片之间的流量。
下面以具体的示例进行说明：
在一示例中，针对非局域网的使用场景，OSPF报文结构中新增设置有与算法类型对应的段标识子结构，即新增一个Adj-SID per Algorithm Sub-TLV，并且包含在OSPF协议现有的Extended Link TLV中通告。参照如图4A所示的段标识子结构，在该段标识子结构中，新增有用于表示算法类型的属性字段，在该段标识子结构中，各主要字段的解释如下：
Type：占1字节，用于表示本段标识子结构是设置有表示算法类型的字段的报文结构；
Algorithm：占1字节，算法类型字段，用于表示当前邻接段标识是相应的链路针对特定的算法类型而分配的。
值得注意的是，该段标识子结构中其它字段的解释，和现有OSPF报文结构中Adj-SID Sub-TLV所包含的相应字段的解释相同，因此此处不再赘述。
在另一示例中，针对局域网的使用场景，OSPF报文结构中新增设置有与算法类型对应的段标识子结构，即新增一个LAN Adj-SID per Algorithm Sub-TLV，并且包含在OSPF协议现有的Extended Link TLV中通告。参照如图4B所示的段标识子结构，在该段标识子结构中，新增有用于表示算法类型的属性字段，在该段标识子结构中，各主要字段的解释如下：
Type：占1字节，用于表示本段标识子结构是设置有表示算法类型的字段的报文结构；
Algorithm：占1字节，算法类型字段，用于表示当前邻接段标识是相应的广播链路针对特定的算法类型 而分配的。
值得注意的是，该段标识子结构中其它字段的解释，和现有OSPF报文结构中LAN Adj-SID Sub-TLV所包含的相应字段的解释相同，因此此处不再赘述。
在一实施例中，当IGP协议为OSPFv3协议，泛洪设置有与算法类型对应的段标识子结构的OSPFv3报文以泛洪段标识，其中，段标识子结构中设置有表示算法类型的字段。
在一实施例中，在对网络切片分配与相应的算法类型对应的段标识后，当IGP协议为OSPFv3协议时，通过在OSPFv3报文中设置与相应的算法类型对应的段标识子结构，并且该段标识子结构中设置有表示相应的算法类型的字段，可以使得OSPFv3报文在泛洪时能够把与相应的算法类型对应的段标识向各个节点进行通告，使得各个节点均可保存有对应于不同算法类型的段标识，因此，当节点根据段标识进行报文转发时，能够根据不同的算法类型进行区分，从而能够区分及隔离不同网络切片之间的流量。
下面以具体的示例进行说明：
在一示例中，针对非局域网的使用场景，OSPFv3报文结构中新增设置有与算法类型对应的段标识子结构，即新增一个Adj-SID per Algorithm Sub-TLV，并且包含在OSPFv3协议现有的Router-Link TLV中通告。参照如图5A所示的段标识子结构，在该段标识子结构中，新增有用于表示算法类型的属性字段，在该段标识子结构中，各主要字段的解释如下：
Type：占1字节，用于表示本段标识子结构是设置有表示算法类型的字段的报文结构；
Algorithm：占1字节，算法类型字段，用于表示当前邻接段标识是相应的链路针对特定的算法类型而分配的。
值得注意的是，该段标识子结构中其它字段的解释，和现有OSPFv3报文结构中Adj-SID Sub-TLV所包含的相应字段的解释相同，因此此处不再赘述。
在另一示例中，针对局域网的使用场景，OSPFv3报文结构中新增设置有与算法类型对应的段标识子结构，即新增一个LAN Adj-SID per Algorithm Sub-TLV，并且包含在OSPFv3协议现有的Router-Link TLV中通告。参照如图5B所示的段标识子结构，在该段标识子结构中，新增有用于表示算法类型的属性字段，在该段标识子结构中，各主要字段的解释如下：
Type：占1字节，用于表示本段标识子结构是设置有表示算法类型的字段的报文结构；
Algorithm：占1字节，算法类型字段，用于表示当前邻接段标识是相应的广播链路针对特定的算法类型而分配的。
值得注意的是，该段标识子结构中其它字段的解释，和现有OSPFv3报文结构中LAN Adj-SID Sub-TLV所包含的相应字段的解释相同，因此此处不再赘述。
另外，在一实施例中，步骤S200包括但不限于以下步骤：
根据不同的算法类型分别配置不同的QoS策略，并将QoS策略应用到与相应的算法类型对应的网络切片中的链路。
在本实施例中，针对每个节点，根据不同的算法类型分别配置不同的QoS策略，因此，在每个节点中，每一个算法类型均对应有一种QoS策略；此外，将与相应的算法类型对应的QoS策略应用到与相应的算法类型对应的网络切片中的链路，可以使得共享同一链路的不同网络切片能够具有不同的QoS策略，实现对不同网络切片实施差异化的QoS策略的目的。
以一个具体例子进行说明，在如图1所示的网络拓扑中，由于第一节点110归属于第一网络切片FA-128和第二网络切片FA-129，因此针对第一网络切片FA-128配置第一QoS策略，针对第二网络切片FA-129配置第二QoS策略，并将第一QoS策略和第二QoS策略同时应用到连接第一节点110的第一链路Link1，因此，承载于第一链路Link1的第一网络切片FA-128和第二网络切片FA-129能够对应具有第一QoS策略和第二QoS策略，从而能够实现网络切片间的QoS策略的差异化。
另外，在一实施例中，段标识包括与节点对应的节点段标识和与链路对应的链路段标识，节点段标识和链路段标识均与相应的算法类型对应。
在一实施例中，与节点对应的节点段标识可以有不同的实施方式，例如：针对SR-MPLS场景，节点段标 识为前缀段标识；针对SRv6场景，节点段标识为端点段标识。而与链路对应的链路段标识也可以有不同的实施方式，例如：针对SR-MPLS场景，链路段标识为邻接段标识；针对SRv6场景，链路段标识为三层交叉连接段标识。针对节点段标识和链路段标识的具体类型，可以根据实际的应用场景而适当选择，本实施例并不作具体限定。
在一实施例中，由于节点段标识和链路段标识均与相应的算法类型对应，因此当不同网络切片的报文根据节点段标识和链路段标识进行转发时，能够根据不同的算法类型进行区分，从而能够实现不同网络切片之间流量的区分及隔离；当报文在链路中传输时，由于报文是基于与相应的算法类型对应的链路段标识进行转发的，因此，对于不同网络切片共享同一个链路的情况时，本实施例也可以实现不同网络切片间的流量区分与隔离。
另外，参照图6，在一实施例中，步骤S300包括但不限于以下步骤：
步骤S310，根据不同的节点段标识，分别建立至目的节点的包含有相应的算法类型的第一标签转发表项；
步骤S320，根据不同的链路段标识，建立与相应的网络切片中的链路相关的且包含有对应的算法类型的第二标签转发表项；
步骤S330，根据第一标签转发表项、第二标签转发表项和QoS策略转发报文。
在一实施例中，如图6所示的路由方法可以应用于SR-MPLS场景，此时，第一标签转发表项包括转发等价类至下一跳标签转发单元映射(FEC to NHLFE Map，FTN)转发表项和入标签映射(Incoming Label Map，ILM)转发表项，并且在FTN转发表项和ILM转发表项所包含的转发信息中，均包含有相应的算法类型；第二标签转发表项则包括与邻接段标识相关的标签转发表项，并且该与邻接段标识相关的标签转发表项所包含的转发信息中，包含有相应的算法类型。因此，当本实施例的路由方法应用于SR-MPLS场景时，能够在保证不同网络切片的流量实现区分及隔离的情况下，实现报文的转发。
另外，参照图7，在一实施例中，步骤S300包括但不限于以下步骤：
步骤S340，根据不同的节点段标识，分别建立至目的节点的包含有相应的算法类型的路由转发表项；
步骤S350，根据不同的链路段标识，建立与相应的网络切片中的链路相关的且包含有对应的算法类型的本地段标识转发表项；
步骤S360，根据路由转发表项、本地段标识转发表项和QoS策略转发报文。
值得注意的是，如图6所示的实施例和如图7所示的实施例属于并列的实施例，并且分别对应于不同的应用场景。
在一实施例中，如图7所示的路由方法可以应用于SRv6场景，此时，路由转发表项为一般的路由表项，但该一般的路由表项所包含的转发信息中，包含有相应的算法类型；本地段标识转发表项则为与三层交叉连接段标识相关的local SID表项，并且该local SID表项所包含的转发信息中，包含有相应的算法类型。因此，当本实施例的路由方法应用于SRv6场景时，能够在保证不同网络切片的流量实现区分及隔离的情况下，实现报文的转发。
另外，参照图8，在一实施例中，步骤S310包括但不限于以下步骤：
步骤S311，根据不同的网络切片分别建立至目的节点的最短路径树；
步骤S312，根据最短路径树和与相应的网络切片对应的不同的节点段标识，分别建立至目的节点的包含有相应的算法类型的第一标签转发表项，其中，第一标签转发表项包括FTN转发表项和ILM转发表项，FTN转发表项和ILM转发表项均包含有相应的算法类型。
在一实施例中，在对与不同的算法类型对应的各个网络切片分别分配与相应的算法类型对应的段标识后，网络切片内的每个节点均以自己作为根节点而创建在该网络切片内的最短路径树，根据对应于不同根节点的最短路径树，网络切片内的节点均可获得其至其它目的节点的路径，在这种情况下，根据最短路径树和与相应的网络切片对应的不同的节点段标识，即可对网络切片内的每个节点均建立包含有相应的算法类型的FTN转发表项和ILM转发表项。当不同网络切片的报文在当前IGP协议域内根据FTN转发表项和ILM转发表项进行转发时，能够根据不同的算法类型进行区分，从而能够区分及隔离不同网络切片之间的流量；由于FTN转发表项和ILM转发表项中的转发信息均包含有对应的算法类型，因此，当不同网络切片的报文根据FTN转 发表项和ILM转发表项沿同一个链路进行转发时，也能够实现不同网络切片间的流量区分与隔离。
另外，参照图9，在一实施例中，步骤S340包括但不限于以下步骤：
步骤S341，根据不同的网络切片分别建立至目的节点的最短路径树；
步骤S342，根据最短路径树和与相应的网络切片对应的不同的节点段标识，分别建立至目的节点的包含有相应的算法类型的路由转发表项。
在一实施例中，在对与不同的算法类型对应的各个网络切片分别分配与相应的算法类型对应的段标识后，网络切片内的每个节点均以自己作为根节点而创建在该网络切片内的最短路径树，根据对应于不同根节点的最短路径树，网络切片内的节点均可获得其至其它目的节点的路径，在这种情况下，根据最短路径树和与相应的网络切片对应的不同的节点段标识，即可对网络切片内的每个节点均建立包含有相应的算法类型的路由转发表项。当不同网络切片的报文在当前IGP协议域内根据路由转发表项进行转发时，能够根据不同的算法类型进行区分，从而能够区分及隔离不同网络切片之间的流量；由于路由转发表项中的转发信息均包含有对应的算法类型，因此，当不同网络切片的报文根据路由转发表项沿同一个链路进行转发时，也能够实现不同网络切片间的流量区分与隔离。
另外，如图10所示，在一实施例中，步骤S300包括但不限于以下步骤：
步骤S370，根据段标识对各个网络切片分别建立段标识列表，段标识列表包含有节点段标识和链路段标识；
步骤S380，基于段标识列表和QoS策略转发报文。
值得注意的是，如图10所示的实施例和如图6所示的实施例、如图7所示的实施例相互属于并列的实施例，并且分别对应于不同的应用场景。
在一实施例中，如图10所示的路由方法可以应用于段式路由流量工程(Segment Routing Traffic Engineering，SR-TE)的转发行为。
针对SR-MPLS场景，根据段标识对各个网络切片分别建立段标识列表，即建立与各个网络切片对应的不同的SR-TE隧道，该SR-TE隧道内的段标识列表包含有与网络切片对应的前缀段标识或邻接段标识。当进行报文转发时，可以先把报文引导至网络切片内的SR-TE隧道，此时，报文将按照段标识列表进行逐段转发，例如，当某一段为前缀段时，报文将按照与相应前缀段标识对应的标签转发表项进行转发；又如，当某一段为邻接段时，报文将按照与相应邻接段标识对应的标签转发表项进行转发。另外，在转发报文时，将根据转发信息中所包含的算法类型，查询与该算法类型对应的QoS策略并为报文施加该QoS策略。所以，当本实施例的路由方法应用于SR-MPLS场景时，能够实现不同网络切片间的流量区分与隔离，并且能够对不同的网络切片实施差异化的QoS策略。
针对SRv6场景，根据段标识对各个网络切片分别建立段标识列表，即建立与各个网络切片对应的不同的SR-TE隧道，该SR-TE隧道内的段标识列表包含有与网络切片对应的端点段标识或三层交叉连接段标识。当进行报文转发时，可以先把报文引导至网络切片内的SR-TE隧道，此时，报文将按照段标识列表进行逐段转发，对于每一段相应的端点段标识或三层交叉连接段标识，将查询与相应目的定位器(Locator)对应的路由转发表项，当命中相应的路由转发表项时，即可利用该路由转发表项指导报文向产生该端点段标识或三层交叉连接段标识的起源节点进行转发，并且在转发过程中，将根据转发信息中所包含的算法类型，查询与该算法类型对应的QoS策略并为报文施加该QoS策略。当报文到达产生该端点段标识或三层交叉连接段标识的起源节点时，将查询相应的本地段标识转发表项，当命中相应的本地段标识转发表项时，特别是与三层交叉连接段标识对应的本地段标识转发表项时，将继续指导报文向某个三层接口转发，并且在转发过程中，将根据转发信息中所包含的算法类型，查询与该算法类型对应的QoS策略并为报文施加该QoS策略。所以，当本实施例的路由方法应用于SRv6场景时，能够实现不同网络切片间的流量区分与隔离，并且能够对不同的网络切片实施差异化的QoS策略。
针对上述实施例所提供的路由方法，下面以具体的示例进行详细的描述：
示例一：
如图11所示的网络拓扑中，包括有第一节点110、第二节点120、第三节点130、第四节点140和第五节 点150，第一节点110、第二节点120和第三节点130依次连接，第四节点140、第二节点120和第五节点150依次连接，第一节点110、第五节点150、第三节点130和第四节点140依次首尾连接。在如图11所示的网络拓扑中，构建有第一网络切片FA-128和第二网络切片FA-129，其中，第一网络切片FA-128对应的算法类型的取值定义为128，第二网络切片FA-129对应的算法类型的取值定义为129。第一网络切片FA-128包括第一节点110、第二节点120、第三节点130、第四节点140以及这些节点间相连的双向链路，第二网络切片FA-129包括第一节点110、第二节点120、第三节点130、第五节点150以及这些节点间相连的双向链路。在本示例中，第一网络切片FA-128和第二网络切片FA-129共享第一节点110和第二节点120之间的第一链路Link1以及共享第二节点120和第三节点130之间的第二链路Link2，并且在第一网络切片FA-128和第二网络切片FA-129中，作为源节点的第一节点110至作为目的节点的第三节点130的最短转发路径均为第一节点110-第二节点120-第三节点130。基于如图11所示的网络拓扑执行应用于SR-MPLS场景的路由方法时，具体过程如下：
首先，在第一节点110中针对第一网络切片FA-128和第二网络切片FA-129分别建立至第三节点130的FTN转发表项，这两个FTN转发表项的键值分别为<Algorithm 128，prefix-D>和<Algorithm 129，prefix-D>，其中，Algorithm 128表示为算法类型的取值为128，Algorithm 129表示为算法类型的取值为129，prefix-D表示为至第三节点130的前缀段标识，由此可知，这两个FTN转发表项所包含的转发信息中对应包含有取值为128的算法类型和取值为129的算法类型，此外，这两个FTN转发表项所包含的转发信息中还包含有相同的出接口(第一链路Link1)和下一跳(第二节点120)。
同样地，在第二节点120中针对第一网络切片FA-128和第二网络切片FA-129分别建立至第三节点130的ILM转发表项，这两个ILM转发表项的键值分别为Label-B-128和Label-B-129，这两个ILM转发表项所包含的转发信息中还对应包含有取值为128的算法类型和取值为129的算法类型，此外，这两个ILM转发表项所包含的转发信息中还包含有相同的出接口(第二链路Link2)和下一跳(第三节点130)。
同样地，在第三节点130中针对其自身分别建立对应于第一网络切片FA-128和第二网络切片FA-129的ILM转发表项，这两个ILM转发表项的键值分别为Label-D-128和Label-D-129，这两个ILM转发表项所包含的转发信息中还对应包含有取值为128的算法类型和取值为129的算法类型。
根据上述步骤，即可在第一网络切片FA-128和第二网络切片FA-129中分别得到从作为源节点的第一节点110至作为目的节点的第三节点130的转发路径，由于两个转发路径能够根据算法类型的不同而实现区分，因此，即使不同网络切片共享相同链路时，也能够实现不同网络切片间的流量区分与隔离。
另外，在第一节点110中针对两个算法类型配置相应的QoS策略，并将这两个QoS策略同时应用到第一链路Link1上，其中，这两个QoS策略可以分别标记为qos-policy-s-128和qos-policy-s-129。同样地，在第二节点120中也针对两个算法类型配置相应的QoS策略，并将这两个QoS策略同时应用到第二链路Link2上，其中，这两个QoS策略可以分别标记为qos-policy-b-128和qos-policy-b-129。同样地，在第三节点130中也针对两个算法类型配置相应的QoS策略，并将这两个QoS策略应用到第三节点130内部，其中，这两个QoS策略可以分别标记为qos-policy-d-128和qos-policy-d-129。此外，假设标记为qos-policy-s-128和qos-policy-b-128的QoS策略使得报文进入出向链路的高优先级队列，标记为qos-policy-s-129和qos-policy-b-129的QoS策略使得报文进入出向链路的低优先级队列，标记为qos-policy-d-128的QoS策略使得报文享有更高的网络处理单元(Networking Processing Unit，NPU)调度优先级，标记为qos-policy-d-129的QoS策略使得报文享有更低的NPU调度优先级。
基于上述的网络拓扑状态，当同类型的报文分别沿着第一网络切片FA-128和第二网络切片FA-129从第一节点110至第三节点130进行转发时，报文会被封装有一个外层MPLS标签。此时，在第一节点110中将根据相应的FTN转发表项中所包含的不同算法类型而获取不同的QoS策略，接着把相应的QoS策略施加至报文，在这种情况下，例如，第一网络切片FA-128所属的报文在转发时会进入第一链路Link1中的高优先级队列，而第二网络切片FA-129所属的报文在转发时会进入第一链路Link1中的低优先级队列；同样地，在第二节点120中将根据相应的ILM转发表项中所包含的不同算法类型而获取不同的QoS策略，接着把相应的QoS策略施加至报文，在这种情况下，例如，第一网络切片FA-128所属的报文在转发时会进入第二链路Link2 的高优先级队列，而第二网络切片FA-129所属的报文在转发时会进入第二链路Link2的低优先级队列；类似地，在第三节点130中也将根据相应的ILM转发表项中所包含的不同算法类型而获取不同的QoS策略，接着把相应的QoS策略施加至报文，在这种情况下，例如，第一网络切片FA-128所属的报文可以享有更高的NPU处理优先级，而第二网络切片FA-129所属的报文则享有较低的NPU处理优先级。因此，即使第一网络切片FA-128和第二网络切片FA-129共享相同的链路，也能够实现两个网络切片间的流量区分与隔离，并且能够对两个网络切片实施差异化的QoS策略。
示例二：
本示例和上述示例一基于相同的网络拓扑，即本示例也适用于如图11所示的网络拓扑。本示例和上述示例一的区别在于：本示例为应用于SRv6场景的路由方法，而示例一则为应用于SR-MPLS场景的路由方法。基于如图11所示的网络拓扑执行应用于SRv6场景的路由方法时，具体过程如下：
首先，在第一节点110中针对第一网络切片FA-128和第二网络切片FA-129分别建立至第三节点130的路由转发表项，这两个路由转发表项的键值分别为<prefix-D-128>和<prefix-D-129>，这两个路由转发表项所包含的转发信息中还对应包含有取值为128的算法类型和取值为129的算法类型，此外，这两个路由转发表项所包含的转发信息中还包含有相同的出接口(第一链路Link1)和下一跳(第二节点120)。
同样地，在第二节点120中针对第一网络切片FA-128和第二网络切片FA-129分别建立至第三节点130的路由转发表项，这两个路由转发表项的键值分别为<prefix-D-128>和<prefix-D-129>，这两个路由转发表项所包含的转发信息中还对应包含有取值为128的算法类型和取值为129的算法类型，此外，这两个路由转发表项所包含的转发信息中还包含有相同的出接口(第二链路Link2)和下一跳(第三节点130)。
同样地，在第三节点130中针对其自身不同的端点段标识分别建立对应于第一网络切片FA-128和第二网络切片FA-129的本地段标识转发表项，这两个本地段标识转发表项所包含的转发信息中对应包含有取值为128的算法类型和取值为129的算法类型。
根据上述步骤，即可在第一网络切片FA-128和第二网络切片FA-129中分别得到从作为源节点的第一节点110至作为目的节点的第三节点130的转发路径，由于两个转发路径能够根据算法类型的不同而实现区分，因此，即使不同网络切片共享相同链路时，也能够实现不同网络切片间的流量区分与隔离。
此外，本示例中根据算法类型对网络切片进行QoS策略配置的具体过程，和上述示例一中根据算法类型对网络切片进行QoS策略配置的具体过程相同，为了避免冗余，此处不再赘述。
基于上述的网络拓扑状态，当同类型的报文分别沿着第一网络切片FA-128和第二网络切片FA-129从第一节点110至第三节点130进行SRv6的承载转发时，报文会被封装有一个外层IPv6头，而目的IP则会被设置为相应网络切片内的目的节点的端点段标识。此时，在第一节点110中将根据相应的路由转发表项中所包含的不同算法类型而获取不同的QoS策略，接着把相应的QoS策略施加至报文，在这种情况下，例如，第一网络切片FA-128所属的报文在转发时会进入第一链路Link1中的高优先级队列，而第二网络切片FA-129所属的报文在转发时会进入第一链路Link1中的低优先级队列；同样地，在第二节点120中将根据相应的路由转发表项中所包含的不同算法类型而获取不同的QoS策略，接着把相应的QoS策略施加至报文，在这种情况下，例如，第一网络切片FA-128所属的报文在转发时会进入第二链路Link2的高优先级队列，而第二网络切片FA-129所属的报文在转发时会进入第二链路Link2的低优先级队列；类似地，在第三节点130中也将根据相应的本地段标识转发表项中所包含的不同算法类型而获取不同的QoS策略，接着把相应的QoS策略施加至报文，在这种情况下，例如，第一网络切片FA-128所属的报文可以享有更高的NPU处理优先级，而第二网络切片FA-129所属的报文则享有较低的NPU处理优先级。因此，即使第一网络切片FA-128和第二网络切片FA-129共享相同的链路，也能够实现两个网络切片间的流量区分与隔离，并且能够对两个网络切片实施差异化的QoS策略。
示例三：
如图12所示的网络拓扑中，包括有第一节点110、第二节点120、第三节点130、第四节点140、第五节点150和第六节点160，第一节点110、第二节点120、第三节点130、第四节点140、第五节点150和第六节点160依次首尾连接，第二节点120和第五节点150相连接。在如图12所示的网络拓扑中，构建有第一网络 切片FA-128和第二网络切片FA-129，其中，第一网络切片FA-128对应的算法类型的取值定义为128，第二网络切片FA-129对应的算法类型的取值定义为129。第一网络切片FA-128包括第一节点110、第二节点120、第五节点150、第四节点140以及这些节点间相连的双向链路，第二网络切片FA-129包括第二节点120、第三节点130、第五节点150、第六节点160以及这些节点间相连的双向链路。在本示例中，第一网络切片FA-128和第二网络切片FA-129共享第二节点120和第五节点150之间的第一链路Link1；此外，在第一网络切片FA-128中，作为源节点的第一节点110至作为目的节点的第二节点120的最短转发路径为第一节点110-第二节点120，TI-LFA(Topology Independent Loop-Free Alternate，拓扑无关的无环替代)备份路径为{第五节点150，第五节点150-第二节点120}；在第二网络切片FA-129中，作为源节点的第三节点130至作为目的节点的第二节点120的最短转发路径为第三节点130-第二节点120，TI-LFA备份路径也为{第五节点150，第五节点150-第二节点120}。假设，当报文沿TI-LFA备份路径进行转发时，报文将先被转发至第五节点150，然后再沿第一链路Link1被转发至第二节点120。基于如图12所示的网络拓扑执行应用于SR-MPLS场景的路由方法时，具体过程如下：
在第一网络切片FA-128中，第一节点110中的TI-LFA备份路径{第五节点150，第五节点150-第二节点120}所对应的段标识列表可表示为{prefix-d-sid-128，adj-d-link1-sid-128}；而在第二网络切片FA-129中，第三节点130中的TI-LFA备份路径{第五节点150，第五节点150-第二节点120}所对应的段标识列表可表示为{prefix-d-sid-129，adj-d-link1-sid-129}。
在第五节点150中，分别针对第一网络切片FA-128内的adj-d-link1-sid-128和第二网络切片FA-129内的adj-d-link1-sid-129建立不同的ILM转发表项，这两个ILM转发表项所包含的转发信息中对应包含有取值为128的算法类型和取值为129的算法类型，此外，这两个ILM转发表项所包含的转发信息中还包含有相同的出接口(第一链路Link1)和下一跳(第二节点120)。
另外，在第五节点150中针对两个算法类型配置相应的QoS策略，并将这两个QoS策略同时应用到第一链路Link1上，其中，这两个QoS策略可以分别标记为qos-policy-b-128和qos-policy-b-129。假设标记为qos-policy-b-128的QoS策略使得报文进入第一链路Link1的高优先级队列，而标记为qos-policy-b-129的QoS策略使得报文进入第一链路Link1的低优先级队列，那么，当同类型的报文分别沿着第一网络切片FA-128和第二网络切片FA-129按照TI-LFA备份路径进行转发时，将根据相应的ILM转发表项中所包含的不同算法类型而获取不同的QoS策略，并把相应的QoS策略施加至报文，在这种情况下，第一网络切片FA-128所属的报文在转发时会进入第一链路Link1中的高优先级队列，而第二网络切片FA-129所属的报文在转发时则会进入第一链路Link1中的低优先级队列。因此，即使第一网络切片FA-128和第二网络切片FA-129共享相同的链路，也能够实现两个网络切片间的流量区分与隔离，并且能够对两个网络切片实施差异化的QoS策略。
示例四：
本示例和上述示例三基于相同的网络拓扑，即本示例也适用于如图12所示的网络拓扑。本示例和上述示例三的区别在于：本示例为应用于SRv6场景的路由方法，而示例三则为应用于SR-MPLS场景的路由方法。基于如图12所示的网络拓扑执行应用于SRv6场景的路由方法时，具体过程如下：
在第一网络切片FA-128中，第一节点110中的TI-LFA备份路径{第五节点150，第五节点150-第二节点120}所对应的段标识列表可表示为{end-b-sid-128，endx-b-link1-sid-128}；而在第二网络切片FA-129中，第三节点130中的TI-LFA备份路径{第五节点150，第五节点150-第二节点120}所对应的段标识列表可表示为{end-b-sid-129，endx-b-link1-sid-129}。
在第五节点150中，分别针对第一网络切片FA-128内的endx-b-link1-sid-128和第二网络切片FA-129内的endx-b-link1-sid-129建立不同的本地段标识转发表项，这两个本地段标识转发表项所包含的转发信息中对应包含有取值为128的算法类型和取值为129的算法类型，此外，这两个本地段标识转发表项所包含的转发信息中还包含有相同的出接口(第一链路Link1)和下一跳(第二节点120)。
另外，在第五节点150中针对两个算法类型配置相应的QoS策略，并将这两个QoS策略同时应用到第一链路Link1上，其中，这两个QoS策略可以分别标记为qos-policy-b-128和qos-policy-b-129。假设标记为qos-policy-b-128的QoS策略使得报文进入第一链路Link1的高优先级队列，而标记为qos-policy-b-129的QoS 策略使得报文进入第一链路Link1的低优先级队列，那么，当同类型的报文分别沿着第一网络切片FA-128和第二网络切片FA-129按照TI-LFA备份路径进行转发时，将根据相应的本地段标识转发表项中所包含的不同算法类型而获取不同的QoS策略，并把相应的QoS策略施加至报文，在这种情况下，第一网络切片FA-128所属的报文在转发时会进入第一链路Link1中的高优先级队列，而第二网络切片FA-129所属的报文在转发时则会进入第一链路Link1中的低优先级队列。因此，即使第一网络切片FA-128和第二网络切片FA-129共享相同的链路，也能够实现两个网络切片间的流量区分与隔离，并且能够对两个网络切片实施差异化的QoS策略。
另外，本申请的一个实施例还提供了一种路由方法，如图13所示，图13是本申请一个实施例提供的路由方法的流程图，该路由方法可以应用于如图1、图11或图12所示实施例中的不同节点，该路由方法包括但不限于以下步骤：
步骤S410，接收通过IGP协议泛洪的不同的段标识，其中，不同的段标识分别与不同的算法类型及不同的网络切片相对应，且不同的网络切片与不同的算法类型相对应；
步骤S420，接收基于不同的段标识和不同的QoS策略转发的报文，其中，不同的QoS策略被配置于不同的网络切片，且不同的QoS策略与不同的算法类型相对应。
在一实施例中，接收通过IGP协议泛洪的不同的段标识，可以使得当前IGP协议域内的每个节点均可以保存有当前IGP协议域内所有节点的段标识，另外，由于与每个网络切片对应的段标识均对应于一个算法类型，所以，当在当前IGP协议域内接收到根据该段标识进行转发的来自于不同网络切片的报文时，能够根据不同的算法类型进行区分，即能够区分及隔离不同网络切片之间的流量，由于接收到的报文是基于与相应的算法类型对应的段标识进行转发的，因此即使不同网络切片共享相同链路时，也能够实现不同网络切片间的流量区分与隔离。
本领域技术人员可以理解的是，IGP FA技术是应用于IGP协议的一种算法，可以根据需要定义一组算法约束条件，并基于该算法约束条件生成满足该算法约束条件的转发路径，从而可以根据这些转发路径生成专属于特定业务流量的网络切片。
值得注意的是，与如图2所示实施例中的段标识一样，本实施例中的段标识同样可以有不同的实施方式。本实施例中的段标识的具体实施方式和如图2所示实施例中的段标识的具体实施方式相同，具体内容可以参照如图2所示实施例中的对应部分，为了避免冗余重复，在此不再赘述。
在一实施例中，QoS策略包括带宽策略、流量服务等级策略、队列调度策略和丢弃策略等中的一个或多个，可以根据实际使用情况而配置于各个网络切片中。由于不同的QoS策略被配置于不同的网络切片，且不同的QoS策略与不同的算法类型相对应，所以，当在当前IGP协议域内接收到根据相应的段标识进行转发的来自于不同网络切片的报文时，每个报文均会对应于一个QoS策略，即能够对不同网络切片实施差异化的QoS策略；由于不同网络切片的报文都对应于不同的段标识和QoS策略，因此，即使不同网络切片共享相同链路，也能够对不同的网络切片实施差异化的QoS策略。
在一实施例中，当IGP协议为ISIS协议，接收设置有与算法类型对应的段标识子结构的ISIS报文以接收段标识，其中，段标识子结构中设置有表示算法类型的字段。
在一实施例中，当IGP协议为ISIS协议时，由于ISIS报文中设置有与算法类型对应的段标识子结构，并且该段标识子结构中设置有表示算法类型的字段，因此，在当前节点接收到由各个节点泛洪过来的ISIS报文的时候，能够接收到与不同算法类型对应的段标识，因此，通过根据不同的算法类型进行区分，能够区分及隔离不同网络切片之间的流量。
值得注意的是，在ISIS报文中设置的与算法类型对应的段标识子结构的具体示例，可参照如图3A所示的示例或如图3B所示的示例，为了避免冗余重复，在此不再赘述。
在一实施例中，当IGP协议为OSPF协议，接收设置有与算法类型对应的段标识子结构的OSPF报文以接收段标识，其中，段标识子结构中设置有表示算法类型的字段。
在一实施例中，当IGP协议为OSPF协议时，由于OSPF报文中设置有与算法类型对应的段标识子结构，并且该段标识子结构中设置有表示算法类型的字段，因此，在当前节点接收到由各个节点泛洪过来的OSPF 报文的时候，能够接收到与不同算法类型对应的段标识，因此，通过根据不同的算法类型进行区分，能够区分及隔离不同网络切片之间的流量。
值得注意的是，在OSPF报文中设置的与算法类型对应的段标识子结构的具体示例，可参照如图4A所示的示例或如图4B所示的示例，为了避免冗余重复，在此不再赘述。
在一实施例中，当IGP协议为OSPFv3协议，接收设置有与算法类型对应的段标识子结构的OSPFv3报文以接收段标识，其中，段标识子结构中设置有表示算法类型的字段。
在一实施例中，当IGP协议为OSPFv3协议时，由于OSPFv3报文中设置有与算法类型对应的段标识子结构，并且该段标识子结构中设置有表示算法类型的字段，因此，在当前节点接收到由各个节点泛洪过来的OSPFv3报文的时候，能够接收到与不同算法类型对应的段标识，因此，通过根据不同的算法类型进行区分，能够区分及隔离不同网络切片之间的流量。
值得注意的是，在OSPFv3报文中设置的与算法类型对应的段标识子结构的具体示例，可参照如图5A所示的示例或如图5B所示的示例，为了避免冗余重复，在此不再赘述。
另外，在一实施例中，段标识包括与节点对应的节点段标识和与链路对应的链路段标识，节点段标识和链路段标识均与相应的算法类型对应。
在一实施例中，与节点对应的节点段标识可以有不同的实施方式，例如：针对SR-MPLS场景，节点段标识为前缀段标识；针对SRv6场景，节点段标识为端点段标识。而与链路对应的链路段标识也可以有不同的实施方式，例如：针对SR-MPLS场景，链路段标识为邻接段标识；针对SRv6场景，链路段标识为三层交叉连接段标识。针对节点段标识和链路段标识的具体类型，可以根据实际的应用场景而适当选择，本实施例并不作具体限定。
在一实施例中，由于节点段标识和链路段标识均与相应的算法类型对应，因此当接收到根据节点段标识和链路段标识进行转发的来自于不同网络切片的报文时，能够根据不同的算法类型进行区分，即能够实现不同网络切片之间流量的区分及隔离；由于报文在链路中的传输是基于与相应的算法类型对应的链路段标识进行转发的，因此，即使不同网络切片共享同一个链路，本实施例也可以根据不同算法类型的区分而实现不同网络切片间的流量区分与隔离。
另外，参照图14，本申请的一个实施例提供了一种路由装置，该路由装置包括：存储器1401、处理器1402及存储在存储器1401上并可在处理器1402上运行的计算机程序。
处理器1402和存储器1401可以通过总线或者其他方式连接。
需要说明的是，本实施例中的路由装置，可以应用于如图1、图11或图12所示实施例中的不同节点或者网络控制器，包括有本实施例中的路由装置的节点或者网络控制器，能够构成图1、图11或图12所示实施例中的网络拓扑的一部分，这些实施例均属于相同的发明构思，因此这些实施例具有相同的实现原理以及有益效果，此处不再详述。
实现上述实施例的路由方法所需的非暂态软件程序以及指令存储在存储器中，当被处理器执行时，执行上述实施例的路由方法，例如，执行以上描述的图2中的方法步骤S100至S300、图6中的方法步骤S310至S330、图7中的方法步骤S340至S360、图8中的方法步骤S311至S312、图9中的方法步骤S341至S342、图10中的方法步骤S370至S380、图13中的方法步骤S410至S420。
以上所描述的装置实施例仅仅是示意性的，其中作为分离部件说明的单元可以是或者也可以不是物理上分开的，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案的目的。
此外，本申请的一个实施例还提供了一种计算机可读存储介质，该计算机可读存储介质存储有计算机可执行指令，该计算机可执行指令被一个处理器或控制器执行，例如，被上述路由装置实施例中的一个处理器执行，可使得上述处理器执行上述实施例中的路由方法，例如，执行以上描述的图2中的方法步骤S100至S300、图6中的方法步骤S310至S330、图7中的方法步骤S340至S360、图8中的方法步骤S311至S312、图9中的方法步骤S341至S342、图10中的方法步骤S370至S380、图13中的方法步骤S410至S420。
本申请实施例中，根据相应的算法类型配置对应的段标识和QoS策略，能够对共享相同链路的不同网络 切片实现流量区分与隔离，并且能够对不同网络切片实施差异化的QoS策略。
本申请实施例提供了一种路由方法、路由装置及计算机可读存储介质，能够对共享相同链路的不同网络切片实现流量区分与隔离，并且能够对不同网络切片实施差异化的QoS策略。
本申请实施例包括：对与不同算法类型对应的各个网络切片分别分配与相应算法类型对应的段标识，并通过IGP协议泛洪该段标识，对各个网络切片分别配置与相应算法类型对应的QoS策略，基于该段标识和该QoS策略转发报文。根据本申请实施例提供的方案，通过对与不同算法类型对应的各个网络切片分别分配与相应算法类型对应的段标识，并通过IGP协议泛洪该段标识，可以使得当前IGP协议域内的每个节点均保存有当前IGP协议域内所有节点的与相应的算法类型对应的段标识；另外，通过对各个网络切片分别配置与相应的算法类型对应的QoS策略，可以使得不同的网络切片与不同的QoS策略相对应；因此，当不同网络切片的报文在当前IGP协议域内根据该段标识进行转发时，不仅能够根据不同的算法类型而区分及隔离不同网络切片之间的流量，还能够根据与之对应的QoS策略而对不同网络切片实施差异化的QoS策略；由于网络切片的报文是基于与相应算法类型对应的段标识进行转发的，而且不同的网络切片分别配置有与相应算法类型对应的QoS策略，因此，即使不同的网络切片共享相同的链路，也能够实现不同网络切片间的流量区分与隔离，并且能够对不同的网络切片实施差异化的QoS策略。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统可以被实施为软件、固件、硬件及其适当的组合。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。
以上是对本申请的一些实施进行了具体说明，但本申请并不局限于上述实施方式，熟悉本领域的技术人员在不违背本申请范围的前提下还可作出种种的等同变形或替换，这些等同的变形或替换均包含在本申请权利要求所限定的范围内。

Claims (13)

  1. 一种路由方法，包括，
    对与不同的算法类型对应的各个网络切片分别分配与相应的所述算法类型对应的段标识，并通过内部网关协议IGP协议泛洪所述段标识；
    对各个所述网络切片分别配置与相应的所述算法类型对应的服务质量QoS策略；
    基于所述段标识和所述QoS策略转发报文。
  2. 根据权利要求1所述的路由方法，其中，
    当所述IGP协议为中间系统到中间系统ISIS协议，泛洪设置有与所述算法类型对应的段标识子结构的ISIS报文以泛洪所述段标识，其中，所述段标识子结构中设置有表示所述算法类型的字段；
    当所述IGP协议为开放式最短路径优先OSPF协议，泛洪设置有与所述算法类型对应的段标识子结构的OSPF报文以泛洪所述段标识，其中，所述段标识子结构中设置有表示所述算法类型的字段；
    当所述IGP协议为开放式最短路径优先OSPFv3协议，泛洪设置有与所述算法类型对应的段标识子结构的OSPFv3报文以泛洪所述段标识，其中，所述段标识子结构中设置有表示所述算法类型的字段。
  3. 根据权利要求1所述的路由方法，其中，所述对各个所述网络切片分别配置与相应的所述算法类型对应的服务质量QoS策略，包括：
    根据不同的所述算法类型分别配置不同的QoS策略，并将所述QoS策略应用到与相应的所述算法类型对应的所述网络切片中的链路。
  4. 根据权利要求1所述的路由方法，其中，所述段标识包括与节点对应的节点段标识和与链路对应的链路段标识，所述节点段标识和所述链路段标识均与相应的所述算法类型对应。
  5. 根据权利要求4所述的路由方法，其中，所述基于所述段标识和所述QoS策略转发报文，包括如下之一：
    根据不同的所述节点段标识，分别建立至目的节点的包含有相应的所述算法类型的第一标签转发表项；根据不同的所述链路段标识，建立与相应的所述网络切片中的链路相关的且包含有对应的所述算法类型的第二标签转发表项；根据所述第一标签转发表项、所述第二标签转发表项和所述QoS策略转发报文；
    根据不同的所述节点段标识，分别建立至目的节点的包含有相应的所述算法类型的路由转发表项；根据不同的所述链路段标识，建立与相应的所述网络切片中的链路相关的且包含有对应的所述算法类型的本地段标识转发表项；根据所述路由转发表项、所述本地段标识转发表项和所述QoS策略转发报文。
  6. 根据权利要求5所述的路由方法，其中，所述根据不同的所述节点段标识，分别建立至目的节点的包含有相应的所述算法类型的第一标签转发表项，包括：
    根据不同的所述网络切片分别建立至目的节点的最短路径树；
    根据所述最短路径树和与相应的所述网络切片对应的不同的所述节点段标识，分别建立至目的节点的包含有相应的所述算法类型的第一标签转发表项，其中，所述第一标签转发表项包括转发等价类至下一跳标签转发单元映射FTN转发表项和入标签映射ILM转发表项，所述FTN转发表项和所述ILM转发表项均包含有相应的所述算法类型。
  7. 根据权利要求5所述的路由方法，其中，所述根据不同的所述节点段标识，分别建立至目的节点的包含有相应的所述算法类型的路由转发表项，包括：
    根据不同的所述网络切片分别建立至目的节点的最短路径树；
    根据所述最短路径树和与相应的所述网络切片对应的不同的所述节点段标识，分别建立至目的节点的包 含有相应的所述算法类型的路由转发表项。
  8. 根据权利要求4所述的路由方法，其中，所述基于所述段标识和所述QoS策略转发报文，包括：
    根据所述段标识对各个所述网络切片分别建立段标识列表，所述段标识列表包含有所述节点段标识和所述链路段标识；
    基于所述段标识列表和所述QoS策略转发报文。
  9. 一种路由方法，包括，
    接收通过内部网关协议IGP协议泛洪的不同的段标识，其中，不同的所述段标识分别与不同的算法类型及不同的网络切片相对应，且不同的所述网络切片与不同的所述算法类型相对应；
    接收基于不同的所述段标识和不同的服务质量QoS策略转发的报文，其中，不同的所述QoS策略被配置于不同的所述网络切片，且不同的所述QoS策略与不同的所述算法类型相对应。
  10. 根据权利要求9所述的路由方法，其中，
    当所述IGP协议为中间系统到中间系统ISIS协议，接收设置有与所述算法类型对应的段标识子结构的ISIS报文以接收所述段标识，其中，所述段标识子结构中设置有表示所述算法类型的字段；
    当所述IGP协议为开放式最短路径优先OSPF协议，接收设置有与所述算法类型对应的段标识子结构的OSPF报文以接收所述段标识，其中，所述段标识子结构中设置有表示所述算法类型的字段；
    当所述IGP协议为开放式最短路径优先OSPFv3协议，接收设置有与所述算法类型对应的段标识子结构的OSPFv3报文以接收所述段标识，其中，所述段标识子结构中设置有表示所述算法类型的字段。
  11. 根据权利要求9所述的路由方法，其中，所述段标识包括与节点对应的节点段标识和与链路对应的链路段标识，所述节点段标识和所述链路段标识均与相应的所述算法类型对应。
  12. 一种路由装置，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，所述处理器执行所述计算机程序时实现如权利要求1至8中任意一项所述的路由方法或实现如权利要求9至11中任意一项所述的路由方法。
  13. 一种计算机可读存储介质，存储有计算机可执行指令，其中，所述计算机可执行指令用于执行权利要求1至8中任意一项所述的路由方法或执行权利要求9至11中任意一项所述的路由方法。
PCT/CN2020/137252 2020-02-19 2020-12-17 路由方法、路由装置及计算机可读存储介质 WO2021164402A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP20920203.5A EP4109831A4 (en) 2020-02-19 2020-12-17 ROUTING METHOD, ROUTING DEVICE AND COMPUTER READABLE STORAGE MEDIUM
US17/758,517 US20230033298A1 (en) 2020-02-19 2020-12-17 Routing method, routing device and computer-readable storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010102220.0 2020-02-19
CN202010102220.0A CN113285876B (zh) 2020-02-19 2020-02-19 路由方法、路由装置及计算机可读存储介质

Publications (1)

Publication Number Publication Date
WO2021164402A1 true WO2021164402A1 (zh) 2021-08-26

Family

ID=77274988

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/137252 WO2021164402A1 (zh) 2020-02-19 2020-12-17 路由方法、路由装置及计算机可读存储介质

Country Status (4)

Country Link
US (1) US20230033298A1 (zh)
EP (1) EP4109831A4 (zh)
CN (1) CN113285876B (zh)
WO (1) WO2021164402A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114826999A (zh) * 2022-03-22 2022-07-29 北京邮电大学 卫星网络数据传输方法及装置

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102018206780B4 (de) * 2018-05-02 2024-08-14 Volkswagen Aktiengesellschaft Verfahren und Computerprogramm zum Senden eines Datenpaketes, Verfahren und Computerprogramm zum Empfangen eines Datenpaketes, Kommunikationseinheit und Kraftfahrzeug mit Kommunikationseinheit
CN115733793A (zh) * 2020-04-20 2023-03-03 华为技术有限公司 路由配置方法和路由配置装置
US11418436B2 (en) * 2020-05-08 2022-08-16 Ciena Corporation NG-VPLS E-tree signaling using segment routing
US20220247663A1 (en) * 2021-02-04 2022-08-04 Nokia Solutions And Networks Oy Service differentiation based on constrained network topology slicing

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180262585A1 (en) * 2017-03-08 2018-09-13 Linkedin Corporation Sub-second network telemetry using a publish-subscribe messaging system
CN108810903A (zh) * 2017-05-04 2018-11-13 中国移动通信有限公司研究院 一种数据传输配置及数据传输方法和装置
CN109040322A (zh) * 2018-10-08 2018-12-18 腾讯科技（深圳）有限公司 车辆通信方法、装置、计算机可读介质及电子设备
CN109743213A (zh) * 2019-02-28 2019-05-10 腾讯科技（深圳）有限公司 一种网络切片处理方法和设备以及系统
CN110535766A (zh) * 2018-05-25 2019-12-03 华为技术有限公司 一种生成路由的方法和设备

Family Cites Families (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10368777B2 (en) * 2012-09-14 2019-08-06 Toshiba Medical Systems Corporation Non-contrast dynamic MRI myocardial perfusion analysis and visualization
US9565160B2 (en) * 2013-03-11 2017-02-07 Cisco Technology, Inc. Advertisement of adjacency segment identifiers
US9444677B2 (en) * 2013-10-18 2016-09-13 Cisco Technology, Inc. Scalable edge node protection using IPv6 segment routing extension header
US10263881B2 (en) * 2016-05-26 2019-04-16 Cisco Technology, Inc. Enforcing strict shortest path forwarding using strict segment identifiers
US10445100B2 (en) * 2016-06-09 2019-10-15 International Business Machines Corporation Broadcasting messages between execution slices for issued instructions indicating when execution results are ready
CN112165725B (zh) * 2016-06-15 2024-03-19 华为技术有限公司 报文处理的方法及设备
CN107666436B (zh) * 2016-07-27 2019-05-17 中兴通讯股份有限公司 报文转发方法及装置
CN113891432B (zh) * 2016-08-16 2024-06-18 交互数字专利控股公司 Wtru以及wtru中实施的用于无线通信的方法
CN108964961A (zh) * 2017-05-27 2018-12-07 华为技术有限公司 一种管理传输网切片的方法、装置及系统
CN113489641A (zh) * 2017-12-22 2021-10-08 华为技术有限公司 一种网络中传输报文的方法和节点
US20190230115A1 (en) * 2018-01-23 2019-07-25 Cisco Technology, Inc. Fatigue-based segment routing
CN108282708B (zh) * 2018-01-31 2020-07-14 北京电信规划设计院有限公司 多运营商odn共享及异构pon统一管理方法
EP3818669B1 (en) * 2018-07-02 2023-08-09 Cisco Technology, Inc. Resource partitioning for network slices in segment routing networks
CN109062501A (zh) * 2018-07-05 2018-12-21 南京信息职业技术学院 一种基于ida算法的网盘聚合方法
US10567293B1 (en) * 2018-08-23 2020-02-18 Cisco Technology, Inc. Mechanism to coordinate end to end quality of service between network nodes and service provider core
CN112054960B (zh) * 2019-02-13 2024-04-26 华为技术有限公司 一种路径计算方法、装置及设备
US10764175B1 (en) * 2019-03-19 2020-09-01 Cisco Technology, Inc. Validating resource isolation between network slices in a mobile network
US11424986B2 (en) * 2019-10-24 2022-08-23 Cisco Technology, Inc. Method and apparatus for mobile packet core mechanism for GiLAN network slices with segment routing

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180262585A1 (en) * 2017-03-08 2018-09-13 Linkedin Corporation Sub-second network telemetry using a publish-subscribe messaging system
CN108810903A (zh) * 2017-05-04 2018-11-13 中国移动通信有限公司研究院 一种数据传输配置及数据传输方法和装置
CN110535766A (zh) * 2018-05-25 2019-12-03 华为技术有限公司 一种生成路由的方法和设备
CN109040322A (zh) * 2018-10-08 2018-12-18 腾讯科技（深圳）有限公司 车辆通信方法、装置、计算机可读介质及电子设备
CN109743213A (zh) * 2019-02-28 2019-05-10 腾讯科技（深圳）有限公司 一种网络切片处理方法和设备以及系统

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4109831A4 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114826999A (zh) * 2022-03-22 2022-07-29 北京邮电大学 卫星网络数据传输方法及装置
CN114826999B (zh) * 2022-03-22 2023-06-20 北京邮电大学 卫星网络数据传输方法及装置

Also Published As

Publication number Publication date
EP4109831A1 (en) 2022-12-28
CN113285876A (zh) 2021-08-20
EP4109831A4 (en) 2024-01-31
CN113285876B (zh) 2024-04-23
US20230033298A1 (en) 2023-02-02

Similar Documents

Publication Publication Date Title
WO2021164402A1 (zh) 路由方法、路由装置及计算机可读存储介质
US11689452B2 (en) Method for forwarding service data, network device, and network system
US10673741B2 (en) Control device discovery in networks having separate control and forwarding devices
US10581733B2 (en) Methods and devices for constructing label and forwarding label packet
US8599685B2 (en) Snooping of on-path IP reservation protocols for layer 2 nodes
US7551551B2 (en) Fast reroute (FRR) protection at the edge of a RFC 2547 network
CN102150148B (zh) 层2拓扑中针对单播帧和多播帧的差别化服务
EP1859586B1 (en) Loop prevention technique for mpls using service labels
US9485198B1 (en) Methods and apparatus for multicast traffic failover in a network
CN102986176A (zh) 用于bgp mac-vpn的mpls标签分配的方法和装置
CN103428088B (zh) 一种树根分配、报文处理的方法及路由网桥
CN107623630B (zh) 一种位索引显式复制信息传递方法和装置
US11240063B2 (en) Methods, nodes and computer readable media for tunnel establishment per slice
WO2021129085A1 (zh) 网络切片创建方法、报文转发方法及其装置
WO2021143279A1 (zh) 段路由业务处理方法和装置、路由设备及存储介质
WO2021022945A1 (zh) 一种内部网关协议泛洪优化方法及装置、存储介质
CN113366804A (zh) 防止网络拓扑改变期间的微环路的方法和系统
WO2020244304A1 (zh) 路由信息发送的方法、路由选路的方法和装置
CN104247346B (zh) 分组交换网络中的伪线路扩展的群组消息传送
CN112055954B (zh) 网络中优选路径路由的资源预留和维护
WO2022042610A1 (zh) 信息处理方法、网络控制器、节点及计算机可读存储介质
CN103595609B (zh) Trill网络互联方法、系统及设备
WO2012159316A1 (zh) 用于在网络中确定等值路径的方法、网络装置和系统

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20920203

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2020920203

Country of ref document: EP

Effective date: 20220919