Method and system for configuring an autonomous system

The method optimizes path extensions in autonomous systems to reroute traffic to geographically closer routers, addressing interface saturation efficiently and preventing secondary saturations by minimizing reconfigurations.

FR3148695A1Inactive Publication Date: 2024-11-15ORANGE SA
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
FR2023004720
Authority / Receiving Office
FR · FR
Patent Type
Applications
Current Assignee / Owner
Filing Date
2023-05-12
Publication Date
2024-11-15
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

Existing methods for addressing interface saturation in autonomous systems are inefficient due to the high complexity and combinatorics involved in reconfiguring the 'AS Path' attribute, leading to potential secondary saturations and difficulty in choosing appropriate prefixes for traffic rerouting.

Method used

A method and system that optimize the extension of paths associated with prefixes on target routers within an autonomous system, ensuring traffic is rerouted to geographically closer routers, using an objective function to minimize reconfigurations and maintain traffic below saturation thresholds, implemented through an integer linear program.

Benefits of technology

Effectively rebalances load within the autonomous system by minimizing router reconfigurations and preventing secondary saturations, ensuring no ingress router exceeds saturation thresholds.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 00000000_0000_ABST
    Figure 00000000_0000_ABST
Patent Text Reader

Abstract

This method for configuring a first autonomous system (AS2) in a transit network comprises: - a step (E20) of obtaining information that the traffic received by an ingress router (REj) of said first autonomous system (AS2) is saturated; - a step (E40) of determining a prefix (i) of a destination subnet (SRDi) of a second autonomous system (AS3) downstream of said first autonomous system (AS2); - a step (E50) of lengthening the path associated with said prefix (i) on at least one target router (REk) of said first autonomous system (AS2); said prefix and said at least one target router REk being determined by optimizing an objective function (FOBJ) such that the path associated with said prefix must be lengthened for all ingress routers of the first autonomous system (AS2) that are geographically closer to the saturated router (REj) than said target router (REk). Fig. 2
Need to check novelty before this filing date? Find Prior Art

Description

Title of the invention: Method and system for configuring an autonomous system Previous technique

[0001] The invention is situated in the context of a transit network. It relates more particularly to a method and a system for rebalancing the load in an autonomous system (AS) when it is detected that one of its input interfaces is saturated.

[0002] Equivalently, the expressions "input interface" or "input router" will be used.

[0003] In a known manner, such an ingress router receives, from one or more egress routers of an autonomous system called "upstream", traffic comprising packets, and routes each of these packets, from their destination IP address, to a destination subnet of an autonomous system called "downstream".

[0004] It is recalled that the IP addresses of the equipment in the same destination subnet belong to the same address range called a "prefix".

[0005] It is also recalled that these transit networks use the BGP protocol (in English, Border Gateway Protocol) to exchange routing and network accessibility information (called prefixes) between autonomous systems.

[0006] The BGP protocol defines, in particular, an eBGP (Exterior BGP) operating mode used between two autonomous systems (AS). This protocol defines messages, each associated with a certain number of attributes.

[0007] For example, once the eBGP connection is established between the ingress router of a first autonomous system and an egress router of a second upstream autonomous system, the ingress router communicates to the egress router: - information on the destination networks it knows and for which it offers transit, as well as - that a number of attributes associated with these networks help to avoid loops. It is up to the egress routers of the second upstream autonomous system to choose an ingress router of the first autonomous system that offers the best route to a destination subnet.

[0008] In particular, when several routes are possible to the same destination subnet, the BGP protocol allows a router to determine the best route to use and to advertise it to its neighboring routers.

[0009] To this end, the protocol defines an "AS Path" attribute which includes an ordered list of autonomous systems traversed to reach a subnetwork of destination. All other things being equal, the BGP protocol chooses the route with the shortest "AS Path" attribute.

[0010] It is common for some input interfaces to be saturated but not others.

[0011] In the current state of the art, a solution to try to get out of this The saturation situation involves reconfiguring the saturated inbound router by expanding the list of the "AS Path" attribute associated with a destination subnet, or prefix. The egress routers of the second upstream autonomous system then redirect the traffic destined for that prefix to another inbound router.

[0012] However, the large number of prefixes and the combinatorial nature of the problem make it very difficult to choose the prefixes whose paths should be lengthened. Indeed, a chosen prefix can cause saturation on an ingress router; it is then necessary to choose new prefixes on this ingress router, which can lead to further saturation elsewhere, and so on.

[0013] The invention relates to a method and a configuration system which does not have these drawbacks. Object and summary of the invention

[0014] Thus, and according to a first aspect, the invention relates to a method for configuring a first autonomous system in a transit network, this method comprising: - a step of obtaining information that the traffic received by an ingress router of the first autonomous system is saturated, said traffic being received from at least one egress router of a second autonomous system upstream of said first autonomous system; - a step of determining a prefix of a destination subnetwork of a third autonomous system downstream of said first autonomous system, at least part of said traffic being destined for equipment of said destination subnetwork; - a step of lengthening the path associated with said prefix on at least one target router among the ingress routers of said first autonomous system; said prefix and said at least one target router being determined by optimizing an objective function subject to at least these constraints, according to which: (i) for any ingress router of the first autonomous system, the ingress traffic of said router is below a saturation threshold; and (ii) the path associated with said prefix must be lengthened for all ingress routers of the first autonomous system that are geographically closer to the saturated router than said target router.

