WO2020063201A1 - 网络切片的创建方法及装置 - Google Patents

网络切片的创建方法及装置 Download PDF

Info

Publication number
WO2020063201A1
WO2020063201A1 PCT/CN2019/101700 CN2019101700W WO2020063201A1 WO 2020063201 A1 WO2020063201 A1 WO 2020063201A1 CN 2019101700 W CN2019101700 W CN 2019101700W WO 2020063201 A1 WO2020063201 A1 WO 2020063201A1
Authority
WO
WIPO (PCT)
Prior art keywords
slice
link
node
bundle
calculation
Prior art date
Application number
PCT/CN2019/101700
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 EP19865125.9A priority Critical patent/EP3817446B1/en
Publication of WO2020063201A1 publication Critical patent/WO2020063201A1/zh
Priority to US17/103,924 priority patent/US11606255B2/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0252—Traffic management, e.g. flow control or congestion control per individual bearer or channel
    • H04W28/0263—Traffic management, e.g. flow control or congestion control per individual bearer or channel involving mapping traffic to individual bearers or channels, e.g. traffic flow template [TFT]
    • 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/0893—Assignment of logical groups to network elements
    • 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/0803—Configuration setting
    • H04L41/0806—Configuration setting for initial configuration or provisioning, e.g. plug-and-play
    • 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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H04L45/507—Label distribution
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/80—Actions related to the user profile or the type of traffic
    • H04L47/803—Application aware
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/0005—Control or signalling for completing the hand-off
    • H04W36/0011—Control or signalling for completing the hand-off for data sessions of end-to-end connection
    • 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/123—Evaluation of link metrics

