CN114553760B

CN114553760B - Path weight distribution method and device

Info

Publication number: CN114553760B
Application number: CN202011339362.5A
Authority: CN
Inventors: 王贵; 姚俊达; 汪祖亮; 胡志波
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2020-11-25
Filing date: 2020-11-25
Publication date: 2023-05-16
Anticipated expiration: 2040-11-25
Also published as: CN114553760A; WO2022110948A1

Abstract

The application discloses a path weight distribution method and device, and belongs to the technical field of communication. In the method, an entry node acquires a transmission characteristic of a first forwarding path, wherein the transmission characteristic of the first forwarding path is used for indicating the transmission characteristic of the first forwarding path when a segment-based route SR message is transmitted; the entry node assigns a first target weight to the first forwarding path based on a transmission characteristic of the first forwarding path, the first target weight being used to represent a load sharing state of the first forwarding path. According to the method, the weight is distributed to each forwarding path through the entry node, and the control node is not required to distribute the weight to each forwarding path, so that the calculation cost of the control node is saved.

Description

Path weight distribution method and device

Technical Field

The present disclosure relates to the field of communications technologies, and in particular, to a path weight allocation method and apparatus.

Background

Currently, for a certain service, a control node determines a forwarding node in a forwarding network for receiving a data stream from a user side as an ingress node (ingresnode) of the service, and determines a forwarding node in the forwarding network for transmitting the data stream to the user side as an egress node (egresnode) of the service. The control node may further allocate a Segment Routing (SR) -multiprotocol label switching (multiprotocol label switching, MPLS) traffic engineering (traffic engineering, TE) Policy (Policy) for the traffic based on the locations of the ingress node and the egress node in the forwarding network, where the SR-MPLS TE Policy is used to indicate a plurality of candidate paths (candidate paths) with the ingress node as a source node and the egress node as a tail node, each candidate path includes at least one sub-path, the SR-MPLS TE Policy specifically includes a priority of the plurality of candidate paths, a weight of each sub-path in each candidate path, and a segment list identification (segment list identity, ID) of a segment list of each sub-path, where a candidate path with a highest priority of the plurality of candidate paths is a primary candidate path, and other candidate paths are backup paths.

The control node may issue the SR-MPLS TE Policy to an ingress node, and after the ingress node receives the data stream of the service from one user side, the ingress node transmits the received data stream to an egress node through the primary candidate path indicated by the SR-MPLS TE Policy, so that the egress node outputs the data stream to another user side.

When the transmission characteristics of the main candidate paths do not meet the requirements of service-level agreement (SLA) of the service, the control node updates the priority of each candidate path in the SR-MPLS TE Policy, updates the current main candidate path as an alternative path, and sends the updated SR-MPLS TE Policy to the entry node, and the entry node transmits the data stream based on the main candidate path in the updated SR-MPLS TE Policy.

When the scale of the forwarding network is larger, the control services provided by the control node are comparatively more, and if the control node also provides services for updating the SR-MPLS TE Policy for each service, the calculation overhead of the control node is further increased.

Disclosure of Invention

The embodiment of the application provides a path weight distribution method and device, which can reduce the calculation overhead of a control node. The technical scheme is as follows:

In a first aspect, a path weight allocation method is provided, applied to an ingress node, and the method includes:

acquiring transmission characteristics of a first forwarding path; and based on the transmission characteristics of the first forwarding path, a first target weight is allocated to the first forwarding path, wherein the first target weight is used for representing the load sharing state of the first forwarding path.

The transmission characteristics of the first forwarding path are used for indicating the transmission characteristics of the first forwarding path when the SR-based message is transmitted. Optionally, the transmission characteristic is an indicator value associated with a drive test event (cause), or an indicator value associated with an SLA, such as at least one of a transmission delay, a delay jitter value, and a packet loss rate.

According to the method, the weight is distributed to each forwarding path through the entry node, and the control node is not required to distribute the weight to each forwarding path, so that the calculation cost of the control node is saved.

In one possible implementation, the transmission characteristic includes an index value of N transmission indices, where N is an integer greater than or equal to 1, and any one transmission index is used to characterize a transmission performance index.

In one possible implementation, the assigning the first target weight to the first forwarding path based on the transmission characteristics of the first forwarding path includes:

Based on a service level agreement SLA of a target service, an ith weight is allocated to an ith transmission index in the N transmission indexes, wherein the ith weight of the ith transmission index is used for representing the importance degree of the ith transmission index to the target service, and i is an integer which is more than or equal to 1 and less than or equal to N;

and obtaining the first target weight based on the weight corresponding to each transmission index in the N transmission indexes and the index value of each transmission index.

for an ith transmission index of the N transmission indexes, an ith weight is allocated to an index value of the ith transmission index of the first forwarding path, wherein the ith weight of the index value of the ith transmission index is used for representing the quality degree of the first forwarding path relative to k forwarding paths under the ith transmission index, i is an integer greater than or equal to 1 and less than or equal to N, and k is an integer greater than or equal to 1;

the first target weight is determined based on the weight of the index value of the first forwarding path for each of the N transmission indexes.

In one possible implementation, the assigning the ith weight to the index value of the ith transmission index of the first forwarding path includes:

ordering index values of the ith transmission index in the transmission characteristics of the k forwarding paths to obtain an index value sequence corresponding to the ith transmission index;

and obtaining the ith weight of the index value of the ith transmission index of the first forwarding path based on the ordering of the index value of the ith transmission index of the first forwarding path in the index value sequence.

determining the first target weight based on the weight corresponding to each transmission index of the N transmission indexes and the weight of the index value of each transmission index of the first forwarding path;

the weight corresponding to any transmission index is used for indicating the importance degree of any transmission index to a target service, the weight of the index value of any transmission index of the first forwarding path is used for indicating the quality degree of the first forwarding path relative to k forwarding paths under any transmission index, and k is an integer greater than or equal to 1.

In one possible implementation, the first forwarding path belongs to a first candidate forwarding path; the method further comprises the steps of:

for an ith transmission index of the N transmission indexes, assigning a second target weight under the ith transmission index to the first forwarding path based on an index value of the ith transmission index of the first forwarding path, wherein the second target weight of the first forwarding path under the ith transmission index is used for representing the goodness of the first forwarding path relative to each forwarding path in m candidate paths under the ith transmission index, i is an integer greater than or equal to 1 and less than or equal to N, and m is an integer greater than or equal to 1;

a third target weight of the first candidate forwarding path is determined based on a second target weight of the first forwarding path relative to the m candidate paths at each of the N transmission metrics, the third target weight being used to indicate a priority of the first candidate forwarding path among the m candidate forwarding paths.

In one possible implementation, before the allocating the first target weight to the first forwarding path based on the transmission characteristic of the first forwarding path, the method further includes:

And determining that the first forwarding path meets the SLA of the target service based on the transmission characteristics of the first forwarding path.

In one possible implementation, the acquiring the transmission characteristic of the first forwarding path includes at least one of:

when the transmission characteristic comprises transmission time delay, determining the time length of transmitting a test message to an outlet node through the first forwarding path as the transmission time delay;

when the transmission characteristics comprise transmission jitter values, acquiring the transmission jitter values based on the transmission delay determined by two adjacent test messages;

when the transmission characteristics comprise packet loss rate, determining the packet loss rate based on a target sending number and a target receiving number, wherein the target sending number is the total number of the test messages sent by the inlet node to the outlet node through the first forwarding path in a time window, and the target receiving number is the total number of the test messages sent by the inlet node to the outlet node through the first forwarding path in the time window.

In one possible implementation, the test packet includes at least one of a segment list identifier of the first forwarding path, a candidate identifier of the first forwarding path, a transmission time of the entry node to transmit the test packet, and an identifier of the time window.

In one possible implementation, the test message is a seamless bidirectional forwarding check (seamless bidirection forwarding detection, SBFD) message, a bidirectional active detection protocol (tow-way active measurement pootocol, TWAMP) message, or an on-path detection (in-situ information telemetry, fit) message.

In a second aspect, a path weight distribution device is provided, for executing the path weight distribution method. Specifically, the path weight allocation device includes a functional module for executing the path weight allocation method provided in the first aspect or any of the optional manners of the first aspect.