[0015] Correspondingly, the invention relates to a configuration system for a first autonomous system in a transit network, this system comprising: - an optimization unit configured to obtain information that the traffic received by an ingress router of a first autonomous system is saturated, said traffic being received from at least one egress router of a second autonomous system upstream of said first autonomous system; - said optimization unit being configured to determine a prefix of a destination subnet of a third autonomous system downstream of said first autonomous system, at least a portion of said traffic being destined for equipment of said destination subnet; - a control unit configured to lengthen the path associated with said prefix on at least one target router among the ingress routers of said first autonomous system; said prefix and said at least one target router being determined by said optimization unit by optimizing an objective function subject to at least these constraints, according to which: (i) for any ingress router of the first autonomous system, the ingress traffic of said router is below a saturation threshold; and (ii) the path associated with said prefix must be lengthened for all ingress routers of the first autonomous system that are geographically closer to the saturated router than said target router.

[0016] In accordance with the second constraint, the path associated with the determined prefix is ​​at least lengthened on the saturated router and possibly on at least one other target router.

[0017] The invention assumes that lengthening a path associated with a prefix on a given router results in the exit routers of the second upstream autonomous system moving the traffic associated with that prefix to the interface geographically closest to that given router, this movement resulting in a load rebalancing within the first autonomous system.

[0018] According to the invention, the prefix is ​​determined by optimizing an objective function subject to constraints, one constraint imposing that the path associated with the prefix must be lengthened for all ingress routers of the first autonomous system that are geographically closer to the saturated router than the target router.

[0019] In a particular embodiment, the lengthening of the path associated with the prefix on at least one of said target routers comprises: - a reconfiguration of the target router's routing table by adding at least one autonomous system to an AS-Path attribute of the BGP protocol; and - sending said attribute to at least one exit router of said second upstream autonomous system.

[0020] In one embodiment of the invention, the optimization of the objective function consists of minimizing the number of input routers to be reconfigured.

[0021] In other embodiments of the invention, the optimization of the function

[0022] The objective may, for example, consist of minimizing the number of prefixes whose path is lengthened, or minimizing the load on the most heavily loaded interface. The objective function can also be a linear combination of one or more of these optimization functions (minimizing the number of routers, the number of prefixes whose path is lengthened, the load of the busiest interface, ...). In one embodiment: - The objective function is a linear function of the form: Min jZj - and the constraints are expressed linearly in the form: CST1: £ xijk- 1 Viel, VjeJ CST2: xijk + y. < 1 V ie I, V js J, V ke J CST3: Vz Yiel, vkeL v,eT CST5: J,-,-Z / yi^I, in which: - cmax is a saturation threshold and bj is the maximum throughput supported by the REj router; - pijt is a traffic spike associated with the prefix i on the interface j during a time range t; - Lj is an ordered list of the ingress routers of the first autonomous system from the closest to the furthest from the saturated router REj; - L(j,k) is a sublist of Lj comprising the ingress routers of the first autonomous system (AS2) that are geographically closer to the saturated router (REj) than said target router (REk); - xijk is a binary decision variable equal to 1 if the traffic associated with the prefix i is routed from a router REi to a router REj, 0 otherwise; - yy is a binary decision variable equal to 1 if the path associated with the prefix i is lengthened on an ingress router REj, 0 otherwise; - Zj: binary decision variable equal to 1 if the ingress router REi is reconfigured, 0 otherwise.

[0023] In this embodiment, the method implements an integer linear program (ILP), particularly suited for optimization problems with high combinatorics, the ILP being solved in order to obtain a solution that offers a guarantee of optimality on the number of routers to be reconfigured.

[0024] The invention also relates to a computer program comprising instructions for executing the following steps when said program is executed by a computer. - obtaining information that the traffic received by an ingress router of a first autonomous system is saturated, said traffic being received from at least one exit router of a second autonomous system upstream of said first autonomous system;

[0025] - determination of a prefix of a destination subnet of a third system autonomous downstream of said first autonomous system, at least part of said traffic being destined for equipment of said destination subnetwork;

[0026] - sending an instruction to lengthen the path associated with said prefix by at least a target router among the ingress routers of said first autonomous system;

[0027] said prefix and said at least one target router being determined by optimizing an objective function in compliance with at least these constraints, according to which:

[0028] (i) for any ingress router of the first autonomous system, the ingress traffic of said The router is below a saturation threshold; and

[0029] (ii) the path associated with said prefix must be lengthened for all ingress routers of the first autonomous system that are geographically closer to the saturated router than said target router.

[0030] This program may use any programming language, and be in the form of source code, object code, or code intermediate between source code and object code, such as in a partially compiled form, or in any other desirable form.

