Abstract: The present disclosure provides a route determination method, including: determining at least one candidate path in a target network; determining a deterministic delay of each candidate path according to a current scheduling parameter, an intra-node forwarding delay and a link propagation delay; the current scheduling parameter includes a current Deadline scheduling delay and a current scheduling policy, the deterministic delay of each candidate path includes node delays of all intermediate nodes in the candidate path and link propagation delays of all links in the candidate path, the node delay of each intermediate node is obtained according to the intra-node forwarding delay of the intermediate node, the current Deadline scheduling delay and the current scheduling policy; and selecting a target path from the at least one candidate path according to the deterministic delay, and determining a route. The present disclosure further provides an electronic device, a computer-readable storage medium.

Abstract: Provided in the embodiments of the present disclosure are a routing method and apparatus, a cloud resource registering method and apparatus, and a storage medium and an electronic apparatus.

Abstract: A method for packet scheduling, a network device, a storage medium, and a computer program product are disclosed. The method may include acquiring a local deadline time indicative of a maximum allowable residence time of a packet at a local node; acquiring a cumulative deadline time indicative of a sum of each local deadline time that the packet goes through at each upstream node via which the packet is transferred, and a cumulative residence time indicative of the sum of each local residence time that the packet goes through at each upstream node via which the packet is transferred; and calculating a deadline time adjustment value according to the local deadline time, the cumulative deadline time, and the cumulative residence time; and adjusting a time at which the packet is sent according to the deadline time adjustment value.

Abstract: A path calculation method, which is applied to a head node, may include: acquiring virtual networks and Cyclic Queuing and Forwarding (CQF) scheduling parameters supported by nodes, where each of the nodes supports at least one CQF scheduling parameter; acquiring a target binding relationship, where the target binding relationship is a binding relationship between a target virtual network and a target CQF scheduling parameter; determining a plurality of target nodes and a plurality of target links belonging to the target virtual network according to the target binding relationship and the virtual networks and the CQF scheduling parameters supported by the nodes; and calculating a target path to a tail node in the target virtual network according to the plurality of target nodes, the plurality of target links, and the target CQF scheduling parameter.

Abstract: A routing method, a routing device and a computer-readable storage medium are disclosed. The routing method includes: allocating, to each of network slices corresponding to different algorithm types, a segment identifier corresponding to a respective algorithm type, and flooding the segment identifier through an IGP; configuring, for each network slice, a QoS policy corresponding to a respective algorithm type; and, forwarding a packet based on the segment identifier and the QoS policy.

Abstract: A path determination method, a network element, and a computer-readable storage medium are disclosed. The path determination method may include: acquiring link bandwidth data of all physical links within a network slice, where the link bandwidth data corresponds to the network slice, and the network slice is created by an interior gateway protocol flex algorithm (S100); acquiring a required bandwidth of a transmission channel within the network slice (S200); and determining, according to the link bandwidth data and the required bandwidth, a path for the transmission channel from among all the physical links (S300).

Abstract: Disclosed in embodiments of the present application are a traffic scheduling method, a system, and a storage medium. In the present application, a controller acquires the utilization rate of preset resources in a network, then determines, according to the utilization rate, the load state of each service node on a first SR-TE path having the highest scheduling priority in a pre-created SR-TE path scheduling group, when there is an overloaded service node on the first SR-TE path, determines a second SR-TE path according to the first SR-TE path, sets the scheduling priority of the second SR-TE path to the highest scheduling priority, sets the scheduling priority of the first SR-TE path to a normal scheduling priority, and obtains an updated SR-TE path scheduling group, and finally delivers the updated SR-TE path scheduling group to a headend node on the network.

Abstract: A BIER packet forwarding method is applied to a packet sending node and includes: setting node information of a BIER forwarding neighboring node in a BIFT forwarding entry; in a case of determining according to the node information that the BIER forwarding neighboring node has a capability of processing a target packet format, encapsulating a BIER packet according to the target packet format; and sending an encapsulated BIER packet to the BIER forwarding neighboring node.

Abstract: Provided are a method for receiving border gateway protocol (BGP)-intent route, and a method for advertising BGP-intent route. The method for receiving BGP-intent route includes: receiving the BGP-intent route advertised by a BGP speaker, where the BGP-intent route carries at least one of the following: a metric type, a metric and metric credit information.

Abstract: Embodiments of the present disclosure provide a network logical layering method based on Routing In Fat Tree (RIFT) protocol, a network logical layering device, a network device and a storage medium. By exchanging Link Information Element (LIE) packets and Topology Information Element (TIE) packets with other devices, a network device can enable the other devices in the network to know a topology supported by the present device and to know neighbor information and Metric information of the present device in the supported topology, and the network device can also know the topologies supported by the other devices in the network and the neighbor information and the Metric information of the other devices in the corresponding topologies. Thus, the device can calculate a topology route corresponding to the topology supported thereby.