In a third aspect, there is provided a network device comprising a processor and a memory having stored therein at least one piece of program code that is loaded and executed by the processor to carry out the operations as performed by the method provided in the first aspect or various alternative implementations of the first aspect.

In a fourth aspect, a computer readable storage medium is provided, in which at least one program code is stored, which is loaded and executed by a processor to implement the operations performed by the path weight allocation method described above.

In a fifth aspect, a computer program product or computer program is provided, the computer program product or computer program comprising a program code stored in a computer readable storage medium, the program code being read from the computer readable storage medium by a processor of a network device, the program code being executed by the processor, causing the computer device to perform the method provided in the above-mentioned first aspect or in various alternative implementations of the first aspect.

In a sixth aspect, there is provided a system comprising the path weight allocation apparatus of the second aspect or any of the alternatives of the second aspect, or a network device of the third aspect or any of the alternatives of the third aspect.

The solutions provided in the second aspect to the fifth aspect may be used to implement the path weight allocation method provided in the first aspect or any optional manner of the first aspect, so that the same beneficial effects as those achieved in the first aspect or any optional manner of the first aspect may be achieved, which is not described herein.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

Fig. 1 is a schematic diagram of a network scenario provided in an embodiment of the present application;

fig. 2 is a flowchart of a path weight allocation method provided in an embodiment of the present application;

FIG. 3 is a schematic diagram of a package format of a test packet according to an embodiment of the present application;

fig. 4 is a schematic structural diagram of a path weight distribution device according to an embodiment of the present application;

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

Detailed Description

For the purpose of making the objects, technical solutions and advantages of the present application more apparent, the embodiments of the present application will be described in further detail below with reference to the accompanying drawings.

Fig. 1 is a schematic diagram of a network scenario provided in an embodiment of the present application, and referring to fig. 1, the network 100 includes a plurality of forwarding nodes 101. The plurality of forwarding nodes 101 may be divided into an ingress node 1011, an intermediate node (internode) 1012, and an egress node 1013 according to the location or function in the network 100.

The ingress node 1011 is an edge device of the network 100 and is connected to a Customer Edge (CE) device, and the ingress node 1011 is configured to receive a data stream from a customer side and send the received data stream to the egress node 1013 through a forwarding path in the network 100, where the egress node 1013 forwards the data stream received from the forwarding path to another customer side to output the data stream to the network 100. Wherein one forwarding path includes a plurality of forwarding nodes 101, and the ingress node 1011 is the first forwarding node of the forwarding path, that is, the source node; the egress node 1013 is the last forwarding node of the forwarding path, i.e. the tail node; the other nodes on the forwarding path than the ingress node 1011 and the egress node 1013 are intermediate nodes 1012, the intermediate nodes 1012 being used to forward data streams to the other forwarding nodes 101.

For example, the ingress node 1011 and the egress node 1013 are Provider Edge (PE) devices, in fig. 1, PE1 and PE2 are ingress nodes 1011, each connected to CE1, PE3 and PE4 are egress nodes 1013, each connected to CE2, PE1 receives a data stream sent by CE1, and transmits the received data stream to PE3 through a forwarding path between PE1 and PE3, and PE3 forwards the received data stream to CE2, thereby implementing forwarding of the data stream output by CE1 to CE2.

The ingress node 1011 is further configured to, before forwarding the data flow, obtain an SR Policy (e.g. SR-MPLS TE Policy) of a service corresponding to the data flow, and then determine a candidate path with the highest priority indicated by the SR Policy as a main candidate path for forwarding the data flow, where the ingress node 1011 is further configured to use the weight of each sub-path in the main candidate path to indicate the load sharing state of the sub-path. The data stream is split and transmitted on each sub-path in the main candidate path, so that each sub-path can share the load, and the data streams transmitted on each sub-path are converged at the egress node 1103 and forwarded out of the network 100 by the egress node 1103. For example, the primary candidate path includes 2 sub-paths 1 and 2, sub-path 1 having a weight of 0.3 and sub-path 2 having a weight of 0.7, ingress node 1011 transmits 30% of the received data stream to egress node 1013 via sub-path 1, and ingress node 1011 transmits 70% of the received data stream to egress node 1013 via sub-path 2.

The ingress node 1011 is further configured to obtain, after obtaining the SR Policy, a transmission characteristic of each sub-path in each candidate path indicated by the SR Policy, and update a weight of each sub-path according to the transmission characteristic of each sub-path, thereby avoiding the control node updating the weight of each sub-path in the SR Policy, and reducing the computation overhead of the control node.

In one possible implementation, when the ingress node 1011 updates the weight of each sub-path according to the transmission characteristics of each sub-path in a candidate path, the ingress node 1011 sets the weight of the sub-path to 0 for sub-paths in the candidate path for which the transmission characteristics do not satisfy the SLA, on the condition of the SLA of the traffic, so as to avoid subsequent transmission of the data stream of the traffic on the sub-path. For the target sub-paths with transmission characteristics satisfying the SLA in the candidate path, the ingress node 1011 updates the weights of the target sub-paths according to the transmission characteristics of the target sub-paths, and if the candidate path is a main candidate path, the ingress node 1011 can ensure that the transmission characteristics of the data stream satisfy the SLA and can also ensure that the data stream is transmitted on each target sub-path in an optimal split manner when the ingress node 1011 transmits the data stream on each target sub-path of the main candidate path.

In one possible implementation, the ingress node 1011 only updates the weights of the sub-paths in the primary candidate path indicated by SR Policy, and does not update the weights of the sub-paths in the backup path indicated by SR Policy, and when the transmission characteristics of each sub-path in the primary candidate path do not meet the SLA, the ingress node 1011 requests the control node to re-issue SR Policy.

In one possible implementation, the ingress node 1011 can update the priority of each candidate path based on the weight of each sub-path in each candidate path in addition to updating the weight of each sub-path in each candidate path indicated by SR Policy to re-determine a new primary candidate path.

For example, the candidate forwarding paths and the sub-paths of the candidate forwarding paths in the embodiments of the present application are forwarding paths formed by a plurality of forwarding nodes. When there is no bifurcation node in the candidate forwarding paths, the candidate forwarding paths are one forwarding path, or, in other words, one candidate forwarding path in SR Policy corresponds to only one segment list (segment list), and one forwarding path indicated by the segment list is the candidate forwarding path. When a bifurcation node exists in the candidate forwarding paths, the candidate forwarding paths are mesh forwarding paths formed by a plurality of sub-paths, each sub-path is a branch of the mesh forwarding paths, each branch takes an inlet node as a first forwarding node of each branch, and takes an outlet node as a last forwarding node of each branch. The forking node is a forwarding node having a connection relationship with at least two forwarding nodes in the candidate forwarding paths, for example, an exit node is connected with 2 intermediate nodes in the candidate forwarding paths, the exit node is a forking node, and for example, 1 intermediate node in the candidate forwarding paths is connected with other 3 intermediate nodes in the candidate forwarding paths, and then the 1 intermediate nodes are forking nodes. Or, one candidate forwarding path in the SR Policy corresponds to at least two segment lists, where one forwarding path indicated by each segment list in the at least two segment lists is a sub-path of the candidate forwarding path, and a mesh forwarding path formed by at least two sub-paths indicated by the at least two segment lists is the candidate forwarding path.

In order to further embody the process of updating the weights of the sub-paths in the candidate forwarding paths by the egress node, refer to a flowchart of a path weight distribution method provided in the embodiment of the present application as shown in fig. 2.

201. The egress node obtains the SR Policy of the target service.

The target service is any service served by the forwarding network, such as a video service, a game service, etc. The SR Policy is used for indicating m candidate forwarding paths for forwarding the data flow of the target service, where m is an integer greater than or equal to 1. Alternatively, the SR Policy is applied to a segment route (segment routing using Ipv6 data plane, SRv 6) using an Internet protocol version 6 (Internet protocol version, IPv 6) data plane, or to a segment route (segment routing using Ipv4 data plane, SRv 4) using an Internet protocol version 4 data plane.