[0031] The invention also relates to a computer-readable information carrier containing instructions for a computer program as described above. The information carrier can be any entity or device capable of storing the program. For example, the carrier can include a storage means, such as a ROM, non-volatile flash memory, or a magnetic recording means, such as a hard drive. Alternatively, the information carrier can be a transmissible medium, such as an electrical or optical signal, which can be transmitted via an electrical or optical cable, by radio, or by other means. The program according to the invention can, in particular, be uploaded to a network such as the Internet. Alternatively, the information carrier can be an integrated circuit in which the program is incorporated, the circuit being adapted to execute or to be used in the execution of the process in question. Brief description of the drawings

[0032] Other features and advantages of the present invention will become apparent from the description below, with reference to the accompanying drawings which illustrate non-limiting examples of embodiments. In the figures:

[0033] [Fig-1] Fig. 1 illustrates an example of the implementation of a balancing system of load conforming to a particular embodiment of the invention. ;

[0034] [Fig.2] Fig.2 represents the main steps of a configuration process conforming to an embodiment of the invention. Description of the implementation methods

[0035] Fig. 1 illustrates in detail an example of the implementation of a load balancing system 100 according to the invention.

[0036] In the embodiment described here, the load balancing system 100 comprises a DC collection unit, an OPT optimization unit and a CTR controller.

[0037] In the embodiment of [Fig. 1], these three entities are separate. Alternatively, at least two of them can be integrated into the same equipment. They can be co-located or connected to each other by a network of any kind.

[0038] In the example described here, a first autonomous system AS1 has three output routers RS1, RS2, RS3, and a second autonomous system AS2, upstream of the first autonomous system AS1, has three input routers RE1, RE2, RE3.

[0039] In the example described here, each output router RSi is connected with the input router REi (of the same index).

[0040] Furthermore, in the example of [Fig. 1], the RSI exit router is connected within the autonomous system AS1 to the AS2 exit router, which is itself connected to the RS3 exit router. The RSI exit router therefore has two possibilities for sending a packet to the destination subnet SRD1:

[0041] - either route this packet to the REI ingress router,

[0042] - evening the router to the RS2 output router, which in turn can either route it to the input router RE2, either to output router RS3, the latter then routing it to input router RE3.

[0043] In the embodiment described here, it is assumed that the three ingress routers REI, RE2, RE3 of the autonomous AS2 system are located respectively in Paris, London and Amsterdam.

[0044] In the example described here, the autonomous AS3 system comprises two destination subnets SRD1, SRD2 and other destination subnets not shown.

[0045] Each of these autonomous ASi systems further comprises a set Ei of routers R.

[0046] The addresses of the equipment in the same destination subnet have the same prefix.

[0047] For example: - the destination subnet SRD1 contains the IP address range 10.0.0.0 to 10.0.0.255, and its prefix can be noted as 10.0.0.0 / 24; and - The destination subnet SRD2 contains the IP address range 20.0.0.0 to 20.0.0.255, and its prefix can be noted as 20.0.0.0 / 24.

[0048] In accordance with the BGP protocol, each ingress router of the first autonomous system AS2 maintains a routing table, which includes, for each destination subnet to which it can route traffic, an AS-Path attribute that lists the autonomous system(s) a packet must traverse to reach that subnet. For example, the routing table of the ingress router RE1 contains two records:

[0049] SRD1: AS-Path: AS2, AS3

[0050] SRD2: AS-Path: AS2, AS3

[0051] In accordance with the BGP protocol, the ingress router RE1 (respectively RE2, RE3) notifies the egress router RS1 (respectively RS2, and RS3) of the autonomous system AS1 that it is capable of routing traffic to the destination subnets SRD1 and SRD2. This message contains information from its routing table, and in particular, the distance between the routers and the destination subnets. This distance is specific to the operation of IP routing and does not correspond to a geographical distance. To distinguish it from a geographical distance, this distance will be called the "routing distance."

[0052] As an example, the ingress router RE1 sends two messages of type UPDATE(SRD1, AS2, AS3) and UPDATE(SRD2, AS2, AS3) to the egress router RS1 to indicate that it can route traffic to the destination subnet SRD1 (respectively SRD2) and that it is within a routing distance of two autonomous systems (in this case AS2, AS3) of the destination subnet SRD1 (respectively SRD2).

[0053] In the embodiment described here, the input router RE2 (respectively RE3) makes the same announcements to the output router RS2 (respectively RS3).

[0054] Fig. 2 represents the main steps of a configuration process according to an embodiment of the invention.

[0055] The balancing process includes a general step E10 of collecting data representative of the traffic received inbound by the inbound routers RE1, RE2, RE3 of the autonomous system AS2.

[0056] If data collection cannot be done simultaneously on all prefixes, it can be done in time slots by groups of prefixes.

[0057] In the embodiment described here, this data makes it possible, in particular, to determine: - the peak throughput, in other words the maximum throughput, at the input of an ingress router over a time range; and - the peak throughput corresponding to the packets of a destination SRDi subnet, in other words to the traffic associated with a given prefix during a time range.