Definitions

  • the embodiments of the present application relate to 5G (5Generation, fifth generation mobile communication technology) slicing technology, for example, to a method and device for creating a network slice.
  • 5G 5Generation, fifth generation mobile communication technology
  • the requirement of 5G slices for bearer networks is that different slices need to have their own dedicated bearer subnetworks.
  • Different dedicated bearer subnetworks can be either strict hard resource isolation or soft isolation that achieves a similar hard isolation effect.
  • the packet network does not support hard isolation. It supports statistical multiplexing, which is more economical than a dedicated network or a TDM (Time Division Multiplex) network. It can be seen that in order to respond to the 5G slicing requirements, the packet network needs to be sliced on the underlay network resources to meet the requirements of different overlay services, such as VPN (Virtual Private Network) services.
  • VPN Virtual Private Network
  • IGP Interior, Gateway, Protocol
  • IGP Interior, Gateway, Protocol multi-topology technology
  • Others use the IGP flexible algorithm algorithm to run multiple IGP algorithms in the same topology to obtain multiple Flex-algorithm planes, and iterate different overlay services to different Flex-algorithm planes.
  • the IGP multi-topology technology needs to maintain multiple IGP routing tables in the packet network equipment. The implementation overhead and cost are very high. Therefore, the IGP multi-topology technology is rarely used in actual network deployment.
  • the technology cannot effectively support TE (Traffic Engineering) bandwidth reservation requirements, which limits the application of IGP Flex-algorithm technology.
  • TE Traffic Engineering
  • the original intention of the IGP Flex-algorithm technology is not to serve as a network slicing solution, but to compress Segments Routing policies (Segmented Routing Policy, SR policy, see draft-ietf-spring-segment-routing-policy-01) The label stack.
  • a basic requirement is that the underlay network resources need to be sliced, that is, some underlay network resources need to be configured with a unique slice-id.
  • Another basic requirement is that the overlay service is a service within a dedicated slice. It will also be configured with its own slice number.
  • An embodiment of the present application provides a method for creating a network slice, including:
  • sliced bundle link includes: at least one member link created between the first node and the second node;
  • a packet service is configured for the slice bundle link.
  • An embodiment of the present application further provides a device for creating a network slice, including:
  • a creating unit configured to create a sliced bundle link between the first node and the second node; wherein the sliced bundle link includes: at least one member link created between the first node and the second node;
  • the configuration unit is configured to configure the slice bundle link to configure a packet service.
  • An embodiment of the present application further provides a device for network slicing, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor.
  • a device for network slicing which includes a memory, a processor, and a computer program stored on the memory and executable on the processor.
  • An embodiment of the present application further provides a computer-readable storage medium.
  • the computer-readable storage medium stores an information processing program, and the information processing program is implemented by a processor to implement the foregoing network slice creation method.
  • FIG. 1 is a schematic flowchart of a network slicing method according to Embodiment 1 of the present application; FIG.
  • FIG. 2 is a schematic structural diagram of a network slicing apparatus provided in Embodiment 2 of the present application;
  • Example 3 is a schematic flowchart of a network slicing method provided in Example 1 of this application;
  • Example 4 is a network topology diagram of a network slice provided in Example 2 of this application;
  • Example 5 is a schematic flowchart of a network slicing method provided in Example 2 of this application.
  • Example 6 is a network topology diagram of a network slice provided in Example 3 of the present application.
  • Example 7 is a schematic flowchart of a network slicing method provided in Example 3 of this application.
  • Example 8 is a network topology diagram of a network slice provided in Example 4 of this application.
  • FIG. 9 is a schematic flowchart of a network slicing method provided in Example 4 of the present application.
  • This application proposes a simple and easy-to-deploy network slicing method that can simply and effectively map overlay services belonging to a specific slice to the underlay network resources dedicated to that specific slice.
  • FIG. 1 is a schematic flowchart of a network slice creation method according to Embodiment 1 of the present application. As shown in FIG. 1, the method includes the following steps.
  • Step 101 Create a slice bundle link between a first node and a second node.
  • the slice bundle link includes: at least one member link created between the first node and the second node.
  • Step 102 Configure a packet service for the slice bundle link.
  • the method before creating a sliced bundle link between the first node and the second node, the method further includes: creating at least one member link between the first node and the second node; and for each member chain The channel configures the corresponding member link to belong to the slice, and each node configures the corresponding node to belong to the slice.
  • the step of creating a sliced bundling link between the first node and the second node includes: creating an interconnected sliced bundling interface on the first node and the second node respectively, and combining the at least one member A link is added to the slice bundle interface as a member interface.
  • configuring the corresponding member link belonging slice for each member link, and configuring the corresponding node belonging slice for each node includes: configuring the corresponding member link for each member link. At least one slice attribute of each node; for each node, configure at least one slice attribute of the corresponding node.
  • the configuring a packet service for the slice bundle link includes configuring a packet service on the slice bundle interface.
  • the method further includes: flooding the link state information, and maintaining a consistent link state database on each node.
  • the link state database records the flooded link state information, and the link state information carries a slice attribute of each node, and carries state information and slice attributes of each member link.
  • the method further includes: calculating a sliced path based on the link state database.
  • calculating the path of the slice may include any of the following calculations.
  • the running constraint shortest path first CSPF operation calculates the shortest path from the first node to all other destination nodes in the first slice to which the first node belongs, and the constraint condition of the running CSPF operation calculation is ⁇ the first
  • the slice number is slice-id, the IGP metric is the smallest igp-metric ⁇ ; the calculation includes: according to the constraint condition, the slice attribute of each member link included in the slice bundle link and the node's Match the slice attributes to obtain the shortest path forwarding entry of the first slice, that is, the optimal next hop of the shortest path forwarding of the first slice.
  • Slice-id is the key information for associating overlay services with underlay network resources.
  • a CSPF operation is performed to calculate a TE path from the first node to a destination node in a first slice to which the first node belongs, and the constraint condition for the calculation of the CSPF operation is ⁇ Slice-id of the first slice, constraint condition A ⁇ , the constraint condition A includes at least one of the following: bandwidth, delay, affinity, TE metrics, maximum hops; the calculation includes: according to the constraint condition , Matching the slice attribute of each member link included in the slice bundle link with the slice attribute of each node to obtain a TE path of the first slice.
  • the controller is requested to run the CSPF operation to calculate a TE path from the first node to the destination node in the first slice to which the first node belongs based on the link state database, and the CSPF operation calculation is performed.
  • the constraint condition is ⁇ slice-id of the first slice, constraint condition A ⁇ , and the constraint condition A includes at least one of the following: bandwidth, delay, affinity, TE metric, maximum hops; the calculation includes: Matching the slice attribute of each member link included in the slice bundle link and the slice attribute of each node according to the constraint condition to obtain a TE path of the first slice.
  • the method further includes: performing packet forwarding along the slice-bundled link.
  • the method further includes: setting a priority for each member link in the slice bundle link according to a local policy.
  • the message forwarding along the sliced bundling link includes: in the process of forwarding protocol packets of a control plane along the sliced bundling link, always selecting the highest priority effective member in the sliced bundling link. The link is forwarded.
  • the packet forwarding along the sliced bundling link may further include: selecting the sliced bundling link during the data layer data packet forwarding along the sliced bundling link.
  • the dedicated member link of the slice to which the data message belongs is forwarded; if the dedicated member link of the slice to which the data message belongs fails, the data message is discarded.
  • the method further includes: in the case of creating a new slice, creating a new member link, and configuring the new member link to belong to the new slice; and A new member link is added to the slice bundle link.
  • the configuring packet service includes configuring at least one of the following: IP address, enabling intermediate system to intermediate system ISIS, resource reservation protocol traffic engineering RSVP-TE, open shortest path first OSPF, and label distribution protocol LDP .
  • the type of a member link includes one of the following: a flexible Ethernet channel FlexE channel, an aggregate link, an Ethernet Ethernet link, an Ethernet VLAN sub-interface, and a point-to-point P2P link.
  • the slice is a homogeneous network or a heterogeneous network.
  • the first node and the second node belong to the same AS system domain, or the first node and the second node belong to different AS domains.
  • FIG. 2 is a schematic structural diagram of a network slicing apparatus provided in Embodiment 2 of the present application. As shown in FIG. 2, the device includes a creation unit and a configuration unit.
  • the creating unit is configured to create a sliced bundling link between the first node and the second node; wherein the sliced bundling link includes at least one member link created between the first node and the second node.
  • the configuration unit is configured to configure the slice bundle link to configure a packet service.
  • the creating unit is further configured to create at least one member link between the first node and the second node; and the configuration unit is further configured to configure a member link corresponding to each member link configuration. Attribution slice. For each node, configure the corresponding node's slice.
  • the creating unit is configured to create interconnected slice bundle interfaces on the first node and the second node, respectively, and add the at least one member link as a member interface to the slice bundle interface. .
  • the configuration unit is configured to set at least one slice attribute of a member link corresponding to each member link configuration; and configure at least one slice attribute of a corresponding node for each node.
  • the configuration unit is configured to configure a packet service on the slice bundle interface.
  • the apparatus further includes: a flooding unit.
  • the flooding unit is configured to flood link state information, and maintain a consistent link state database on each node;
  • the link state database records flooded link state information, the link state information carries slice attribute information of each node, and carries state information and slice attribute information of each member link .
  • the apparatus further includes a computing unit.
  • the calculation unit is configured to perform slice path calculation based on the link state database.
  • the calculation unit is configured to perform path calculation of any of the following slices.
  • the running constraint shortest path first CSPF operation calculates the shortest path from the first node to all other destination nodes in the first slice to which the first node belongs, and the constraint condition of the running CSPF calculation is ⁇ the slice of the first slice -id, igp-metric minimum ⁇ ; the calculation includes: matching the slice attribute information of each member link included in the slice bundle link and the slice attribute information of each node according to the constraint conditions to obtain The shortest path forwarding entry of the first slice.
  • the running constraint shortest path first CSPF operation calculates a TE path from the first node to the destination node in the first slice to which the first node belongs, and the constraint condition for running the CSPF calculation is ⁇ Slice-id of the first slice, constraint condition A ⁇ , the constraint condition A includes at least one of the following: bandwidth, delay, affinity, TE metrics, maximum hops; the calculation includes: according to the constraint condition Matching the slice attribute information of each member link included in the slice bundle link with the slice attribute information of each node to obtain a TE path of the first slice.
  • the controller is requested to calculate the TE path from the first node to the destination node in the first slice to which the first node belongs according to the CSPF operation based on the link state database, and the constraint condition for running the CSPF operation calculation is: ⁇ The slice-id of the first slice, constraint condition A ⁇ , the constraint condition A includes at least one of the following: bandwidth, delay, affinity, TE metrics, maximum hops; the calculation includes: according to the constraint Conditionally, the slice attribute information of each member link included in the slice bundle link and the slice attribute information of each node are matched to obtain a TE path of the first slice.
  • the apparatus further includes: a forwarding unit.
  • the forwarding unit is configured to perform message forwarding along the slice bundled link.
  • the apparatus further includes: a setting unit.
  • the setting unit is configured to set a priority for each member link in the slice bundle link according to a local policy.
  • the forwarding unit is configured to always select a valid member link with the highest priority among the sliced bundle links during the process of forwarding protocol packets of the control plane along the slice bundled links. Forward it.
  • the forwarding unit is configured to select a slice to which the data packet in the slice bundle link belongs during a data layer data packet forwarding process along the slice bundle link.
  • the dedicated member link is forwarded; if the dedicated member link of the slice to which the data message belongs fails, the data message is discarded.
  • the creating unit is further configured to create a new member link when a new slice is created, and add the new member link to the slice bundle link.
  • the configuration unit is further configured to configure the new member link to belong to the new slice.
  • the configuration unit is configured to configure at least one of the following: IP address, intermediate system-to-intermediate system ISIS, resource reservation protocol traffic engineering RSVP-TE, open shortest path priority OSPF, and label distribution Protocol LDP.
  • the type of a member link includes one of the following: a flexible Ethernet channel FlexE channel, an aggregate link, an Ethernet Ethernet link, an Ethernet VLAN sub-interface, and a point-to-point P2P link.
  • the slice is a homogeneous network or a heterogeneous network.
  • the first node and the second node belong to the same AS system domain, or the first node and the second node belong to different AS domains.
  • the technical solutions provided in the first and second embodiments of the present application do not need to run complex IGP multiple topologies or flexible algorithms to provide slicing, which is more concise, convenient to deploy, and can easily and effectively map overlay services to its dedicated underlay network resources.
  • FIG. 3 is a schematic flowchart of a network slice creation method provided in Example 1 of the present application. As shown in FIG. 3, the method includes the following steps.
  • Step 301 Create at least one member link between a neighboring first node and a second node, and configure an affiliation slice for each member link and each node.
  • the purpose of performing step 301 is to allocate network resources to specific slices, that is, to configure topology-related resources (such as nodes and links) that belong to specific slices.
  • different slices can have different slice attributes.
  • the slice attribute can be identified by slice-id, that is, different slices have different slice-ids.
  • a slice-id of 0 indicates a default slice, that is, the entire network belongs to the default slice before any slice division is carried on the bearer network.
  • a slice-id other than 0 indicates a valid slice identifier allocated for the corresponding overlay service.
  • a node can be configured to belong to one or more slices, and a link can also be configured to belong to one or more slices.
  • Non-topology related resources (such as CPU computing resources in a node) can also be configured to belong to a specific slice.
  • step 301 may include: creating one or more member links between the adjacent first node and the second node, and configuring each member link to which the member link belongs, which is the first The node configures the slice to which the first node belongs, and configures the second node to the slice to which the second node belongs.
  • Step 302 Create a slice bundle link between the first node and the second node.
  • a slice bundling link (can be referred to as a slice-bundles link) is established between two adjacent nodes in the domain, and the slice-bundles link contains multiple member links belonging to a specific slice.
  • the member links contained in a slice-bundles link can be traditional Ethernet (Ethernet) links, Ethernet VLAN sub-interfaces, P2P (point-to-point) links, or FlexE channels (flexible Ethernet pipes), or even It is an aggregation link (such as an aggregation link created by LACP (Link Aggregation Control Protocol)).
  • Step 303 Configure a packet service for the slice bundle link.
  • Configure packet services only on slice-bundles links such as configuring IP (Internet Protocol) addresses, enabling IGP protocols (such as ISIS (Intermediate System to Intermediate System, Intermediate System to Intermediate System Protocol), and OSPF (Open Shortest Path First, open shortest path first)), and other protocols (such as (Label Distribution Protocol), RSVP-TE (Resource Reservation Protocol Traffic Engineering), and other related configurations. These configurations are not made on every member link contained in the slice-bundles link. Similarly, when crossing AS (Autonomous System) domains, slice-bundles links can also be established between two adjacent ASBR (Autonomous Syszhtem Boundary Router autonomous system border router) nodes and only on slice-bundles links Configure packet services.
  • AS Autonomous System
  • Step 304 Flood the link state information and maintain a consistent link state database.
  • the consistent link state database described here may be a consistent link state database that every node in the IGP domain must maintain.
  • step 304 The purpose of performing step 304 is to announce the network resources of the specific slice.
  • Each node in the IGP domain maintains a consistent link state database.
  • the link state database records flooded link state information, and the link state information carries slice attributes of each node and state information and slice attributes of each member link.
  • Link status information can be flooded in the IGP domain.
  • the link-state flood message carries the corresponding slice-id attribute.
  • Each node in the IGP domain will maintain a consistent link-state database.
  • the link-state database records which slice-id attributes each node and each link have.
  • the flooding process may include member link (as a Layer 2 member link) information in the slice-bundles link.
  • This is not the IGP multi-topology technology, but the information announcement in the topology (such as the default topology), and it is not to use TE affinity technology to color the links.
  • TE AFfinity links are colored for TE path calculations, and slice-id is used to characterize the exclusive network resources of hard-isolated slices. The two levels are different. You can actually use TEaffinity to perform TE path calculations in a slice.
  • the controller can also collect BGP-LS (North-Bound Distribution of Link-State and Traffic Engineering and Information Engineering) by extending BGP (Border Gateway Protocol), and use BGP to advertise link state and TE information. See RFC7752) for collection.
  • BGP-LS North-Bound Distribution of Link-State and Traffic Engineering and Information Engineering
  • BGP Border Gateway Protocol
  • Network-side link state data (which contains the slice-id attribute) information.
  • the network side can report the link state information to the controller whether it is in the IGP domain or across the AS domains.
  • specific member link (as a layer 2 member link) information may be included.
  • Step 305 Perform slice path calculation based on the link state database.
  • the calculation of the sliced path includes the calculation of the shortest path, the calculation of the TE path, and the like.
  • the calculation of the shortest path in a slice includes: each node in the IGP domain can be based on which slices it has added.
  • the CSPF Consstrained Shortest Path First
  • the calculation constraint of the CSPF algorithm is ⁇ slice-id of the first slice, the smallest igp-metric ⁇ , that is, the nodes and links included in the shortest path calculated by the CSPF algorithm must have the slice corresponding to the first slice The -id attribute and the minimum IGP metric that meets the entire path.
  • Each node in the IGP domain is calculated in this way, and the optimal next hop from each node to any other destination node in the IGP domain is obtained according to the calculation result, which is used to generate the shortest path forwarding entry in a specific slice (such as the first slice).
  • the first slice may be any one of all slices to which the first node belongs, then the “calculating the shortest path to all other destination nodes in the first slice” in the above calculation may be: calculating the first node to The shortest path to any other destination node within the first slice it belongs to.
  • the calculation of TE paths in a slice includes: triggered by a service or configuration, a node S in the IGP domain may need to calculate a TE that belongs to the first slice and meets the constraint A to another node D in the IGP domain. path. This calculation can still be based on the aforementioned consistent link state database using the CSPF algorithm.
  • the calculation constraint of the CSPF algorithm is ⁇ slice-id of the first slice, constraint A ⁇ , that is, the nodes and links included in the TE path calculated by the CSPF algorithm must have the slice- corresponding to the first slice- id attribute, and constraint A is satisfied.
  • the constraint A may include at least one of the following factors: bandwidth, delay, affinity, TE metric, maximum number of hops, and so on.
  • the node S may also send the above-mentioned TE path calculation request to a PCE (Path Computation Element) through PCEP (Path Computation Element Communication Protocol). It is similar, but before that, the controller to which the PCE belongs needs to collect the link-side data on the network side (the link-state data contains the slice-id attribute), for example, through BGP-LS.
  • the first slice is any one of all slices to which the node S belongs.
  • the calculation of the shortest path described above requires each node to run the CSPF algorithm to calculate the shortest path from each node to any other destination node in the slice to which the node belongs.
  • the calculation of the TE path described above only needs to be calculated by the head node of the TE path (or the head node requests the controller).
  • Step 306 Perform message forwarding along the slice bundled link.
  • Control plane protocol packets (such as ISIS, OSPF, BGP, LDP, RSVP-TE and other protocol packets) are forwarded along the slice-bundles link, and always selected to be forwarded along the highest-priority member link in the slice-bundles No load sharing is performed on multiple member links.
  • the priority order of each member link in slice-bundles can be set or determined according to local policies. If the current member link with the highest priority fails, restart Among the remaining member links, the member link with the highest priority is selected.
  • Example 1 of this application does not need to run complex IGP multi-topologies or flexible algorithms to provide slicing, which is more concise, convenient to deploy, and can easily and effectively map overlay services to its exclusive underlay. Internet resources.
  • all slices are homogeneous networks.
  • the homogeneous network means that the virtual network topology diagrams corresponding to each slice are the same, which means that all slices are synchronized together to divide each of the underlying physical networks.
  • the resources in the nodes and the resources of each link are only different in share, and the homogeneous network is applicable to the method for creating a network slice provided in the embodiment of the present application.
  • FIG. 4 is a network topology diagram of a network slice provided in Example 2 of the present application.
  • an IGP for example, intermediate system to intermediate system ISIS
  • an IGP for example, intermediate system to intermediate system ISIS
  • R1, R2, and R3 three nodes R1, R2, and R3.
  • three hard-isolated FlexE channels were created between R1 and R2 and between R2 and R3, namely FlexE-channel1 (FlexE link 1), FlexE-channel 2 (FlexE link 2), FlexE-channel 3 (FlexE link 3).
  • FIG. 5 is a schematic flowchart of a network slice creation method provided in Example 2 of the present application. As shown in FIG. 5, the method includes the following steps.
  • slice-bundles 1 (slice bundle link 1) is created between R1 and R2
  • slice-bundles 2 (slice bundle link 2) is created between R2 and R3, and slice-bundles 1 and slice are created.
  • -bundles 2 Configure IP addresses and enable IGP.
  • nodes R1, R2, and R3 were configured to join slices 1, 2, and 3, respectively.
  • Step 502 R1, R2, and R3 flood the link state information through IGP and maintain a consistent link state database.
  • the flooding process of the slice-bundles link will also include information about all its member links, and a consistent link state database will be maintained on R1, R2, and R3.
  • slice-id attribute information of each node and each link is recorded.
  • step 503 the shortest path calculation of slices 1, 2, and 3 is performed.
  • the CSPF algorithm On R1, since it adds slice 1, it runs the CSPF algorithm based on the above link state database to calculate the shortest path from R1 to other nodes in slice 1.
  • ⁇ slice-id 1, minimum igp-metric ⁇ .
  • the shortest path forwarding next hop on R1 within slice 1 to R2 and R3 can be expressed as:
  • Next-hop the IP address of the slice-bundles1 interface on the R2 side
  • the shortest path on R2 to the next hop on slice 1 to R1 can be expressed as:
  • Next-hop the IP address of the slice-bundles interface on the R1 side
  • the shortest path forwarding next hop on slice 2 to R3 on R2 can be expressed as:
  • Next-hop The IP address of the slice-bundles 2 interface on the R3 side;
  • next hop forwarded by R3 in the shortest path within slice 1 to R1 and R2 can be expressed as:
  • Next-hop the IP address of the slice-bundles 2 interface on the R2 side
  • the calculation of the shortest path in other slices 2 and 3 is similar. Therefore, we can build a routing and forwarding table within each slice accordingly.
  • a more appropriate method is to assign different MPLS (Multiprotocol Label Switching) to the same prefix (forwarding equipment equivalence class) (FEC) of different slices.
  • MPLS Multiprotocol Label Switching
  • FEC forwarding equipment equivalence class
  • MPLS LSP Label Switched Path, label forwarding path
  • Step 504 Perform TE path calculation for slices 1, 2, and 3.
  • the R1 node can be triggered by services or configurations to calculate TE paths that meet the constraint A of R1 to R3 in slice 1.
  • the constraint condition A may include at least one of the following: bandwidth, delay, affinity , TE metric, maximum hop count, and so on.
  • the calculation of TE paths in other slices is similar.
  • the calculated TE path is: ⁇ node R1, layer 3 link slice-bundles 1 (layer 2 member link FlexE-channel 1), node R2, layer 3 link slice-bundles 2 (two Layer member link FlexE-channel 1), node R3 ⁇ .
  • the calculation of TE paths in other slices is similar.
  • Node R1 can also send the TE path calculation request to the controller through the PCEP protocol.
  • the calculation action of the controller is similar to the above, but before the controller performs TE path calculation, the controller needs to collect (for example, through BGP-LS) the network Link state database (which contains the slice-id attribute).
  • the slice is a heterogeneous network (Heterogeneous Network).
  • the heterogeneous network means that the virtual network topology diagrams corresponding to different slices are different, which means that some network resources are divided up by some slices and other network resources. Divided up by another slice.
  • FIG. 6 is a network topology diagram of a network slice provided in Example 3 of the present application.
  • four nodes R1, R2, R3, and R4 form an IGP (for example, intermediate system to intermediate system ISIS) domain.
  • IGP intermediate system to intermediate system ISIS
  • a hard-isolated FlexE channel is created between R1 and R2, between R2 and R3, between R1 and R4, and between R4 and R3.
  • Between R4 and R3 Create FlexE channel 2 at a time.
  • FIG. 7 is a schematic flowchart of a network slice creation method provided in Example 3 of the present application. As shown in FIG. 7, the method includes the following steps.
  • Step 701 Create slice-bundles1 between R1 and R2, and create slice-bundles2 between R2 and R3, and configure IP addresses for slice-bundles1 and slice-bundles2 and enable the IGP protocol.
  • R1, R2, and R3 nodes were respectively configured to join slice 1
  • R1, R4, and R3 nodes were respectively configured to join slice 2.
  • Configure dedicated slice information for each member interface of the slice-bundles1 interface and the slice-bundles2 interface for example, FlexEchannel1 belongs to slice1.
  • Step 702 R1, R2, R3, and R4 flood the link state information through the IGP and maintain a consistent link state database.
  • R1, R2, R3, and R4 will maintain a consistent link state database.
  • step 703 the shortest path calculation of slices 1 and 2 is performed.
  • each node uses which slices it joins, and calculates the shortest path forwarding information from the node to other nodes in the corresponding slice through the CSPF algorithm according to the constraint ⁇ slice-id, igp-metric minimum ⁇ .
  • the shortest path forwarding next hop of R1 to R2 and R3 in slice 1 can be expressed as:
  • Next-hop the IP address of the slice-bundles1 interface on the R2 side
  • the shortest path forwarding next hop of R1 to R4 and R3 in slice 2 can be expressed as:
  • FlexE channel 2 layer 3 interface FlexE channel 2 layer 3 interface
  • Step 704 Perform TE path calculation for slices 1 and 2.
  • the R1 node can be triggered by services or configurations to calculate TE paths that meet the constraint A of R1 to R3 in slice 1.
  • Constraint A may include at least one of the following: bandwidth, delay, affinity, TE metric, maximum hops, and other factors. The calculation of TE paths in other slices is similar.
  • Node R1 can also send the TE path calculation request to the controller through the PCEP protocol.
  • the calculation action of the controller is similar to the above, but before the calculation, the controller needs to collect (for example, via BGP-LS) the link state database on the network side. (Which contains the slice-id attribute).
  • the FlexE channel in this example 3 is replaced with other link types, such as traditional ethernet link, VLAN sub-interface, P2P link, and aggregate link, etc.
  • the processing flow is similar.
  • This example 4 applies to a slice network across AS domains.
  • FIG. 8 is a network topology diagram of a network slice provided in Example 4 of the present application.
  • this network includes two autonomous systems, AS1 and AS2, which are directly connected through ASBR1 and ASBR2.
  • AS1 and AS2 which are directly connected through ASBR1 and ASBR2.
  • FlexE link 2 FlexE channel 2
  • FlexE channel 1 belongs to slice 1
  • FlexE channel 2 belongs to slice 2.
  • FIG. 9 is a schematic flowchart of a network slice creation method provided in Example 4 of the present application. As shown in FIG. 9, the method includes the following steps.
  • Step 901 Create slice-bundles 1 between ASBR1 and ASBR2, and configure an IP address for slice-bundles 1.
  • slice-bundles1 interfaces are created on ASBR1 and ASBR2, and all FlexEchannels between the two nodes are added as layer-2 member interfaces to the slice-bundles1 interface of the corresponding nodes.
  • the service is configured on the slice-bundles1 interface, that is, an IP address is configured on the slice-bundles1 interface. This IP address is used as the TCP (Transmission Control Protocol) of the BGP session between ASBR1 and ASBR2. Chain address.
  • TCP Transmission Control Protocol
  • Step 902 Establish a BGP session between ASBR1 and ASBR2 and advertise a BGP route.
  • BGP sessions between ASBR1 and ASBR2 can be used to advertise multiple types of BGP routes.
  • ASBR2 can advertise BGP-LU (BGP Labeled Unicast) routes to ASBR1 through BGP (see RFC8277), BGP / MPLS IP VPN routes (see RFC4364) and so on.
  • BGP-LU BGP Labeled Unicast
  • step 903 the shortest path calculation of slices 1 and 2 is performed.
  • a more appropriate method is to assign and advertise different BGP labels for the same BGP route in different slices, and establish different BGP LSPs, that is, BGP LSPs correspond to
  • the next hop information contained in the forwarding entry is supplemented with slice-id information or Layer 2 member interface information corresponding to slice-id. This can be supported by extending BGP.
  • ASBR2 can advertise ASBR1's BGP-LU (BGP Labeled Unicast) routes (see RFC8277), BGP / MPLS IP VPN routes (see RFC4364), etc. to ASBR1 through ASBGP.
  • BGP-LU BGP Labeled Unicast
  • RFC4364 BGP / MPLS IP VPN routes
  • Next-hop the IP address of the slice-bundles 1 interface on the ASBR2 side;
  • the slice-bundles layer 3 interface and the FlexEchannel channel layer 2 member interface that is actually forwarded can be given in the shortest path forwarding next hop information above; or the slice-bundles layer 3 interface and the corresponding slice- The id value is used to match the actually forwarded FlexE channel layer 2 member interface to the slice-bundles layer 3 interface according to the slice-id during the packet forwarding process.
  • ASBR1 and ASBR2 can report the slice-bundles link between them to the controller as link state data. During the reporting process, all member link information and its slice-id attributes need to be included, so that the controller has cross- The link connection relationship in the AS domain facilitates the controller to calculate the TE path across the AS domain for a specific slice. This can be supported by extending BGP-LS.
  • the FlexE channel in this example 4 is replaced with other link types such as traditional ethernet links, VLAN sub-interfaces, P2P links, and aggregate links.
  • the processing flow is similar.
  • the method for creating a network slice further includes: if a new slice needs to be created, only a new FlexE channel needs to be created and the FlexE channel is added as a member interface to the slice-bundles interface, in addition to The new FlexE channel member interface needs to be configured with its slice-id attribute. No other configuration needs to be modified, and the scalability is very good.
  • An embodiment of the present application further provides a device for creating a network slice, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and the computer program is executed by the processor. To implement any of the above-mentioned network slice creation methods.
  • An embodiment of the present application further provides a computer-readable storage medium, where the computer-readable storage medium stores an information processing program, and when the information processing program is executed by a processor, implements any of the foregoing network slice creation methods.
  • the term computer storage medium includes volatile and non-volatile implemented in any method or technology used to store information such as computer-readable instructions, data structures, program modules or other data.
  • Removable, removable and non-removable media include, but are not limited to, Random Access Memory (RAM), Read-Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), Flash memory or other memory technology, Compact Disc-Read-Only Memory (CD-ROM), Digital Video Disc (DVD) or other optical disc storage, magnetic box, magnetic tape, disk storage or other magnetic storage A device, or any other medium that can be used to store desired information and can be accessed by a computer.
  • a communication medium typically contains computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transmission mechanism, and may include any information delivery medium .