The SR Policy includes a candidate identification (candidate identity, candidate ID) of each of the m candidate forwarding paths, a fourth target weight of each candidate forwarding path, and segment list information of each candidate forwarding path. The fourth target weight of one candidate forwarding path is used for indicating the priority of the candidate forwarding path in the m candidate forwarding paths, the candidate forwarding path with the fourth target weight being the main candidate path of the target service, namely the candidate forwarding path with the highest priority, and forwarding paths of the m candidate forwarding paths except the main candidate path are all candidate paths of the target service. The segment list information of one candidate forwarding path includes segment list identifications of k segment lists, where k is an integer greater than or equal to 1, and fifth target weights of the k segment lists. A segment list identification of a segment list is used for the segment list, the segment list being used to indicate a forwarding path, optionally the segment list comprising address information of a plurality of forwarding nodes on the forwarding path, such as internet protocol (internet protocol, IP) addresses. The fifth target weight of the segment list, that is, the weight of the forwarding path indicated by the segment list, is used to represent the load sharing status of the forwarding path. When the segment list information of a candidate forwarding path includes a segment list identifier of a segment list, a forwarding path indicated by the segment list in the segment list information is the candidate forwarding path; when the segment list information of the candidate forwarding path includes segment list identifiers of a plurality of segment lists, the forwarding path indicated by each segment list in the segment list information is a sub-path of the candidate forwarding path.

In one possible implementation, the ingress node obtains the SR Policy from the control node.

In another possible implementation, the ingress node does not need to obtain the SR Policy from the control node, but the ingress node directly generates the SR Policy. Optionally, the ingress node determines an egress node in the forwarding network for forwarding the data flow to the destination device according to the location information of the destination device of the target service, the ingress node assigns a fourth target weight to at least one candidate forwarding path between the ingress node and the egress node in the forwarding network, so as to indicate the priority of each candidate forwarding path, assigns a fifth target weight to each sub-path of each candidate forwarding path, and generates the SR Policy based on the fourth target weight of each candidate forwarding path and the fifth target weight of each sub-path in each candidate forwarding path.

The target device is a user side device for receiving the data stream of the target service forwarded by the forwarding network, and optionally, the target device is a user edge device connected with the egress node or a terminal device connected with the user edge device.

202. The ingress node determines a first forwarding path to be tested based on the SR Policy.

The ingress node determines any sub-path within any one of the m candidate forwarding paths indicated by the SR Policy as the first forwarding path.

203. The entry node obtains a transmission characteristic of the first forwarding path, where the transmission characteristic of the first forwarding path is used to indicate a transmission characteristic of the first forwarding path when transmitting the SR-based packet.

The SR-based messages are messages transmitted by adopting a segment routing mode, such as SRv messages and SRv messages. The transmission characteristics include index values of N transmission indexes, where N is an integer greater than or equal to 1, and any one transmission index is used to characterize a transmission performance index. Optionally, the transmission characteristic is an indicator value associated with a drive test event or an indicator value associated with an SLA, such as at least one of a transmission delay, a delay jitter value, and a packet loss rate.

The ingress node detects a transmission characteristic of the first forwarding path based on a test message, wherein the test message is a seamless bidirectional forwarding check (seamless bidirection forwarding detection, SBFD) message, a bidirectional active detection protocol (tow-way active measurement pootocol, TWAMP) message, or an associated detection (in-situ information telemetry, fit) message.

In one possible implementation, the process shown in this step 203 is implemented by at least one of the following steps 2031-2033.

Step 2031, determining, by the ingress node, a duration of transmitting a test message to the egress node via the first forwarding path as the transmission delay when the transmission characteristic includes the transmission delay.

Before executing step 2031, the ingress node obtains a duration of transmission of the test packet to the egress node through the first forwarding path. The process of the ingress node obtaining the duration of the test message transmitted to the egress node through the first forwarding path includes the following steps a-E.

And step A, the entry node generates a test message.

The test message includes at least one of a segment list identifier of the first forwarding path, a candidate identifier of the first forwarding path, a sending time (send time) of the test message, and an identifier of a time window to which the sending time belongs. The candidate identifier of the first forwarding path is a candidate identifier corresponding to the segment list identifier in the SR Policy, that is, a candidate identifier of a candidate forwarding path to which the first forwarding path belongs. The sending time of the test message is the time of the entry node sending the test message. In some embodiments, the ingress node tests the transmission characteristics of the first forwarding path in real time during a plurality of test periods, each test period being a time window, and the ingress node sends a plurality of test messages to the egress node through the first forwarding path during the time window of each test period to test the transmission characteristics of the first forwarding path in real time through the plurality of test messages.

When the test message is an SBFD message or a TWAMP message, for any message in the SBFD message and the TWAMP message, the entry node adds the segment list identifier of the first forwarding path, the candidate identifier of the first forwarding path, the sending time of the test message and the identifier of the time window to which the sending time belongs in the extension field of the any message to obtain the test message.