[0058] In the embodiment described here, we will consider two time ranges, at knowing, for example, in the morning and in the evening.

[0059] The notations used below are introduced by way of an example.

[0060] In the embodiment example described here, we consider 2 destination subnets SRD1, SRD2, denoted SRDi, namely 2 prefixes i = 1 to 2.

[0061] In the embodiment described here, the system comprises 3 ingress routers RE1, RE2, RE3, in other words 3 interfaces j = 1 to 3.

[0062] In the embodiment example described here, two time ranges t = 1 to 2 are considered.

[0063] We denote pijt the peak of traffic associated with the prefix i on the interface j during the time range t.

[0064] To illustrate the description, we assume that the nominal situation is that of table Tl in the appendix.

[0065] For example, for router RE1, interface j=l, located in Paris: - the maximum morning throughput (t=l) to the SDR1 subnetwork (prefix i=l), noted pm, is 3 Gbps; - the maximum morning throughput (t=l) to SDR2 (i=2), noted p2n, is 2 Gbps; - the maximum throughput in the evening (t=2) to SDR1 (i=l), noted pn2, is 6 Gbps; - the maximum throughput in the evening (t=2) to SDR2 (i=2), noted p2i2, is 4 Gbps.

[0066] We denote DTjt, the maximum cumulative flow rate on interface j during the time range t.

[0067] We denote Cj, the load on interface j, defined as the ratio between the maximum throughput over one or more time ranges and the maximum throughput bj supported by this interface (assumed to be equal to 100 Gbps for all the interfaces below).

