WO2023071359A1 - BGP-intent路由的接收方法和BGP-intent路由的通告方法 - Google Patents

BGP-intent路由的接收方法和BGP-intent路由的通告方法 Download PDF

Info

Publication number
WO2023071359A1
WO2023071359A1 PCT/CN2022/109512 CN2022109512W WO2023071359A1 WO 2023071359 A1 WO2023071359 A1 WO 2023071359A1 CN 2022109512 W CN2022109512 W CN 2022109512W WO 2023071359 A1 WO2023071359 A1 WO 2023071359A1
Authority
WO
WIPO (PCT)
Prior art keywords
metric
bgp
intent
credit
route
Prior art date
Application number
PCT/CN2022/109512
Other languages
English (en)
French (fr)
Inventor
彭少富
谭斌
刘爱华
熊泉
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2023071359A1 publication Critical patent/WO2023071359A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks

Definitions

  • the present disclosure relates to the field of data communication, in particular, to a method for receiving a BGP-intent route and a method for notifying a BGP-intent route.
  • Border Gateway Protocol In a large-scale network spanning multiple domains, the Border Gateway Protocol (BGP) is generally used to provide an end-to-end intent-aware path.
  • a lower-level transmission path is selected according to the clear intention at the time of one hop, which means that the BGP route needs to carry the intention information when it is advertised. Since the lower-level transmission path is a traffic engineering path (Traffic Engineering neering Path) established based on a specific intent, in a network that provides transmission services, the intent can also be called a traffic engineering target.
  • Traffic Engineering neering Path Traffic Engineering neering Path
  • draft-kaliraj-idr-bgp-classful-transport-planes-12 defines "Classful Transport” SAFI NLRI and "Transport Class” Route Target extended community to To carry intent information
  • draft-dskc-bess-bgp-car-02 defines BGPCAR SAFI NL RI to carry intent information
  • draft-zhou-idr-inter-domain-lcu-02 directly uses Color extended community to carry intent information.
  • BGP routes refers to such BGP routes as BGP-intent routes.
  • the node that receives the BGP-intent routing notification message will interpret the intent locally according to the intent configuration information (also called intent-template) to establish a transmission path or select an existing one that matches the intent of the message advertiser. transmission path.
  • intent configuration information also called intent-template
  • the intention configuration information contains a set of constraints, such as the link bandwidth size that needs to be provided in the path, the minimum and maximum delays, the delay jitter, the packet loss rate, and the inclusion or exclusion of specific nodes. Or link, limit the calculation path in a specific virtual network, and so on.
  • the BGP-intent route to the EgressPE that can match the service requirements will be selected according to the service SLA (Service Level Agreement), that is, the Ingress PE node.
  • the intent configuration information is generally consistent with the business SLA, but this does not mean that the intent configuration information on the intermediate node should also be consistent with the business SLA. For example, to observe the forwarding behavior of a BGP route across multiple domains, the service SLA that needs to be satisfied is "provide a path with a delay limit of 100ms from the Ingress PE to the Egress PE".
  • the delay of 100ms refers to the end-to-end
  • the upper limit of cumulative delay does not refer to the cumulative delay of a certain path in the middle of BGP route forwarding. Transmission path of the next BGP speaker.
  • a cumbersome configuration method is to include different delay indicators (or called delay credits) in the intent-template configured on different BGP speakers in the path.
  • this static configuration method has obvious defects, because an intent-template is not necessarily bound to a specific end-to-end path, and may serve multiple paths.
  • the embodiment of the present disclosure provides a method for receiving BGP-intent routes and a method for notifying BGP-intent routes, so as to solve at least the content carried in BGP-intent routes in the related art and make the establishment of transmission paths of BGP-intent routes more efficient lower question.
  • a method for receiving a BGP-intent route including: receiving a BGP-intent route notified by a BGP speaker, wherein the BGP-intent route carries at least one of the following: metric type, Measure, measure credit information.
  • a method for advertising a BGP-intent route including: advertising the BGP-intent route to a neighbor BGPspeaker, wherein the BGP-intent route carries at least one of the following: metric type , measure, measure credit information.
  • a device for receiving a BGP-intent route including: a receiving module configured to receive a BGP-intent route notified by a BGP speaker, wherein the BGP-intent route carries at least the following One of: Metric Type, Metric, Metric Credit Information.
  • a BGP-intent route notification device including: a notification module configured to notify a neighbor BGPspeaker of a BGP-intent route, wherein the BGP-intent route carries at least the following One of: Metric Type, Metric, Metric Credit Information.
  • a computer-readable storage medium where a computer program is stored in the computer-readable storage medium, wherein the computer program is configured to perform any of the above-mentioned items when running.
  • an electronic device including a memory, a processor, and a computer program stored in the memory and operable on the processor, wherein the processor executes the above-mentioned tasks through the computer program. one method.
  • the BGP-intent route carries at least one of the following: metric type, metric, and metric credit information
  • the establishment of the transmission path of the route in the related art is solved
  • the problem of low efficiency improves the establishment efficiency of the transmission path.
  • Fig. 1 is the block diagram of the hardware structure of the computer terminal of the receiving method of the BGP-intent route of the embodiment of the present disclosure
  • FIG. 2 is a flowchart of a method for receiving a BGP-intent route according to an embodiment of the disclosure
  • Fig. 3 is a flowchart of a method for advertising a BGP-intent route according to an embodiment of the present disclosure
  • FIG. 4 is a schematic diagram of a metric-credit attribute format according to an embodiment of the present disclosure
  • Fig. 5 is a schematic diagram of transmission paths with different intentions between the same source and the same destination according to an embodiment of the present disclosure
  • FIG. 6 is a schematic diagram of transmission paths of the same intent between multiple pairs of sources and sinks according to an embodiment of the present disclosure
  • FIG. 7 is a structural block diagram of a device for receiving a BGP-intent route according to an embodiment of the present disclosure
  • Fig. 8 is a structural block diagram of a device for advertising BGP-intent routes according to an embodiment of the present disclosure.
  • FIG. 1 is a block diagram of a hardware structure of a computer terminal according to a method for receiving a BGP-intent route according to an embodiment of the present disclosure.
  • the computer terminal can include one or more (only one is shown in Figure 1) processor 102 (processor 102 can include but not limited to microprocessor (Microprocessor Unit, MPU for short) or programmable logic device (Programmable logic device, referred to as PLD)) and a memory 104 configured to store data, in an exemplary embodiment, the above-mentioned computer terminal may also include a transmission device 106 and an input/output device 108 configured as a communication function.
  • MPU Microprocessor Unit
  • PLD programmable logic device
  • the above-mentioned computer terminal may also include a transmission device 106 and an input/output device 108 configured as a communication function.
  • the structure shown in FIG. 1 is only for illustration, and it does not limit the structure of the above computer terminal.
  • the computer terminal may also include more or less components than those shown in FIG. 1 , or have a different configuration with functions equivalent to those shown in FIG. 1 or more functions than those shown in FIG. 1 .
  • the memory 104 can be set to store computer programs, for example, software programs and modules of application software, such as the computer program corresponding to the BGP-intent route receiving method in the embodiment of the present disclosure, and the processor 102 runs the computer program stored in the memory 104 program, so as to execute various functional applications and data processing, that is, to realize the above-mentioned method.
  • the memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory.
  • the memory 104 may further include a memory that is remotely located relative to the processor 102, and these remote memories may be connected to a computer terminal through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
  • Transmission device 106 is configured to receive or transmit data via a network.
  • the specific example of the above-mentioned network may include a wireless network provided by the communication provider of the computer terminal.
  • the transmission device 106 includes a network interface controller (NIC for short), which can be connected to other network devices through a base station so as to communicate with the Internet.
  • the transmission device 106 may be a radio frequency (Radio Frequency, RF for short) module, which is configured to communicate with the Internet in a wireless manner.
  • RF Radio Frequency
  • Fig. 2 is the flow chart of the receiving method of BGP-intent route according to the embodiment of the present disclosure, as shown in Fig. 2, the steps of this method include:
  • Step S202 receiving a BGP-intent route notified by a BGP speaker, wherein the BGP-intent route carries at least one of the following: metric type, metric, and metric credit information.
  • the BGP-intent route carries at least one of the following: metric type, metric, and metric credit information, which solves the problem in the BGP-intent route in the related art
  • the content carried makes the establishment of the transmission path of the BGP-intent route less efficient.
  • the efficiency of the establishment of the transmission path is further improved.
  • the metric type includes: IGP metric, link delay metric, link and node delay metric, TE default metric, bandwidth metric;
  • the metric credit information includes: metric total credit, Estimated BGP hop count and metric credit fragments; the metric credit information only includes one piece of information, which has nothing to do with a specific source; or the metric credit information includes multiple pieces of information, and the multiple pieces of information are related to multiple specific sources one by one correspond.
  • link delay metric may include link delay, but is not limited thereto.
  • link and node delay metrics may include both link delay and node delay, but is not limited thereto.
  • the specific steps include: obtaining the intent identifier from the BGP-intent route, and according to the intent Identify the local lookup intent template to obtain intent information; establish or select an existing transmission path for the BGP-intent route according to the intent information.
  • a technical solution for establishing or selecting an existing transmission path for the BGP-intent route according to the intent information including: according to the metric included in the BGP-intent route , metric total credit, estimated BGP hop count, and metric credit segment determine the metric credit segment reference value of the transmission path between the current BGP speaker and the downstream neighbor BGP speaker of the current BGP speaker; limit the establishment or selection of an existing The cumulative metric of the metric type of the transmission path is less than or equal to the reference value of the metric credit segment, so as to establish or select an existing transmission path.
  • Corresponding metric credit attribute divide the total metric credit by the estimated BGP hop count to obtain the average metric credit between two adjacent BGP Speakers in the end-to-end path; subtract the total metric credit from the BGP-intent route Included metrics, get the remaining metrics.
  • the method also includes: the average metric credit and residual metric calculated for all sources: the metric credit fragment reference value of the transmission path from this BGP speaker to the downstream neighbor BGP speaker includes: all source calculations The resulting average metric credit with the smallest positive value in the remaining metric.
  • a technical solution is provided, and the specific steps include: in the case that the BGP-intent route also includes an explicit metric credit fragment, for each Source corresponding metric credit information: According to the position number of this BGP Speaker in the end-to-end path, obtain the measurement credit segment corresponding to the BGP Speaker from the BGP-intent route; subtract the measurement included in the BGP-intent route with the measurement total credit , to get the residual measure.
  • the method further includes: the metric credit segment and the remaining metric calculated for all sources: the metric credit segment reference value of the transmission path from the BGP speaker to the downstream neighbor BGP speaker includes: all source calculations The resulting metric credit fragment and the smallest positive value in the remaining metric.
  • the current BGP Speaker finds that there is no transmission path to the downstream BGP Speaker that can satisfy the reference value of the metric credit segment, select a metric type with the highest cumulative metric value among all candidate transmission paths.
  • the path to the reference value for the near metric credit fragment in the embodiment of the present disclosure, in the case that there is no eligible transmission path for this BGP Speaker, the condition can be relaxed to increase the margin, and then select a cumulative metric of the metric type closest to the metric credit segment reference in all candidate transmission paths value path.
  • the transmission path from the present BGP Speaker to the downstream BGP Speaker includes at least one of the following: the shortest forwarding path, traffic engineering path; the transmission path includes multiple sub-paths, and load sharing is formed through the multiple sub-paths, or forming fast rerouting FRR protection, or forming a path of multi-flow duplication and elimination, wherein, when the path of multi-flow duplication and elimination is formed through the multiple sub-paths, the metric difference between the multiple sub-paths should satisfy the set set limit value.
  • Fig. 3 is the flow chart of the notification method of BGP-intent route according to the embodiment of the disclosure, as shown in Fig. 3, the steps of the method include:
  • a BGP-intent route is notified to a neighboring BGP speaker, wherein the BGP-intent route carries at least one of the following: metric type, metric, and metric credit information.
  • the BGP-intent route carries at least one of the following: metric type, metric, and metric credit information, which solves the problem in the BGP-intent route in the related art
  • the content carried makes the establishment of the transmission path of the BGP-intent route less efficient.
  • the efficiency of the establishment of the transmission path is further improved.
  • the metric type includes: IGP metric, link delay metric, link and node delay metric, TE default metric, bandwidth metric;
  • the metric credit information includes: metric total credit, Estimated BGP hop count and metric credit fragments; the metric credit information only includes one piece of information, which has nothing to do with a specific source; or the metric credit information includes multiple pieces of information, and the multiple pieces of information are related to multiple specific sources one by one correspond.
  • the metric corresponding to the metric type is the metric contained in the BGP-intent routing advertisement received from the downstream neighbor BGP speaker and the metric of the transmission path from the BGP speaker to the downstream neighbor BGP speaker The sum of the accumulated metrics corresponding to the type; or, when the BGP speaker is the original advertising node, the metric corresponding to the metric type is an initial value set.
  • Step 1 extend BGP, when a BGP speaker advertises a BGP-intent route to its upstream neighbor, it carries optional metric-type, metric, and metric credit information.
  • the metric credit information is composed of metric total credit (total-metric-credit), estimated BGP hop count, and metric-credit-piece.
  • Metric credit information can only contain one copy, which has nothing to do with a specific source (that is, a specific Ingress PE), or it can contain multiple copies, and each specific source corresponds to one copy.
  • Step 2 The BGP speaker that receives the BGP-intent routing notification obtains the intent identifier from the routing notification, searches the intent template locally to obtain the intent information, and establishes or selects an existing transmission path according to the intent information.
  • RFC4271 defines the Path Attributes of BGP, which are carried with the BGP route advertisement and represent various attributes of the route. This disclosure adds the following Attribute Type Codes and their attribute values to respectively represent the above attributes such as metric-type and metric-credit, but not limited thereto. Note: The metric attribute is the AIGP Attribute defined in RFC7311.
  • metric-type attribute metric-credit attribute
  • the metric-type attribute is an optional non-transmissible attribute, which is used to indicate what type of metric the metric contained in the AIGP Attribute is.
  • the current values are as follows:
  • IGP Metric defined in RFC5305, RFC2328, RFC5340
  • Deterministic Delay Metric (discussed in other documents, in comparison, the above-mentioned Unidirectional Link Delay only considers the link delay, and the Deterministic Delay includes both the link delay and the delay within the node);
  • the metric-credit attribute is an optional non-transferable attribute, which is used to prompt the end-to-end metric total credit, estimated BGP hop count, metric credit fragment and other information.
  • metric-credit attribute can be described with reference to FIG. 4 .
  • Fig. 4 is a schematic diagram of a metric-credit attribute format according to an embodiment of the present disclosure. The fields in Figure 4 are explained as follows:
  • Count of Sources Occupies 1 byte, and its value is at least 1, indicating the result of counting Sources, that is, how many Sources (that is, Ingress PE) correspond to the measurement credit information.
  • the metric credit information corresponding to each Source consists of "Flags", “Network Address of Source”, “Total Metric Credit for Source”, “Estimated BGP Hops Count for Source”, “Current Hop Number”, “Metric Credit Piece[]” composition.
  • Flags occupies 1 byte, flag bit. Three flags are currently defined, namely:
  • S-Flag Source Address Flag, indicating whether to include the Network Address of Source field. 0 means not included, 1 means included.
  • F-Flag Family Flag, indicating the address cluster of Network Address of Source. When the S-Flag is 1, continue to determine the length of the Network Address of Source according to the F-Flag, 0 indicates a 4-byte IPv4 address, and 1 indicates a 16-byte IPv6 address.
  • P-Flag Piece Flag, indicating whether to include specific metric credit piece information (composed of "Current Hop Number” and "Metric Credit Piece[]”), 0 means not included, 1 means included.
  • Network Address of Source The number of bytes is variable, indicating the IP address of Source. When S-Flag is 0, this field does not exist; when S-Flag is 1 and F-Flag is 0, this field is a 4-byte IPv4 address; when S-Flag is 1 and F-Flag is 1, this field The field is a 16-byte IPv6 address. If the Network Address of Source does not exist, it means that the metric credit information has nothing to do with the specific Source. This generally occurs in the scenario where it is desired to control the establishment of the transmission path based on the metric credit at a coarse granularity. For example, in a single AS, the Egress PE sends to the AS When multiple Ingress PEs advertise BGP-intent routes, they only carry a single unified measurement credit information that has nothing to do with the Source.
  • Total Metric Credit for Source 4 bytes, indicating the total metric credit from a specific Source (or any Source, when the Network Address of Source does not exist) to the Egress PE.
  • Estimated BGP Hops Count for Source Occupies 1 byte, indicating the estimated BGP hop count from a specific Source (or any Source, when the Network Address of Source does not exist) to the Egress PE, only counting those routes that receive BGP-intent When advertising, it is necessary to modify BGP Next-hop to its own BGP Speaker.
  • S-A-B-C-D composed of 5 BGP Speakers
  • D is Egress PE
  • A/B/C are three intermediate BGP Speaker nodes and they all modify BGP Next when receiving BGP-intent route notification -hop is itself, then the estimated number of BGP hops at this time is 4, that is, the entire advertisement path consists of 4 segments.
  • Metric Credit Piece[] is an array, the number of elements contained is specified by Estimated BGP Hops Count for Source, and each element occupies 2 bytes.
  • each BGP Speaker along the way will use the Current Hop Number as the subscript to access the array when modifying the BGP Next-hop of the route to itself, so as to obtain the explicit measurement credit fragment information.
  • BGP Speaker finds that the value of Current Hop Number in the received BGP-intent route advertisement message is greater than or equal to the value of Estimated BGP Hops Count for Source, then it must stop searching for transmission paths according to the measurement credit segment information.
  • step 2 may be described in conjunction with the following embodiments.
  • the metric credit attribute information contained in the BGP-intent route notification message only contains the total metric credit related to the Source, but does not include explicit metric credit fragment information, then the corresponding Metric credit information performs the following operations:
  • Operation 1 Set the variable total_metric_credit_value to the value of Total Metric Credit for Source:
  • Operation 2 Set the variable bgp_hops_count to the value of Estimated BGP Hops Count for Source;
  • Operation 3 Set the variable metric_value to the value of the metric contained in the AIGP Attribute of the received BGP-intent route;
  • BGP-intent routes may accumulate a large metric_value when advertising, resulting in a negative value for the metric_residual_value corresponding to a source, and metric_residual_value corresponding to other sources. Positive value.
  • Operation 6 Set the variable min_metric_residual_value to the smallest positive value among the metric_residual_values corresponding to all Sources;
  • Operation 7 Set the variable min_average_metric_credit_value to the minimum value of the average_metric_credit_value corresponding to all Sources;
  • the "metric credit segment reference value" of the transmission path from one BGP speaker to the downstream neighbor BGP speaker is the minimum of min_metric_residual_value and min_average_metric_credit_value.
  • the BGP-intent route notification message also includes explicit metric credit segment information
  • the following operations can be performed on the metric credit information corresponding to each Source:
  • Operation 8 Set the variable total_metric_credit_value to the value of Total Metric Credit for Source
  • Operation 9 Set the variable bgp_hops_count to the value of Estimated BGP Hops Count for Source;
  • Operation 10 Set the variable metric_value to the value of the metric contained in the AIGP Attribute of the received BGP-intent route;
  • BGP-intent routes may accumulate a large metric_value when advertising, resulting in a negative value for the metric_residual_value corresponding to a source, and metric_residual_value corresponding to other sources. Positive value.
  • Operation 12 Set the variable explicit_metric_credit_piece_value to the value of the element read from the array Metric Credit Piece[] using the subscript Current Hop Number. Note that if the reading occurs out of bounds, the explicit_metric_credit_piece_value is considered to be 0;
  • Operation 13 Set the variable min_metric_residual_value to the smallest positive value among the metric_residual_values corresponding to all Sources;
  • Operation 14 Set the variable min_explicit_metric_credit_piece_value to the smallest positive value among explicit_metric_credit_piece_values corresponding to all Sources;
  • the "metric credit piece reference value" of the transmission path from one BGP speaker to the downstream neighbor BGP speaker is the minimum of min_metric_residual_value and min_explicit_metric_credit_piece_value.
  • the purpose of the "metric credit fragment reference value" calculated in the above-mentioned embodiment is to constrain the cumulative metric (metric) of this section of the transmission path used cannot exceed the "metric credit fragment reference value", but some In some cases, if the BGP Speaker finds that there is no transmission path that can meet the above requirements, this constraint can be relaxed appropriately, but the transmission path used by the BGP Speaker in the end, compared with other candidate transmission paths, its corresponding metric type The cumulative metric (metric) of (metric-type) is the closest to the "metric credit fragment reference value".
  • the metric type (metric-type) included is copied from the received routing advertisement, and the included metric (metric) attribute value is updated to the value contained in the received routing advertisement.
  • the metric (metric) plus the cumulative metric (metric) of the corresponding metric-type (metric-type) of the transmission path used, and the included metric-credit (metric-credit) attribute is copied from the received routing advertisement (note the Current The Hop Number should be incremented by 1).
  • this BGP Speaker can continue to advertise the BGP-intent route generated above to the upstream BGP Speaker neighbors and modify the BGP Next-hop to itself. At this time, the updated metric (metric) attribute and metric credit ( metric-credit) attribute.
  • FIG. 5 is a schematic diagram of transmission paths with different intents between the same source and the same destination according to an embodiment of the present disclosure.
  • the network shown in Figure 5 includes two IGP domains (IGP domains).
  • BGP neighbors are established between PE1 and ABR, and between ABR and PE2, and BGP-intent routes are advertised.
  • Egress PE2 advertises its loopback route (recorded as loopback-PE2) to ABR through BGP, and carries the Color extended community in the route advertisement to carry intent information.
  • loopback-PE2 loopback route
  • ABR continues to notify PE1 through BGP, that is, Ingress PE1, ABR, and Egress PE2 are BGP Speakers in the preceding scheme.
  • metric-type Unidirectional Link Delay (unit is ms); total-metric: 10; metric-credit enabled.
  • metric-type Unidirectional Link Delay (unit is ms); total-metric: 100; metric-credit enabled.
  • the intent configuration information corresponding to the above two colors is also uniformly configured on other BGP Speaker nodes (ABR, Ingress PE1). It should be noted that since the intent configuration information includes the metric-credit enabled command, these other BGP Speakers will not only receive the BGP-intent route advertisement from the downstream BGP Speaker neighbors based on the total credit information included in the intent configuration information. -metric To calculate the transmission path to the downstream BGP Speaker neighbor, but also to obtain the metric credit information from the received BGP-intent routing advertisement, and establish or use the existing transmission path that meets the intent. Alternatively, the total-metric information may not be included in the intent configuration configured on these other BGP Speaker nodes.
  • the ABR knows that the "metric credit segment reference value" from this BGP Speaker (that is, the ABR) to the downstream BGP Speaker neighbor (that is, the Egress PE2) is 5ms (the total metric credit divided by 2), the ABR node will call the CSPF (Constraint Shortest Path First) calculation module to calculate an extremely low-latency path of no more than 5ms to Egress PE2, assuming it is TEpath-12 in Figure 5 , and its time delay is 4ms.
  • CSPF Constraint Shortest Path First
  • the ABR continues to advertise the BGP-intent route to the upstream BGP Speaker neighbor (Ingress PE1), where the metric-type is Unidirectional Link Delay, the metric is 4, the BGP Next-hop is changed to ABR, and the metric credit information (same as the previously received route advertisement metric credit information remains unchanged).
  • the ABR knows that the "metric credit segment reference value" from this BGP Speaker (that is, ABR) to the downstream BGP Speaker neighbor (that is, Egress PE2) is 50ms (total metric credit divided by 2) , the ABR node will call the CSPF calculation module to calculate a low-latency path to Egress PE2 that does not exceed 50ms, assuming it is TEpath-22 in Figure 5, and its delay is 40ms.
  • the ABR continues to advertise the BGP-intent route to the upstream BGP Speaker neighbor (Ingress PE1), where the metric-type is Unidirectional Link Delay, the metric is 40, the BGP Next-hop is changed to ABR, and the metric credit information (with the previously received route advertisement metric credit information remains unchanged).
  • Step 3 Ingress PE1 receives the BGP-intent route and establishes an underlying transmission path to BGP Next-hop that meets the intent:
  • Ingress PE1 knows that the "Metric Credit Fragment Reference Value" from this BGP Speaker (that is, Ingress PE1) to the downstream BGP Speaker neighbor (that is, ABR) is 5ms (total Metric credit divided by 2 is equal to 5, and the remaining metric credit is 6, whichever is smaller), then the Ingress PE1 node will call the CSPF calculation module to calculate an extremely low-latency path not exceeding 5 ms to the ABR, which is assumed to be the path in Figure 5 TE path-11 (path-11), its delay is 4ms.
  • the underlying transmission path of the BGP-intent routing entry ⁇ prefix loopback-PE2
  • Ingress PE1 knows that the "metric credit segment reference value" from this BGP Speaker (that is, Ingress PE1) to the downstream BGP Speaker neighbor (that is, ABR) is 50ms (the total metric credit is divided by 2 is equal to 50, and the remaining metric credit is 60, whichever is smaller), then the Ingress PE1 node will call the CSPF calculation module to calculate a low-latency path to the ABR that does not exceed 50ms, assuming it is TEpath-21 in Figure 5 (path- 21), the delay is 40ms.
  • each BGP Speaker can establish a differentiated transmission path based on a basis, and avoid contention for high-quality ultra-low-latency link resources.
  • the ABR knows that the "metric credit segment reference value" from this BGP Speaker (that is, the ABR) to the downstream BGP Speaker neighbor (that is, the Egress PE2) is 4ms (total metric credit divided by 2 is 5, and the element of the measurement credit segment [0] is 4, whichever is smaller), then the ABR node will call the CSPF calculation module to calculate an extremely low-latency path to Egress PE2 that does not exceed 4ms, assuming the graph TE path-12 in 5 has a delay of 4ms.
  • the ABR continues to advertise the BGP-intent route to the upstream BGP Speaker neighbor (Ingress PE1), where the metric-type is Unidirectional Link Delay, the metric is 4, the BGP Next-hop is changed to ABR, and the metric credit information (Current Hop Number is automatically increased to 1 ).
  • the ABR knows that the "metric credit segment reference value" from this BGP Speaker (that is, ABR) to the downstream BGP Speaker neighbor (that is, Egress PE2) is 40ms (dividing the total metric credit by 2 is 50, the metric credit segment [0] element is 40, take a small value), then the ABR node will call the CSPF calculation module to calculate a low-latency path that does not exceed 40ms to Egress PE2, assuming it is the TE path in Figure 5- 22, the delay is 40ms.
  • the ABR continues to advertise the BGP-intent route to the upstream BGP Speaker neighbor (Ingress PE1), where the metric-type is Unidirectional Link Delay, the metric is 40, the BGP Next-hop is changed to ABR, and the metric credit information (Current Hop Number is automatically increased to 1 ).
  • Step 3 Ingress PE1 receives the BGP-intent route and establishes an underlying transmission path to BGP Next-hop that meets the intent:
  • Ingress PE1 based on the metric credit information contained in the received routing advertisement, Ingress PE1 knows that the "Metric Credit Fragment Reference Value" from this BGPS speaker (that is, Ingress PE1) to the downstream BGP Speaker neighbor (that is, ABR) is 5ms (total metric credit divided by 2 is equal to 5, the remaining metric credit is 6, and the metric credit fragment [1] element is 6, whichever is smaller), then the Ingress PE1 node will call the CSPF calculation module to calculate a very low time limit of no more than 5ms to the ABR
  • the delay path is assumed to be TE path-11 in Figure 5, and its delay is 4ms.
  • the underlying transmission path of the BGP-intent routing entry ⁇ prefix loopback-PE2
  • Ingress PE1 According to the metric credit information contained in the received routing advertisement, Ingress PE1 knows that the "metric credit segment reference value" from this BGP Speaker (that is, Ingress PE1) to the downstream BGP Speaker neighbor (that is, ABR) is 50ms (the total metric credit is divided by 2 is equal to 50, the remaining metric credit is 60, and the metric credit segment[1] element is 60, whichever is smaller), then the Ingress PE1 node will call the CSPF calculation module to calculate a low-latency path to the ABR that does not exceed 50ms, assuming TEpath-21 in Figure 5 has a delay of 40ms.
  • Fig. 6 is a schematic diagram of transmission paths of the same intent among multiple pairs of source and sink according to an embodiment of the present disclosure.
  • ASs Autonomous System
  • BGP is established between PE1 and ASBR1, between ASBR1 and ASBR2, between ASBR1 and ASBR3, between ASBR2 and PE2, and between ASBR3 and PE3 Neighbors advertise BGP-intent routes.
  • Egress PE2 advertises its loopback route (denoted as loopback-PE2) to ASBR2 through BGP
  • Egress PE3 advertises its loopback route through BGP (denoted as Notify ASBR3 for loopback-PE3), and carry Color extended community in the routing advertisement to carry intent information.
  • ASBR2/ASBR3 continue to notify ASBR1 through BGP
  • ASBR1 continues to notify Ingress PE1 through BGP, that is, Ingress PE1, ASBR1, ASBR2, ASBR3, Egress PE2, and Egress PE3 are the aforementioned BGP Speaker in the scheme.
  • the same type of business needs to communicate between Ingress PE1 and Egress PE2, and between Ingress PE1 and Egress PE3.
  • the intention of this type of business is that the total end-to-end delay of the transmission path used is related to the distance specific value of .
  • metric-type Unidirectional Link Delay (unit is ms); total-metric: 200 (considering the actual distance is relatively short) ;metric-credit enabled.
  • metric-type Unidirectional Link Delay (unit is ms); total-metric: 300 (considering the actual distance is longer) ;metric-credit enabled.
  • the intent configuration information corresponding to the above color is also uniformly configured on other BGP Speaker nodes (ASBR1, ASBR2, ASBR3, lngress PE1), and the total-metric information may not be included.
  • the main information contained is as follows: Set BGP Next-hop is: loopback-PE2; set metric-type to: Unidirectional Link Delay; set initial metric to: 0.
  • ASBR2 continues to advertise the BGP-intent route to ASBR1, where the metric-type is Unidirectional Link Delay, the metric is 60, the BGP Next-hop is changed to ASBR2, and the metric credit information (the same as the metric credit in the previously received route advertisement) information remains unchanged).
  • metric-type is: Unidirectional Link Delay
  • BGP Next-hop is: loopback-PE3 (according to the reference value of the metric credit segment 100, the transmission path iterated to PE2 is TEpath-23); the metric is : 100 (the cumulative delay of TE path-23
  • ASBR3 continues to advertise the BGP-intent route to ASBR1, where the metric-type is Unidirectional Link Delay, the metric is 100, the BGP Next-hop is changed to ASBR3, and the metric credit information (the same as the metric credit in the previously received route advertisement) information remains unchanged).
  • metric-type is: Unidirectional Link Delay
  • BGP Next-hop is: ASBR2 (according to the reference value of metric credit segment 66, the transmission path iterated to ASBR2 is TEpath-12); metric is: 70 (Accumulated cumulative delay of TEpath-12 is 10 ms);
  • ASBR1 continues to advertise the BGP-intent route to Ingress PE1, where the metric-type is Unidirectional Link Delay, the metric is 70, the BGP Next-hop is changed to ASBR1, and the metric credit information (the same as the metric in the previously received routing advertisement) Credit information remains the same).
  • the main attributes include: metric-type: Unidirectional Link Delay; BGP Next-hop is: ASBR3 (according to the metric credit segment reference value of 100, the transmission path iterated to ASBR3 is TEpath-22); metric is: 110 (accumulated cumulative delay of TE path-22 is 10ms); metric-credit information: It remains unchanged from the information in the received routing advertisement.
  • ASBR1 continues to advertise the BGP-intent route to Ingress PE1, where the metric-type is Unidirectional Link Delay, the metric is 110, the BGP Next-hop is changed to ASBR1, and the metric credit information (the same as the metric in the previously received routing advertisement) Credit information remains the same).
  • the main attributes of the corresponding routing entry include: metric-type: Unidirectional Link Delay; BGP Next-hop: ASBR1 (according to the metric credit segment reference value 66, the transmission path iterated to ASBR2 is TE path-11); metric It is: 130 (the accumulated delay of TE path-11 is 60ms); metric-credit information: remains unchanged from the information in the received routing advertisement.
  • the main attributes include: metric-type: Unidirectional Link Delay; BGP Next-hop is: ASBR1 (according to the metric credit segment reference value of 100, the transmission path iterated to ASBR1 is TE path-21); metric is: 210 (the accumulated delay of TE path-22 is 100ms); metric-credit Information: remains unchanged from the information in the received routing advertisement.
  • Fig. 7 is a structural block diagram of a device for receiving a BGP-intent route according to an embodiment of the present disclosure. As shown in Figure 7, the receiving device of BGP-intent route includes:
  • the receiving module 702 is configured to receive the BGP-intent route notified by the BGP speaker, wherein the BGP-intent route carries at least one of the following: metric type, metric, and metric credit information.
  • the BGP-intent route carries at least one of the following: metric type, metric, and metric credit information, which solves the problem of BGP-intent routing in the related art
  • the content carried makes the establishment of the transmission path of the BGP-intent route less efficient.
  • the efficiency of the establishment of the transmission path is further improved.
  • the metric type includes: IGP metric, link delay metric, link and node delay metric, TE default metric, bandwidth metric;
  • the metric credit information includes: metric total credit, estimated BGP hop count, and A metric credit fragment;
  • the metric credit information includes only one piece of information, which has nothing to do with a specific source; or the metric credit information includes multiple pieces of information, and the multiple pieces of information are in one-to-one correspondence with multiple specific sources.
  • link delay metric may include link delay, but is not limited thereto.
  • link and node delay metrics may include both link delay and node delay, but is not limited thereto.
  • the receiving device of the BGP-intent route also includes: an acquisition module configured to obtain an intent identifier from the BGP-intent route, and search an intent template locally according to the intent identifier to obtain intent information; according to the intent
  • the message establishes or selects an existing transmission path for the BGP-intent route.
  • the acquisition module is also configured to determine the current BGP speaker and the downstream neighbor BGP speaker of the current BGP speaker according to the metric included in the BGP-intent route, the metric total credit, the estimated BGP hop count, and the metric credit segment.
  • the reference value of the metric credit segment of the transmission path between; the cumulative metric of the metric type defining the establishment or selection of the existing transmission path is less than or equal to the reference value of the metric credit segment, so as to establish or select the existing transmission path.
  • the receiving device of the BGP-intent route also includes: a first metric obtaining module, configured to include only the total metric credit related to the source in the metric credit information contained in the BGP-intent route, but not the explicit metric credit information.
  • a first metric obtaining module configured to include only the total metric credit related to the source in the metric credit information contained in the BGP-intent route, but not the explicit metric credit information.
  • the metric credit segment of the formula for the metric credit attribute corresponding to each source: divide the total metric credit by the estimated BGP hop count to obtain the average metric credit between two adjacent BGP Speakers in the end-to-end path; The metric included in the BGP-intent route is subtracted from the metric total credit to obtain the remaining metric.
  • the first metric obtaining module is also set to the average metric credit and residual metric calculated for all sources: the metric credit fragment reference value of the transmission path from the BGP speaker to the downstream neighbor BGP speaker includes: the average metric credit calculated by all sources The smallest positive value in the metric credit and remaining metric.
  • the receiving device of the BGP-intent route also includes: a second metric obtaining module, configured to, in the case that the BGP-intent route also includes an explicit metric credit segment, for each Source corresponding metric credit information : According to the position number of the BGP Speaker in the end-to-end path, obtain the measurement credit segment corresponding to the BGP Speaker from the BGP-intent route; subtract the total credit of the measurement from the BGP-intent route included in the metric to get the remaining metric.
  • a second metric obtaining module configured to, in the case that the BGP-intent route also includes an explicit metric credit segment, for each Source corresponding metric credit information : According to the position number of the BGP Speaker in the end-to-end path, obtain the measurement credit segment corresponding to the BGP Speaker from the BGP-intent route; subtract the total credit of the measurement from the BGP-intent route included in the metric to get the remaining metric.
  • the second metric obtaining module is also set to the metric credit fragments and remaining metrics calculated for all sources: the metric credit fragment reference value of the transmission path from the BGP speaker to the downstream neighbor BGP speaker includes: the metric credits calculated by all sources Smallest positive value in fragment and remaining metric.
  • the acquisition module is also set to, when the BGP Speaker finds that there is no transmission path to the downstream BGP Speaker that can satisfy the reference value of the metric credit segment, select a metric type with the highest cumulative metric in all candidate transmission paths The path to the reference value for the near metric credit fragment.
  • the transmission path from the present BGP Speaker to the downstream BGP Speaker includes at least one of the following: the shortest forwarding path, traffic engineering path; the transmission path includes multiple sub-paths, through which multiple sub-paths To form load sharing, or to form fast rerouting FRR protection, or to form a path of multi-flow duplication and elimination, wherein, when the path of multi-flow duplication and elimination is formed through the multiple sub-paths, the distance between the multiple sub-paths The difference in measure should satisfy the set limit value.
  • Fig. 8 is a structural block diagram of a device for advertising BGP-intent routes according to an embodiment of the present disclosure.
  • the notification device of BGP-intent route includes:
  • the notification module 802 is configured to notify a neighbor BGP speaker of a BGP-intent route, wherein the BGP-intent route carries at least one of the following: metric type, metric, and metric credit information.
  • the BGP-intent routes carry at least one of the following: metric type, metric, and metric credit information, which solves the BGP-intent problem in the related art
  • the content carried in the route makes the establishment of the transmission path of the BGP-intent route less efficient.
  • the efficiency of the establishment of the transmission path is further improved.
  • the metric type includes: IGP metric, link delay metric, link and node delay metric, TE default metric, bandwidth metric;
  • the metric credit information includes: metric total credit, Estimated BGP hop count and metric credit fragments; the metric credit information only includes one piece of information, which has nothing to do with a specific source; or the metric credit information includes multiple pieces of information, and the multiple pieces of information are related to multiple specific sources one by one correspond.
  • the metric corresponding to the metric type is the metric contained in the BGP-intent routing advertisement received from the downstream neighbor BGP speaker and the metric type of the transmission path from the BGP speaker to the downstream neighbor BGP speaker The sum of the corresponding accumulated metrics; or, when the BGP speaker is the original advertising node, the metric corresponding to the metric type is a set initial value.
  • the above-mentioned computer-readable storage medium may include but not limited to: U disk, read-only memory (Read-Only Memory, referred to as ROM), random access memory (Random Access Memory, referred to as RAM) , mobile hard disk, magnetic disk or optical disk and other media that can store computer programs.
  • ROM read-only memory
  • RAM random access memory
  • mobile hard disk magnetic disk or optical disk and other media that can store computer programs.
  • Embodiments of the present disclosure also provide an electronic device, including a memory and a processor, where a computer program is stored in the memory, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.
  • the above-mentioned processor may be configured to execute the following steps through a computer program:
  • the above-mentioned processor may also be configured to execute the following steps through a computer program:
  • the electronic device may further include a transmission device and an input and output device, wherein the transmission device is connected to the processor, and the input and output device is connected to the processor.
  • each module or each step of the above-mentioned disclosure can be realized by a general-purpose computing device, and they can be concentrated on a single computing device, or distributed in a network composed of multiple computing devices
  • they can be realized by program code executable by a computing device, thus, they can be stored in a storage device to be executed by a computing device, and in some cases, they can be executed in an order different from that shown here.
  • the described steps are realized by making them into respective integrated circuit modules, or making multiple modules or steps among them into a single integrated circuit module. As such, the present disclosure is not limited to any specific combination of hardware and software.