Abstract: A network slice creation method and apparatus, and a packet forwarding method and apparatus are provided. The network slice creation method includes: respectively configuring Traffic Engineering (TE) affinity attributes for layer-2 member links in a layer-3 bundled link, and flooding the TE affinity attributes of the layer-2 member links by using Interior Gateway Protocol (IGP); and then creating, according to the TE affinity attributes of the layer-2 member links and by using a Flex Algorithm (FA), network slices containing the layer-2 member links.

Abstract: The present disclosure provides a routing management method and apparatus, a network device, and a readable storage medium. The method comprises: a controller obtaining network topology information of a network side; the controller calculating, on the basis of the network topology information, path information of a segment routing traffic engineering (SR-TE) instance to be created, and sending the path information to a header node of the network side, wherein the path information comprises segment list information and entropy label (EL) insertion position information; and the controller creating the SR-TE instance from the header node to a tail node on the network side.

Abstract: Disclosed are a method and apparatus for sending a segment routing traffic engineering (SR-TE) policy, a method and apparatus for receiving an SR-TE policy, a network element, and a computer-readable storage medium. The method for sending an SR-TE policy includes creating an SR-TE policy instance by a first network element; and sending an SR-TE policy corresponding to the SR-TE policy instance to a second network element by the first network element, where the SR-TE policy carries path identifier information and primary/standby state information of a segment list so as to support fast reroute (FRR) of a segment list level.

Abstract: The present disclosure provides a path computation method, a non-transitory storage medium, and an electronic apparatus. The path computation method includes: sending a path computation request (PCReq) message to a path computation element (PCE), wherein the PCReq message carries a constraint condition ID including at least one of a protocol ID, a multi-topology ID, a network slice ID, an application ID, or a traffic engineering (TE) target ID, and the PCReq message is configured to instruct the PCE to compute a TE path according to the constraint condition ID; and receiving a path computation reply (PCRep) message returned from the PCE, wherein the PCRep message carries the TE path.

Abstract: Embodiments of the present disclosure provide an information sending method applied to a node. The method includes: sending capability advertisement information, wherein the capability advertisement information is used for indicating a capability of the node to support compressed SRv6 SIDs. Embodiments of the present disclosure further provide an information processing method, a node, a controller, and a non-transitory computer-readable storage medium.

Abstract: The present disclosure provides a packet encapsulation method, including: determining a segment routing-traffic engineering (SR-TE) path; generating, according to a segment identifier (SID) of each node in the SR-TE path, an SID list, where each node supports a plurality of unified-SID encapsulation types (UETs) corresponding to SIDs of different lengths, and in the SID list, the SID of at least a node serving as an intermediate node of the SR-TE path is the SID having the non-longest length in the plurality of SIDs corresponding to the node; forming a segment routing header (SRH) from the SID list; and encapsulating an initial packet with the SRH to obtain a final packet. The present disclosure further provides a packet forwarding method, a UET announcement method, an electronic device, and a computer-readable storage medium. The final packet obtained by the packet encapsulation method has a higher load rate.

Abstract: Provided are a message sending method and apparatus, a message receiving method and apparatus, and a storage medium. The message sending method includes: sending, by an egress node, a Border Gateway Protocol (BGP) update message to an ingress node to notify the ingress node of routing reachability information, wherein the BGP update message includes a tunnel encapsulation attribute, which includes one or more pieces of tunnel encapsulation information, the tunnel encapsulation information including at least one of the following: a designated flow classification feature value and path information of a designated virtual network, and the tunnel encapsulation information being configured to instruct the ingress node to map, to a path of the designated virtual network, traffic which is sent to the egress node and has the designated flow classification feature value.

Abstract: Provided are an information transmission method and apparatus, a network node, a controller and a storage medium. The method is applied to a network node and includes: acquiring slice-associated resource information for each link in a network and transmitting the resource information.

Abstract: A path construction method and related devices are disclosed. The method may include: advertising, by a second PE node, a first VPN route to a first PE node through an MP-BGP signaling channel, such that the first PE node is able to determine a label forwarding path to a first VPN Prefix based on a first transmission path descriptor (TPD) carried in the first VPN route received; where the first TPD is configured to identify the label forwarding path for a first VPN message to reach a BGP next hop.

Abstract: Disclosed in embodiments of the present application are a traffic scheduling method, a system, and a storage medium. In the present application, a controller acquires the utilization rate of preset resources in a network, then determines, according to the utilization rate, the load state of each service node on a first SR-TE path having the highest scheduling priority in a pre-created SR-TE path scheduling group, when there is an overloaded service node on the first SR-TE path, determines a second SR-TE path according to the first SR-TE path, sets the scheduling priority of the second SR-TE path to the highest scheduling priority, sets the scheduling priority of the first SR-TE path to a normal scheduling priority, and obtains an updated SR-TE path scheduling group, and finally delivers the updated SR-TE path scheduling group to a headend node on the network.