[0068] In the example of table Tl, the maximum morning throughput (t=l) at interface 1 (router RE1), denoted DTn, is considered to be 80 Gbps; and that in the evening, this maximum throughput is DT[2 = 93 Gbps. The load Ci of router RE1 is therefore 93%.

[0069] The configuration process includes a step E20 to determine whether the incoming traffic of an ingress router REj of the autonomous system AS2 is saturated. In the embodiment described here, this determination is performed by comparing the load of router REj with a saturation threshold cmax.

[0070] In the example described here, the saturation threshold cmax is equal to 90%.

[0071] In the example in table Tl, the ingress router RE1 (or interface 1) is determined to be saturated, because Ci (93%) is greater than cmax.

[0072] When an ingress router REj is determined to be saturated, the result of the E20 test is positive.

[0073] The invention proposes to rebalance the load by lengthening the path associated with a prefix on this saturated router, the invention assuming that when an exit router of the autonomous system AS1 learns that the path associated with a prefix is lying on an ingress router REj, it moves the traffic associated with that prefix to the ingress router REk of the autonomous AS2 system geographically closest to REj.

[0074] Table TD in the appendix shows the geographical distances between Paris (PAR), London (LON) and Amsterdam (AMS).

[0075] For an ingress router REj, in other words for an interface j, we denote Lj the ordered list of ingress routers REk (interfaces k), from the closest to the furthest from interface j.

[0076] In this example: L1 = {1, 2, 3], L2 = {2, 1, 3], L3 = {3, 2, 1}.

[0077] In one embodiment of the invention, to lengthen the path associated with a prefix i on an ingress REk router (interface k), we reconfigure this REk router by adding to the AS PATH attribute of the BGP protocol an autonomous system in the list of autonomous systems to traverse to reach the destination SRDi subnet associated with this prefix.

[0078] For example, in the example described here, to lengthen the path associated with the prefix i=l on the ingress router RE1, the routing table record of the ingress router RE1 associated with this prefix can be modified:

[0079] SRDI: AS-Path: AS2, AS2, AS3

[0080] This configuration can be performed by the CTR controller.

[0081] In accordance with the BGP protocol, the ingress router REi whose routing table has been modified announces this reconfiguration to the upstream egress router to which it is connected.

[0082] In this example, the ingress router REI sends two messages of type UPDATE(SRD1, AS2, AS2, AS3) to the egress router RS1.

[0083] The exit router RS1 becomes aware of this attribute change and chooses to route the traffic associated with the destination subnet SRDi (for example here SRDI) to another ingress router of the autonomous system AS2 offering a shorter BGP route to this destination subnet.

[0084] Indeed, in the diagram of [Fig.1], the output router RS1 has two possibilities for sending a packet to the destination subnetwork SRDI:

[0085] - either route this packet to the REI ingress router that advertised the route AS2, AS2, AS3 (routing distance equal to 3 AS),

[0086] - either route this packet to the RS2 output router which routes it to the router RE2 entry which advertised the route AS2, AS2 (routing distance equal to 2 AS)

[0087] In this example, he will then choose the second option which is the shortest.

[0088] Taking up the example of the table Tl again, we detail below the effect of lengthening the path associated with the prefix i=l, then with the prefix i=2. Path lengthening associated with the prefix i=l

[0089] Table T2 in the Annex thus illustrates the input rates of each of the input routers RE1, RE2, RE3 assuming that the path associated with the prefix i=l is lengthened on router RE1.

[0090] In accordance with the invention, it is assumed that this path lengthening has the effect that the traffic associated with the prefix i=l will be moved to the geographically closest interface, i.e. RE2 (see list Ll). Therefore, if this is the case: - the pm throughput associated with the prefix i=l at the input of the interface j=l for the time range t=l becomes 0, all associated traffic being routed on interface 2; the total throughput DT h is reduced by 3 Gbps; - the pi2i throughput associated with the i=l prefix at the j=2 interface input, which was 10 Gbps in the t = 1 range, is increased by 3 Gbps and becomes 13 Gbps; the total DT2i throughput is also increased by 3 Gbps; - the p112 throughput associated with the prefix i=l at the ingress of the interface j=l for the time range t=2 becomes 0, all associated traffic being routed on interface 2; the total throughput DT 12 is reduced by 6 Gbps; the load Ci on interface 1 is then 87%, below the cmax threshold; - the pm throughput associated with the i=l prefix at the j=2 interface, which was 20 Gbps in the t=2 range, is increased by 6 Gbps and becomes 26 Gbps; the total DT22 throughput at the RE2 router is also increased by 6 Gbps and becomes 94 Gbps.

[0091] It is observed that the load C2 of the ingress router RE2 of 94% then exceeds the saturation threshold Cmax.

[0092] It is now assumed that the path associated with the prefix i=l is also lengthened on the ingress router RE2 and that this path lengthening has the effect that the traffic associated with the prefix i=l will be moved to the interface geographically closest to RE2, i.e. to RE3 (see list Ll).

[0093] Table T3 in the Annex illustrates the input throughput of each of the ingress routers RE1, RE2, RE3, assuming that the throughput associated with the prefix i=l is extended on routers RE1 and RE2 and is therefore routed on the ingress router RE3. In particular: - the throughput pi2i associated with the prefix i=l at the input of interface j=2 for the time range t=l becomes 0, all associated traffic being routed on interface 3; the total throughput DT h is reduced by 13 Gbps; - the pBi rate associated with the prefix i=l at the input of the interface j=3 which was 2 Gbps in the range t = 1 is increased by 13 Gbps and becomes 15 Gbps; the total DT3[ rate is also increased by 13 Gbps; - the pm throughput associated with the prefix i=l at the ingress of interface j=2 for the time range t=2 becomes 0, all associated traffic being routed on interface 3; the total throughput DT 22 is reduced by 26 Gbps; the load Ci on interface 2 is then 70%, below the cmax threshold; - the pi32 throughput associated with the i=l prefix at the j=3 interface, which was 2 Gbps in the t=3 range, is increased by 26 Gbps and becomes 28 Gbps; the total DT32 throughput at the RE2 router is also increased by 26 Gbps and becomes 96 Gbps.

[0094] It is observed that the C3 load of the ingress router RE3 of 94% exceeds the saturation threshold cmax of 90%.

[0095] In this example, it is not possible to route incoming traffic to another ingress router of the autonomous AS2 system.

[0096] Consequently, lengthening the paths associated with the prefix i=l on the input routers RE1, RE2 does not prevent the saturation phenomenon addressed by the invention. Lengthening of the path associated with the prefix i=2

[0097] Table T4 in the Appendix illustrates the inbound throughput of each of the inbound routers RE1, RE2, RE3, assuming that the path associated with the prefix i=2 is extended on router RE1, and that this traffic is routed to the inbound router RE2. In particular - the p2n throughput associated with the prefix i=2 at the input of the interface j=l for the time range t=l becomes 0, all associated traffic being routed on interface 2; the total throughput DT h is reduced by 3 Gbps; - the p22i throughput associated with the i=2 prefix at the j=2 interface input, which was 3 Gbps in the t = 1 range, is increased by 2 Gbps and becomes 5 Gbps; the total DT2[ throughput is also increased by 2 Gbps; - the p2!2 throughput associated with the prefix i=2 at the ingress of interface j=l for the time range t=2 becomes 0, all associated traffic being routed on interface 2; the total throughput DT i2 is reduced by 4 Gbps; the load Ci on interface 1 is then 89%, below the cmax threshold; - the p222 throughput associated with the i=2 prefix at the j=2 interface, which was 3 Gbps in the t=2 range, is increased by 4 Gbps and becomes 7 Gbps; the total DT22 throughput at the RE2 router is also increased by 4 Gbps and becomes 92 Gbps.

[0098] It is observed that the load C2 of the ingress router RE2 of 92% exceeds the saturation threshold Cmax of 90%.

[0099] It is now assumed that the path associated with the prefix i=2 is also lengthened on the ingress router RE2 and that this path lengthening has the effect that the traffic associated with the prefix i=2 is moved to the interface that is geographically closest to RE2, i.e. to RE3.

[0100] Table T5 in the Appendix illustrates the input throughput of each of the ingress routers RE1, RE2, RE3, assuming that the throughput associated with the prefix i=2 is extended on routers RE1 and RE2 and routed on ingress router RE3. In particular: - the p22[ rate associated with the i=2 prefix at the j=2 interface input for the range of time t=l becomes 0, all associated traffic being routed on interface 3; the total throughput DT 2i is reduced by 5 Gbps; - the p23i throughput associated with the i=2 prefix at the j=3 interface, which was 5 Gbps in the t = 1 range, is increased by 5 Gbps and becomes 10 Gbps; the total DT31 throughput is also increased by 5 Gbps; - The p222 throughput associated with the i=2 prefix at the j=2 interface for the t=2 time range becomes 0, with all associated traffic being routed to interface 3; the total DT22 throughput is reduced by 7 Gbps; the C2 load on interface 2 is then 85%, below the ^max threshold. - the p232 throughput associated with the prefix i=2 at the input of interface j=3 which was 5 Gbps in the range t = 2 is increased by 7 Gbps and becomes 12 Gbps; the total DT32 throughput at the input of router RE2 is also increased by 7 Gbps and becomes 77 Gbps; the C3 load on interface 2 is then 85%, below the cmax threshold.

[0101] It is observed that this load rebalancing by lengthening the path associated with the prefix i=2 on the routers RE1 and RE2 leads to a situation in which none of the ingress routers RE1, RE2, RE3 is saturated.

[0102] Very advantageously, the configuration method according to the invention makes it possible to automatically determine a prefix (step E40) and the ingress routers of the autonomous AS2 system on which the paths associated with this prefix must be lengthened (step E50) so that the traffic is rebalanced so that none of these ingress routers is saturated.

[0103] In accordance with the invention, this determination is carried out by optimizing an objective function FOBJ in compliance with a set of constraints.

[0104] In the embodiment described here, the optimization of the objective function FOBJ consists of minimizing the number of ingress routers (or interfaces) to be reconfigured.

[0105] In the embodiment described here, the optimization function respects 5 constraints: - the first constraint CST1 requires that traffic associated with a prefix i is routed on one and only one ingress router; - the second constraint CST2 prohibits triggering the routing of traffic associated with a prefix i to an ingress router REk while lengthening the path associated with that prefix on that ingress router; - the third CST3 constraint requires that if the traffic associated with a prefix i is switched from an ingress router REj to an ingress router REk, then the path associated with this prefix must be lengthened on all ingress routers classified between these two routers REj (inclusive) and REk (exclusive) in the list Lj; - The fourth constraint, CST4, imposes that, regardless of the time range t, the total incoming traffic on an ingress router REj must not exceed the threshold of saturation Cmax; and - The fifth constraint, CST5, requires that if at least one path associated with a prefix is ​​lengthened on an ingress router, then that ingress router must be reconfigured.

[0106] In one embodiment of the invention, this optimization is implemented by the execution of a linear program, the objective function and the constraints being expressed as linear functions with respect to decision variables.

[0107] In one embodiment, the following notations are introduced:

[0108] pijt: peak traffic associated with prefix i on interface j during a time range t.

[0109] Lj: ordered list of ingress routers of the first autonomous system from closest to furthest from the saturated router REj.

[0110] L(j,k): sublist of Lj comprising the ingress routers of the first autonomous system that are geographically closer to the saturated router REj than said target router REk.

[0111] xijk: binary decision variable equal to 1 if the traffic associated with prefix i is rerouted from interface j to interface k, 0 otherwise;

[0112] yy is a binary decision variable equal to 1 if the prefix ia its extended path on interface j, 0 otherwise.

[0113] Zj is a binary decision variable equal to 1 if interface j is reconfigured, 0 otherwise.

[0114] The following notations are introduced:

[0115] Cm“x is a saturation threshold and bj is the maximum throughput supported by the REj router.

[0116] xijk is a binary decision variable equal to 1 if the traffic associated with the prefix i is routed from router REi to router REj, 0 otherwise; yy is a binary decision variable equal to 1 if the path associated with the prefix i is lengthened on an ingress router REj, 0 otherwise; Zj is a binary decision variable equal to 1 if the ingress router REi is reconfigured, 0 otherwise.

[0117] With these notations: - The objective function of FOBJ, which consists of minimizing the number of ingress routers (or interfaces) to be reconfigured, is expressed as follows: FOBJ:MinV z JtJ J - The 5 constraints CST1 to CST5 are expressed as follows: Vid, VjeJ CST2: xijk + < 1 ViefVjeJ, VkeJ CST3: < y,] V i^I, V k^J, VL(j, CST4 VkeJ, VieT CST5: yt; — zj V iel, \ / I J

[0118] In one embodiment of the invention, the optimization of the objection function FOBJ under compliance with the linearized CST1 to CST5 constraints as above can for example be implemented by a CPLEX solver version 12.56 published by IBM (registered trademark), or by a CBC solver (for Coin-or Branch and Cut in English) distributed at https: / / www.coin-or.org / Cbc.

[0119] The optimization process provides the prefix i and the interfaces j (or ingress routers REj) for which the path associated with this prefix i must be lengthened.

[0120] In the embodiment described here, and as mentioned previously, the lengthening of a path associated with an i prefix on an ingress router REk (step E50) involves:

[0121] - a reconfiguration of this router by adding at least one standalone system to a AS-Path attribute of the BGP protocol; and

[0122] - sending said attribute to the egress routers of the upstream autonomous system.

[0123] In the embodiment described here, with reference to [Fig. 1], the OPT optimization unit has the hardware architecture of a computer. It includes, in particular, a processor 10, a random access memory 11, a read-only memory 12, and communication means 13.

[0124] The read-only memory 12 constitutes a recording medium within the meaning of the invention. It includes a computer program PG according to the invention.

[0125] This computer program PG includes instructions for performing the following steps when said program is run by a computer. - obtaining, from the DC collection device, information indicating that the traffic received by an ingress router of a first autonomous system is saturated; - determination of a prefix for a destination subnetwork of an autonomous system downstream of said first autonomous system;

[0126] - sending an instruction to lengthen the path associated with said prefix by at least a target router among the ingress routers of said first autonomous system.

[0127] This instruction can for example be sent to the CTR controller so that it lengthens the path associated with the i prefix on an ingress router of the autonomous system.

[0128] In a particular embodiment, the computer program PG implements the integer linear program PLNE described above to determine the prefix and routers to be reconfigured. APPENDIX

[0129] Table Tl: Pyt (Gbps) interface j = 1 interface j = 2 interface j = 3 Time range t = 1 prefix i = 1 Pin — 3 P121 —10 Pbi —2 prefix i = 2 P211 = 2 P221 =3 P231 =5 DTji DTn = 80 DT21 = 80 DT31 = 80 Time range t = 2 prefix i = 1 Pi 12 = 6 P122 =20 P132 =2 prefix i = 2 P212 = 4 P222 =3 P232 =5 dtj2 DT12 = 93 DT22 = 88 DT32 = 70 Charge Cj Ci = 93% C2 = 88% C3 = 80%

[0130] Table T2: Pyt (Gbps) interface j = 1 interface j = 2 interface j = 3 Time range t = 1 prefix i = 1 P111 = 0 P121 = 13 P131 = 2 prefix i = 2 P211 = 2 P221 = 3 P231 = 5 DTj! DTn = 77 DT2i = 83 DT3i = 80 Time range t = 2 prefix i = 1 Pi 12 = 0 p 122 = 26 P132 = 2 prefix i = 2 P212 = 4 P222 = 3 P232 = 5 dtj2 DT12 = 87 DT22 = 94 DT32 = 70 Load Cj Ci = 87% C2 = 94% C3 = 80%

[0131] Table T3: pijt (Gbps) interface j = 1 interface j = 2 interface j = 3 Time range t = 1 prefix i = 1 P111 = 0 P121 = 0 P131 = 15 prefix i = 2 P211 = 2 P221 = 3 P231 = 5 DTji DTn = 77 DT2i = 70 DT3i = 93 Time range t = 2 prefix i = 1 Pi 12 = 0 P122 = 0 P132 = 28 prefix i = 2 P212 = 4 P222 = 3 P232 = 5 dtj2 DTi2 = 87 DT22 = 68 DT32 = 96 Load Cj Ci = 87% C2 = 70% C3 = 80%

[0132] Table T4: Pijt (Gbps) interface j = 1 interface j = 2 interface j = 3 Time range t = 1 prefix i = 1 Pin = 3 P121 = 10 P131 = 2 prefix i = 2 P211 = 0 P221 = 5 P231 = 5 DTji DTn = 78 DT2i = 82 DT3i = 80 Time range t = 2 prefix i = 1 Pi 12 — 6 P122 -20 P132 —2 prefix i = 2 P212 = 0 P222 = 7 P232 = 5 dtj2 DT12 = 89 DT22 = 92 DT32 = 70 Charge Cj G = 89% C2 = 92% C3 = 80%

[0133] Table T5: pijt (Gbps) interface j = 1 interface j = 2 interface j = 3 Time range t = 1 prefix i = 1 Pm = 3 P121 = 10 P131 = 2 prefix i = 2 P211 = 0 P221 = 0 P231 = 10 DTn DTn = 78 DT21 = 77 DT31 = 85 Time range t = 2 prefix i = 1 Pi 12 = 6 P122 = 20 P132 = 2 prefix i = 2 P212 = 0 P222 = 0 P232 = 12 dtj2 DT12 = 89 DT22 = 85 DT32 = 77 Load Cj Ci = 89% C2 = 85% C3 = 85%

[0134] TD Table: PAR LON AMS PAR 0 345 km 357 km LON 345 ​​km 0 355 km AMS 357 km 355 km 0

Claims

Claims

1. Method for configuring a first autonomous system (AS2) in a transit network, this method comprising: - a step (E20) of obtaining information according to which the traffic received by an input router (REj) of said first autonomous system (AS2) is saturated, said traffic being received from at least one output router (RSj) of a second autonomous system (AS1) upstream of said first autonomous system (AS2); - a step (E40) of determining a prefix (i) of a destination subnetwork (SRDi) of a third autonomous system (AS3) downstream of said first autonomous system (AS2), at least part of said traffic being intended for equipment of said destination subnetwork (SRDi); - a step (E50) of extending the path associated with said prefix (i) on at least one target router (REk) among the input routers of said first autonomous system (AS2);said prefix and said at least one target router (REk) being determined by optimizing an objective function (FOBJ) in compliance with at least these constraints (CST4, CST3), according to which: (i) for any ingress router of the first autonomous system (AS2), the ingress traffic of said router is less than a saturation threshold (cmax); and (ii) the path associated with said prefix must be lengthened for all the ingress routers of the first autonomous system (AS2) which are geographically closer to the saturated router (REj) than said target router (REk).;

2. Configuration method according to claim 1, characterized in that the extension (E50) of the path associated with said prefix (i) on at least one said target router (REk) comprises: - a reconfiguration of a routing table of said target router (REk) by adding at least one autonomous system to an AS-Path attribute of the B GP protocol; and - a sending of said attribute to at least one output router (RS) of said second upstream autonomous system (AS1).

3. Configuration method according to claim 1 or 2, characterized in that the optimization of the objective function (FOBJ) consists of minimizing the number of input routers to be reconfigured.

4. Configuration method according to claim 1 or 2, characterized in that that the optimization of the objective function (FOBJ) consists of minimizing the number of prefixes whose path is lengthened, or of minimizing the load of the most loaded interface.

5. Configuration method according to any one of claims 1 to 4, characterized in that: - said objective function (FOBJ) is a linear function of the form: Min - and in that said constraints are expressed linearly in the form: CST1: EkeJXijk = 1 V ie I, V je J CST2: Xjjk + y,k < 1 ViefVjeJ, VkeJ CST3: *k^J, Vieille} CST4: £ Cmax bk V ke J, V te T CST5:Kz <z, VJeJ dans lesquelles : - cmax est un seuil de saturation et bj est le débit maximal supporté par le routeur saturé (REj) ; - pijt est un pic de trafic associé au préfixe i sur une interface j au cours d’une plage de temps t ; - Lj est une liste ordonnée des routeurs d’entrée du premier système autonome du plus proche au plus éloigné du routeur saturé (REj) ;- L(j,k) is a sublist of Lj comprising the ingress routers of the first autonomous system (AS2) which are geographically closer to the saturated router (REj) than said target router (REk); xijk is a binary decision variable equal to 1 if the traffic associated with prefix i is routed from an ingress router (REj) to a target router (REk), 0 otherwise; yy is a binary decision variable equal to 1 if the path associated with prefix i is extended on an ingress router (REj), 0 otherwise; Zj is a binary decision variable equal to 1 if the ingress router (REj) is reconfigured, 0 otherwise.;

6. System (100) for configuring a first autonomous system (AS2) in a transit network, this system comprising: - an optimization unit (OPT) configured to obtain an in-

7. formation according to which the traffic received by an ingress router (REj) of a first autonomous system (AS2) is saturated, said traffic being received from at least one egress router (RSj) of a second autonomous system (AS1) upstream of said first autonomous system (AS2); - said optimization unit (OPT) being configured to determine a prefix of a destination subnetwork (SRDi) of a third autonomous system (AS3) downstream of said first autonomous system (AS2), at least part of said traffic being intended for equipment of said destination subnetwork (SRDi); - a control unit (CTR) configured to extend the path associated with said prefix on at least one target router (REk) among the input routers of said first autonomous system (AS2); said prefix and said at least one target router (REk) being determined by said optimization unit (OPT) by optimizing an objective function (FOBJ) in compliance with at least these constraints (CST4, CST3), according to which: (i) for any ingress router of the first autonomous system (AS2), the ingress traffic of said router is less than a saturation threshold (cmax); and (ii) the path associated with said prefix (i) must be extended for all ingress routers of the first autonomous system (AS2) which are geographically closer to the saturated router (REj) than said target router (REk). A computer program (CP) comprising instructions for performing the following steps when the program is executed by a computer: - obtaining (E20) information according to which the traffic received by an input router (REj) of a first autonomous system (AS2) is saturated, said traffic being received from at least one output router (RSj) of a second autonomous system (AS1) upstream of said first autonomous system (AS2); - determination (E20) of a prefix of a destination subnetwork (SRDi) of a third autonomous system (AS3) downstream of said first autonomous system (AS2), at least part of said traffic being intended for equipment of said destination subnetwork (SRDi); - sending an instruction to extend the path associated with said prefix (i) on at least one target router (REk) among the routers input of said first autonomous system (AS2); said prefix (i) and said at least one target router REk being determined by optimizing an objective function (FOBJ) in compliance with at least these constraints (CST4, CST3), according to which: (i) for any ingress router of the first autonomous system (AS2), the ingress traffic of said router is less than a saturation threshold (cmax); and (ii) the path associated with said prefix (i) must be extended for all ingress routers of the first autonomous system (AS2) which are geographically closer to the saturated router (REj) than said target router (REk).

8. A computer-readable recording medium on which a computer program (PG) according to claim 7 is recorded.

Citation Information

Patent Citations

  • Methods, apparatuses and computer-readable storage mediums for dynamically controlling traffic over peering links

    US20200007435A1

  • Method for optimizing traffic between autonomous systems

    US20220321477A1