Abstract

本公开实施例提供了一种BGP-intent路由的接收方法和BGP-intent路由的通告方法，其中，BGP-intent路由的接收方法包括：接收BGP speaker通告的BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。

Description

BGP-intent路由的接收方法和BGP-intent路由的通告方法
本公开要求于2021年10月25日提交中国专利局、申请号为202111243804.0、发明名称“BGP-intent路由的接收方法和BGP-intent路由的通告方法”的中国专利申请的优先权，其全部内容通过引用结合在本公开中。
技术领域
本公开涉及数据通信领域，具体而言，涉及一种BGP-intent路由的接收方法和BGP-intent路由的通告方法。
背景技术
在大规模的跨多个域的网络中，一般采用边界网关协议(Border Gateway Protocol，简称为BGP)提供端到端的感知意图(intent)的路径，所谓感知意图的路径是指BGP路由在迭代下一跳时根据明确的意图去选择更底层的传输路径，这意味着BGP路由在通告时需要携带意图信息。由于更底层的传输路径是基于特定意图去建立的流量工程路径(Traffic Engi neering Path)，所以在提供传输服务的网络中，意图也可被称为流量工程目标。当前有多种方法使得BGP路由通告时携带意图，比如，draft-kaliraj-idr-bgp-classful-transport-p lanes-12定义了″Classful Transport″SAFI NLRI和″Transport Class″Route Target ex tended community以携带意图信息，draft-dskc-bess-bgp-car-02定义了BGPCAR SAFI NL RI以携带意图信息，以及draft-zhou-idr-inter-domain-lcu-02直接使用Color extended community以携带意图信息。本文将这样的BGP路由统称为BGP-intent路由。
一般情况下，收到BGP-intent路由通告消息的节点，会在本地根据意图配置信息(也称为intent-template)去解读意图，以建立传输路径或选择已有的至消息通告方的符合意图的传输路径。意图配置信息中包含了一系列约束条件的集合，如路径中需要提供的链路带宽大小、限定的最小和最大时延、限定的时延抖动、限定的丢包率、包含或排除特定的节点或链路、限定在特定的虚拟网络中计算路径等等。在网络中的Ingress PE节点(即，负责业务接入的节点)上，将根据业务的SLA(Service Level Agreement)去选择能匹配业务需求的至EgressPE的BGP-intent路由，即Ingress PE节点上的意图配置信息一般与业务SLA是一致的，但这并不意味着中间节点上的意图配置信息也要与业务SLA一致。比如，观察一条跨多个域的BGP路由转发行为，需满足业务的SLA为“提供一条从Ingress PE至Egress PE的时延上限为100ms的路径”，显然，时延100ms指的是端到端的累计时延上限，并不是指BGP路由转发时的中间某一段路径的累计时延，也就是说，处于路径中间的各BGP speaker并不能也按照时延100ms为指标去建立或选择已有的至下一个BGP speaker的传输路径。关于如何解决这个问题，一种配置繁琐的方法是在路径中的不同BGP speaker上配置的intent-template中包含不同的时延指标(或称为时延信用)。然而这种静态配置的方式存在明显的缺陷，因为某个intent-template并不一定与特定的端到端路径绑定，可能服务于多个路径。
针对相关技术中，BGP-intent路由中携带的内容使得BGP-intent路由的传输路径的建立效率较低的问题，目前尚未提出有效的解决方案。
因此，有必要对相关技术予以改良以克服相关技术中的缺陷。
发明内容
本公开实施例提供了一种BGP-intent路由的接收方法和BGP-intent路由的通告方法，以至少解决相关技术中的BGP-intent路由中携带的内容使得BGP-intent路由的传输路径的建立效率较低的问题。
根据本公开实施例的一方面，提供了一种BGP-intent路由的接收方法，包括：接收BGPspeaker通告的BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。
根据本公开实施例的又一方面，提供了一种BGP-intent路由的通告方法，包括：向邻居BGPspeaker通告BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。
根据本公开实施例的又一方面，提供了一种BGP-intent路由的接收装置，包括：接收模块，设置为接收BGPspeaker通告的BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。
根据本公开实施例的又一方面，提供了一种BGP-intent路由的通告装置，包括：通告模块，设置为向邻居BGPspeaker通告BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。
根据本公开实施例的又一方面，还提供了一种计算机可读的存储介质，该计算机可读的存储介质中存储有计算机程序，其中，该计算机程序被设置为运行时执行上述任一项的方法。
根据本公开实施例的又一方面，还提供了一种电子装置，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，上述处理器通过计算机程序执行上述任一项的方法。
通过本公开，通过接收BGPspeaker通告的BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息，解决了相关技术中的路由的传输路径的建立效率较低的问题，提高了传输路径的建立效率。
附图说明
此处所说明的附图用来提供对本公开的进一步理解，构成本公开的一部分，本公开的示例性实施例及其说明用于解释本公开，并不构成对本公开的不当限定。在附图中：
图1是本公开实施例的BGP-intent路由的接收方法的计算机终端的硬件结构框图；
图2是根据本公开实施例的BGP-intent路由的接收方法的流程图；
图3是根据本公开实施例的BGP-intent路由的通告方法的流程图；
图4是根据本公开实施例的metric-credit attribute格式的示意图；
图5是根据本公开实施例的同源同宿间不同意图的传输路径的示意图；
图6是根据本公开实施例的多对源宿间的相同意图的传输路径的示意图；
图7是根据本公开实施例的BGP-intent路由的接收装置的结构框图；
图8是根据本公开实施例的BGP-intent路由的通告装置的结构框图。
具体实施方式
为了使本技术领域的人员更好地理解本公开方案，下面将结合本公开实施例中的附图，对本公开实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本公开一部分的实施例，而不是全部的实施例。基于本公开中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都应当属于本公开保护的范围。
需要说明的是，本公开的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。应该理解这样使用的数据在适当情况下可以互换，以便这里描述的本公开的实施例能够以除了在这里图示或描述的那些以外的顺序实施。此外，术语“包括”和“具有”以及他们的任何变形，意图在于覆盖不排他的包含，例如，包含了一系列步骤或单元的过程、方法、系统、产品或设备不必限于清楚地列出的那些步骤或单元，而是可包括没有清楚地列出的或对于这些过程、方法、产品或设备固有的其它步骤或单元。
本公开实施例中所提供的方法实施例可以在计算机终端或者类似的运算装置中执行。以运行在计算机终端上为例，图1是本公开实施例的BGP-intent路由的接收方法的计算机终端的硬件结构框图。如图1所示，计算机终端可以包括一个或多个(图1中仅示出一个)处理器102(处理器102可以包括但不限于微处理器(Microprocessor Unit，简称是MPU)或可编程逻辑器件(Programmable logic device，简称是PLD))和设置为存储数据的存储器104，在一个示例性实施例中，上述计算机终端还可以包括设置为通信功能的传输设备106以及输入输出设备108。本领域普通技术人员可以理解，图1所示的结构仅为示意，其并不对上述计算机终端的结构造成限定。例如，计算机终端还可包括比图1中所示更多或者更少的组件，或者具有与图1所示等同功能或比图1所示功能更多的不同的配置。
存储器104可设置为存储计算机程序，例如，应用软件的软件程序以及模块，如本公开实施例中的BGP-intent路由的接收方法对应的计算机程序，处理器102通过运行存储在存储器104内的计算机程序，从而执行各种功能应用以及数据处理，即实现上述的方法。存储器104可包括高速随机存储器，还可包括非易失性存储器，如一个或者多个磁性存储装置、闪存、或者其他非易失性固态存储器。在一些实例中，存储器104可进一步包括相对于处理器102远程设置的存储器，这些远程存储器可以通过网络连接至计算机终端。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
传输设备106设置为经由一个网络接收或者发送数据。上述的网络具体实例可包括计算机终端的通信供应商提供的无线网络。在一个实例中，传输设备106包括一个网络适配器(Network Interface Controller，简称为NIC)，其可通过基站与其他网络设备相连从而可与互联网进行通讯。在一个实例中，传输设备106可以为射频(Radio Frequency，简称为RF)模块，其设置为通过无线方式与互联网进行通讯。
图2是根据本公开实施例的BGP-intent路由的接收方法的流程图，如图2所示，该方法的步骤包括：
步骤S202，接收BGP speaker通告的BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。
通过上述步骤，通过接收BGP speaker通告的BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息，解决了相关技术中的BGP-intent路由中携带的内容使得BGP-intent路由的传输路径的建立效率较低的问题，通过在BGP-intent路由中携带度量类型、度量、度量信用信息，进一步提高了传输路径的建立效率。
进一步地，在一个实施例中，所述度量类型包括：IGP度量、链路时延度量、链路与节点时延度量、TE默认度量、带宽度量；所述度量信用信息包括：度量总信用、预估BGP跳数以及度量信用片段；所述度量信用信息只包含一份信息，与特定源无关；或所述度量信用信息包含多份信息，且所述多份信息与多个特定源一一对应。
需要说明的是，上述链路时延度量可以包括链路的时延，但不限于此。
需要说明的是，上述链路与节点时延度量可以同时包括链路的时延与节点内的时延，但不限于此。
进一步地，在一个实施例中，在接收BGP speaker通告的BGP-intent路由之后，还提供了一种技术方案，具体步骤包括：从所述BGP-intent路由中获取intent标识，并根据所述intent标识本地查找intent template，以获取意图信息；根据所述意图信息为所述BGP-intent路由建立或选择已有的传输路径。
进一步地，在一个实施例中，提供了一种根据所述意图信息为所述BGP-intent路由建立或选择已有的传输路径的技术方案，包括：根据所述BGP-intent路由中包括的度量、度量总信用、预估BGP跳数以及度量信用片段确定当前BGP speaker和所述当前BGP speaker的下游邻居BGP speaker之间的传输路径的度量信用片段参考值；限定所述建立或选择已有的传输路径的度量类型的累计度量小于或等于所述度量信用片段参考值，以建立或选择已有的传输路径。
进一步地，在一个实施例中，在所述BGP-intent路由中包含的度量信用信息中只包含与源相关的总度量信用，但不包含显式的度量信用片段的情况下，针对每个源对应的度量信用属性：用度量总信用除以预估BGP跳数，得到端到端路径中相邻两个BGP Speaker之间的平均度量信用；用度量总信用减去所述BGP-intent路由中包括的度量，得到剩余度量。
进一步地，在一个实施例中，所述方法还包括：针对所有源计算得到的平均度量信用与剩余度量：本BGP speaker至下游邻居BGP speaker的传输路径的度量信用片段参考值包括：所有源计算得到的平均度量信用与剩余度量中的最小正值。
进一步地，在一个实施例中，提供了一种技术方案，具体步骤包括：在所述BGP-intent路由中还包含显式的度量信用片段的情况下，针对每个Source对应的度量信用信息：根据本BGP Speaker在端到端路径中所处的位置编号，从BGP-intent路由中获取所述本BGP Speaker对应的度量信用片段；用度量总信用减去所述BGP-intent路由中包括的度量，得到剩余度量。
进一步地，在一个实施例中，所述方法还包括：针对所有源计算得到的度量信用片段与剩余度量：本BGP speaker至下游邻居BGP speaker的传输路径的度量信用片段参考值包括：所有源计算得到的度量信用片段与剩余度量中的最小正值。
进一步地，在一个实施例中，当本BGP Speaker发现并不存在一条至下游BGP Speaker 的能满足度量信用片段参考值的传输路径时，在所有候选的传输路径中选择一条度量类型的累计度量最接近度量信用片段参考值的路径。在本公开实施例中，在本BGP Speaker不存在符合条件的传输路径的情况下，可以放宽条件增加裕量，进而在所有候选的传输路径中选择一条度量类型的累计度量最接近度量信用片段参考值的路径。
进一步地，所述本BGP Speaker至下游BGP Speaker的传输路径至少包括以下之一：最短转发路径，流量工程路径；所述传输路径包括多条子路径，通过所述多条子路径以形成负荷分担，或形成快速重路由FRR保护，或形成多流复制和消除的路径，其中，当通过所述多条子路径形成多流复制和消除的路径时，所述多条子路径之间的度量之差应满足设定的限定值。
图3是根据本公开实施例的BGP-intent路由的通告方法的流程图，如图3所示，该方法的步骤包括：
步骤S302，向邻居BGP speaker通告BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。
通过上述步骤，通过向邻居BGP speaker通告BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息，解决了相关技术中的BGP-intent路由中携带的内容使得BGP-intent路由的传输路径的建立效率较低的问题，通过在BGP-intent路由中携带度量类型、度量、度量信用信息，进一步提高了传输路径的建立效率。
进一步地，在一个实施例中，所述度量类型包括：IGP度量、链路时延度量、链路与节点时延度量、TE默认度量、带宽度量；所述度量信用信息包括：度量总信用、预估BGP跳数以及度量信用片段；所述度量信用信息只包含一份信息，与特定源无关；或所述度量信用信息包含多份信息，且所述多份信息与多个特定源一一对应。
进一步地，在一个实施例中，所述度量类型对应的度量为从下游邻居BGP speaker收到的BGP-intent路由通告中包含的度量和本BGP speaker至下游邻居BGP speaker的传输路径的所述度量类型对应的累计度量之和；或，当本BGP speaker为原始的通告节点时，所述度量类型对应的度量为设定的某个初始值。
需要说明的是，上述初始值可以为0，但不限于此。
接下来结合以下实施例讨论一种更通用的方法，使得收到BGP-intent路由的BGP speaker能够以更灵活和准确的意图去建立或选择已有的至下一个BGP speaker的传输路径。
在一个实施例中，提供了一种技术方案，具体步骤如下：
步骤1，扩展BGP，当某个BGP speaker向其上游邻居通告BGP-intent路由时，携带可选的度量类型(metric-type)、度量(metric)、度量信用信息。其中度量信用信息由度量总信用(total-metric-credit)、预估BGP跳数，以及度量信用片段(metric-credit-piece)组成。度量信用信息可以只需包含一份，与特定的源(即特定的Ingress PE)无关，也可以包含多份，每个特定的源对应一份。
步骤2，收到BGP-intent路由通告的BGP speaker，从路由通告中获取intent标识，本地查找intent template获取意图信息，根据意图信息去建立或选择已有的传输路径。特别是，在建立或选择已有的传输路径时，还需根据路由通告中包含的度量(metric)、度量总信用(total-metric-credit)、预估BGP跳数、显式的度量信用片段信息，去得到本BGP speaker至下游邻居BGP speaker这一段传输路径的“度量信用片段参考值”，作为建立或选择已有传 输路径的依据，限定所使用的这一段传输路径的相应metric type的累计metric不超过“度量信用片段参考值”。
为了更好的理解上述步骤1，可以参考以下针对BGP的一种推荐的具体协议的扩展形式：
RFC4271定义了BGP的Path Attributes，随BGP路由通告时携带，表示路由的各种属性。本公开新增以下的Attribute Type Codes及其attribute values，以分别表示上述度量类型(metric-type)、度量信用(metric-credit)等属性，但不限于此。注：度量(metric)属性就是RFC7311中已定义的AIGP Attribute。
需要说明的是，在一个实施例中，对上述度量类型(metric-type)属性和度量信用(metric-credit)属性进行说明，具体如下：
a)度量类型(metric-type)属性：当Path Attribute的Type Code＝TBD1(待IANA(Internet Assigned Numbers Authority互联网地址编码分配机构)分配)，以表示attribute value中包含的是长度为一个字节的metric-type属性。metric-type属性是一个可选的不可传递的属性，用于提示AIGP Attribute中包含的metric是什么类型的metric，目前取值如下：
0：IGP Metric(定义于RFC5305、RFC2328、RFC5340)；
1：Unidirectional Link Delay(定义于RFC7810)；
2：TE default metric(定义于RFC5305)；
3：Bandwidth Metric(定义于draft-ietf-lsr-flex-algo-bw-con-01)；
4：Deterministic Delay Metric(在其它文档中讨论，相比而言，上述Unidirectional Link Delay仅考虑了链路时延，而Deterministic Delay既包含了链路时延也包含了节点内的时延)；
5～255：待将来定义。
b)度量信用(metric-credit)属性：当Path Attribute 的Type Code＝TBD2(待IANA分配)，以表示attribute value中包含的是如下格式的metric-credit属性。metric-credit属性是一个可选的不可传递的属性，用于提示端到端的度量总信用、预估BGP跳数、度量信用片段等信息。
在一个实施例中，可以结合图4对度量信用(metric-credit)属性进行说明。图4是根据本公开实施例的metric-credit attribute格式的示意图。对图4中的字段进行解释如下：
Count of Sources：占1字节，其取值至少为1，表示对Source计数的结果，即有多少个Source(即Ingress PE)对应的度量信用信息。每个Source对应的度量信用信息由“Flags”、“Network Address of Source”、“Total Metric Credit for Source”、“Estimated BGP Hops Count for Source”、“Current Hop Number”、“Metric Credit Piece[]”组成。
Flags：占1字节，标志位。目前定义三个标志，分别是：
S-Flag：Source Address Flag，指示是否包含Network Address of Source字段。0表示不包含，1表示包含。
F-Flag：Family Flag，指示Network Address of Source的地址簇。当S-Flag为1时，继续根据F-Flag确定Network Address of Source的长度，0表示4字节的IPv4地址，1表示16字节的IPv6地址。
P-Flag：Piece Flag，指示是否包含具体的度量信用片段信息(由“Current Hop Number”、 “Metric Credit Piece[]”组成)，0表示不包含，1表示包含。
Network Address of Source：字节数可变，表示Source的IP地址。当S-Flag为0时，本字段不存在；当S-Flag为1且F-Flag为0，本字段为4字节的IPv4地址；当S-Flag为1且F-Flag为1，本字段为16字节的IPv6地址。如果Network Address of Source不存在，说明度量信用信息与特定的Source无关，这一般发生于希望粗粒度的根据度量信用去控制传输路径建立的场景，比如在单个AS内，Egress PE向本AS内的多个Ingress PE通告BGP-intent路由时，仅携带单份与Source无关的统一的度量信用信息。
Total Metric Credit for Source：占4字节，表示从特定Source(或任意Source，当Network Address of Source不存在时)至Egress PE的总度量信用。
Estimated BGP Hops Count for Source：占1字节，表示从特定Source(或任意Source，当Network Address of Source不存在时)至Egress PE的预估BGP跳数，只计入那些收到BGP-intent路由通告时需要修改BGP Next-hop为自身的BGP Speaker。比如，5个BGP Speaker组成的通告路径S-A-B-C-D中，S为Ingress PE，D为Egress PE，A/B/C为三个中间BGP Speaker节点且它们都在收到BGP-intent路由通告时修改BGP Next-hop为自身，那么此时的预估BGP跳数为4，即整个通告路径由4段组成。
Current Hop Number：占1字节，表示数组Metric Credit Piece[]的当前下标。注意当P-Flag为0时，“Current Hop Number”和“Metric Credit Piece[]”字段不存在。Egress PE向其相邻的上游BGP Speaker邻居发送的BGP-intent路由通告报文中，Current Hop Number初始值为0；BGP-intent路由通告报文每经过一个BGP Speaker且该BGP Speaker将路由的BGP Next-hop修改为自身时，它将从数组Metric Credit Piece[]中按下标Current Hop Number读取元素，获取本BGP Speaker至下游BGP Speaker邻居这一段传输路径的度量信用片段，然后将报文中的Current Hop Number自增1并继续向上游BGP Speaker邻居通告路由。注意使用下标Current Hop Number从数组Metric Credit Piece[]中读取元素时，必须避免数组越界。
Metric Credit Piece[]：是一个数组，包含的元素个数由Estimated BGP Hops Count for Source指定，每个元素占2个字节。在BGP-intent路由通告的过程中，沿途每个BGP Speaker在将路由的BGP Next-hop修改为自身时，都将使用Current Hop Number作为下标去访问该数组，以获取显式的度量信用片段信息。度量信用片段的使用有非常严格的限制条件，即BGP-intent路由必须严格按照Egress PE期望的通告路径逐跳的向特定的Source通告。当发生异常时，BGP Speaker发现收到的BGP-intent路由通告报文中的Current Hop Number值已经大于或等于Estimated BGP Hops Count for Source值，那么它必须停止按照度量信用片段信息去寻找传输路径。
为了更好的理解上述步骤2，可以结合下述实施例对步骤2进行说明。
实施例1
在本实施例中，如果BGP-intent路由通告消息中包含的度量信用属性信息中只包含与Source相关的总度量信用，但不包含显式的度量信用片段信息，则可以针对每个Source对应的度量信用信息进行下述操作：
操作1：设置变量total_metric_credit_value为Total Metric Credit for Source的值：
操作2：设置变量bgp_hops_count为Estimated BGP Hops Count for Source的值；
操作3：设置变量metric_value为收到的BGP-intent路由的AIGP Attribute中包含的metric的值；
操作4：设置变量metric_residual_value为剩下的度量，其中，metric_residual_value＝total_metric_credit_value-metric_value；
需要说明的是，注意当存在多个Source对应的度量信用信息时，BGP-intent路由在通告时可能积累了很大的metric_value，导致某个Source对应的metric_residual_value为负值，其它Source对应的metric_residual_value为正值。
操作5：设置变量average_metric_credit_value为端到端路径中每相邻BGP Speaker之间的平均度量信用，其中，average_metric_credit_value＝total_metric_credit_value/bgp_hops_count；
另外，可以针对所有Source对应的度量信用信息，进行下述操作：
操作6：设置变量min_metric_residual_value为所有Source对应的metric_residual_value中的最小正值；
操作7：设置变量min_average_metric_credit_value为所有Source对应的average_metric_credit_value中的最小值；
本实施例中的其中一个BGP speaker至下游邻居BGP speaker这一段传输路径的“度量信用片段参考值”为min_metric_residual_value与min_average_metric_credit_value中的最小者。
实施例2
在本实施例中，如果BGP-intent路由通告消息中还包含显式的度量信用片段信息，则可以针对每个Source对应的度量信用信息进行下述操作：
操作8：设置变量total_metric_credit_value为Total Metric Credit for Source的值；
操作9：设置变量bgp_hops_count为Estimated BGP Hops Count for Source的值；
操作10：设置变量metric_value为收到的BGP-intent路由的AIGP Attribute中包含的metric的值；
操作11：设置变量metric_residual_value为剩下的度量，其中，metric_residual_value＝total_metric_credit_value-metric_value；
需要说明的是，注意当存在多个Source对应的度量信用信息时，BGP-intent路由在通告时可能积累了很大的metric_value，导致某个Source对应的metric_residual_value为负值，其它Source对应的metric_residual_value为正值。
操作12：设置变量explicit_metric_credit_piece_value为使用下标Current Hop Number从数组Metric Credit Piece[]中读取的元素的值，注意如果读取发生越界，则认为explicit_metric_credit_piece_value为0；
另外，可以针对所有Source对应的度量信用信息进行下述操作：
操作13：设置变量min_metric_residual_value为所有Source对应的metric_residual_value中的最小正值；
操作14：设置变量min_explicit_metric_credit_piece_value为所有Source对应的e xplicit_metric_credit_piece_value中的最小正值；
本实施例中的其中一个BGP speaker至下游邻居BGP speaker这一段传输路径的“度量信用片段参考值”为min_metric_residual_value与min_explicit_metric_credit_piece_value中的最小者。
通过上述实施例，可以确定上述实施例计算得到的“度量信用片段参考值”的目的是约束所使用的这一段传输路径的累计度量(metric)不能超过“度量信用片段参考值”，但某些情况下，本BGP Speaker发现并不存在一条能满足上述要求的传输路径，则这种约束可以适当放宽，但是本BGP Speaker最终所使用的传输路径，相比其它候选的传输路径，其相应度量类型(metric-type)的累计度量(metric)是最接近“度量信用片段参考值”的。
其中，本BGP Speaker上生成的BGP-intent路由中，包含的度量类型(metric-type)从收到的路由通告中拷贝，包含的度量(metric)属性值更新为收到的路由通告中包含的度量(metric)加上所使用的传输路径的相应度量类型(metric-type)的累计度量(metric)，包含的度量信用(metric-credit)属性从收到的路由通告中拷贝(注意其中的Current Hop Number要自增1)。
另外，本BGP Speaker可继续向上游BGP Speaker邻居通告上述生成的BGP-intent路由并修改BGP Next-hop为自身，此时在路由通告中将携带上述更新后的度量(metric)属性以及度量信用(metric-credit)属性。
接下来可以通过以下实施例对本公开实施例的BGP-intent路由的接收方法进行说明。
实施例3
结合图5对本实施例进行说明，图5是根据本公开实施例的同源同宿间不同意图的传输路径的示意图。如图5所示的网络中，包含两个IGP domain(IGP域)，在PE1与ABR之间，ABR与PE2之间建立BGP邻居，通告BGP-intent路由。比如，按照draft-zhou-idr-inter-domain-lcu-02中描述的方法，Egress PE2通过BGP将其loopback路由(记为loopback-PE2)向ABR通告，在路由通告中携带Color extended community以携带意图信息。ABR收到该路由通告后，继续通过BGP向PE1通告，即Ingress PE1、ABR、Egress PE2为前述方案中的BGP Speaker。
假设此例中，在Ingress PE1和Egress PE2之间有两类业务需要通信，其中一类业务的意图为所使用的传输路径的端到端总时延不能超过10ms，另一类业务的意图为所使用的传输路径的端到端总时延不能超过100ms。由于需要在同样的源/目的之间表征两条意图相关的路径，因此本实施例中，需要在EgressPE2上配置两个color，记为color-1000和color-2000。
需要说明的是，Color-1000对应的意图配置如下：metric-type：Unidirectional Link Delay(单位为ms)；total-metric：10；metric-credit enabled。
需要说明的是，Color-2000对应的意图配置如下：metric-type：Unidirectional Link Delay(单位为ms)；total-metric：100；metric-credit enabled。
其中，上述两个color对应的意图配置信息也统一在其它BGP Speaker节点(ABR、Ingress PE1)上配置。需要注意的是，由于意图配置信息中包含了metric-credit enabled命令，则这些其它BGP Speaker在从下游BGP Speaker邻居收到BGP-intent路由通告后，并不会仅仅根据意图配置信息中包含的total-metric去计算至下游BGP Speaker邻居的传输路径，而是 还要从收到的BGP-intent路由通告中获取度量信用信息，据此建立或使用已有的满足意图的传输路径。或者，在这些其它BGP Speaker节点上配置的意图配置中，可不包含total-metric信息。
在本实施例中，提供了一种技术方案，具体步骤包括：
步骤1)Egress PE2产生BGP-intent路由并向ABR通告：在Egress PE2上，相应的产生两个BGP-intent路由，<prefix＝loopback-PE2，color＝1000>和<prefix＝loopback-PE2，color＝2000>，分别向ABR通告，路由通告中的BGP Next-hop为Egress PE2。
需要说明的是，可以通告BGP-intent路由<prefix＝loopback-PE2，color＝1000>时，根据color-1000对应的意图配置信息，设置路由通告中包含的信息，即：设置metric-type为：Unidirectional Link Delay；设置初始metric为：0。
以及设置度量信用信息为：Count of Sources：1；Flags：S-Flag＝1，F-Flag＝0，P-Flag＝0；Network Address of Source：loopback-PE1(假设为IPv4地址)；Total Metric Credit for Source：10；Estimated BGP Hops Count for Source：2(至Ingress PE1要经历两个BGP Speaker)。
另外，通告BGP-intent路由<prefix＝loopback-PE2，color＝2000>时，根据color-2000对应的意图配置信息，设置路由通告中包含的信息，即：设置metric-type为：Unidirectional Link Delay；设置初始metric为：0。以及设置度量信用信息为：Count of Sources：1；Flags：S-Flag＝1，F-Flag＝0，P-Flag＝0；Network Address of Source：loopback-PE1(假设为IPv4地址)；Total Metric Credit for Source：100；Estimated BGP Hops Count for Source：2(至Ingress PE1要经历两个BGP Speaker)。
步骤2)ABR收到BGP-intent路由，建立至BGP Next-hop的满足意图的底层传输路径：ABR收到BGP-intent路由<prefix＝loopback-PE2，color＝1000>时，在本地生成相应的路由表项，其中metric-type为Unidirectional Link Delay，BGPNext-hop为Egress PE2。
需要说明的是，ABR根据收到的路由通告中包含的度量信用信息，知道本BGP Speaker(即ABR)至下游BGP Speaker邻居(即Egress PE2)的“度量信用片段参考值”为5ms(总度量信用除以2)，则ABR节点内部将调用CSPF(Constraint Shortest Path First约束最短路径优先)计算模块计算一条至Egress PE2的不超过5ms的极低时延路径，假设为图5中的TEpath-12，其时延为4ms。因此，ABR上生成的BGP-intent路由表项<prefix＝loopback-PE2，color＝1000>迭代至BGP Next-hop的底层传输路径为TE path-12，并相应的设置路由表项中的metric为4。ABR继续向上游BGP Speaker邻居(Ingress PE1)通告BGP-intent路由，其中metric-type为Unidirectional Link Delay，metric为4，BGP Next-hop修改为ABR，以及度量信用信息(与之前收到的路由通告中的度量信用信息保持不变)。
类似的，还可以在ABR收到BGP-intent路由<prefix＝loopback-PE2，color＝2000>时，在本地生成相应的路由表项，其中metric-type为Unidirectional Link Delay，BGP Next-hop为Egress PE2。ABR根据收到的路由通告中包含的度量信用信息，知道本BGP Speaker(即ABR)至下游BGP Speaker邻居(即Egress PE2)的“度量信用片段参考值”为50ms(总度量信用除以2)，则ABR节点内部将调用CSPF计算模块计算一条至Egress PE2的不超过50ms的低时延路径，假设为图5中的TEpath-22，其时延为40ms。因此，ABR上生成的BGP-intent路由表项<prefix＝loopback-PE2，color＝2000>迭代至BGP Next-hop的底层传输路径为TEpath-22，并相应的设置路由表项中的metric为40。ABR继续向上游BGP Speaker邻居(Ingress  PE1)通告BGP-intent路由，其中metric-type为Unidirectional Link Delay，metric为40，BGP Next-hop修改为ABR，以及度量信用信息(与之前收到的路由通告中的度量信用信息保持不变)。
步骤3)Ingress PE1收到BGP-intent路由，建立至BGP Next-hop的满足意图的底层传输路径：Ingress PE1收到BGP-intent路由<prefix＝loopback-PE2，color＝1000>时，在本地生成相应的路由表项，其中metric-type为Unidirectional Link Delay，BGP Next-hop为ABR。
需要说明的是，Ingress PE1根据收到的路由通告中包含的度量信用信息，知道本BGP Speaker(即Ingress PE1)至下游BGP Speaker邻居(即ABR)的“度量信用片段参考值”为5ms(总度量信用除以2等于5，剩余度量信用为6，取小值)，则Ingress PE1节点内部将调用CSPF计算模块计算一条至ABR的不超过5ms的极低时延路径，假设为图5中的TE path-11(路径-11)，其时延为4ms。因此，Ingress PE1上生成的BGP-intent路由表项<prefix＝loopback-PE2，color＝1000>迭代至BGP Next-hop的底层传输路径为TE path-11，并相应的设置路由表项中的metric为8(＝4+4)。
类似的，还可以在Ingress PE1收到BGP-intent路由<prefix＝loopback-PE2，color＝2000>时，在本地生成相应的路由表项，其中metric-type为Unidirectional Link Delay，BGP Next-hop为ABR。Ingress PE1根据收到的路由通告中包含的度量信用信息，知道本BGP Speaker(即Ingress PE1)至下游BGP Speaker邻居(即ABR)的“度量信用片段参考值”为50ms(总度量信用除以2等于50，剩余度量信用为60，取小值)，则Ingress PE1节点内部将调用CSPF计算模块计算一条至ABR的不超过50ms的低时延路径，假设为图5中的TEpath-21(路径-21)，其时延为40ms。因此，Ingress PE1上生成的BGP-intent路由表项<prefix＝loopback-PE2，color＝2000>迭代至BGP Next-hop的底层传输路径为TE path-21，并相应的设置路由表项中的metric为80(＝40+40)。
可见，本实施例中，通过路由通告中包含的度量信用信息，使得各BGP Speaker上能有依据的建立差异化的传输路径，避免都争用优质的极低时延链路资源。
实施例4
可以参考图5所示的网络，由于两个IGP domain由单个服务提供商管理，该服务提供商熟知网络的性能指标，且BGP-intent路由通告的传播路径是明确的，则此时可以在Egress PE2上配置本地策略，使得在通告BGP-intent路由中包含显式的度量信用片段信息。主要的步骤如下：
步骤1)Egress PE2产生BGP-intent路由并向ABR通告：在Egress PE2上，相应的产生两个BGP-intent路由，<prefix＝loopback-PE2，color＝1000>和<prefix＝loopback-PE2，color＝2000>，分别向ABR通告，路由通告中的BGP Next-hop为Egress PE2。
需要说明的是，可以通告BGP-intent路由<prefix＝loopback-PE2，color＝1000>时，根据color-1000对应的意图配置信息，设置路由通告中包含的信息，即：设置metric-type为：Unidirectional Link Delay；设置初始metric为：0。
以及，设置度量信用信息为：Count of Sources：1；Flags：S-Flag＝1，F-Flag＝0，P-Flag＝1；Network Address of Source：loopback-PE1(假设为IPv4地址)；Total Metric Credit for  Source：10；Estimated BGP Hops Count for Source：2(至Ingress PE1要经历两个BGP Speaker)；Current Hop Number：0；Metric Credit Piece[2]：[0]＝4，[1]＝6。
需要说明的是，还可以通告BGP-intent路由<prefix＝loopback-PE2，color＝2000>时，根据color-2000对应的意图配置信息，设置路由通告中包含的信息，即：设置metric-type为：Unidirectional Link Delay；设置初始metric为：0。
以及，设置度量信用信息为：Count of Sources：1；Flags：S-Flag＝1，F-Flag＝0，P-Flag＝0；Network Address of Source：loopback-PE1(假设为IPv4地址)；Total Metric Credit for Source：100；Estimated BGP Hops Count for Source：2(至Ingress PE1要经历两个BGP Speaker)；Current Hop Number：0；Metric Credit Piece[2]：[0]＝40，[1]＝60。
步骤2)ABR收到BGP-intent路由，建立至BGP Next-hop的满足意图的底层传输路径：ABR收到BGP-intent路由<prefix＝loopback-PE2，color＝1000>时，在本地生成相应的路由表项，其中metric-type为Unidirectional Link Delay，BGP Next-hop为Egress PE2。
需要说明的是，ABR根据收到的路由通告中包含的度量信用信息，知道本BGP Speaker(即ABR)至下游BGP Speaker邻居(即Egress PE2)的“度量信用片段参考值”为4ms(总度量信用除以2为5，度量信用片段[0]元素为4，取小值)，则ABR节点内部将调用CSPF计算模块计算一条至Egress PE2的不超过4ms的极低时延路径，假设为图5中的TE path-12，其时延为4ms。因此，ABR上生成的BGP-intent路由表项<prefix＝loopback-PE2，color＝1000>迭代至BGP Next-hop的底层传输路径为TE path-12，并相应的设置路由表项中的metric为4。ABR继续向上游BGP Speaker邻居(Ingress PE1)通告BGP-intent路由，其中metric-type为Unidirectional Link Delay，metric为4，BGP Next-hop修改为ABR，以及度量信用信息(Current Hop Number自增为1)。
类似的，还可以在ABR收到BGP-intent路由<prefix＝loopback-PE2，color＝2000>时，在本地生成相应的路由表项，其中metric-type为Unidirectional Link Delay，BGP Next-hop为Egress PE2。ABR根据收到的路由通告中包含的度量信用信息，知道本BGP Speaker(即ABR)至下游BGP Speaker邻居(即Egress PE2)的“度量信用片段参考值”为40ms(总度量信用除以2为50，度量信用片段[0]元素为40，取小值)，则ABR节点内部将调用CSPF计算模块计算一条至Egress PE2的不超过40ms的低时延路径，假设为图5中的TE path-22，其时延为40ms。因此，ABR上生成的BGP-intent路由表项<prefix＝loopback-PE2，color＝2000>迭代至BGP Next-hop的底层传输路径为TE path-22，并相应的设置路由表项中的metric为40。ABR继续向上游BGP Speaker邻居(Ingress PE1)通告BGP-intent路由，其中metric-type为Unidirectional Link Delay，metric为40，BGP Next-hop修改为ABR，以及度量信用信息(Current Hop Number自增为1)。
步骤3)Ingress PE1收到BGP-intent路由，建立至BGP Next-hop的满足意图的底层传输路径：Ingress PE1收到BGP-intent路由<prefix＝loopback-PE2，color＝1000>时，在本地生成相应的路由表项，其中metric-type为Unidirectional Link Delay，BGP Next-hop为ABR。
需要说明的是，Ingress PE1根据收到的路由通告中包含的度量信用信息，知道本BGPSpeaker(即Ingress PE1)至下游BGP Speaker邻居(即ABR)的“度量信用片段参考值”为5ms(总度量信用除以2等于5，剩余度量信用为6，度量信用片段[1]元素为6，取小值)， 则Ingress PE1节点内部将调用CSPF计算模块计算一条至ABR的不超过5ms的极低时延路径，假设为图5中的TE path-11，其时延为4ms。因此，Ingress PE1上生成的BGP-intent路由表项<prefix＝loopback-PE2，color＝1000>迭代至BGP Next-hop的底层传输路径为TEpath-11，并相应的设置路由表项中的metric为8(＝4+4)。
类似的，还可以在Ingress PE1收到BGP-intent路由<prefix＝loopback-PE2，color＝2000>时，在本地生成相应的路由表项，其中metric-type为Unidirectional Link Delay，BGP Next-hop为ABR。Ingress PE1根据收到的路由通告中包含的度量信用信息，知道本BGP Speaker(即Ingress PE1)至下游BGP Speaker邻居(即ABR)的“度量信用片段参考值”为50ms(总度量信用除以2等于50，剩余度量信用为60，度量信用片段[1]元素为60，取小值)，则Ingress PE1节点内部将调用CSPF计算模块计算一条至ABR的不超过50ms的低时延路径，假设为图5中的TEpath-21，其时延为40ms。因此，Ingress PE1上生成的BGP-intent路由表项<prefix＝loopback-PE2，color＝2000>迭代至BGPNext-hop的底层传输路径为TEpath-21，并相应的设置路由表项中的metric为80(＝40+40)。
实施例5
结合图6对本实施例中的技术方案进行说明。图6是根据本公开实施例的多对源宿间的相同意图的传输路径的示意图。如图6所示的网络中，包含3个AS(Autonomous System)，在PE1与ASBR1之间、ASBR1与ASBR2之间、ASBR1与ASBR3之间、ASBR2与PE2之间、ASBR3与PE3之间建立BGP邻居，通告BGP-intent路由。比如，按照draft-zhou-idr-inter-domain-lcu-02中描述的方法，Egress PE2通过BGP将其loopback路由(记为loopback-PE2)向ASBR2通告，Egress PE3通过BGP将其loopback路由(记为loopback-PE3)向ASBR3通告，在路由通告中携带Color extended community以携带意图信息。ASBR2/ASBR3收到该路由通告后，继续通过BGP向ASBR1通告，ASBR1收到该路由通告后，继续通过BGP向Ingress PE1通告，即Ingress PE1、ASBR1、ASBR2、ASBR3、Egress PE2、Egress PE3为前述方案中的BGP Speaker。
假设此例中，同一类业务需要在Ingress PE1和Egress PE2之间，以及Ingress PE1和Egress PE3之间进行通信，该类业务的意图为所使用的传输路径的端到端总时延与距离相关的特定值。
需要说明的是，假设在Egress PE2上配置相应的color-1000，其对应的意图配置如下：metric-type：Unidirectional Link Delay(单位为ms)；total-metric：200(考虑到实际距离较短)；metric-credit enabled。
需要说明的是，假设在Egress PE3上配置相应的color-1000，其对应的意图配置如下：metric-type：Unidirectional Link Delay(单位为ms)；total-metric：300(考虑到实际距离较长)；metric-credit enabled。
其中，上述color对应的意图配置信息也统一在其它BGP Speaker节点(ASBR1、ASBR2、ASBR3、lngress PE1)上配置，可不包含total-metric信息。
具体流程前述实施例类似，这里仅描述关键的内容：
步骤1)Egress PE2产生BGP-intent路由并向ASBR2通告：在Egress PE2上，相应的产生BGP-intent路由<prefix＝loopback-PE2，color＝1000>向ASBR2通告，包含的主要信息 如下：设置BGP Next-hop为：loopback-PE2；设置metric-type为：Unidirectional Link Delay；设置初始metric为：0。
以及，设置度量信用信息为：Count of Sources：1；Flags：S-Flag＝1，F-Flag＝0，P-Flag＝0；Network Address of Source：loopback-PE1(假设为IPv4地址)；Total Metric Credit for Source：200；Estimated BGP Hops Count for Source：3(至Ingress PE1要经历3个BGP Speaker)。
步骤2)Egress PE3产生BGP-intent路由并向ASBR3通告：在Egress PE3上，相应的产生BGP-intent路由<prefix＝loopback-PE3，color＝1000>向ASBR3通告，包含的主要信息如下：设置BGP Next-hop为：loopback-PE3；设置metric-type为：Unidirectional Link Delay；设置初始metric为：0。
以及，设置度量信用信息为：Count of Sources：1；Flags：S-Flag＝1，F-Flag＝0，P-Flag＝0；Network Address of Source：loopback-PE1(假设为IPv4地址)；Total Metric Credit for Source：300；Estimated BGP Hops Count for Source：3(至Ingress PE1要经历3个BGP Speaker)。
步骤3)ASBR2收到BGP-intent路由，建立至BGP Next-hop的满足意图的底层传输路径：ASBR2收到BGP-intent路由<prefix＝loopback-PE2，color＝1000>时，在本地生成相应的路由表项，主要的属性包括：metric-type为：Unidirectional Link Delay；BGP Next-hop为：loopback-PE2(按照度量信用片段参考值66，迭代至PE2的传输路径为TE path-13)；metric为：60(累加了TE path-13的累计时延60ms)；metric-credit信息：与收到的路由通告中的信息保持不变。
另外，ASBR2继续向ASBR1通告该BGP-intent路由，其中metric-type为Unidirectional Link Delay，metric为60，BGP Next-hop修改为ASBR2，以及度量信用信息(与之前收到的路由通告中的度量信用信息保持不变)。
步骤4)ASBR3收到BGP-intent路由，建立至BGP Next-hop的满足意图的底层传输路径：ASBR3收到BGP-intent路由<prefix＝loopback-PE3，color＝1000>时，在本地生成相应的路由表项，主要的属性包括：metric-type为：Unidirectional Link Delay；BGP Next-hop为：loopback-PE3(按照度量信用片段参考值100，迭代至PE2的传输路径为TEpath-23)；metric为：100(累加了TE path-23的累计时延100ms)；metric-credit信息：与收到的路由通告中的信息保持不变。
另外，ASBR3继续向ASBR1通告该BGP-intent路由，其中metric-type为Unidirectional Link Delay，metric为100，BGP Next-hop修改为ASBR3，以及度量信用信息(与之前收到的路由通告中的度量信用信息保持不变)。
步骤5)ASBR1收到BGP-intent路由，建立至BGP Next-hop的满足意图的底层传输路径：ASBR1收到BGP-intent路由<prefix＝loopback-PE2，color＝1000>时，在本地生成相应的路由表项，主要的属性包括：metric-type为：Unidirectional Link Delay；BGP Next-hop为：ASBR2(按照度量信用片段参考值66，迭代至ASBR2的传输路径为TEpath-12)；metric为：70(累加了TEpath-12的累计时延10ms)；metric-credit信息：与收到的路由通告中的信息保持不变。
另外，ASBR1继续向Ingress PE1通告该BGP-intent路由，其中metric-type为 Unidirectional Link Delay，metric为70，BGP Next-hop修改为ASBR1，以及度量信用信息(与之前收到的路由通告中的度量信用信息保持不变)。
类似的，还可以在ASBR1收到BGP-intent路由<prefix＝loopback-PE3，color＝1000>时，在本地生成相应的路由表项，主要的属性包括：metric-type为：Unidirectional Link Delay；BGP Next-hop为：ASBR3(按照度量信用片段参考值100，迭代至ASBR3的传输路径为TEpath-22)；metric为：110(累加了TE path-22的累计时延10ms)；metric-credit信息：与收到的路由通告中的信息保持不变。
另外，ASBR1继续向Ingress PE1通告该BGP-intent路由，其中metric-type为Unidirectional Link Delay，metric为110，BGP Next-hop修改为ASBR1，以及度量信用信息(与之前收到的路由通告中的度量信用信息保持不变)。
步骤6)Ingress PE1收到BGP-intent路由，建立至BGP Next-hop的满足意图的底层传输路径：Ingress PE1收到BGP-intent路由<prefix＝loopback-PE2，color＝1000>时，在本地生成相应的路由表项，主要的属性包括：metric-type为：Unidirectional Link Delay；BGP Next-hop为：ASBR1(按照度量信用片段参考值66，迭代至ASBR2的传输路径为TE path-11)；metric为：130(累加了TE path-11的累计时延60ms)；metric-credit信息：与收到的路由通告中的信息保持不变。
类似的，还可以在Ingress PE1收到BGP-intent路由<prefix＝loopback-PE3，color＝1000>时，在本地生成相应的路由表项，主要的属性包括：metric-type为：Unidirectional Link Delay；BGP Next-hop为：ASBR1(按照度量信用片段参考值100，迭代至ASBR1的传输路径为TE path-21)；metric为：210(累加了TE path-22的累计时延100ms)；metric-credit信息：与收到的路由通告中的信息保持不变。
通过采用上述实施例中的技术方案，能有依据的控制意图路由的传输路径建立，提供差异化的转发资源，避免所有业务都去争用优质资源。
另外，上述实施例中的技术方案可应用于IPRAN/SPN，城域网/骨干，但不限于此。
图7是根据本公开实施例的BGP-intent路由的接收装置的结构框图。如图7所示，BGP-intent路由的接收装置包括：
接收模块702，设置为接收BGP speaker通告的BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。
通过上述方案，通过接收BGP speaker通告的BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息，解决了相关技术中的BGP-intent路由中携带的内容使得BGP-intent路由的传输路径的建立效率较低的问题，通过在BGP-intent路由中携带度量类型、度量、度量信用信息，进一步提高了传输路径的建立效率。
进一步地，所述度量类型包括：IGP度量、链路时延度量、链路与节点时延度量、TE默认度量、带宽度量；所述度量信用信息包括：度量总信用、预估BGP跳数以及度量信用片段；所述度量信用信息只包含一份信息，与特定源无关；或所述度量信用信息包含多份信息，且所述多份信息与多个特定源一一对应。
需要说明的是，上述链路时延度量可以包括链路的时延，但不限于此。
需要说明的是，上述链路与节点时延度量可以同时包括链路的时延与节点内的时延，但不限于此。
进一步地，BGP-intent路由的接收装置还包括：获取模块，设置为从所述BGP-intent路由中获取intent标识，并根据所述intent标识本地查找intent template，以获取意图信息；根据所述意图信息为所述BGP-intent路由建立或选择已有的传输路径。
进一步地，获取模块，还设置为根据所述BGP-intent路由中包括的度量、度量总信用、预估BGP跳数以及度量信用片段确定当前BGP speaker和所述当前BGP speaker的下游邻居BGP speaker之间的传输路径的度量信用片段参考值；限定所述建立或选择已有的传输路径的度量类型的累计度量小于或等于所述度量信用片段参考值，以建立或选择已有的传输路径。
进一步地，BGP-intent路由的接收装置还包括：第一度量获得模块，设置为在所述BGP-intent路由中包含的度量信用信息中只包含与源相关的总度量信用，但不包含显式的度量信用片段的情况下，针对每个源对应的度量信用属性：用度量总信用除以预估BGP跳数，得到端到端路径中相邻两个BGP Speaker之间的平均度量信用；用度量总信用减去所述BGP-intent路由中包括的度量，得到剩余度量。
进一步地，第一度量获得模块还设置为针对所有源计算得到的平均度量信用与剩余度量：本BGP speaker至下游邻居BGP speaker的传输路径的度量信用片段参考值包括：所有源计算得到的平均度量信用与剩余度量中的最小正值。
进一步地，BGP-intent路由的接收装置还包括：第二度量获得模块，设置为在所述BGP-intent路由中还包含显式的度量信用片段的情况下，针对每个Source对应的度量信用信息：根据本BGP Speaker在端到端路径中所处的位置编号，从BGP-intent路由中获取所述本BGP Speaker对应的度量信用片段；用度量总信用减去所述BGP-intent路由中包括的度量，得到剩余度量。
进一步地，第二度量获得模块还设置为针对所有源计算得到的度量信用片段与剩余度量：本BGP speaker至下游邻居BGP speaker的传输路径的度量信用片段参考值包括：所有源计算得到的度量信用片段与剩余度量中的最小正值。
进一步地，获取模块还设置为，当本BGP Speaker发现并不存在一条至下游BGP Speaker的能满足度量信用片段参考值的传输路径时，在所有候选的传输路径中选择一条度量类型的累计度量最接近度量信用片段参考值的路径。
进一步地，在一个实施例中，所述本BGP Speaker至下游BGP Speaker的传输路径至少包括以下之一：最短转发路径，流量工程路径；所述传输路径包括多条子路径，通过所述多条子路径以形成负荷分担，或形成快速重路由FRR保护，或形成多流复制和消除的路径，其中，当通过所述多条子路径形成多流复制和消除的路径时，所述多条子路径之间的度量之差应满足设定的限定值。
图8是根据本公开实施例的BGP-intent路由的通告装置的结构框图。如图8所示，BGP-intent路由的通告装置包括：
通告模块802，设置为向邻居BGP speaker通告BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。
通过上述方案，通过用于向邻居BGP speaker通告BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息，解决了相关技术中的BGP-intent路由中携带的内容使得BGP-intent路由的传输路径的建立效率较低的问题，通过在BGP-intent路由中携带度量类型、度量、度量信用信息，进一步提高了传输路径的建 立效率。
进一步地，在一个实施例中，所述度量类型包括：IGP度量、链路时延度量、链路与节点时延度量、TE默认度量、带宽度量；所述度量信用信息包括：度量总信用、预估BGP跳数以及度量信用片段；所述度量信用信息只包含一份信息，与特定源无关；或所述度量信用信息包含多份信息，且所述多份信息与多个特定源一一对应。
进一步地，需要说明的是，所述度量类型对应的度量为从下游邻居BGP speaker收到的BGP-intent路由通告中包含的度量和本BGP speaker至下游邻居BGP speaker的传输路径的所述度量类型对应的累计度量之和；或，当本BGP speaker为原始的通告节点时，所述度量类型对应的度量为设定的某个初始值。
需要说明的是，上述初始值可以为0，但不限于此。
在一个示例性实施例中，上述计算机可读存储介质可以包括但不限于：U盘、只读存储器(Read-Only Memory，简称为ROM)、随机存取存储器(Random Access Memory，简称为RAM)、移动硬盘、磁碟或者光盘等各种可以存储计算机程序的介质。
本实施例中的具体示例可以参考上述实施例及示例性实施方式中所描述的示例，本实施例在此不再赘述。
本公开的实施例还提供了一种电子装置，包括存储器和处理器，该存储器中存储有计算机程序，该处理器被设置为运行计算机程序以执行上述任一项方法实施例中的步骤。
可选地，在本实施例中，上述处理器可以被设置为通过计算机程序执行以下步骤：
S1，接收BGP speaker通告的BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。
可选的，在其他实施例中，上述处理器还可以被设置为通过计算机程序执行以下步骤：
S1，向邻居BGP speaker通告BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。
在一个示例性实施例中，上述电子装置还可以包括传输设备以及输入输出设备，其中，该传输设备和上述处理器连接，该输入输出设备和上述处理器连接。
本实施例中的具体示例可以参考上述实施例及示例性实施方式中所描述的示例，本实施例在此不再赘述。
显然，本领域的技术人员应该明白，上述的本公开的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在部分情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本公开不限制于任何特定的硬件和软件结合。
以上所述仅为本公开的优选实施例而已，并不用于限制本公开，对于本领域的技术人员来说，本公开可以有各种更改和变化。凡在本公开的原则之内，所作的任何修改、等同替换、改进等，均应包含在本公开的保护范围之内。