The extension field includes a stain (station) identification field, a candidate identification field, a segment list identification field, and a transmission time field. The dyeing identification field is used for storing the identification of the time window to which the sending time belongs, the candidate identification field is used for storing the candidate identification of the first forwarding path, the segment list identification field is used for storing the segment list identification of the first forwarding path, and the sending time field is used for storing the sending time of the test message. In some embodiments, the test packet further includes at least one of a received time (received time) field and a reserved field, where the received time field is used to store a received time when the entry node receives the test packet, and the reserved field is a reserved field, so that information can be added according to the application scenario requirement. The other fields except the extension field in any message are all existing fields of the any message, for example, an encapsulation format schematic of a test message provided in the embodiment of the present application shown in fig. 3, where the test message in fig. 3 is an SBFD message, and the existing fields of the SBFD message include a version (version, vers) field, a diagnostic field (diagnostic) field, a state (state) field, a poll (P) field, a final (F) field, a forwarding/control separation (control plane independent, C) field, an authentication identifier (authentication present, a) field, a demand (D) field, a multipoint (M) field, a detection timeout (detect) field, a length (length) field, a local identifier (my identifier) field, a far-end identifier (your discriminator) field, a minimum transmission extension interval (desired minimum transmit extended specification interval, desired min TX interval) field (minimum transmission interval (minimum echo interval required) required min Echo RX interval), a minimum transmission interval required (minimum echo interval required) required min Echo RX interval) and a minimum reception interval required (minimum echo interval required (required min Echo RX interval). Wherein, the Vers field is used for storing the SBFD protocol version number; the Diag field is used for storing a diagnosis word to indicate the reason for the last session state transmission change of the local SBFD system; the P field is used for storing a P mark, when the parameter transmission changes, the sender sets the P mark in the SBFD message, and the receiver has to respond to the SBFD message; the F field is used for storing an F mark, and whether a response message responding to setting of the P mark is determined by the setting state of the F mark; the C field is used for storing a C mark, once the C mark is set to be 1, the service state change of the control plane does not influence SBFD detection; the A field is used for storing an authentication identifier to indicate whether the session needs authentication or not; the D field is used to store a D flag to indicate whether the system wishes to operate in query mode; the M field is a reserved bit set for SBFD to support multipoint expansion in future; the detection timeout times stored in the detection timeout times field are used for the detection party to calculate detection timeout time; the length field is used for storing the length of the SBFD message; the local identifier field is used for storing the SBFD session connection local identifier, and transmitting a unique non-0 authentication value generated by the system for distinguishing a plurality of SBFD sessions of the system; the remote identifier field is used for storing an SBFD session connection remote identifier; the minimum sending interval field is used for storing the minimum SBFD message sending interval supported locally, and the unit is millisecond; the required minimum receiving interval field is used for storing the minimum SBFD message receiving interval supported locally, and the unit is millisecond; the required minimum echo message receiving interval field is used for storing the minimum echo message receiving interval supported locally, and the unit is millisecond.

When the test message is an iFIT message and the first forwarding path belongs to a main candidate path, after the entry node receives the data stream of the target service, in a time window, the entry node adds an iFIT header to any service message of the data stream, and adds a segment list identifier of the first forwarding path, a candidate identifier of the first forwarding path, the sending time of the test message and an identifier of the time window to which the sending time belongs to the iFIT header, so as to obtain the test message.

For example, since the SBFD message and the TWAMP message have no relation with the data flow of the target service, the ingress node can test the transmission characteristics of the first forwarding path in real time based on the test message whose message type is the SBFD message or the TWAMP message. For example, before receiving the data stream, the ingress node tests the transmission characteristics of the first forwarding path in real time based on a test message with a message type of SBFD message or TWAMP message, and for example, the ingress node tests the transmission characteristics of the first forwarding path in real time based on a test message with a message type of SBFD message or TWAMP message in the process of forwarding the data stream. The test message with the message type of iFIT message is generated based on the service message in the data stream, so the test message must be sent with the data stream, and the entry node only transmits the data stream on the main candidate path, so when the entry node takes the service message with the iFIT header as the test message, the main candidate path can only be tested in the process of forwarding the data stream.

And B, the inlet node sends the test message to the outlet node through the first forwarding path.

The ingress node determining a next hop node for the ingress node on the first forwarding path based on the segment list indicated by the segment list identification of the first forwarding path; at the sending time of the test message, the entry node sends the test message to the next hop node; for any intermediate node on the first forwarding path, after the any intermediate node receives the test message from the last hop node, the test message is sent to the next hop node of the any intermediate node on the first forwarding path based on the segment list indicated by the segment list identifier in the test message.

And step C, the exit node receives the test message.

The egress node receives the test message from a node on the first forwarding path that is the last hop of the egress node.

And D, the outlet node sends a response message of the test message to the inlet node.

The response message comprises a segment list identifier of the first forwarding path, a candidate identifier of the first forwarding path, a sending time of the test message, an identifier of a time window to which the sending time belongs and a receiving time of the test message, wherein the receiving time of the test message is the time of the exit node to receive the test message.

The exit node obtains the segment list identifier of the first forwarding path, the candidate identifier of the first forwarding path, the sending time of the test message, and the identifier of the time window to which the sending time belongs from the test message, and encapsulates the receiving time, the obtained segment list identifier of the first forwarding path, the candidate identifier of the first forwarding path, the sending time of the test message, and the identifier of the time window to which the sending time belongs into a response message.

In some embodiments, if the test packet is an SBFD packet and a TWAMP packet, the egress node adds the receiving time in a receiving time field of the test packet to obtain the response packet.

After the exit node acquires the response message, the exit node sends the response message to the entrance node. In one possible implementation, the egress node outputs the response message to the ingress node through the first forwarding path. In another possible implementation manner, a control signal channel exists between the exit node and the entry node, the exit node transmits the response message to the entry node through the control signal channel, and the control signal channel is used for transmitting a control signal between the entry node and the exit node, wherein the response message is one of the control signals.

And E, after receiving the response message, the inlet node obtains the difference between the receiving time of the test message and the sending time of the test message in the response message as the time length of the test message transmitted to the outlet node through the first forwarding path.

When the time length is acquired, the entry node uses the time length as the transmission delay of the first forwarding path at the current time. The transmission Delay is shown in the following formula, where t1 is the sending time of the test message, and t2 is the receiving time of the test message.

Delay＝t2-t1

If the ingress node sends multiple test messages to the egress node through the first forwarding path, this step 2031 is executed every time the ingress node receives a response message, so that the ingress node can obtain the transmission delays of the first forwarding path at different times, and therefore, the ingress node can test the transmission delays of the first forwarding path in real time through the test messages.

Step 2032, when the transmission characteristic includes a transmission jitter value, the entry node obtains the transmission jitter value based on the transmission delays determined by two adjacent test messages.

The two adjacent test messages are test messages corresponding to any two adjacent response messages received by the entry node, or are two adjacent effective test messages, and whether one test message is effective depends on whether the entry node can receive the response message of the test message. If the ingress node is able to receive the response message of the test message, the test message is a valid test message, and if the ingress node is not able to receive the response message of the test message, the test message may be lost in the transmission process, and the test message is an invalid test message.

For example, the ingress node sequentially sends a test message 1, a test message 2 and a test message 3 to the egress node through the first forwarding path, and if the ingress node receives a response message 1 of the test message 1, a response message 2 of the test message 2 and a response message 3 of the test message 3, the test messages 1-3 are valid test messages, wherein the test message 1 and the test message 2 are two adjacent test messages, and the test message 2 and the test message 3 are two adjacent test messages; if the ingress node receives the response message 1 and the response message 3 and does not receive the response message 2, the test message 2 is an invalid test message, and the test message 1 and the test message 3 are two adjacent test messages.

The ingress node performs the above step 2031 on both the two adjacent test packets, so that the ingress node can obtain two transmission delays determined based on the two adjacent test packets, and the ingress node determines an absolute value of a difference between the two transmission delays as a delay jitter value of the first forwarding path at the current time. The Delay Jitter value Jitter is shown in the following formula, where Delay1 is a transmission Delay determined based on a first test message of the two adjacent test messages, and Delay2 is a transmission Delay determined based on a second test message of the two adjacent test messages.

Jitter＝|Delay2-Delay1|

Step 2033, when the transmission characteristic includes a packet loss rate, the ingress node determines the packet loss rate based on a target sending number and a target receiving number, where the target sending number is a total number of the test packets sent by the ingress node to the egress node through the first forwarding path in a time window, and the target receiving number is a total number of the test packets sent by the ingress node received by the egress node through the first forwarding path in the time window.

And in the time window, the inlet node sends a plurality of test messages to the outlet node through the first forwarding path, each test message carries the identifier of the time window, and the inlet node counts the total number of the plurality of test messages to obtain the target sending number.

And each time the exit node receives a test message, returning a response message of the test message to the entrance node, wherein the response message carries the identification of a time window to which the sending time of the test message belongs, and the entrance node counts the total number of the response messages carrying the identification of the time window to obtain the target receiving number.

After the target sending number and the target receiving number are obtained, the inlet node determines the difference between the target sending number and the target receiving number as a target lost number, wherein the target lost number is the total number of the test messages lost by the first forwarding path when the plurality of test messages are transmitted; the ingress node determines a ratio between the target number of losses and the target number of transmissions as the loss rate of the first forwarding path over the time window. The Loss rate Loss is shown in the following formula, where S1 is the target transmission number and S2 is the target reception number.

Loss＝(S1-S2)/S1

In some embodiments, if the transmission characteristics include loss rates, the ingress node performs this step 2033 within each time window, so that the ingress node can obtain the loss rate of the first forwarding path within each time window. In other embodiments, if the transmission characteristics do not include loss rate, the ingress node does not perform this step 2033 and neither the test message nor the response message need to carry an identification of the time window.

204. The entry node assigns a first target weight to the first forwarding path based on a transmission characteristic of the first forwarding path, the first target weight of the forwarding path being used to represent a load sharing state of the first forwarding path.

The transmission characteristics of the first forwarding path include index values of N transmission indexes, for example, the N transmission indexes include at least one of a delay index, a delay jitter index, and a packet loss index, the transmission delay is an index value of the delay index, the delay jitter value is an index value of the delay jitter index, and the packet loss rate is an index value of the packet loss index. The embodiments of the present application are described by taking transmission characteristics including transmission delay, delay jitter values, and packet loss rate as examples.

In some embodiments, the entry node assigns a weight to each transmission indicator, and then assigns a first target weight to the first forwarding path based on the weight corresponding to each transmission indicator. In one possible implementation, this step 204 is implemented by the process shown in steps 2041-2042 described below.

Step 2041, the entry node allocates an ith weight to an ith transmission index of the N transmission indexes based on the SLA of the target service, where the ith weight of the ith transmission index is used to represent the importance degree of the ith transmission index on the target service, and i is an integer greater than or equal to 1 and less than or equal to N.

The i weight of the i transmission index is the weight corresponding to the i transmission index. The SLAs of the target service have different priorities required for different transmission indexes, and the priority of one transmission index is used for indicating the priority condition that the SLA requires the forwarding path to meet the transmission index. The forwarding path firstly meets the requirements of the SLA on the transmission index with high priority, and then meets the requirements of the SLA on the transmission index with low priority.

The entry node assigns different weights to each of the N transmission indexes based on the priorities of the N transmission indexes specified by the SLA, wherein a trend of the N transmission indexes is the same as a trend of the N transmission indexes, for example, if the N transmission indexes have a gradually increasing trend, and if the N transmission indexes have a gradually decreasing trend, the N transmission indexes have a gradually decreasing trend.

For another example, the delay index is at a first priority, the delay jitter index is at a second priority, and the packet loss index is at a third priority, where the first priority is higher than the second priority, and the second priority is higher than the third priority, and weights allocated to the delay index, the delay jitter index, and the packet loss index by the ingress node are respectively 0.6, 0.3, and 0.1.

Step 2042, the entry node obtains a first target weight of the first forwarding path based on the weight corresponding to each of the N transmission indexes and the index value of each transmission index.

For the ith transmission index of the N transmission indexes, the entry node obtains an ith weight corresponding to an index value of the ith transmission index in the transmission characteristic, where the ith weight corresponding to the index value of the ith transmission index of the first forwarding path is used to represent the quality of the first forwarding path under the jth transmission index, where i is an integer greater than or equal to 1 and less than or equal to N.

The ways in which the entry node acquires the ith weight corresponding to the index value of the ith transmission index in the transmission characteristic include the following ways 1 and 2.

In mode 1, the entry node determines a weight corresponding to an index section to which the index value of the i-th transmission index of the first transmission path belongs as an i-th weight corresponding to the index value of the i-th transmission index.

The entry node sets a plurality of index intervals for the ith transmission index, each index interval including a plurality of index values, each index interval corresponding to a weight, respectively. The index value in any index interval is in inverse relation with the corresponding weight, that is, the larger the index value in any index interval is, the smaller the corresponding weight is, and otherwise, the larger the corresponding weight is. For example, the ith transmission index is a delay index, and the multiple index intervals under the delay index include a delay index interval 1[0, 20ms, a delay index interval 2 (20 ms,1000 us), and a delay index interval 3 (1000 ms, infinity), wherein the weight corresponding to the delay index interval 1 is 0.5, the weight corresponding to the delay index interval 2 is 0.2, and the weight corresponding to the delay index interval 3 is 0.3.

In one possible implementation manner, the entry node sets an index threshold for the ith transmission index, and if the minimum index value in any index interval under the ith transmission index is greater than the index threshold, the entry node sets a weight corresponding to the any index interval to 0.

Optionally, the index threshold of the ith transmission index is specified by the SLA. Optionally, the index threshold of the ith transmission index may be different in different actual network environments, and in this embodiment of the present application, the index threshold set by the ingress node for the ith transmission index is not specifically limited.

Mode 2, regarding an index value of an i-th transmission index in the transmission characteristics, the entry node determines a ratio of an index threshold of the i-th transmission index to the index value as an i-th weight corresponding to the index value.

After the entry node obtains the weights corresponding to the index values of each transmission index in the transmission characteristics of the first forwarding path, the entry node inputs the weights corresponding to the index values of each transmission index in the N transmission indexes and the weights corresponding to each transmission index into the following formula to calculate the first target weight W of the first forwarding path _x Wherein w is _i The weight w is the i weight corresponding to the i transmission index in the N transmission indexes _0，i And the i weight corresponding to the index value of the i transmission index in the transmission characteristics of the first forwarding path is obtained.

In some embodiments, the entry node does not need to determine the first target weight of the first forwarding path based on the weight corresponding to each transmission metric, but determines the first target weight of the first forwarding path directly based on the size of each metric value in the transmission profile. In one possible implementation, this step 204 is implemented by the process shown in steps 204A-204B described below.

Step 204A, for an ith transmission index of the N transmission indexes, assigning an ith weight to an index value of the ith transmission index of the first forwarding path, where the ith weight of the index value of the ith transmission index is used to represent a quality degree of the first forwarding path relative to k forwarding paths under the ith transmission index, i is an integer greater than or equal to 1 and less than or equal to N, and k is an integer greater than or equal to 1.

The i weight of the index value of the i transmission index is the weight corresponding to the index value of the i transmission index of the first forwarding path. The k forwarding paths are sub-paths among candidate forwarding paths to which the first forwarding path belongs, and the first forwarding path is any one of the k forwarding paths, and the candidate forwarding path to which the first forwarding path belongs is denoted as a "first candidate forwarding path" for convenience of description.

And for the ith transmission index in the N transmission indexes, the entry node sorts the index values of the ith transmission index in the transmission characteristics of the k forwarding paths to obtain an index value sequence corresponding to the ith transmission index. In one possible implementation manner, the entry node orders the index values of the ith transmission index in the transmission characteristics of the k forwarding paths in order from small to large, where the smaller the index value of the ith transmission index is, the better the performance of the ith transmission index is in the forwarding path.

After obtaining the index value sequence, the entry node assigns an ith weight to the index value of the ith transmission index of the first forwarding path based on the index value sequence. In one possible implementation manner, the entry node obtains the ith weight of the index value of the ith transmission index of the first forwarding path based on the ordering of the index value of the ith transmission index of the first forwarding path in the index value sequence, wherein the smaller the index value of the ith transmission index is, the greater the ith weight allocated to the forwarding path is, and conversely, the smaller the ith weight allocated is.

Optionally, the ith weight w of the index value of the ith transmission index of the first forwarding path _1，i Comprises any one of the following forms, wherein R is the order of the first forwarding path in the index value sequence, and a and b are integers greater than or equal to 1.

w _1，i ＝N-R，w _1，i ＝a*(N-R)，w _1，i =n-r+b or w _1，i ＝a*(N-R)+b

Step 204B, the entry node determines a first target weight of the first forwarding path based on the weights of the index values of the first forwarding path for each of the N transmission indexes.

The entry node determines a sum of weights of index values of the first forwarding path among each of the N transmission indexes as a first target weight of the first forwarding path.

In some embodiments, the entry node determines the first target weight of the first forwarding path based on the weight corresponding to each of the N transmission metrics, the weight of the index value of each of the transmission metrics of the first forwarding path. Optionally, the entry node inputs the weight corresponding to each transmission index of the N transmission indexes and the weight of the index value of each transmission index of the N transmission indexes of the first forwarding path into the following formula, and calculates the first target weight W of the first forwarding path _x Wherein w is _1，i The i weight of the index value of the i-th transmission index of the first forwarding path.

After the entry node obtains the first target weight of the first forwarding path through this step 204, the entry node updates the fifth target weight of the first forwarding path in the SR Policy to the first target weight of the first forwarding path.

The ingress node may assign a first target weight to each sub-path of each candidate forwarding path indicated by the SR Policy according to the procedure described in steps 201-204 above, and update the fifth target weight of each sub-path in the SR Policy to the first target weight assigned to each sub-path.

205. If the first candidate forwarding path to which the first forwarding path belongs is the main candidate path of the data stream, the entry node sends the data stream to the exit node through k forwarding paths based on the first target weights of the k forwarding paths in the first candidate forwarding path.

After the ingress node receives the data stream, for a first forwarding path of the k forwarding paths, the ingress node sends data of a first target weight ratio of the first forwarding path in the data stream to the egress node through the first forwarding path. For example, if the first target weight of the first forwarding path is 0.3, the ingress node transmits 30% of the data in the data stream to the egress node through the first forwarding path.

In some embodiments, after acquiring the transmission characteristics of the first forwarding path, the ingress node determines whether the first forwarding path meets the SLA based on the transmission characteristics of the first forwarding path and the SLA of the target traffic. Optionally, if at least one index value in the transmission characteristics of the first forwarding path meets the index threshold specified by the SLA, the ingress node determines that the first forwarding path meets the SLA, otherwise, the ingress node determines that the first forwarding path does not meet the SLA. For example, if the transmission delay of the first forwarding path is less than or equal to the index threshold of the delay index specified by the SLA, the first forwarding path satisfies the SLA.

If the first forwarding path meets the SLA, the portal node assigns a first target weight to the first forwarding path based on the transmission characteristics of the first forwarding path. If the first forwarding path does not meet the SLA, the ingress node sets a first target weight of the first forwarding path to 0, so as to avoid forwarding the data stream of the target service by using the first forwarding path.

The process shown in steps 203-204 above assigns a weight to each sub-path in each candidate path for the ingress node. In some embodiments, the ingress node is further capable of assigning a third target weight to the m candidate forwarding paths indicated by SR Policy, wherein the third target weight of one candidate forwarding path is used to represent a priority of the candidate forwarding path among the m candidate forwarding paths.

In a possible implementation manner, for the first candidate forwarding path to which the first forwarding path belongs, the ingress node assigns a third target weight to the first candidate forwarding path according to the procedure shown in the above steps 203-204.

In another possible implementation, the ingress node assigns a third target weight to the first candidate forwarding path through a process shown in steps a-B below.

And step A, for the ith transmission index in the N transmission indexes, the entry node allocates a second target weight under the ith transmission index for the first forwarding path based on the index value of the ith transmission index of the first forwarding path, wherein the second target weight of the first forwarding path under the ith transmission index is used for representing the quality degree of the first forwarding path relative to each forwarding path in m candidate paths under the ith transmission index.

The entry node sorts index values of the ith transmission index in the transmission characteristics of each forwarding path in the m candidate forwarding paths, and assigns a second target weight under the ith transmission index to each forwarding path in the m candidate forwarding paths based on the sorting result. In one possible implementation manner, for an ith transmission index of the N transmission indexes, the entry node orders, in order from small to large, index values of the ith transmission index of each forwarding path of the m candidate forwarding paths, so as to obtain a target index sequence corresponding to the ith transmission index. The entry node determines the weight corresponding to the index value of the ith transmission index of the first forwarding path according to the sequence of the index values of the ith transmission index of the first forwarding path in the target index sequence, wherein the weight corresponding to the index value which is smaller in the target index sequence is larger, and the weight corresponding to the index value which is larger in the target index sequence is smaller. The entry node determines a weight corresponding to an index value of an ith transmission index of the first forwarding path as a second target weight of the first forwarding path under the ith transmission index.

And B, the entry node determines a third target weight of the first candidate forwarding path based on a second target weight of the first forwarding path relative to the m candidate paths under each of N transmission indexes, wherein the third target weight is used for indicating the priority of the first candidate forwarding path in the m candidate forwarding paths.

In a possible implementation manner, the ingress node inputs the weight corresponding to each transmission index of the N transmission indexes and the second target weight of the first forwarding path under each transmission index of the N transmission indexes relative to the m candidate paths into the following formula, and calculates to obtain the third target weight W of the first candidate forwarding path _y . Wherein the w is _2，s，i And (3) for the second target weight of the s-th forwarding path in the first candidate forwarding paths under the ith transmission characteristic, wherein s is an integer which is more than or equal to 1 and less than or equal to m.

In some embodiments, the ingress node assigns a third target weight to the first candidate forwarding path based on the number of forwarding paths in the first candidate forwarding path that satisfy the SLA. In one possible implementation manner, the entry node is provided with a plurality of target number intervals, each target number interval includes a plurality of target numbers, and the plurality of target number intervals respectively correspond to a weight, wherein the greater the target number in the plurality of target number intervals is, the greater the weight corresponding to the target number interval is, and conversely, the smaller the corresponding weight is. The ingress node determines a weight corresponding to a target number interval to which the number of forwarding paths satisfying the SLA belongs in the first candidate path as a third target weight of the first candidate forwarding path. For example, the weight corresponding to the target number interval 1[1,3] is 0.4, the weight corresponding to the target number interval 2[4,7] is 0.6, and if the number of forwarding paths satisfying the SLA in the first candidate forwarding path is 6, the ingress node uses the weight of 0.6 as the third target weight of the first candidate forwarding path.

For example, after the ingress node determines the third target weight of the first candidate forwarding path, the ingress node updates the fourth target weight of the first candidate forwarding path in the SR Policy to the third target weight of the first candidate forwarding path. The entry node may assign a third target weight to each candidate forwarding path indicated by the SR Policy in a manner of assigning the third target weight to the first candidate forwarding path, and update a fourth target weight of each candidate forwarding path in the SR Policy to be the third target weight assigned by the fourth target weight. When the entry node receives the data stream of the target service, determining a candidate forwarding path with the largest third target weight in the updated SR Policy as a main candidate path of the data stream, if the first candidate node is the main candidate path, the entry node sends the data stream to the exit node through m forwarding paths based on the first target weights of the m forwarding paths in the first candidate path.

According to the method provided by the embodiment of the application, the weight is distributed to each forwarding path through the entry node, and the control node is not required to distribute the weight to each forwarding path, so that the calculation cost of the control node is saved. And, based on the SLA of the target service, the weight is allocated to each forwarding path, so that the subsequent entry node preferentially adopts the forwarding path meeting the SLA to transmit the data flow. And, the entry node determines the first target weight of each forwarding path based on the weight corresponding to each transmission index in the M transmission indexes and the weight corresponding to each forwarding path under each transmission index, so that the allocated first target weight of each forwarding path is more reasonable. And, the ingress node can obtain the transmission characteristics of each forwarding path by transmitting the test message on each forwarding path, so that the ingress node assigns weights for each forwarding path based on the transmission characteristics of each forwarding path.

The method of the embodiment of the present application is described above, and the apparatus of the embodiment of the present application is described below. The apparatus described below has any of the functions of the ingress node in the above method.

Fig. 4 is a schematic structural diagram of a path weight distribution device according to an embodiment of the present application, where the device 400 includes:

an obtaining module 401, configured to perform the step 203;

an allocation module 402, configured to perform step 204.

Optionally, the allocation module is configured to perform steps 2041-4042 described above.

Optionally, the allocation module includes:

a first allocation unit for performing the above steps 204A-404B.

Optionally, the first allocation unit is configured to: ordering index values of the ith transmission index in the transmission characteristics of the k forwarding paths to obtain an index value sequence corresponding to the ith transmission index; and obtaining the ith weight of the index value of the ith transmission index of the first forwarding path based on the ordering of the index value of the ith transmission index of the first forwarding path in the index value sequence.

Optionally, the allocation module is configured to: determining the first target weight based on the weight corresponding to each transmission index of the N transmission indexes and the weight of the index value of each transmission index of the first forwarding path; the weight corresponding to any transmission index is used for indicating the importance degree of any transmission index to a target service, the weight of the index value of any transmission index of the first forwarding path is used for indicating the quality degree of the first forwarding path relative to k forwarding paths under any transmission index, and k is an integer greater than or equal to 1.

Optionally, the allocation module includes:

a second allocation unit, configured to allocate, for an ith transmission index of the N transmission indexes, a second target weight under the ith transmission index to the first forwarding path based on an index value of the ith transmission index of the first forwarding path, where the second target weight of the first forwarding path under the ith transmission index is used to represent a degree of merit of the first forwarding path relative to each forwarding path of m candidate paths under the ith transmission index, where i is an integer greater than or equal to 1 and less than or equal to N, and m is an integer greater than or equal to 1;

a second determining unit, configured to determine a third target weight of the first candidate forwarding path based on a second target weight of the first forwarding path under each of the N transmission indexes with respect to the m candidate paths, where the third target weight is used to indicate a priority of the first candidate forwarding path among the m candidate forwarding paths.

Optionally, the apparatus further comprises:

and the determining module is used for determining that the first forwarding path meets the SLA of the target service based on the transmission characteristics of the first forwarding path.

Optionally, the obtaining module is configured to perform at least one of the steps 2031-2033.

Optionally, the apparatus 400 further comprises a sending module, configured to perform step 205 described above.

For example, the apparatus 400 corresponds to the ingress node in the above method embodiment, and each module in the apparatus 300 and the other operations and/or functions described above are respectively for implementing various steps and methods implemented by the ingress node in the method embodiment, and specific details may be referred to the above method embodiment, which are not repeated herein for brevity.

For example, when the apparatus 400 generates the weight for allocating the forwarding path, only the above-mentioned division of each functional module is used for illustration, in practical application, the above-mentioned functional allocation may be performed by different functional modules according to needs, that is, the internal structure of the apparatus 400 is divided into different functional modules to perform all or part of the above-mentioned functions. In addition, the apparatus 400 provided in the foregoing embodiment belongs to the same concept as the foregoing method embodiment, and a specific implementation process of the apparatus is detailed in the foregoing method embodiment, which is not repeated herein.

For example, the apparatus 400 may be provided at an ingress node 1011 in the network 100.

Corresponding to the method embodiment and the virtual device embodiment provided in the present application, the embodiment of the present application further provides a network device, and the following describes a hardware structure of the network device.

The network device 500 corresponds to the ingress node in the above method embodiment, and each hardware, module and other operations and/or functions in the network device 500 are respectively for implementing various steps and methods implemented by the ingress node in the method embodiment, and specific details regarding how the network device 500 allocates the weight of the forwarding path may be referred to the above method embodiment, which is not described herein for brevity. Wherein the steps of the above method embodiments are accomplished by instructions in the form of integrated logic circuits or software of hardware in the processor of the network device 500. The steps of a method disclosed in connection with the embodiments of the present application may be embodied directly in a hardware processor for execution, or in a combination of hardware and software modules in the processor for execution. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in a memory, and the processor reads the information in the memory and, in combination with its hardware, performs the steps of the above method. To avoid repetition, a detailed description is not provided herein.

The network device 500 corresponds to the apparatus 400 in the virtual apparatus embodiment described above, and each functional module in the apparatus 400 is implemented in software of the network device 500. In other words, the functional modules included in the apparatus 400 are generated after the processor of the network device 500 reads the program codes stored in the memory.

Referring to fig. 5, fig. 5 is a schematic structural diagram of a network device according to an embodiment of the present application, where the network device 500 may be configured as an ingress node.

The network device 500 comprises at least one processor 501, a communication bus 502, a memory 503, and at least one physical interface 504.

The processor 501 may be a general purpose central processing unit (central processing unit, CPU), network processor (network processor, NP), microprocessor, or may be one or more integrated circuits for implementing aspects of the present application, such as application-specific integrated circuits (ASIC), programmable logic devices (programmable logic device, PLD), or a combination thereof. The PLD may be a complex programmable logic device (complex programmable logic device, CPLD), a field-programmable gate array (field-programmable gate array, FPGA), general-purpose array logic (generic array logic, GAL), or any combination thereof.

Communication bus 502 is used to transfer information between the above-described components. The communication bus 502 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, the figures are shown with only one bold line, but not with only one bus or one type of bus.

The Memory 503 may be, but is not limited to, a read-only Memory (ROM) or other type of static storage device that can store static information and instructions, a random access Memory (random access Memory, RAM) or other type of dynamic storage device that can store information and instructions, an electrically erasable programmable read-only Memory (electrically erasable programmable read-only Memory, EEPROM), a compact disc (compact disc read-only Memory) or other optical disk storage, optical disk storage (including compact disc, laser disc, optical disc, digital versatile disc, blu-ray disc, etc.), magnetic disk storage media, or other magnetic storage device, or any other medium that can be used to carry or store the desired program code in the form of instructions or data structures and that can be accessed by a computer. The memory 503 may be stand alone and be coupled to the processor 501 via a communication bus 502. Memory 503 may also be integrated with processor 501.

The physical interface 504 uses any transceiver-like device for communicating with other devices or communication networks. Physical interface 504 includes a wired communication interface and may also include a wireless communication interface. The wired communication interface may be, for example, an ethernet interface. The ethernet interface may be an optical interface, an electrical interface, or a combination thereof. The wireless communication interface may be a wireless local area network (wireless local area networks, WLAN) interface, a cellular network communication interface, a combination thereof, or the like. Physical interface 504 is also referred to as a physical port.

In a particular implementation, as one embodiment, processor 501 may include one or more CPUs, such as CPU0 and CPU1 shown in FIG. 5.

In a particular implementation, as one embodiment, the network device 500 may include multiple processors, such as processor 501 and processor 505 shown in FIG. 5. Each of these processors may be a single-core processor (single-CPU) or a multi-core processor (multi-CPU). A processor herein may refer to one or more devices, circuits, and/or processing cores for processing data (e.g., computer program instructions).

In a specific implementation, the network device 500 may also include an output device 506 and an input device 507, as one embodiment. The output device 506 communicates with the processor 501 and may display information in a variety of ways. For example, the output device 506 may be a liquid crystal display (liquid crystal display, LCD), a light emitting diode (light emitting diode, LED) display device, a Cathode Ray Tube (CRT) display device, or a projector (projector), or the like. The input device 507 is in communication with the processor 501 and may receive user input in a variety of ways. For example, the input device 507 may be a mouse, keyboard, touch screen device, or sensing device, among others.

In some embodiments, the memory 503 is configured to store program code 510 for executing aspects of the present application, and the processor 501 may execute the program code 510 stored in the memory 503. That is, the network device 500 may implement the method provided by the method embodiments through the processor 501 and the program code 510 in the memory 503.

The network device 500 of the embodiments of the present application may correspond to the ingress node in the above-described method embodiments, and the processor 501, the physical interface 504, etc. in the network device 500 may implement the functions and/or the implemented various steps and methods of the ingress node in the above-described method embodiments. For brevity, the description is omitted here.

For example, the allocation module 402 in the apparatus 400 may correspond to the processor 501 in the network device 500; the acquisition module 401 and the transmission module in the apparatus 400 correspond to the physical interface 504 in the network device 500.

In some possible embodiments, the above-described ingress node may be implemented as a virtualized device. For example, the virtualized device may be a Virtual Machine (VM) running a program for sending message functions, the virtual machine deployed on a hardware device (e.g., a physical server). Virtual machines refer to complete computer systems that run in a completely isolated environment with complete hardware system functionality through software emulation. The virtual machine may be configured as an ingress node. For example, the ingress node may be implemented based on a generic physical server in combination with network function virtualization (network functions virtualization, NFV) technology. The ingress node is a virtual host, a virtual router, or a virtual switch. Those skilled in the art can virtually develop an ingress node with the above functions on a general physical server in combination with NFV technology by reading the present application. And will not be described in detail herein.

For example, the network devices in the various product forms have any function of the ingress node in the foregoing method embodiment, and are not described herein.

The embodiments of the present application also provide a computer program product or a computer program, which comprises computer instructions stored in a computer readable storage medium, from which a processor of a network device reads the computer instructions, and which is executed by the processor, such that the path weight allocation performs the path weight allocation method described above.

The embodiment of the application also provides a chip, which comprises a processor and an interface circuit, wherein the interface circuit is used for receiving the instruction and transmitting the instruction to the processor; and a processor, configured to perform the path weight allocation method applied to the instruction entry node. Wherein the processor is coupled to a memory for storing programs or instructions which, when executed by the processor, cause the system-on-a-chip to implement the method of any of the method embodiments described above. Alternatively, the processor in the system-on-chip may be one or more. The processor may be implemented in hardware or in software. When implemented in hardware, the processor may be a logic circuit, an integrated circuit, or the like. When implemented in software, the processor may be a general purpose processor, implemented by reading software code stored in a memory. Alternatively, the memory in the system-on-chip may be one or more. The memory may be integral with the processor or separate from the processor, and is not limited in this application. For example, the memory may be a non-transitory processor, such as a ROM, which may be integrated on the same chip as the processor, or may be separately provided on different chips, and the type of memory and the manner of providing the memory and the processor are not specifically limited in this application. For example, the system-on-chip may be a field programmable gate array (field programmable gate array, FPGA), an application specific integrated chip (application specific integrated circuit, ASIC), a system on chip (SoC), a CPU, an NP, a digital signal processing circuit (digital signal processor, DSP), a microcontroller (micro controller unit, MCU), a programmable controller (programmable logic device, PLD) or other integrated chips.

Embodiments of the present application provide a system comprising the above-described apparatus 400 or the above-described network device 500.

Any combination of the above-mentioned optional solutions may be adopted to form an optional embodiment of the present disclosure, which is not described herein in detail. It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program for instructing relevant hardware, where the program may be stored in a computer readable storage medium, and the storage medium may be a read-only memory, a magnetic disk or an optical disk, etc. The foregoing description of the preferred embodiments is merely exemplary in nature and is in no way intended to limit the invention, since it is intended that all modifications, equivalents, improvements, etc. that fall within the spirit and scope of the invention.

Claims

1. A path weight allocation method, applied to an ingress node, the method comprising:

generating a test message; when the test message is a seamless bidirectional forwarding check (SBFD) message, adding a segment list identifier of a first forwarding path, a candidate identifier of the first forwarding path, the sending time of the test message and an identifier of a time window to which the sending time belongs in an extension field of the SBFD message;

Sending the test message to an outlet node through the first forwarding path;

receiving a response message of the test message sent by the outlet node, wherein the response message comprises the receiving time of the test message received by the outlet node;

acquiring a transmission characteristic of a first forwarding path based on the test message, wherein the transmission characteristic of the first forwarding path is used for indicating the transmission characteristic of the first forwarding path when the segment-based route SR message is transmitted, and the transmission characteristic comprises at least one of transmission delay, transmission jitter value and packet loss rate;

and based on the transmission characteristics of the first forwarding path, a first target weight is allocated to the first forwarding path, wherein the first target weight is used for representing the load sharing state of the first forwarding path.

2. The method of claim 1, wherein the transmission characteristics comprise

Index value of seed transmission index, said +.>

Any one transmission index is used to characterize a transmission performance index, which is an integer greater than or equal to 1.

3. The method of claim 2, wherein the assigning a first target weight to the first forwarding path based on the transmission characteristics of the first forwarding path comprises:

Service level agreement SLA based on target business, for the

The>

Seed transmission index assignment->

Weight, the->

Seed transport indicator->

Weights are used to represent the +.>

The importance of the seed transmission index to the target service, said->

Is greater than or equal to 1 and less than or equal to->

Is an integer of (2);

based on the following

The weight corresponding to each transmission index in the transmission indexes and the index value of each transmission index are obtainedAnd a first target weight.

4. The method of claim 2, wherein the assigning a first target weight to the first forwarding path based on the transmission characteristics of the first forwarding path comprises:

for the said

The>

A seed transmission index, which is the first +.>

Index value allocation of seed transmission index +.>

Weight, the->

Index value of seed transmission index +.>

Weights are used to represent the values at said +.>

The first forwarding path is opposite to +.>

The degree of preference of the individual forwarding paths, said +.>

Is 1 or more and 1 or less

Integer of>

Is an integer of 1 or more;

based on the first forwarding path

And determining the first target weight according to the weight of the index value of each transmission index.

5. The method of claim 4, wherein the first forwarding path is

Index value allocation of seed transmission index +.>

The weight comprises:

for the said

Said +.>

Sorting index values of the seed transmission index to obtain the first index value

A sequence of index values corresponding to the seed transmission index;

the first forwarding path

Ordering of index values of the seed transmission index in said index value sequence, obtaining the +.>

Index value of seed transmission index +.>

And (5) weighting.

6. The method of claim 2, wherein the assigning a first target weight to the first forwarding path based on the transmission characteristics of the first forwarding path comprises:

based on the following

Determining the first target weight by the weight corresponding to each transmission index in the transmission indexes and the weight of the index value of each transmission index of the first forwarding path;

wherein the weight corresponding to any transmission index is used for representing the importance degree of the any transmission index to the target service, and the weight of the index value of the any transmission index of the first forwarding path is used for representing the relative position of the first forwarding path under any transmission index

The degree of preference of the individual forwarding paths, said +.>

Is an integer of 1 or more.

7. The method according to any of claims 2-6, wherein the first forwarding path belongs to a first candidate forwarding path; the method further comprises the steps of:

for the said

The>

A seed transmission indicator based on said +.>

An index value of a seed transmission index allocated to the first forwarding path at the +.>

A second target weight under the transmission index, the first forwarding path being at the +.>

A second target weight under the transmission index is used for representing that the first forwarding path is at the second forwarding path

Relative to->

The degree of preference of each forwarding path in the candidate paths, said +.>

Is greater than or equal to 1 and less than or equal to->

Integer of>

Is an integer of 1 or more;

based on the first forwarding path relative to the first forwarding path

The candidate paths are at the->

Determining a third target weight of the first candidate forwarding path based on a second target weight of each of the transmission indexes, the third target weight being used to indicate that the first candidate forwarding path is at the ∈>

Priority in the candidate forwarding paths.

8. The method according to any of claims 1-6, wherein before assigning the first target weight to the first forwarding path based on the transmission characteristics of the first forwarding path, the method further comprises:

9. The method according to any of claims 1-6, wherein the acquiring transmission characteristics of the first forwarding path comprises at least one of:

when the transmission characteristics comprise packet loss rate, determining the packet loss rate based on a target sending number and a target receiving number, wherein the target sending number is the total number of the test messages sent by an inlet node to the outlet node through the first forwarding path in a time window, and the target receiving number is the total number of the test messages sent by the inlet node received by the outlet node through the first forwarding path in the time window.

10. The method of claim 9, wherein the test message comprises at least one of a segment list identification of the first forwarding path, a candidate identification of the first forwarding path, a transmission time at which the ingress node transmits the test message, and an identification of the time window.

11. A path weight allocation apparatus, the apparatus comprising:

the acquisition module is used for generating a test message; when the test message is a seamless bidirectional forwarding check (SBFD) message, adding a segment list identifier of a first forwarding path, a candidate identifier of the first forwarding path, the sending time of the test message and an identifier of a time window to which the sending time belongs in an extension field of the SBFD message; sending the test message to an outlet node through the first forwarding path; receiving a response message of the test message sent by the outlet node, wherein the response message comprises the receiving time of the test message received by the outlet node; acquiring a transmission characteristic of a first forwarding path based on the test message, wherein the transmission characteristic of the first forwarding path is used for indicating the transmission characteristic of the first forwarding path when the segment-based route SR message is transmitted, and the transmission characteristic comprises at least one of transmission delay, transmission jitter value and packet loss rate;

And the allocation module is used for allocating a first target weight for the first forwarding path based on the transmission characteristics of the first forwarding path, wherein the first target weight is used for representing the load sharing state of the first forwarding path.

12. The apparatus of claim 11, wherein the transmission characteristics comprise

Index value of seed transmission index, said +.>

13. The apparatus of claim 12, wherein the allocation module is to:

service level agreement SLA based on target business, for the

The>

Seed transmission index assignment->

Weight, the->

Seed transport indicator->

Weights are used to represent the +.>

The importance of the seed transmission index to the target service, said->

Is greater than or equal to 1 and less than or equal to->

Is an integer of (2);

based on the following

And obtaining the first target weight by the weight corresponding to each transmission index in the transmission indexes and the index value of each transmission index.

14. The apparatus of claim 12, wherein the allocation module comprises:

A first distribution unit for the

The>

A seed transmission index, which is the first +.>

Index value allocation of seed transmission index +.>

Weight, the->

Index value of seed transmission index +.>

Weights are used to represent the values at said +.>

The first forwarding path is opposite to +.>

The degree of preference of the individual forwarding paths, said +.>

Is greater than or equal to 1 and less than or equal to->

Integer of>

Is an integer of 1 or more;

a first determining unit for determining the first forwarding path based on the first forwarding path

15. The apparatus of claim 14, wherein the first allocation unit is configured to:

for the said

Said +.>

A sequence of index values corresponding to the seed transmission index;

the first forwarding path

Index value of seed transmission index +.>

And (5) weighting.

16. The apparatus of claim 12, wherein the allocation module is to:

Based on the following

wherein the weight corresponding to any transmission index is used for representing the importance degree of the any transmission index to the target service, and the weight of the index value of the any transmission index of the first forwarding path is used for representing the index value of the any transmission indexThe following first forwarding path is relative to

The degree of preference of the individual forwarding paths, said +.>

Is an integer of 1 or more.

17. The apparatus of any of claims 12-16, wherein the allocation module comprises:

a second distributing unit for the

The>

A seed transmission indicator based on said +.>

A second target weight under the transmission index is used to indicate that the first forwarding path is at the +.>

Relative to- >

Is greater than or equal to 1 and less than or equal to->

Integer of>

Is an integer of 1 or more;

a second determining unit for determining the relative position of the first forwarding path

The candidate paths are at the->

Priority in the candidate forwarding paths.

18. The apparatus according to any one of claims 11-16, wherein the apparatus further comprises:

19. The apparatus of any of claims 11-16, wherein the acquisition module is configured to perform at least one of:

When the transmission characteristics comprise packet loss rate, determining the packet loss rate based on a target sending number and a target receiving number, wherein the target sending number is the total number of the test messages sent to the outlet node by the inlet node through the first forwarding path in a time window, and the target receiving number is the total number of the test messages sent by the inlet node through the forwarding path in the time window, which are received by the outlet node.

20. The apparatus of claim 19, wherein the test message comprises at least one of a segment list identification of the first forwarding path, a candidate identification of the first forwarding path, a transmission time at which the ingress node transmits the test message, and an identification of the time window.