Landscapes

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

Abstract

本申请实施例公开了一种网络切片的创建方法和装置。网络切片的创建方法包括：在第一节点与第二节点之间创建切片捆绑链路；所述切片捆绑链路包括在第一节点与第二节点之间创建的至少一条成员链路；为所述切片捆绑链路配置分组业务。

Description

网络切片的创建方法及装置
本申请要求在2018年09月25日提交中国专利局、申请号为201811116143.3的中国专利申请的优先权，该申请的全部内容通过引用结合在本申请中。
技术领域
本申请实施例涉及5G(5Generation，第五代移动通信技术)切片技术，例如涉及一种网络切片的创建方法及装置。
背景技术
5G切片(slice)对承载网的需求，就是不同切片需要有其专属承载子网络，不同专属承载子网络可以是严格的资源硬隔离，也可以是达到近似硬隔离效果的软隔离。分组网络不支持硬隔离，它支持的是统计复用，相比专网或TDM(Time Division Multiplex，时分复用)网络更加经济。可见为了响应5G切片需求，分组网络需要在underlay(底层)网络资源上做切片划分，以满足不同的overlay(上层)业务的需求，如VPN(Virtual Private Network，虚拟私有网络)业务。当前业界提出了多种5G承载网切片技术。比如，采用IGP(Interior Gateway Protocol，内部网关协议)多拓扑技术，将同一张物理网络拓扑划分成多张逻辑子拓扑，将不同的overlay业务归属至不同的逻辑子拓扑。还有的采用IGP灵活算法(Flex-algorithm)技术，在同一拓扑内运行多种IGP算法计算得到多种Flex-algorithm平面，将不同的overlay业务迭代到不同的Flex-algorithm平面。上述5G承载网切片技术中，IGP多拓扑技术需要在分组网络设备中维护多张IGP路由表，实施开销和成本很高，因而IGP多拓扑技术在网络实际部署中很少使用；IGP Flex-algorithm技术无法有效的支持TE(Traffic Engineering，流量工程)带宽预留需求，限制了IGP Flex-algorithm技术的应用。实际上IGP Flex-algorithm技术的初衷并不是作为网络切片解决方案，而是用于压缩Segment Routing policy(分段路由策略，SR policy，见draft-ietf-spring-segment-routing-policy-01)的标签栈。
在5G承载网络中，一个基本需求是underlay网络资源需要做切片划分，即一些underlay网络资源需要被配置专属的切片编号(slice-id)，另一个基本需求是overlay业务是专属切片内的业务，也会被配置其专属的切片编号。
相关技术中，无法将属于一切片的overlay业务向该切片专属的underlay网络资源进行映射。
发明内容
本申请实施例提供了一种网络切片的创建方法，包括：
在第一节点与第二节点之间创建切片捆绑链路；其中，所述切片捆绑链路包括：在第一节点与第二节点之间创建的至少一条成员链路；
为所述切片捆绑链路配置分组业务。
本申请实施例还提供了一种网络切片的创建装置，包括：
创建单元，设置成在第一节点与第二节点之间创建切片捆绑链路；其中，所述切片捆绑链路包括：在第一节点与第二节点之间创建的至少一条成员链路；
配置单元，设置成为所述切片捆绑链路配置分组业务。
本申请实施例还提供了一种网络切片的装置，包括存储器、处理器及存储在所述存储器上并可在所述处理器上运行的计算机程序，所述计算机程序被所述处理器执行时实现上述网络切片的创建方法。
本申请实施例还提供了一种计算机可读存储介质，所述计算机可读存储介质上存储有信息处理程序，所述信息处理程序被处理器执行时实现上述网络切片的创建方法。
附图说明
图1为本申请实施例一提供的网络切片的方法的流程示意图；
图2为本申请实施例二提供的网络切片的装置的结构示意图；
图3为本申请示例一提供的网络切片的方法的流程示意图；
图4为本申请示例二提供的网络切片的网络拓扑图；
图5为本申请示例二提供的网络切片的方法的流程示意图；
图6为本申请示例三提供的网络切片的网络拓扑图；
图7为本申请示例三提供的网络切片的方法的流程示意图；
图8为本申请示例四提供的网络切片的网络拓扑图；
图9为本申请示例四提供的网络切片的方法的流程示意图。
具体实施方式
下文中将结合附图对本发明的实施例进行详细说明。在附图的流程图示出的步骤可以在诸如一组计算机可执行指令的计算机系统中执行。虽然在流程图中示出了逻辑顺序，但是在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤。
本申请提出了一种实现简单、部署方便的网络切片方法，能够简单有效的将属于特定切片的overlay业务向该特定切片专属的underlay网络资源进行映射。
实施例一
图1为本申请实施例一提供的网络切片的创建方法的流程示意图。如图1所示，该方法，包括如下步骤。
步骤101，在第一节点与第二节点之间创建切片捆绑链路；所述切片捆绑链路包括：在第一节点与第二节点之间创建的至少一条成员链路。
步骤102，为所述切片捆绑链路配置分组业务。
在一实施例中，在第一节点与第二节点之间创建切片捆绑链路之前，该方法还包括：在第一节点与第二节点之间创建至少一条成员链路；为每一个成员链路配置对应的成员链路归属的切片，为每一个节点配置对应的节点归属的切片。
在一实施例中，所述在第一节点与第二节点之间创建切片捆绑链路，包括：在第一节点和第二节点上分别创建相互连接的切片捆绑接口，将所述至少一条 成员链路作为成员接口加入到所述切片捆绑接口。
在一实施例中，所述为每一个成员链路配置对应的成员链路归属的切片，为每一个节点配置对应的节点归属的切片，包括：为每一个成员链路配置对应的成员链路的至少一个切片属性；为每一个节点配置对应的节点的至少一个切片属性。
在一实施例中，所述为所述切片捆绑链路配置分组业务，包括：在所述切片捆绑接口上配置分组业务。
在一实施例中，该方法还包括：泛洪链路状态信息，并在每个节点上维护一致的链路状态数据库。所述链路状态数据库记录泛洪的所述链路状态信息，所述链路状态信息携带每一个节点的切片属性，并携带每一个成员链路的状态信息和切片属性。
在一实施例中，该方法还包括：基于所述链路状态数据库进行切片的路径计算。
在一实施例中，进行切片的路径计算，可以包括如下计算中的任一种。
运行约束最短路径优先CSPF运算计算所述第一节点归属的第一切片中从所述第一节点至所有其他目的节点的最短路径，所述运行CSPF运算计算的约束条件为{所述第一切片的切片编号slice-id,IGP度量igp-metric最小}；所述计算包括：根据所述约束条件，对所述切片捆绑链路包含的每一个成员链路的切片属性和每一个节点的切片属性进行匹配，得到所述第一切片的最短路径转发表项，也即所述第一切片的最短路径转发的最优下一跳。slice-id是关联overlay业务与underlay网络资源的关键信息。
或者，基于所述链路状态数据库，运行CSPF运算计算所述第一节点归属的第一切片中从所述第一节点至目的节点的TE路径，所述运行CSPF运算计算的约束条件为{所述第一切片的slice-id，约束条件A}，所述约束条件A包括以下至少之一：带宽、延迟、亲和力、TE metric、最大跳数；所述计算包括：根据所述约束条件，对所述切片捆绑链路包含的每一个成员链路的切片属性和每一个节点的切片属性进行匹配，得到所述第一切片的TE路径。
或者，请求控制器基于所述链路状态数据库，运行所述CSPF运算计算所述 第一节点归属的第一切片中从所述第一节点至目的节点的TE路径，所述运行CSPF运算计算的约束条件为{所述第一切片的slice-id，约束条件A}，所述约束条件A包括以下至少之一：带宽、延迟、亲和力、TE metric、最大跳数；所述计算包括：根据所述约束条件对所述切片捆绑链路包含的每一个成员链路的切片属性和每一个节点的切片属性进行匹配，得到所述第一切片的TE路径。
在一实施例中，该方法还包括：沿所述切片捆绑链路进行报文转发。
在一实施例中，该方法还包括：根据本地策略为所述切片捆绑链路中的每一个成员链路设置优先级。
所述沿所述切片捆绑链路进行报文转发，包括：在控制层面的协议报文沿所述切片捆绑链路转发的过程中，始终选择所述切片捆绑链路中最高优先级的有效成员链路进行转发。
在一实施例中，所述沿所述切片捆绑链路进行报文转发，还可以包括：在数据层面的数据报文沿所述切片捆绑链路转发的过程中，选择所述切片捆绑链路中所述数据报文归属的切片的专属成员链路进行转发；如果所述数据报文归属的切片的专属成员链路失效，则丢弃所述数据报文。
在一实施例中，该方法还包括：在创建新的切片的情况下，创建新的成员链路，并将所述新的成员链路配置为归属于所述新的切片；以及将所述新的成员链路加入到所述切片捆绑链路中。
在一实施例中，所述配置分组业务包括配置以下至少之一：IP地址、使能中间系统至中间系统ISIS、资源预留协议流量工程RSVP-TE、开放最短路径优先OSPF和标签分发协议LDP。
在一实施例中，一条成员链路的类型包括以下之一：灵活以太管道FlexE channel、聚合链路、以太Ethernet链路、Ethernet VLAN子接口和点到点P2P链路。
在一实施例中，所述切片为同构网络或异构网络。
在一实施例中，所述第一节点和第二节点分别属于同一自治系统AS域，或者所述第一节点和第二节点分别属于不同的AS域。
实施例二
图2为本申请实施例二提供的网络切片的装置的结构示意图。如图2所示，该装置，包括：创建单元和配置单元。
创建单元，设置成在第一节点与第二节点之间创建切片捆绑链路；其中，所述切片捆绑链路包括在第一节点与第二节点之间创建的至少一条成员链路。配置单元，设置成为所述切片捆绑链路配置分组业务。
在一实施例中，所述创建单元，还设置成在第一节点与第二节点之间创建至少一条成员链路；所述配置单元，还设置成为每一个成员链路配置对应的成员链路归属的切片，为每一个节点配置对应的节点归属的切片。
在一实施例中，所述创建单元，是设置成在第一节点和第二节点上分别创建相互连接的切片捆绑接口，将所述至少一条成员链路作为成员接口加入到所述切片捆绑接口。
在一实施例中，所述配置单元，是设置成为每一个成员链路配置对应的成员链路的至少一个切片属性；为每一个节点配置对应的节点的至少一个切片属性。
在一实施例中，所述配置单元，是设置成在所述切片捆绑接口上配置分组业务。
在一实施例中，该装置还包括：泛洪单元。所述泛洪单元，设置成泛洪链路状态信息，并在每个节点上维护一致的链路状态数据库；
在一实施例中，所述链路状态数据库记录泛洪的链路状态信息，所述链路状态信息携带每一个节点的切片属性信息，并携带每一个成员链路的状态信息和切片属性信息。
在一实施例中，该装置还包括：计算单元。所述计算单元，设置成基于所述链路状态数据库进行切片的路径计算。
在一实施例中，所述计算单元，是设置成进行以下任一种切片的路径计算。
运行约束最短路径优先CSPF运算计算第一节点归属的第一切片中从第一节点至所有其他目的节点的最短路径，所述运行CSPF运算计算的约束条件为{所述第一切片的slice-id,igp-metric最小}；所述计算包括：根据所述约束条件，对所述切片捆绑链路包含的每一个成员链路的切片属性信息和每一个节点的切 片属性信息进行匹配，得到所述第一切片的最短路径转发表项。
或者，基于所述链路状态数据库，运行约束最短路径优先CSPF运算计算第一节点归属的第一切片中从第一节点至目的节点的TE路径，所述运行CSPF运算计算的约束条件为{所述第一切片的slice-id，约束条件A}，所述约束条件A包括以下至少之一：带宽、延迟、亲和力、TE metric、最大跳数；所述计算包括：根据所述约束条件，对所述切片捆绑链路包含的每一个成员链路的切片属性信息和每一个节点的切片属性信息进行匹配，得到所述第一切片的TE路径。
或者，请求控制器基于所述链路状态数据库，运行所述CSPF运算计算第一节点归属的第一切片中从第一节点至目的节点的TE路径，所述运行CSPF运算计算的约束条件为{所述第一切片的slice-id，约束条件A}，所述约束条件A包括以下至少之一：带宽、延迟、亲和力、TE metric、最大跳数；所述计算包括：根据所述约束条件，对所述切片捆绑链路包含的每一个成员链路的切片属性信息和每一个节点的切片属性信息进行匹配，得到所述第一切片的TE路径。
在一实施例中，该装置还包括：转发单元。所述转发单元，设置成沿所述切片捆绑链路进行报文转发。
在一实施例中，该装置还包括：设置单元。所述设置单元，设置成根据本地策略为所述切片捆绑链路中的每一个成员链路设置优先级。
在一实施例中，所述转发单元，是设置成在控制层面的协议报文沿所述切片捆绑链路转发的过程中，始终选择所述切片捆绑链路中最高优先级的有效成员链路进行转发。
在一实施例中，所述转发单元，是设置成在数据层面的数据报文沿所述切片捆绑链路转发的过程中，选择所述切片捆绑链路中所述数据报文归属的切片的专属成员链路进行转发；如果所述数据报文归属的切片的专属成员链路失效，则丢弃所述数据报文。
在一实施例中，所述创建单元，还设置成在创建新的切片的情况下，创建新的成员链路，并将所述新的成员链路加入到所述切片捆绑链路中。
所述配置单元，还设置成将所述新的成员链路配置为归属于所述新的切片。
在一实施例中，所述配置单元，是设置成配置以下至少之一：IP地址、使 能中间系统至中间系统ISIS、资源预留协议流量工程RSVP-TE、开放最短路径优先OSPF和标签分发协议LDP。
在一实施例中，一条成员链路的类型包括以下之一：灵活以太管道FlexE channel、聚合链路、以太Ethernet链路、Ethernet VLAN子接口和点到点P2P链路。
在一实施例中，所述切片为同构网络或异构网络。
在一实施例中，所述第一节点和第二节点分别属于同一自治系统AS域，或者所述第一节点和第二节点分别属于不同的AS域。
本申请实施例一、二提供的技术方案，不需要运行复杂的IGP多拓扑或者灵活算法来提供切片，实现更加简洁，部署方便，能够简单有效的将overlay业务映射至其专属的underlay网络资源。
下面通过几个简单的示例对本申请实施例一、二提供的技术方案进行详细说明。
示例一
图3为本申请示例一提供的网络切片的创建方法的流程示意图。如图3所示，该方法包括如下步骤。
步骤301，在相邻的第一节点与第二节点之间创建至少一条成员链路，为每一个成员链路和每一个节点配置归属的切片。
执行步骤301的目的是为特定切片分配网络资源，即为拓扑相关的资源(如节点、链路)配置它们属于特定的切片。
在本示例中，不同的切片可以具有不同的切片属性。切片属性可以使用slice-id标识，即不同的切片具有不同的slice-id。slice-id为0表示默认切片，也即承载网络在做任何切片划分前，整个网络均属于默认切片。slice-id非0表示：为相应overlay业务分配的有效切片标识。
在本示例中，一个节点可以配置为属于一个或多个切片，一条链路也可以配置为属于一个或多个切片。非拓扑相关的资源(如节点内的CPU计算资源等)也可以配置为属于特定的切片。
在本示例中，步骤301可以包括：在相邻的第一节点与第二节点之间创建一条或多条成员链路，为每一个成员链路配置该成员链路归属的切片，为第一节点配置该第一节点归属的切片，以及为第二节点配置该第二节点归属的切片。
步骤302，在第一节点与第二节点之间创建切片捆绑链路。
为了更简单和灵活的支持切片的创建和删除，使得切片业务对承载网络的影响最小(比如尽量少的配置修改、尽量复用的层三(Layer 3，L3)配置)，可以根据需要在IGP域内的两个相邻的节点之间建立一条切片捆绑链路(可以记为slice-bundles链路)，该slice-bundles链路中包含了属于特定切片的多个成员链路。slice-bundles链路所包含的成员链路可以是传统的Ethernet(以太)链路、Ethernet VLAN子接口、P2P(点到点)链路，也可以是FlexE channel(灵活以太管道)，甚至还可以是聚合链路(比如通过LACP(Link Aggregation Control Protocol链路聚合控制协议)创建的聚合链路)。
步骤303，为所述切片捆绑链路配置分组业务。
只在slice-bundles链路上配置分组业务，比如配置IP(Internet Protocol，互联网协议)地址、配置使能IGP协议(如ISIS(Intermediate System to Intermediate System，中间系统至中间系统协议)、OSPF(Open Shortest Path First，开放最短路径优先))，以及其它协议(如(Label Distribution Protocol，标签分发协议)、RSVP-TE(Resource Reservation Protocol Traffic Engineering，资源预留协议流量工程))等等相关的配置。不在slice-bundles链路所包含的每个成员链路上做这些配置。同理，跨AS(Autonomous System，自治系统)域时，两相邻的ASBR(Autonomous Syszhtem Boundary Router自治系统边界路由器)节点之间也可以建立slice-bundles链路并只在slice-bundles链路上配置分组业务。
步骤304，泛洪链路状态信息，且维护一致的链路状态数据库。这里所述的一致的链路状态数据库可以是IGP域内的每一个节点都要维护的一致的链路状态数据库。
执行步骤304的目的是为了通告特定切片的网络资源。
所述IGP域内每一个节点维护一致的链路状态数据库。所述链路状态数据库记录泛洪的链路状态信息，所述链路状态信息携带每一个节点的切片属性和 每一条成员链路的状态信息和切片属性。
IGP域内可以泛洪链路状态信息。在链路状态泛洪消息中携带相应的slice-id属性。IGP域内每个节点将维护一致的链路状态数据库，链路状态数据库中记录了每个节点和每条链路分别具有哪些slice-id属性。例如，对于slice-bundles链路(作为三层链路)的泛洪，在泛洪的过程中可以包含slice-bundles链路中的成员链路(作为二层成员链路)信息。这里不是IGP多拓扑技术，而是拓扑内(比如默认拓扑内)的信息通告，也不是采用TE affinity(亲和力)技术对链路进行着色。TE affinity中对链路进行着色用于TE路径的计算，而slice-id用于表征硬隔离切片的专属的网络资源，两者层级不同。实际上可以在某个切片内使用TE affinity进行该切片内的TE路径计算。
控制器也可以通过扩展BGP(Border Gateway Protocol，边界网关协议)的BGP-LS(North-Bound Distribution of Link-State and Traffic Engineering information Using BGP，使用BGP通告链路状态与TE信息，见RFC7752)收集网络侧的链路状态数据(其中包含有slice-id属性)信息。网络侧无论是IGP域内的还是跨AS域间的链路状态信息都可以上报给控制器。对于slice-bundles链路(作为三层链路)的上报，在上报的过程中，可以包含具体的成员链路(作为二层成员链路)信息。
步骤305，基于链路状态数据库进行切片的路径计算。
所述进行切片的路径计算包括最短路径的计算、TE路径的计算等。
对于切片内最短路径的计算包括：IGP域内每个节点均可以根据它自身加入了哪些切片，基于上述一致的链路状态数据库，使用CSPF(Constrained Shortest Path First，约束最短路径优先)算法，计算至第一切片内所有其它目的节点的最短路径。CSPF算法的计算约束条件为{第一切片的slice-id,igp-metric最小}，即用CSPF算法计算得到的最短路径中所包含的节点和链路必须具有该第一切片对应的slice-id属性，以及满足路径全程IGP metric(度量)最小。IGP域内每个节点都如此计算，根据计算结果获得每个节点至IGP域内其它任何目的节点的最优下一跳，用于生成特定切片(如第一切片)内的最短路径转发表项。所述第一切片可以为第一节点归属的所有切片中的任一个切片，那么上述计算中的“计算至第一切片内所有其它目的节点的最短路径”可以为：计算第一节点 至其归属的第一切片内的任何其它目的节点的最短路径。
对于切片内TE路径的计算包括：受业务或者配置等触发，IGP域内的某个节点S可能需要计算一条属于第一切片内的、满足约束条件A的、至IGP域内另一节点D的TE路径。该计算仍然可以基于上述一致的链路状态数据库，使用CSPF算法计算。CSPF算法的计算约束条件为{第一切片的slice-id,约束条件A}，即用CSPF算法计算得到的TE路径中所包含的节点和链路必须具有该第一切片对应的slice-id属性，以及满足约束条件A。该约束条件A可以包含以下至少之一：带宽、延迟、亲和力、TE metric、最大跳数，等等因子。在另一示例中，节点S还可以通过PCEP(Path Computation Element Communication Protocol，路径计算单元通信协议)将上述TE路径计算请求发给PCE(Path Computation Element，路径计算单元)，PCE的计算动作与上述类似，不过在此之前，PCE所属的控制器需要收集网络侧的链路状态数据(链路状态数据中包含有slice-id属性)信息，比如通过BGP-LS收集。所述第一切片为节点S归属的所有切片中的任一个切片。
上述最短路径的计算，需要每个节点都要运行CSPF算法，以计算每个节点至该节点所归属的切片内的任何其它目的节点的最短路径。而上述TE路径的计算，只需要TE路径的头节点(或该头节点请求控制器)计算即可。
步骤306，沿所述切片捆绑链路进行报文转发。
控制层面的协议报文(如ISIS、OSPF、BGP、LDP、RSVP-TE等协议报文)沿slice-bundles链路转发的过程中，始终选择沿slice-bundles中的最高优先级成员链路转发，不在多个成员链路上进行负荷分担，slice-bundles中的每个成员链路的优先级排序可以根据本地策略进行设置或确定，如果当前优先级最高的成员链路失效了，则重新在剩余的其它成员链路中选择出最高优先级的成员链路。
转发层面的数据报文沿slice-bundles链路转发的过程中，需要根据报文所属的切片沿该切片对应的成员链路转发，如果切片专属的成员链路失效了，则相应切片的转发报文会丢弃。
本申请示例一提供的技术方案，与相关技术相比，不需要运行复杂的IGP多拓扑或者灵活算法来提供切片，实现更加简洁，部署方便，能够简单有效的将overlay业务映射至其专属的underlay网络资源。
示例二
在本示例二中，所有切片为同构网络(homogeneous network)，同构网络是指各切片对应的虚拟网络拓扑图是相同的，这意味着所有切片均一起同步的瓜分底层物理网络中每个节点内的资源以及每条链路资源，只是份额不同而已，同构网络适用于本申请实施例提供的网络切片的创建方法。
图4为本申请示例二提供的网络切片的网络拓扑图。如图4所示，由三个节点R1、R2、R3，组成一个IGP(例如中间系统到中间系统ISIS)域。为了支持5G切片，在R1与R2之间以及R2与R3之间分别创建了三条硬隔离的FlexE channel，即FlexE-channel 1(FlexE链路1)、FlexE-channel 2(FlexE链路2)、FlexE-channel 3(FlexE链路3)。
图5为本申请示例二提供的网络切片的创建方法的流程示意图。如图5所示，该方法包括如下步骤。
步骤501，在R1与R2之间创建slice-bundles 1(切片捆绑链路1)，以及在R2与R3之间创建slice-bundles 2(切片捆绑链路2)，并为slice-bundles 1和slice-bundles 2配置IP地址并使能IGP协议。
在R1上创建slice-bundles接口(记为slice-bundles 1)，将FlexE-channel 1、FlexE-channel 2、FlexE-channel 3作为成员接口分别加入到slice-bundles 1接口中。类似的，在R2上创建连向R1的slice-bundles 1接口以及连向R3的slice-bundles 2接口，在R3上创建连向R2的slice-bundles 2接口。
在此之前，在R1、R2、R3节点上分别配置它们都加入切片1、2以及3。还可以为FlexE-channel 1、FlexE-channel 2以及FlexE-channel 3分别配置其专属的切片信息，如FlexE-channel 1归属于切片1(即slice-id＝1)，FlexE-channel 2归属于切片2(即slice-id＝2)，FlexE-channel 3归属于切片3(即slice-id＝3)。
在slice-bundles 1接口上配置IP地址并使能IGP协议，而无需在FlexE-channel 1、FlexE-channel 2、FlexE-channel 3接口上分别配置IP地址以及使能IGP协议。
假设在每个slice-bundles接口中所有成员接口均有效，且FlexE-channel 1成员接口具有最高优先级，则向slice-bundles接口转发的IGP协议报文将实际沿FlexE-channel 1成员接口转发。
步骤502，R1、R2、R3通过IGP泛洪链路状态信息，并维护一致的链路状态数据库。
本步骤中，对于slice-bundles链路的泛洪过程，还会包含其所有成员链路信息，R1、R2、R3上将会维护一致的链路状态数据库。在链路状态数据库中，记录了每个节点以及每条链路归属的slice-id属性信息。例如，本示例二中，所有节点均具有slice-id＝1、2、3的属性取值，即每个slice-bundles三层链路本身不属于某个具体的切片，但是每个slice-bundles三层链路包含的二层成员链路均具有相应的slice-id属性，即FlexE-channel 1成员链路具有slice-id＝1的属性取值，FlexE-channel 2成员链路具有slice-id＝2的属性取值，FlexE-channel 3成员链路具有slice-id＝3的属性取值。
步骤503，进行切片1、2、3的最短路径计算。
R1上，由于其加入了切片1，则基于上述链路状态数据库运行CSPF算法计算切片1内R1至其它节点的最短路径。CSPF算法计算的约束条件为：{slice-id＝1,igp-metric最小}。在利用CSPF算法进行计算的过程中，在链路状态数据库中匹配符合slice-id约束条件的链路时，会具体根据slice-bundles三层链路所包含的二层成员链路所具有的slice-id属性进行匹配，而igp-metric约束条件则是匹配slice-bundles三层链路的igp-metric属性。本示例二中，R1上在切片1内至R2与R3的最短路径转发下一跳可表示为：
Next-hop:R2侧slice-bundles 1接口的IP地址；
Interface:slice-bundles 1三层接口，FlexE-channel 1二层成员接口；
类似的，R2上在切片1内至R1的最短路径转发下一跳可表示为：
Next-hop:R1侧slice-bundles 1接口的IP地址；
Interface:slice-bundles 1三层接口，FlexE-channel 1二层成员接口；
类似的，R2上在切片1内至R3的最短路径转发下一跳可表示为：
Next-hop:R3侧slice-bundles 2接口的IP地址；
Interface:slice-bundles 2三层接口，FlexE-channel 1二层成员接口；
类似的，R3上在切片1内至R1与R2的最短路径转发下一跳可表示为：
Next-hop:R2侧slice-bundles 2接口的IP地址；
Interface:slice-bundles 2三层接口，FlexE-channel 1二层成员接口；
我们可以在如上的最短路径转发下一跳信息中给出slice-bundles三层接口以及实际转发的FlexE-channel二层成员接口；或者给出slice-bundles三层接口和相应的slice-id值，在报文转发处理流程中根据slice-id去slice-bundles三层接口中匹配实际转发的FlexE-channel二层成员接口。
其它切片2、3内的最短路径计算也是类似的。于是，我们可以据此建立每个切片内的路由转发表。而为了在网络内区分不同切片内的最短路径转发流量，一种比较合适的方法是为不同切片的相同prefix(前缀)FEC(Forwarding Equivalence Class，转发等价类)分配不同的MPLS(Multiprotocol Label Switching，多协议标签交换)label(标签)，建立不同的MPLS LSP(Label Switched Path，标签转发路径)，这可以通过扩展LDP、Segment Routing等技术来支持。
步骤504，进行切片1、2、3的TE路径计算。
R1节点上，可以受业务或者配置触发，计算切片1内R1至R3的符合约束条件A的TE路径。基于上述的一致的链路状态数据库，使用CSPF算法计算，使用CSPF算法计算的约束条件为{slice-id＝1,约束条件A}，约束条件A可以包含以下至少之一：带宽、延迟、亲和力、TE metric、最大跳数等等因子。其它切片内的TE路径计算也是类似的。在本示例二中，计算得到的TE路径为：{节点R1,三层链路slice-bundles 1(二层成员链路FlexE-channel 1),节点R2,三层链路slice-bundles 2(二层成员链路FlexE-channel 1),节点R3}。其它切片内的TE路径计算也是类似的。
节点R1还可以通过PCEP协议将上述TE路径计算请求发给控制器，控制器的计算动作与上述类似，不过在控制器进行TE路径计算之前，控制器需要收集(比如通过BGP-LS)网络侧的链路状态数据库(其中包含有slice-id属性)。
为了在网络内区分不同切片内的TE路径转发流量，使用Segment Routing技术时，可以为slice-bundles三层链路中的不同二层成员链路分配不同的邻接体段标识(adjacency-sid)。
示例三
在本示例三中，切片为异构网络(Heterogeneous Network)，异构网络是指不同的切片对应的虚拟网络拓扑图不相同，这意味着有一些网络资源被一部分切片瓜分，而另一些网络资源被另一部分切片瓜分。
图6为本申请示例三提供的网络切片的网络拓扑图。如图6所示，由四个节点R1、R2、R3、R4，组成一个IGP(例如中间系统到中间系统ISIS)域。为了支持5G切片，在R1与R2之间、R2与R3之间、R1与R4之间以及R4与R3之间分别创建了一条硬隔离的FlexE channel。在R1与R2之间创建FlexE链路1(FlexE channel 1)，在R2与R3之间创建FlexE channel 1，在R1与R4之间创建FlexE链路2(FlexE channel 2)，在R4与R3之间创建FlexE channel 2。
图7为本申请示例三提供的网络切片的创建方法的流程示意图。如图7所示，该方法包括如下步骤。
步骤701，在R1与R2之间创建slice-bundles 1，以及在R2与R3之间创建slice-bundles 2，并为slice-bundles 1和slice-bundles 2配置IP地址并使能IGP协议。
为了便于以后R1与R2之间，以及R2与R3之间新增FlexE channel，创建了相应的slice-bundles接口；R1与R4之间，以及R4与R3之间由于链路带宽资源有限，不会有新的FlexE channel创建，所以没有创建slice-bundles接口，而是直接在传统的FlexE channel 2上配置分组业务。在R1上创建slice-bundles接口(记为slice-bundles 1)，将FlexE channel 1作为成员接口加入到slice-bundles1接口中。类似的，在R2上也创建连向R1的slice-bundles 1接口以及连向R3的slice-bundles 2接口。在R3上创建连向R2的slice-bundles 2接口。
在此之前，在R1、R2、R3节点上分别配置加入切片1，在R1、R4、R3节点上分别配置加入切片2。为slice-bundles 1接口和slice-bundles 2接口中的每个成员接口配置专属的切片信息，例如FlexE channel 1归属于切片1。
在slice-bundles 1接口、slice-bundles 2接口上配置IP地址并使能IGP协议。无需在FlexE channel 1接口上配置IP地址以及使能IGP协议。
假设在每个slice-bundles接口中所有成员接口均有效，且FlexE channel 1成员接口具有最高优先级，则向slice-bundles接口转发的IGP协议报文将实际沿FlexE channel 1成员接口转发。
步骤702，R1、R2、R3、R4通过IGP泛洪链路状态信息，并维护一致的链路状态数据库。
在对slice-bundles链路的泛洪过程中，还会包含其所有成员链路信息。R1、 R2、R3、R4上将会维护一致的链路状态数据库，在链路状态数据库中，记录了每个节点以及每条链路归属的slice-id属性信息。例如，本示例三中，通过IGP泛洪，会在每个节点上得到一致的链路状态数据库，即节点R1和R3均具有slice-id＝1和2的属性取值，节点R2具有slice-id＝1的属性取值，节点R4具有slice-id＝2的属性取值。三层链路slice-bundles 1和slice-bundles 2的二层成员链路FlexE channel 1分别具有slice-id＝1的属性取值，而FlexE channel 2三层链路具有slice-id＝2的属性取值。
步骤703，进行切片1、2的最短路径计算。
每个节点均以自身加入了哪些切片，基于上述链路状态数据库，通过CSPF算法按照约束条件{slice-id,igp-metric最小}，计算得到对应切片内该节点至其它节点的最短路径转发信息。例如，本示例三中，在切片1内R1至R2与R3的最短路径转发下一跳可表示为：
Next-hop:R2侧slice-bundles 1接口的IP地址；
Interface:slice-bundles 1三层接口，FlexE channel 1二层成员接口；
比如在切片2内R1至R4与R3的最短路径转发下一跳可表示为：
Next-hop:R4侧FlexE channel 2接口的IP地址；
Interface:FlexE channel 2三层接口；
其它节点也类似生成各切片内的最短路径转发信息。
步骤704，进行切片1、2的TE路径计算。
R1节点上，可以受业务或者配置触发，计算切片1内R1至R3的符合约束条件A的TE路径。基于上述一致的链路状态数据库，使用CSPF算法计算，使用CSPF算法计算的约束条件为{slice-id＝1,约束条件A}，这可以是由源节点R1自己通过CSPF算法基于上述一致的链路状态数据库计算的，或者也可以是R1通过PCEP协议请求PCE计算的。
约束条件A可以包含以下至少之一：带宽、延迟、亲和力、TE metric、最大跳数等等因子。其它切片内的TE路径计算也是类似的。
节点R1还可以通过PCEP协议将上述TE路径计算请求发给控制器，控制器的计算动作与上述类似，不过在计算之前，控制器需要收集(比如通过BGP-LS)网络侧的链路状态数据库(其中包含有slice-id属性)。
为了在网络内区分不同切片内的TE路径转发流量，使用Segment Routing技术时，可以为slice-bundles三层链路中的不同二层成员链路分配不同的adjacency-sid。
将本示例三中的FlexE channel换成其它链路类型如传统的ethernet链路、VLAN子接口、P2P链路以及聚合链路等等，其处理流程是类似的。
示例四
本示例四应用于跨AS域的切片网络。
图8为本申请示例四提供的网络切片的网络拓扑图。如图8所示，该网络包含AS1与AS2两个自治系统，它们通过ASBR1与ASBR2直连，为了支持5G切片，在ASBR1与ASBR2之间创建了两条硬隔离的FlexE链路1(FlexE channel 1)和FlexE链路2(FlexE channel 2)，FlexE channel 1归属于切片1，FlexE channel 2归属于切片2。
图9为本申请示例四提供的网络切片的创建方法的流程示意图。如图9所示，该方法包括如下步骤。
步骤901，在ASBR1与ASBR2之间创建切片捆绑链路1(slice-bundles 1)，并为slice-bundles 1配置IP地址；
为了方便扩展，在ASBR1和ASBR2上分别创建了slice-bundles 1接口，将两个节点之间的所有FlexE channel作为二层成员接口分别加入到对应节点的slice-bundles 1接口中。在本示例中，业务配置在slice-bundles 1接口上，即在slice-bundles 1接口上配置IP地址，该IP地址作为ASBR1与ASBR2之间BGP会话的TCP(Transmission Control Protocol，传输控制协议)建链地址。
步骤902，ASBR1与ASBR2之间建立一个BGP会话并通告BGP路由。
ASBR1与ASBR2之间只需要建立一个BGP会话，与切片个数无关。假设在每个slice-bundles接口中所有成员接口均有效，且FlexE channel 1成员接口具有最高优先级，则向对应的slice-bundles接口转发的BGP协议报文将实际沿FlexE channel 1成员接口转发。
ASBR1与ASBR2之间的BGP会话，可以用来通告多种类型的BGP路由，比如ASBR2可以通过BGP向ASBR1通告BGP-LU(BGP Labeled unicast)路由(见RFC8277)、BGP/MPLS IP VPN路由(见RFC4364)等。
步骤903，进行切片1、2的最短路径计算。
为了在ASBR1与ASBR2之间区分不同切片内的最短路径转发流量，一种比较合适的方法是为不同切片的相同BGP路由分配和通告不同的BGP label，建立不同的BGP LSP，即BGP LSP对应的转发表项包含的下一跳信息中将补充slice-id信息或者slice-id对应的二层成员接口信息。这可以通过扩展BGP来支持。
例如：ASBR2可以通过BGP向ASBR1通告属于切片1的BGP-LU(BGP Labeled unicast)路由(见RFC8277)、BGP/MPLS IP VPN路由(见RFC4364)等，ASBR2在向ASBR1通告BGP路由消息的过程中，可修改消息中的BGP下一跳属性为该ASBR2，则ASBR1上收到路由通告后形成的最短路径转发表项包含的下一跳信息可表示为：
Next-hop:ASBR2侧slice-bundles 1接口的IP地址；
Interface:slice-bundles 1三层接口，FlexE channel 1二层成员接口。
在一示例中，可以在如上的最短路径转发下一跳信息中给出slice-bundles三层接口以及实际转发的FlexE channel二层成员接口；或者给出slice-bundles三层接口和相应的slice-id值，在报文转发处理流程中根据slice-id去slice-bundles三层接口中匹配实际转发的FlexE channel二层成员接口。
另外，ASBR1和ASBR2可以将它们之间的slice-bundles链路作为链路状态数据上报给控制器，上报过程中，需要包含所有的成员链路信息及其slice-id属性，使得控制器具有跨AS域的链路连接关系，便于控制器为特定切片计算跨AS域的TE路径。这可以通过扩展BGP-LS来支持。
将本示例四中的FlexE channel换成其它链路类型如传统的ethernet链路、VLAN子接口、P2P链路以及聚合链路等，其处理流程是类似的。
示例五
在示例一至四的基础上，所述网络切片的创建方法还包括：如果有新的切片需要创建，只需要创建新的FlexE channel并将该FlexE channel作为成员接口加入到slice-bundles接口中，除了需要为新的FlexE channel成员接口配置其slice-id属性以外，其它配置均不需要修改，可扩展性非常好。
本申请实施例还提供了一种网络切片的创建装置，包括存储器、处理器及 存储在所述存储器上并可在所述处理器上运行的计算机程序，所述计算机程序被所述处理器执行时实现上述任一种网络切片的创建方法。
本申请实施例还提供了一种计算机可读存储介质，所述计算机可读存储介质上存储有信息处理程序，所述信息处理程序被处理器执行时实现上述任一种网络切片的创建方法。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统、装置中的功能模块/单元可以被实施为软件、固件、硬件及其适当的组合。在硬件实施方式中，在以上描述中提及的功能模块/单元之间的划分不一定对应于物理组件的划分；例如，一个物理组件可以具有多个功能，或者一个功能或步骤可以由若干物理组件合作执行。某些组件或所有组件可以被实施为由处理器，如数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于随机存取存储器(Random Access Memory，RAM)、只读存储器(Read-Only Memory，ROM)、带电可擦可编程只读存储器(Electrically Erasable Programmable read only memory，EEPROM)、闪存或其他存储器技术、光盘只读存储器(Compact Disc Read-Only Memory，CD-ROM)、数字多功能盘(Digital Video Disc，DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。

Claims (20)

  1. 一种网络切片的创建方法，包括：
    在第一节点与第二节点之间创建切片捆绑链路，其中，所述切片捆绑链路包括：在第一节点与第二节点之间的至少一条成员链路；
    为所述切片捆绑链路配置分组业务。
  2. 根据权利要求1所述的方法，其中，在第一节点与第二节点之间创建切片捆绑链路之前，该方法还包括：
    在所述第一节点与所述第二节点之间创建所述至少一条成员链路；
    为每一个成员链路配置对应的成员链路归属的切片，为每一个节点配置对应的节点归属的切片。
  3. 根据权利要求1所述的方法，其中，所述在第一节点与第二节点之间创建切片捆绑链路，包括：
    在所述第一节点和所述第二节点上分别创建相互连接的切片捆绑接口，将所述至少一条成员链路作为成员接口加入到所述切片捆绑接口。
  4. 根据权利要求2所述的方法，其中，所述为每一个成员链路配置对应的成员链路归属的切片，为每一个节点配置对应的节点归属的切片，包括：
    为每一个成员链路配置对应的成员链路的至少一个切片属性；为每一个节点配置对应的节点的至少一个切片属性。
  5. 根据权利要求3所述的方法，其中，所述为所述切片捆绑链路配置分组业务，包括：在所述切片捆绑接口上配置所述分组业务。
  6. 根据权利要求1所述的方法，还包括：
    泛洪链路状态信息，并在每个节点上维护一致的链路状态数据库；
    其中，所述链路状态数据库记录泛洪的链路状态信息，所述链路状态信息携带每一个节点的切片属性，并携带每一个成员链路的状态信息和切片属性。
  7. 根据权利要求6所述的方法，还包括：
    基于所述链路状态数据库进行切片的路径计算。
  8. 根据权利要求7所述的方法，其中，进行切片的路径计算，包括：
    运行约束最短路径优先CSPF运算计算所述第一节点归属的第一切片中从所述第一节点至所有其他目的节点的最短路径，所述运行CSPF运算计算的约束条件为{所述第一切片的切片编号slice-id,IGP度量igp-metric最小}；所述计算包括：根据所述约束条件，对所述切片捆绑链路包含的每一个成员链路的切片属性和每一个节点的切片属性进行匹配，得到所述第一切片的最短路径转发的最优下一跳；
    或者，基于所述链路状态数据库，运行CSPF运算计算所述第一节点归属的第一切片中从所述第一节点至目的节点的TE路径，所述运行CSPF运算计算的约束条件为{所述第一切片的slice-id，约束条件A}，所述约束条件A包括以下至少之一：带宽、延迟、亲和力、TE metric、最大跳数；所述计算包括：根据所述约束条件，对所述切片捆绑链路包含的每一个成员链路的切片属性和每一个节点的切片属性进行匹配，得到所述第一切片的TE路径；
    或者，请求控制器基于所述链路状态数据库，运行所述CSPF运算计算所述第一节点归属的第一切片中从所述第一节点至目的节点的TE路径，所述运行CSPF运算计算的约束条件为{所述第一切片的slice-id，约束条件A}，所述约束条件A包括以下至少之一：带宽、延迟、亲和力、TE metric、最大跳数；所述计算包括：根据所述约束条件对所述切片捆绑链路包含的每一个成员链路的切片属性和每一个节点的切片属性进行匹配，得到所述第一切片的TE路径。
  9. 根据权利要求1所述的方法，还包括：
    沿所述切片捆绑链路进行报文转发。
  10. 根据权利要求9所述的方法，还包括：
    根据本地策略为所述切片捆绑链路中的每一个成员链路设置优先级。
  11. 根据权利要求10所述的方法，其中，所述沿所述切片捆绑链路进行报文转发，包括：
    在控制层面的协议报文沿所述切片捆绑链路转发的过程中，选择所述切片捆绑链路中最高优先级的有效成员链路进行转发。
  12. 根据权利要求9所述的方法，其中，所述沿所述切片捆绑链路进行报文转发，包括：
    在数据层面的数据报文沿所述切片捆绑链路转发的过程中，选择所述切片捆绑链路中所述数据报文归属的切片的专属成员链路进行转发；
    如果所述数据报文归属的切片的专属成员链路失效，则丢弃所述数据报文。
  13. 根据权利要求1至12任一项所述的方法，还包括：
    在创建新的切片的情况下，创建新的成员链路；
    将所述新的成员链路配置为归属于所述新的切片；以及
    将所述新的成员链路加入到所述切片捆绑链路中。
  14. 根据权利要求1至12任一项所述的方法，其中，所述配置分组业务包括配置以下至少之一：
    IP地址、使能中间系统至中间系统ISIS、资源预留协议流量工程RSVP-TE、开放最短路径优先OSPF和标签分发协议LDP。
  15. 根据权利要求1至12任一项所述的方法，其中，一条成员链路的类型包括以下之一：
    灵活以太管道FlexE channel、聚合链路、以太Ethernet链路、Ethernet VLAN子接口和点到点P2P链路。
  16. 根据权利要求1至12任一项所述的方法，其中，所有切片为同构网络或异构网络。
  17. 根据权利要求1至12任一项所述的方法，其中，所述第一节点和所述第二节点分别属于同一自治系统AS域，或者所述第一节点和所述第二节点分别属于不同的AS域。
  18. 一种网络切片的创建装置，包括：
    创建单元，设置成在第一节点与第二节点之间创建切片捆绑链路；其中，所述切片捆绑链路包括：在第一节点与第二节点之间创建的至少一条成员链路；
    配置单元，设置成为所述切片捆绑链路配置分组业务。
  19. 一种网络切片的创建装置，包括存储器、处理器及存储在所述存储器上并可在所述处理器上运行的计算机程序，所述计算机程序被所述处理器执行时实现如权利要求1至17中任一项所述的网络切片的创建方法。
  20. 一种计算机可读存储介质，存储有信息处理程序，所述信息处理程序被处理器执行时实现如权利要求1至17中任一项所述网络切片的创建方法。
PCT/CN2019/101700 2018-09-25 2019-08-21 网络切片的创建方法及装置 WO2020063201A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP19865125.9A EP3817446B1 (en) 2018-09-25 2019-08-21 Method and apparatus for creating network slices
US17/103,924 US11606255B2 (en) 2018-09-25 2020-11-24 Method and apparatus for creating network slices

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811116143.3 2018-09-25
CN201811116143.3A CN110944357B (zh) 2018-09-25 2018-09-25 一种网络切片的方法及装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/103,924 Continuation US11606255B2 (en) 2018-09-25 2020-11-24 Method and apparatus for creating network slices

Publications (1)

Publication Number Publication Date
WO2020063201A1 true WO2020063201A1 (zh) 2020-04-02

Family

ID=69904870

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/101700 WO2020063201A1 (zh) 2018-09-25 2019-08-21 网络切片的创建方法及装置

Country Status (4)

Country Link
US (1) US11606255B2 (zh)
EP (1) EP3817446B1 (zh)
CN (1) CN110944357B (zh)
WO (1) WO2020063201A1 (zh)

Families Citing this family (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112054960B (zh) * 2019-02-13 2024-04-26 华为技术有限公司 一种路径计算方法、装置及设备
US11082337B2 (en) 2019-02-15 2021-08-03 Juniper Networks, Inc. Support for multiple virtual networks over an underlay network topology
CN114128240A (zh) * 2019-02-28 2022-03-01 华为技术有限公司 实现内部网关协议的网络中的压缩数据传输
CN112398756B (zh) * 2019-08-13 2024-05-17 华为技术有限公司 用于传输业务数据的方法和装置
CN116761208A (zh) * 2020-03-17 2023-09-15 华为技术有限公司 报文处理方法、装置、设备及存储介质
CN113498084B (zh) * 2020-04-07 2022-07-29 烽火通信科技股份有限公司 一种层次化的基于切片的5g业务承载方法及系统
US20210367883A1 (en) * 2020-05-22 2021-11-25 Juniper Networks, Inc. Bitmask route target in targeted distribution of information using a routing protocol
CN113839870B (zh) * 2020-06-24 2023-01-13 华为技术有限公司 路径创建方法、装置及系统
CN112187641B (zh) * 2020-06-24 2022-03-11 华为技术有限公司 一种路由信息发送方法、报文发送方法及相关装置
CN111865792B (zh) * 2020-07-29 2022-07-12 新华三技术有限公司 一种bsid的管理方法、一种路由设备和可读存储介质
CN114205279B (zh) * 2020-09-01 2023-07-21 中国移动通信有限公司研究院 路径选择策略配置方法、路径选择方法、装置及存储介质
CN114866470A (zh) * 2021-02-03 2022-08-05 华为技术有限公司 发送报文的方法、装置、系统及存储介质
CN115134282A (zh) * 2021-03-08 2022-09-30 华为技术有限公司 一种路由处理方法及网络设备
CN115208809A (zh) * 2021-04-09 2022-10-18 华为技术有限公司 确定路径的方法和装置
CN115277548A (zh) * 2021-04-30 2022-11-01 中国移动通信有限公司研究院 一种传输方法、装置及存储介质
CN115314440A (zh) * 2021-05-06 2022-11-08 中兴通讯股份有限公司 流量调度方法、系统及存储介质
CN115473840A (zh) * 2021-06-11 2022-12-13 华为技术有限公司 一种报文发布方法、转发路径处理方法及装置
US11844012B2 (en) * 2021-07-02 2023-12-12 Cisco Technology, Inc. Mapping and stitching network slices across various domains based on a border gateway protocol attribute
CN114006814B (zh) * 2021-10-11 2023-12-05 中盈优创资讯科技有限公司 一种基于网络的硬切片动态监控方法及装置
WO2023155733A1 (zh) * 2022-02-17 2023-08-24 华为技术有限公司 一种网络切片信息传输方法及装置
CN115051944B (zh) * 2022-07-15 2023-07-21 中国电信股份有限公司 端到端切片创建方法、装置、设备及存储介质
CN116056160B (zh) * 2023-02-09 2024-01-30 烽火通信科技股份有限公司 网络切片的方法与装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2424146A1 (en) * 2009-02-13 2012-02-29 LG Electronics Inc. Apparatus for transmitting and receiving a signal and method of transmitting and receiving a signal
US20170245140A1 (en) * 2016-02-18 2017-08-24 Huawei Technologies Co., Ltd. System and method of user equipment state configurations
CN107426776A (zh) * 2016-05-24 2017-12-01 华为技术有限公司 QoS控制方法及设备
CN107734482A (zh) * 2017-09-11 2018-02-23 西安电子科技大学 基于d2d和业务卸载的内容分发方法

Family Cites Families (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6956821B2 (en) * 2001-01-30 2005-10-18 Telefonaktiebolaget L M Ericsson (Publ) Path determination in a data network
CN100466597C (zh) 2004-10-11 2009-03-04 华为技术有限公司 基于区分服务域的业务流分配的实现方法
EP1921808B1 (en) * 2006-11-10 2014-06-18 Alcatel Lucent Preemptive transmission protection scheme for data services
CN102118319B (zh) * 2011-04-06 2013-09-18 杭州华三通信技术有限公司 流量负载均衡方法和装置
US8576708B2 (en) * 2011-06-02 2013-11-05 Cisco Technology, Inc. System and method for link protection using shared SRLG association
US9137590B2 (en) * 2011-11-14 2015-09-15 Infinera Corporation OSPFTE extension to support GMPLS for flexible grid
CN103179178B (zh) * 2011-12-26 2016-06-15 杭州华三通信技术有限公司 扩展集群间聚合组成员端口的方法和设备
US8942256B1 (en) * 2012-01-06 2015-01-27 Juniper Networks, Inc. Advertising with a layer three routing protocol constituent link attributes of a layer two bundle
WO2015054904A1 (zh) 2013-10-18 2015-04-23 华为技术有限公司 转发报文的方法、控制器、转发设备和网络系统
US9654418B2 (en) * 2013-11-05 2017-05-16 Telefonaktiebolaget L M Ericsson (Publ) Method and system of supporting operator commands in link aggregation group
US10020826B2 (en) * 2014-04-02 2018-07-10 International Business Machines Corporation Generating molecular encoding information for data storage
US9313663B2 (en) * 2014-08-21 2016-04-12 Futurewei Technologies, Inc. Automatic division of internet protocol radio access networks to interior gateway protocol areas
CN105791108B (zh) * 2014-12-25 2019-07-12 中兴通讯股份有限公司 一种基于捆绑接口的隧道带宽预留的方法及装置
US10382341B2 (en) * 2015-03-20 2019-08-13 Juniper Networks, Inc. Label switched path preemption avoidance
US9990243B2 (en) * 2015-04-02 2018-06-05 Fixstream Networks Inc. Using spanning tree protocol to determine a layer 2 topology of an ethernet type network
CN105516312B (zh) 2015-12-09 2019-02-22 重庆邮电大学 一种软件定义网络负载均衡装置与方法
KR101748750B1 (ko) 2016-02-29 2017-06-19 부산대학교 산학협력단 Ｓｄｎ 기반 무선 가상 네트워크 환경에서 트래픽 변화를 고려한 대역폭 제어 장치 및 방법
US10200278B2 (en) * 2016-03-02 2019-02-05 Arista Networks, Inc. Network management system control service for VXLAN on an MLAG domain
CN105812256B (zh) 2016-04-18 2019-04-12 华为技术有限公司 基于标签转发的业务处理方法和装置
US10320645B2 (en) 2016-07-11 2019-06-11 Cisco Technology, Inc. System and method of using atomic flow counters in data center switching
CN108243106B (zh) * 2016-12-23 2020-09-04 华为技术有限公司 控制网络切片的方法、转发设备、控制设备和通信系统
US10686734B2 (en) * 2017-09-26 2020-06-16 Hewlett Packard Enterprise Development Lp Network switch with interconnected member nodes
CN108206790B (zh) 2018-01-11 2021-03-16 重庆邮电大学 一种基于网络切片的sdn联合路由选择及资源分配方法
CN111869171B (zh) * 2018-03-20 2023-09-05 诺基亚通信公司 用于ip多媒体子系统（ims）域的网络切片管理

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2424146A1 (en) * 2009-02-13 2012-02-29 LG Electronics Inc. Apparatus for transmitting and receiving a signal and method of transmitting and receiving a signal
US20170245140A1 (en) * 2016-02-18 2017-08-24 Huawei Technologies Co., Ltd. System and method of user equipment state configurations
CN107426776A (zh) * 2016-05-24 2017-12-01 华为技术有限公司 QoS控制方法及设备
CN107734482A (zh) * 2017-09-11 2018-02-23 西安电子科技大学 基于d2d和业务卸载的内容分发方法

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
3GPP TECHNICAL SPECIFICATION GROUP RADIO ACCESS NETWORK: "Study on New Radio Access Technology; Radio Access Architecture and Interfaces (Release 14", 3GPP TR 38.801 V2.0.0, 31 March 2017 (2017-03-31), XP055698745 *
3GPP TECHNICAL SPECIFICATION GROUP RADIO ACCESS NETWORK: "Study on New Radio Access Technology; Radio Access Architecture and Interfaces (Release 14", 3GPP TR 38.801 VI.1.0, 31 January 2017 (2017-01-31), XP055698747 *

Also Published As

Publication number Publication date
US20210083940A1 (en) 2021-03-18
EP3817446B1 (en) 2023-03-08
EP3817446A4 (en) 2021-07-28
US11606255B2 (en) 2023-03-14
CN110944357A (zh) 2020-03-31
CN110944357B (zh) 2023-08-29
EP3817446A1 (en) 2021-05-05

Similar Documents

Publication Publication Date Title
WO2020063201A1 (zh) 网络切片的创建方法及装置
CN109257278B (zh) 用于非分段路由启用的路由器的分段路由标签交换路径方法
US9660897B1 (en) BGP link-state extensions for segment routing
EP3200402B1 (en) Segment routing information obtainment method and segment routing network establishment method
US9178796B2 (en) Multi-layer stateful path computation element architecture
US9019865B2 (en) Advertising traffic engineering information with the border gateway protocol
US11743166B2 (en) Provisioning non-colored segment routing label switched paths via segment routing policies in border gateway protocol
US10623302B2 (en) X channel to zone in zone routing
WO2016115823A1 (zh) 标签构造以及标签报文转发方法及装置
US9270426B1 (en) Constrained maximally redundant trees for point-to-multipoint LSPs
US9571387B1 (en) Forwarding using maximally redundant trees
US10630581B2 (en) Dynamic tunnel report for path computation and traffic engineering within a computer network
US11483242B2 (en) Seamless end-to-end segment routing across metropolitan area networks
US11888722B2 (en) Route advertisement method, device, and system
US11425056B1 (en) Dynamic computation of SR-TE policy for SR-enabled devices connected over non-SR-enabled devices
US10554543B1 (en) Migrating data traffic between label switched paths (LSPs) based on per-LSP protocol priority value
US11824763B2 (en) Filtering topologies for path computation in massively scaled networks
US20220217086A1 (en) Stateless multicasting over traffic engineered unicast tunnels
Ajiardiawan et al. Performance analysis of segment routing on MPLS L3VPN using PNETLAB
Torres Segment Routing Protocol Analysis
Abukhshim Intra-Area, Inter-Area and Inter-AS Traffic Engineering and Path Selection Evaluation
Singh Protection and Restoration in MPLS based Networks

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: 19865125

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2019865125

Country of ref document: EP

Effective date: 20201203

NENP Non-entry into the national phase

Ref country code: DE