Claims (17)

  1. 一种BGP-intent路由的接收方法，包括：
    接收BGP speaker通告的BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。
  2. 根据权利要求1所述的BGP-intent路由的接收方法，其中，所述方法还包括：
    所述度量类型包括：IGP度量、链路时延度量、链路与节点时延度量、TE默认度量、带宽度量；
    所述度量信用信息包括：度量总信用、预估BGP跳数以及度量信用片段；
    所述度量信用信息只包含一份信息，与特定源无关；或所述度量信用信息包含多份信息，且所述多份信息与多个特定源一一对应。
  3. 根据权利要求1所述的BGP-intent路由的接收方法，其中，接收BGP speaker通告的BGP-intent路由之后，所述方法还包括：
    从所述BGP-intent路由中获取intent标识，并根据所述intent标识本地查找intent template，以获取意图信息；
    根据所述意图信息为所述BGP-intent路由建立或选择已有的传输路径。
  4. 根据权利要求3所述的BGP-intent路由的接收方法，其中，根据所述意图信息为所述BGP-intent路由建立或选择已有的传输路径，包括：
    根据所述BGP-intent路由中包括的度量、度量总信用、预估BGP跳数以及度量信用片段确定当前BGP speaker和所述当前BGP speaker的下游邻居BGP speaker之间的传输路径的度量信用片段参考值；
    限定所述建立或选择已有的传输路径的度量类型的累计度量小于或等于所述度量信用片段参考值，以建立或选择已有的传输路径。
  5. 根据权利要求1所述的BGP-intent路由的接收方法，其中，所述方法还包括：
    在所述BGP-intent路由中包含的度量信用信息中只包含与源相关的总度量信用，但不包含显式的度量信用片段的情况下，针对每个源对应的度量信用属性：
    用度量总信用除以预估BGP跳数，得到端到端路径中相邻两个BGP Speaker之间的平均度量信用；
    用度量总信用减去所述BGP-intent路由中包括的度量，得到剩余度量。
  6. 根据权利要求5所述的BGP-intent路由的接收方法，其中，所述方法还包括：
    针对所有源计算得到的平均度量信用与剩余度量：
    本BGP speaker至下游邻居BGP speaker的传输路径的度量信用片段参考值包括：所有源计算得到的平均度量信用与剩余度量中的最小正值。
  7. 根据权利要求1所述的BGP-intent路由的接收方法，其中，所述方法还包括：
    在所述BGP-intent路由中还包含显式的度量信用片段的情况下，针对每个Source对应的度量信用信息：
    根据本BGP Speaker在端到端路径中所处的位置编号，从BGP-intent路由中获取所述本BGP Speaker对应的度量信用片段；
    用度量总信用减去所述BGP-intent路由中包括的度量，得到剩余度量。
  8. 根据权利要求7所述的BGP-intent路由的接收方法，其中，所述方法还包括：
    针对所有源计算得到的度量信用片段与剩余度量：
    本BGP speaker至下游邻居BGP speaker的传输路径的度量信用片段参考值包括：所有源计算得到的度量信用片段与剩余度量中的最小正值。
  9. 根据权利要求4所述的BGP-intent路由的接收方法，其中，所述方法还包括：
    当本BGP Speaker发现并不存在一条至下游BGP Speaker的能满足度量信用片段参考值的传输路径时，在所有候选的传输路径中选择一条度量类型的累计度量最接近度量信用片段参考值的路径。
  10. 根据权利要求5至9任一项所述的BGP-intent路由的接收方法，其中，所述方法还包括：
    所述本BGP Speaker至下游BGP Speaker的传输路径至少包括以下之一：最短转发路径，流量工程路径；
    所述传输路径包括多条子路径，通过所述多条子路径以形成负荷分担，或形成快速重路由FRR保护，或形成多流复制和消除的路径，其中，当通过所述多条子路径形成多流复制和消除的路径时，所述多条子路径之间的度量之差应满足设定的限定值。
  11. 一种BGP-intent路由的通告方法，包括：
    向邻居BGP speaker通告BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。
  12. 根据权利要求11所述的BGP-intent路由的通告方法，其中，所述方法还包括：
    所述度量类型包括：IGP度量、链路时延度量、链路与节点时延度量、TE默认度量、带宽度量；
    所述度量信用信息包括：度量总信用、预估BGP跳数以及度量信用片段；
    所述度量信用信息只包含一份信息，与特定源无关；或所述度量信用信息包含多份信息，且所述多份信息与多个特定源一一对应。
  13. 根据权利要求11所述的BGP-intent路由的通告方法，其中，所述方法还包括：
    所述度量类型对应的度量为从下游邻居BGP speaker收到的BGP-intent路由通告中包含的度量和本BGP speaker至下游邻居BGP speaker的传输路径的所述度量类型对应的累计度量之和；
    或，当本BGP speaker为原始的通告节点时，所述度量类型对应的度量为设定的某个初始值。
  14. 一种BGP-intent路由的接收装置，包括：
    接收模块，设置为接收BGP speaker通告的BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。
  15. 一种BGP-intent路由的通告装置，包括：
    通告模块，设置为向邻居BGP speaker通告BGP-intent路由，其中，所述BGP-intent路由中携带以下至少之一：度量类型、度量、度量信用信息。
  16. 一种计算机可读的存储介质，所述存储介质中存储有计算机程序，其中，所述计算机程序被设置为运行时执行所述权利要求1至10任一项中所述的方法，或权利要求11至13 任一项所述的方法。
  17. 一种电子装置，包括存储器和处理器，所述存储器中存储有计算机程序，所述处理器被设置为通过所述计算机程序执行所述权利要求1至10任一项中所述的方法，或权利要求11至13任一项所述的方法。
PCT/CN2022/109512 2021-10-25 2022-08-01 BGP-intent路由的接收方法和BGP-intent路由的通告方法 WO2023071359A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202111243804.0 2021-10-25
CN202111243804.0A CN116032817A (zh) 2021-10-25 2021-10-25 BGP-intent路由的接收方法和BGP-intent路由的通告方法

Publications (1)

Publication Number Publication Date
WO2023071359A1 true WO2023071359A1 (zh) 2023-05-04

Family

ID=86079942

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2022/109512 WO2023071359A1 (zh) 2021-10-25 2022-08-01 BGP-intent路由的接收方法和BGP-intent路由的通告方法

Country Status (2)

Country Link
CN (1) CN116032817A (zh)
WO (1) WO2023071359A1 (zh)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103609080A (zh) * 2011-06-23 2014-02-26 瑞典爱立信有限公司 用于支持经由as间路径的路由的方法和节点
CN104012050A (zh) * 2012-01-02 2014-08-27 诺基亚通信公司 用于跨至少两个域传递数据的方法和装置
EP3435599A1 (en) * 2017-07-28 2019-01-30 Juniper Networks, Inc. Service level agreement based next-hop selection
CN110890976A (zh) * 2018-09-07 2020-03-17 丛林网络公司 计算机网络中的动态意图保证方法和装置以及存储介质
US20200382387A1 (en) * 2019-05-31 2020-12-03 Juniper Networks, Inc. Dynamic application sla metric generation, distribution, and intent-based sd-wan link selection
US20210250273A1 (en) * 2019-05-13 2021-08-12 128 Technology, Inc. Routing using segment-based metrics

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103609080A (zh) * 2011-06-23 2014-02-26 瑞典爱立信有限公司 用于支持经由as间路径的路由的方法和节点
CN104012050A (zh) * 2012-01-02 2014-08-27 诺基亚通信公司 用于跨至少两个域传递数据的方法和装置
EP3435599A1 (en) * 2017-07-28 2019-01-30 Juniper Networks, Inc. Service level agreement based next-hop selection
CN110890976A (zh) * 2018-09-07 2020-03-17 丛林网络公司 计算机网络中的动态意图保证方法和装置以及存储介质
US20210250273A1 (en) * 2019-05-13 2021-08-12 128 Technology, Inc. Routing using segment-based metrics
US20200382387A1 (en) * 2019-05-31 2020-12-03 Juniper Networks, Inc. Dynamic application sla metric generation, distribution, and intent-based sd-wan link selection

Also Published As

Publication number Publication date
CN116032817A (zh) 2023-04-28

Similar Documents

Publication Publication Date Title
TWI803687B (zh) 用於路由最佳化的系統及其方法
US11888651B2 (en) Virtual private network VPN service optimization method and device
CN111147373B (zh) 实现非灵活算法路由器参与灵活算法路由协议
EP3046294B1 (en) System and method for efficient name-based content routing using link-state information in information-centric networks
US9667550B2 (en) Advertising traffic engineering information with the border gateway protocol for traffic engineered path computation
EP1997017B1 (en) Technique for preventing routing loops by disseminating bgp attribute information in an ospf-configured network
US8467411B1 (en) Service-specific forwarding in an LDP-RSVP hybrid network
US7751405B1 (en) Automatic configuration of label switched path tunnels using BGP attributes
CN107968750B (zh) 报文传输方法、装置及节点
CN109218197B (zh) 分段路由中的冲突解决方法及路由器
US20070047463A1 (en) Method of constructing a forwarding database for a data communications network
CN111865783B (zh) 用于计算机网络的方法和网络设备
KR101457317B1 (ko) 라우팅 정보 업데이트의 우선 순위 지정
CN113452610B (zh) 跨城域网的无缝端到端分段路由的方法及区域边界路由器
EP3754914B1 (en) Class-based traffic engineering in an ip network
EP3975489A1 (en) Label deduction with flexible-algorithm
US20190334814A1 (en) Path establishment method and device, and network node
WO2023071359A1 (zh) BGP-intent路由的接收方法和BGP-intent路由的通告方法
CN107786439B (zh) 跨域路由方法、控制器、系统及路由方法和域内路由器
WO2021179935A1 (zh) 路由确定方法、装置和网络设备
CN110650088B (zh) 环形网络上点到多点隧道的资源预留技术
WO2023036087A1 (zh) 路由通告方法、路径建立方法、业务数据的传输方法、自治系统边界路由器
US20240056359A1 (en) Automated Scaling Of Network Topologies Using Unique Identifiers
CN117014356A (zh) 路由通告消息的处理方法、装置、存储介质及电子装置

Legal Events

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

Ref document number: 22885259

Country of ref document: EP

Kind code of ref document: A1