CN113037629B

CN113037629B - Traffic scheduling method and system between non-direct connection autonomous systems

Info

Publication number: CN113037629B
Application number: CN201911341464.8A
Authority: CN
Inventors: 刘志华; 卢泉; 贾曼; 黄卓君
Original assignee: China Telecom Corp Ltd
Current assignee: China Telecom Corp Ltd
Priority date: 2019-12-24
Filing date: 2019-12-24
Publication date: 2022-07-12
Anticipated expiration: 2039-12-24
Also published as: CN113037629A

Abstract

The invention discloses a method and a system for scheduling traffic among non-direct connection autonomous systems, and relates to the field of IP data communication. The method comprises the following steps: when advertising an internet service route to a transit router located in a transit AS, an originating router located in a specific origin AS carries TLV (threshold value type) of a newly defined routing function advertisement attribute aiming at the internet route corresponding to traffic to be scheduled, wherein the routing function advertisement attribute comprises an AS path control attribute or a routing filtering attribute; and the transfer router analyzes the routing function advertisement attribute in the TLV and executes corresponding routing advertisement action. The method and the device can realize dynamic traffic scheduling among the non-direct connection ASs, and are favorable for realizing internet traffic balance or quality control.

Description

Method and system for scheduling traffic between non-direct-connection autonomous systems

Technical Field

The present disclosure relates to the field of IP data communications, and in particular, to a method and system for scheduling traffic between non-direct connection autonomous systems.

Background

Backhaul traffic guidance between current ASs (Autonomous systems), especially between non-direct ASs, is mainly implemented by manually configuring a routing policy, for example, setting an MED (Multi-exit identifier) attribute when a route is released or contacting a superior operator to adjust a corresponding routing attribute.

The scheme for realizing the backhaul traffic by setting the MED attribute is that when the router X belonging to the local origin AS < X > distributes a route x.x.x.x/m to a plurality of routers Y belonging to the upper level AS < Y >, the MED attributes distributed to the routes belonging to different routers of AS < Y > are respectively set to different values, for example, the MED value corresponding to the router Y1 belonging to AS < Y > is 10, and the MED value corresponding to the router Y2 belonging to AS < Y > is 20, and when the router belonging to AS < Y > accesses AS1, the router with the smaller MED value is selected to be prioritized. However, because the MED attribute is a non-transitive attribute, this method cannot control the non-direct AS route, and is generally modified or prohibited by an operator, and the manual configuration amount is large, the method is rarely used in the actual inter-AS route control of the network.

When the route from the router belonging to the far-end AS < z > to the router of the local AS < x > needs to be adjusted, at present, the backhaul traffic scheduling can be realized only by contacting the superior operator to adjust the routing policy, and the opposite person can manually adjust the attributes such AS the AS-path of the specific route by negotiating with the maintenance person in the superior operator AS < y > and adjusting the policy of the interconnection router BGP (Border Gateway Protocol). However, such a cooperation mechanism is generally not available between different AS operators, and even if the cooperation mechanism and the work flow for adjusting the routing strategy are provided, the work flow is complex and time-consuming, the efficiency is low, and the requirement that the dynamic change of the traffic needs to be adjusted and controlled in real time cannot be met.

In short, when backhaul traffic needs to be adjusted between the current non-direct-connection ASs, real-time, fast and effective traffic scheduling cannot be achieved.

Disclosure of Invention

The technical problem to be solved by the present disclosure is to provide a method and a system for traffic scheduling between non-direct connection autonomous systems, which solve the problem that traffic between non-direct connection autonomous systems cannot be flexibly guided by different transit autonomous systems, and can improve the efficiency of traffic scheduling. .

According to one aspect of the disclosure, a method for scheduling traffic between non-direct connection autonomous systems is provided, including: when an origin router located in a specific origin Autonomous System (AS) advertises an internet service route to a transit router located in the transit AS, carrying a Type Length Value (TLV) of a newly defined routing function advertisement attribute aiming at the internet route corresponding to traffic to be scheduled, wherein the routing function advertisement attribute comprises an AS path control attribute or a routing filtering attribute; and the switching router receiving the Internet service route advertised by the originating router analyzes the route function advertisement attribute in the TLV and executes corresponding route advertisement action.

In some embodiments, the AS-path-control attributes include: the transfer router belonging to the transfer AS in the AS path increasing list informs a remote router positioned in a third party AS of the route, and the AS path length should be increased; the route filtering attributes include: the transit router filters the internet traffic route to a remote router belonging to a third party AS in the route filtering list.

In some embodiments, after receiving the internet service route advertised by the originating router, the transit router advertises, to the remote router, a route that increases the path length through the transit AS according to an AS path addition list and a corresponding length value in the AS path control attribute if the routing function advertisement attribute is analyzed AS the AS path control attribute according to the TLV field.

In some embodiments, the transit router determines the number of transit ASs contained in the advertised route based on the attribute values in the TLVs.

In some embodiments, after receiving the internet service route advertised by the origin router, the transit router does not advertise the route information including the origin router to the remote router in the route filtering list belonging to the route filtering attribute if the routing function advertisement attribute is analyzed as the route filtering attribute according to the TLV field.

In some embodiments, the originating router and the transit router establish an EBGP connection, acquire an AS connection mapping relationship between the transit router and the remote router, and synchronize the AS connection mapping relationship to the controller; the controller determines a network utilization expected value according to the bandwidth and the utilization rate of each link formed by the origin router, the transit router and the far-end router, matches a prefix pair of the far-end router and the origin router according to the utilization rate and the network utilization expected value of each link and the AS connection mapping relation, and determines an AS path increasing list needing to increase the AS length and an AS path length needing to increase the AS length or determines a route filtering list needing to filter the route; the originating router generates an AS path control attribute that includes an AS path add list and an AS path length that needs to be added, or a route filter attribute that includes a route filter list.

According to another aspect of the present disclosure, a system for scheduling traffic between non-direct connected autonomous systems is further provided, including: the origin router is configured to carry a type length value TLV (type length value) of a newly defined routing function advertisement attribute aiming at an internet route corresponding to traffic to be scheduled when advertising the internet service route to a transit router positioned in a transit AS, wherein the routing function advertisement attribute comprises an AS path control attribute or a routing filtering attribute; and the transfer router is configured to analyze the routing function advertisement attribute in the TLV and execute corresponding routing advertisement action.

In some embodiments, the originating router and the transit router establish an EBGP (external border gateway protocol), acquire an AS connection mapping relationship between the transit router and the remote router, synchronize the AS connection mapping relationship to the controller, and generate an AS path control attribute according to an AS path addition list sent by the controller and an AS path length required to be added, or generate a route filtering attribute according to a route filtering list; the controller is configured to determine a network utilization expected value according to a bandwidth and a utilization rate of each link composed of the origin router, the transit router and the far-end router, match a prefix pair of the far-end router and the origin router according to the utilization rate and the network utilization expected value of each link and an AS connection mapping relation, and determine an AS path adding list needing to increase the AS length and an AS path length needing to increase, or determine a route filtering list needing to filter Internet service routes to routers belonging to a predetermined third-party AS.

According to another aspect of the present disclosure, a system for scheduling traffic between non-direct connected autonomous systems is further provided, including: a memory; and a processor coupled to the memory, the processor configured to perform a method of inter-non-direct autonomous system traffic scheduling as described above based on instructions stored in the memory.

According to another aspect of the present disclosure, a computer-readable storage medium is further provided, on which computer program instructions are stored, and when the instructions are executed by a processor, the method for traffic scheduling between non-direct autonomous systems as described above is implemented.

Compared with the prior art, in the embodiment of the disclosure, when the router is advertised to the switching router, the routing function advertisement attribute is added, and the switching router performs routing advertisement according to the routing function advertisement attribute, so that rapid and effective traffic scheduling between non-direct-connection ASs can be realized.

Other features of the present disclosure and advantages thereof will become apparent from the following detailed description of exemplary embodiments thereof, which proceeds with reference to the accompanying drawings.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description, serve to explain the principles of the disclosure.

The present disclosure may be more clearly understood from the following detailed description, taken with reference to the accompanying drawings, in which:

fig. 1 is a schematic flow diagram of some embodiments of a method for traffic scheduling between non-direct connected autonomous systems according to the present disclosure.

Fig. 2 is a schematic diagram of a router network according to the present disclosure.

Fig. 3 is a flowchart illustrating a traffic scheduling method between non-direct connected autonomous systems according to another embodiment of the disclosure.

Fig. 4 is a format schematic of a TLV of the present disclosure.

Fig. 5 is a simple case schematic of the present disclosure.

Fig. 6 is a schematic structural diagram of some embodiments of an inter-non-direct autonomous system traffic scheduling system according to the present disclosure.

Fig. 7 is a schematic structural diagram of another embodiment of a non-direct connection autonomous system traffic scheduling system according to the present disclosure.

Fig. 8 is a schematic structural diagram of another embodiment of a non-direct connection autonomous system traffic scheduling system according to the present disclosure.

Detailed Description

Various exemplary embodiments of the present disclosure will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions, and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless specifically stated otherwise.

Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description.

The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses.

Techniques, methods, and apparatus known to one of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.

In all examples shown and discussed herein, any particular value should be construed as exemplary only and not as limiting. Thus, other examples of the exemplary embodiments may have different values.

It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.

For the purpose of promoting a better understanding of the objects, aspects and advantages of the present disclosure, reference is made to the following detailed description taken in conjunction with the accompanying drawings.

The method has the advantages that the quantity of the global Internet AS is large, most of the AS can not be directly interconnected, the access flow between the AS is generally transmitted through the intermediate transit AS, the original BGP attribute routing lacks the route control measure between the non-direct connection ASs, the flow between the non-direct connection ASs is scheduled through the specific intermediate transit AS, and the problem that the flow between the non-direct connection autonomous systems can not be flexibly guided through different transit autonomous systems can be solved.

Fig. 1 is a schematic flow diagram of some embodiments of a method for traffic scheduling between non-direct autonomous systems according to the present disclosure.

In step 110, when advertising an internet service route to a transit router located in a transit AS, an originating router located in a specific originating AS carries a TLV (Type-Length-Value) of a newly defined routing function advertisement attribute for an internet route corresponding to traffic to be scheduled, where the routing function advertisement attribute includes an AS path control attribute or a route filtering attribute.

In some embodiments, AS-Path control attributes include: the transfer router belonging to the transfer AS in the AS path increasing list informs a remote router positioned in a third party AS of the route, and the AS path length should be increased; the route filtering attributes include: the transit router filters the internet traffic routes for remote routers belonging to third party ASs in the route filtering list.

In some embodiments, AS shown in fig. 2, the transit AS < Y1> -AS < yn > is a superior AS of the origin AS < X >, the origin router X (e.g., X1-1, X1-2) located at the origin AS < X > carries TLV defining a route function advertisement attribute for a route to be advertised by the transit router Y < Y1-1, Y2-1, y.e., Yi-1, y.e., Ym-1> located at the transit AS < Y1> -AS < yn >, and the information to be expressed is:

AS shown in table 1, the AS path control attribute includes: the target AS message of the added (Prepend) AS length, i.e. the AS path length that should be added when advertising the route to the remote routers Z < Z1-1, Z2-1,... Zk-1,. Zn-1> located at the third party AS < Z1> - -AS < Zn >.

TABLE 1

As shown in table 2, the route filter attributes include: the message for the route is not advertised to the target AS.

Routing prefix

Mask code

Not advertising a route to a target AS

Specific AS List

TABLE 2

In this step, the existing BGP protocol is modified, defining new BGP attributes that the originating router carries when advertising routes to routers of other domains. The AS path adding list is a prepend + n list, and the routing filtering list is a no-export AS-list.

The originating router can determine to which routers of the AS need to be advertised and added with the path length according to the prepend + n list; from the no-export AS-list, it can be determined to which AS the router to which the router is not advertised routing information containing the local router.

In step 120, the transit router receiving the internet service route advertised by the originating router parses the route function advertisement attribute in the TLV, and performs a corresponding route advertisement action.

For example, route advertisement for IPv4 NLRI:

< Prefix > p1.p1/m1< AS-path > AS < y > AS < x > # increased by 1 AS < y > length;

< Prefix > p2.p2/m2< AS-path > AS < y > AS < y > AS < y > AS < x > - # increased by 2 AS < y > lengths;

......

<Prefix>:pn.pn.pn.pn/mn

AS < y > AS < y >. As < x >. the # is increased by n AS < y > lengths.

2) Route advertisement for IPv6 NLRI:

< Prefix > p1: p1: p1: p1: p1: p1: p 1:/m 1< AS-path > AS < y > AS < x > # increased by 1 AS < y > length;

the length of 2 AS < y > is increased for < Prefix > < p2: p2: p2: p2: p2: p2: p 2:/m 2< AS-path > < AS < y > AS < y > AS < x > - #;

......

< Prefix > < pn: pn: pn: pn: pn: pn:/mn < AS-path > < AS < y > AS < y >. AS < y > AS < x >. the. # increases by n AS < y > lengths.

For example, for filtering implemented when IPv4 Prefix advertises routes to AS < z >:

Deny Prefix:k1.k1.k1.k1/m1

Deny Prefix:k2.k2.k2.k2/m2

......

Deny Prefix:kn.kn.kn2.kn/mn

for the filtering implemented when IPv6 Prefix advertises routes to AS < z >:

Deny Prefix:k1:k1:k1:k1:k1:k1:k1::/m1

Deny Prefix:k2:k2:k2:k2:k2:k2:k2::/m2

......

Deny Prefix:kn:kn:kn:kn:kn:kn:kn::/m1

in the above embodiment, when the originating router advertises a route to the transit router, the transit router adds a route function advertisement attribute, and performs route advertisement according to the route function advertisement attribute, thereby implementing fast and effective traffic scheduling between non-direct-connection ASs.

In step 310, the originating router establishes EBGP (External Border Gateway Protocol) connection with the transit router, obtains an AS connection mapping relationship between the transit router and the remote router, and synchronizes the AS connection mapping relationship to the controller. The origin router can obtain the AS connection mapping relation and the route AS path attribute of the whole network.

At step 320, the controller determines a network utilization expectation based on the bandwidth and utilization of each link comprising the origin router, the transit router, and the remote router. In some embodiments, the controller calculates the network utilization expected value according to the formula:

namely that

Where B is the bandwidth of the interconnecting link between the origin router X at the origin AS < X > and the transit router Y at the transit AS < Y >, and U is the link utilization.

In step 330, the controller matches the prefix pairs of the remote router and the origin router according to the utilization rate of each link, the expected value of the network utilization rate and the AS connection mapping relationship, and determines an AS path adding list and an AS path length which need to be added for adding the AS length, or determines a route filtering list which needs to be route filtered.

For AS<x>--AS<y>U space utilization ratio_L(X-Yi)Links that exceed the utilization expectation e (u) by more than a certain threshold Delta range (e.g., 5%) should have their traffic reduced during traffic balancing scheduling. At this time, the far-end AS is collected and analyzed based on the flow direction of the link<z>To the origin AS<x>The advertised routing entry traffic matrix tm (traffic m) is counted and ordered in sequence:

1) IPv4 traffic matrix calculation

Source: AS<z>Polymerisation	AS<x>Per route Prefix aggregation	Data packet/s	Rate of speed
				AS<z1>	p1.p1.p1.p1/m1	pps	bps
...	...	...	...
				AS<zi>	pi.pi.pi.pi/mi	pps	bps
...	...	...	...
				AS<zn>	p1.p1.p1.p1/m1	pps	bps

TABLE 3

2) IPv6 traffic matrix calculation

Source: AS<z>Polymerisation	AS<x>Aggregation per routing Prefix	Data packet/s	Rate of speed
				AS<z1>	p1:p1:p1:p1:p1:p1:p1:/m1	pps	bps
...	...	...	...
				AS<zi>	pi:pi:pi:pi:pi:pi:pi:/m1	pps	bps
...	...	...	...
				AS<zn>	pn:pn:pn:pn:pn:pn:pn:/mn	pps	bps

TABLE 4

By analyzing and aggregating the flow direction of the traffic, an AS < z > - -AS < x > Prefix (Prefix) pair matched with the deviation value of the link utilization rate can be obtained, so that the AS-Path length of which routes need to be increased can be determined, and meanwhile, the specific numerical value of the number n of ASs which need to be increased is determined according to the AS-Path conditions of all the routes in each AS < yi >.

In this step, specific values of the AS to be added that satisfy the < AS, local Prefix > entry of the traffic scheduling target are determined.

At step 340, the origin router generates an AS path control attribute that includes an AS path increment list and the AS path length that needs to be incremented, or a route filter attribute that includes a route filter list.

At step 350, the originating router carries a TLV defining a routing function advertisement attribute when advertising a route to the transit router. A prepend + n list or a no-import AS-list is included in the TLV.

As shown in fig. 4, the TLV includes an attr.type field including an attr.flags field and an attr.type Code field, an attr.length field and an attr.value field. Flags field takes one byte, represents the flag of the attribute, and the meaning of each bit thereof is as follows.

O has a value of 1, denoted as optional attribute; t has a value of 1, denoted as transitive property; the value of P is 1, which indicates optional transitivity; the value of E is 0, and no expansion is needed; when the value of A is 0, the AS number is expressed AS2 bytes, and when the value of A is 1, the AS number is expressed AS4 bytes; when the value of N is 0, the route is not announced to a certain AS, and when the value of N is 1, the superposed AS is represented; u is the low 2 position and is not used.

Type Code takes 1 byte, indicates the type number of the attribute, for example, is set to 17, and represents a new attribute. When the N bit in attr.flags is 0, attr.value indicates that no route is advertised to the router belonging to the AS corresponding to the value; value represents the number of nodes that superimpose the value the number of times when advertising a route outward, when N is 1. And the transfer router determines the number of transfer AS contained in the advertised route according to the attribute value in the TLV.

In step 360, the transit router analyzes the TLV attribute carried by the router, if carrying a prepend + n list, step 370 is executed, and if carrying a no-export AS-list, step 380 is executed.

At step 370, the transit router adds a path length route through its own affiliated AS to a remote router located at the third party AS. Wherein, it is determined to add several ases to which the own is affiliated according to the attribute value, for example, if n is 2, the AS is added twice in the AS path.

At step 380, the transit router does not advertise to remote routers belonging to third party ases in the no-import AS-list that include the routing information of the originating router.

In the above embodiment, the originating router may autonomously adjust a new attribute of the route, determine to which end AS the overlay path length needs to be advertised, or not advertise the route to a router belonging to which AS, and may autonomously adjust the backhaul traffic in real time without communicating with the upper operator.

In one embodiment, AS shown in fig. 5, the originating AS is a local AS, the transit AS is a superior operator AS of the originating AS, and the third party AS is a remote AS of the local AS. The routers belonging to the local AS1 advertise a segment of x.x.x.x route to the routers belonging to the upper operators AS2 and AS3, and the routers belonging to the upper operators AS2 and AS3 also advertise the segment of route to their other neighbor AS, which is the remote AS of the local AS. A router belonging to AS4, which wants to access an x.x.x.x segment belonging to AS1, has two paths to reach, i.e. via AS4, AS2, AS1, or via AS4, AS3, AS 1.

For example, when a router belonging to AS4 accesses an x.x.x.x/m network segment, a path passing through AS4, AS2 and AS1 is preferred, and nodes on the path are congested and lost, the router belonging to local AS1 may carry a new attribute when advertising an x.x.x.x route to a router belonging to AS2, and set the value of the new attribute prepend + n to 2, so that when the router belonging to AS2 advertises a route outwards, the AS number is superimposed twice in the AS path, that is, the original paths AS4, AS2 and AS1 become AS4, AS2, AS2, AS2 and AS 1. Since the paths AS4, AS3 and AS1 are not changed, the paths AS4, AS3 and AS1 are optimized according to the routing principle, so that the regulation and control of the return flow are realized.

For another example, when the router belonging to the local AS1 does not want the router belonging to the AS6 to access the x.x.x.x network segment, that is, does not need to notify the router belonging to the AS6 of the network segment, the router belonging to the AS3 carries the new attribute no-import AS-list when notifying the router belonging to the AS3 of the route, and sets the value of the new attribute no-export AS-list to 6, and the router belonging to the AS3 does not notify the x.x.x.x/m network to the router belonging to the AS6 when notifying the route outwards.

In the embodiment, the BGP protocol is improved, and the traffic can be quickly and accurately regulated and controlled only by a small amount of work.

Fig. 6 is a schematic structural diagram of some embodiments of an inter-non-direct autonomous system traffic scheduling system according to the present disclosure. The system includes an origination router 610 and a transit router 620.

The origin router 610 at a particular origin AS is configured to carry TLVs for newly defined routing function advertisement attributes for internet routes corresponding to traffic to be scheduled when advertising internet traffic routes to transit routers at the transit ASs, where the routing function advertisement attributes include AS path control attributes or route filtering attributes.

The AS path control attributes include: the transfer router belonging to the transfer AS in the AS path increasing list informs a remote router positioned in a third party AS of the route, and the AS path length should be increased; the route filtering attributes include: the transit router filters the internet traffic routes for remote routers belonging to third party ASs in the route filtering list.

In some embodiments, an existing BGP protocol is modified to define new BGP attributes that the originating router carries when advertising routes to routers of other domains. The AS path control attribute carries an AS path adding list and a corresponding length value, wherein the AS path adding list is a prepend + n list. And the route filtering attribute carries a route filtering list which is a no-export AS-list. The origin router may determine to which AS router the added path length needs to be advertised according to the prepend + n list; from the no-export AS-list, it can be determined to which AS the router to which the router is not advertised routing information containing the local router.

Transit router 620 is configured to parse the routing function advertisement attribute in the TLV, performing a corresponding routing advertisement action.

For example, after receiving the internet service route advertised by the origin router, the transit router advertises, to the remote router, a route with a path length that passes through the transit AS according to the AS path addition list and the corresponding length value in the AS path control attribute if the routing function advertisement attribute is analyzed to be the AS path control attribute according to the TLV field. And the transfer router determines the number of transfer AS contained in the advertised route according to the attribute value in the TLV.

For another example, after receiving the internet service route advertised by the origin router, the transit router does not advertise the route information including the origin router to the remote router in the route filtering list belonging to the route filtering attribute if the routing function advertisement attribute is analyzed as the route filtering attribute according to the TLV field.

In other embodiments of the present disclosure, as shown in FIG. 2, the system includes an origin router X < X1-1, X1-2>, a plurality of transit routers Y < Y1-1, Y2-1,..,. Yi-1,..,. Ym-1>, a plurality of remote routers Z < Z1-1, Z2-1,. Zk-1,... Zn-1>, and a controller C.

The method comprises the steps that an origin router X < X1-1 and an X1-2> establish EBGP connection with a transfer router Y < Y1-1, Y2-1, and Y.J., Yi-1, and Ym-1>, acquire AS connection mapping relations of the transfer router Y < Y1-1, Y2-1, and Y.J., Yi-1, and Ym-1 and a far-end router Z < Z1-1, Z2-1, and Z.J.Zk-1, and then synchronize the AS connection mapping relations to a controller C.

The controller C determines a network utilization expected value according to the bandwidth and the utilization rate of each link formed by the origin router, the transit router and the far-end router, matches a prefix pair of the far-end router and the origin router according to the utilization rate and the network utilization expected value of each link and the AS connection mapping relation, and determines an AS path increasing list needing to increase the AS length and the AS path length needing to increase the AS length or determines a route filtering list needing to filter the route.

The origin router X < X1-1, X1-2> generates AS path control attributes including an AS path increment list and an AS path length that needs to be increased, or route filter attributes including a route filter list.

When traffic scheduling between non-direct-connection ASs is carried out, the origin routers X < X1-1 and X1-2> need to be configured with scheduling routing strategies, namely AS path control attributes or routing filtering attributes are generated.

Fig. 7 is a schematic structural diagram of another embodiment of a non-direct connection autonomous system traffic scheduling system according to the present disclosure. The system includes a memory 710 and a processor 720, wherein: the memory 710 may be a magnetic disk, flash memory, or any other non-volatile storage medium. The memory is used for storing instructions in the embodiments corresponding to fig. 1 and 3. Processor 720, coupled to memory 710, may be implemented as one or more integrated circuits, such as a microprocessor or microcontroller. The processor 720 is configured to execute instructions stored in the memory.

In some embodiments, as also shown in FIG. 8, the system 800 includes a memory 810 and a processor 820. The processor 820 is coupled to the memory 810 by a BUS 830. The system 800 may also be coupled to an external storage device 850 via a storage interface 840 for facilitating retrieval of external data, and may also be coupled to a network or another computer system (not shown) via a network interface 860, which will not be described in detail herein.

In the embodiment, the data instruction is stored by the memory, and the instruction is processed by the processor, so that the flow can be quickly and accurately regulated.

In further embodiments, a computer-readable storage medium has stored thereon computer program instructions which, when executed by a processor, implement the steps of the method in the embodiments corresponding to fig. 1 and 3. As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, apparatus, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable non-transitory storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

Thus far, the present disclosure has been described in detail. Some details well known in the art have not been described in order to avoid obscuring the concepts of the present disclosure. It will be fully apparent to those skilled in the art from the foregoing description how to practice the presently disclosed embodiments.

Although some specific embodiments of the present disclosure have been described in detail by way of example, it should be understood by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the present disclosure. It will be appreciated by those skilled in the art that modifications may be made to the above embodiments without departing from the scope and spirit of the present disclosure. The scope of the present disclosure is defined by the appended claims.

Claims

1. A traffic scheduling method among non-direct connection autonomous systems comprises the following steps:

when an origin router located in a specific origin Autonomous System (AS) advertises an internet service route to a transit router located in the transit AS, carrying a Type Length Value (TLV) of a newly defined routing function advertisement attribute aiming at the internet route corresponding to traffic to be scheduled, wherein the routing function advertisement attribute comprises an AS path control attribute or a routing filtering attribute;

and the switching router receiving the Internet service route advertised by the originating router analyzes the route function advertisement attribute in the TLV and executes corresponding route advertisement action.

2. The inter-non-direct autonomous system traffic scheduling method of claim 1,

the AS path control attribute includes: the transfer router belonging to the transfer AS in the AS path increasing list informs a remote router positioned in a third party AS of the route, and the AS path length should be increased;

the route filtering attribute includes: the transit router filters the internet traffic route to a remote router belonging to a third party AS in the route filtering list.

3. The inter-non-direct autonomous system traffic scheduling method of claim 2,

after receiving the internet service route announced by the origin router, the transit router announces a route with a path length passing through the transit AS to the remote router according to an AS path addition list and a corresponding length value in the AS path control attribute if the routing function announcement attribute is analyzed to be an AS path control attribute according to the TLV field.

4. The inter-non-direct autonomous system traffic scheduling method of claim 3,

and the switching router determines the number of the switching AS contained in the advertised route according to the attribute value in the TLV.

5. The inter-non-direct autonomous system traffic scheduling method of claim 2, wherein,

after receiving the internet service route advertised by the origin router, the transit router does not advertise the route information containing the origin router to a remote router in a route filtering list belonging to the route filtering attribute if the route function advertising attribute is analyzed to be the route filtering attribute according to the TLV field.

6. The method for scheduling traffic between non-direct connection autonomous systems according to any one of claims 2 to 5, further comprising:

establishing an External Border Gateway Protocol (EBGP) connection between the originating router and the transfer router, acquiring an AS connection mapping relation between the transfer router and a remote router, and synchronizing the AS connection mapping relation to a controller;

the controller determines a network utilization expected value according to the bandwidth and the utilization rate of each link formed by the origin router, the transit router and the far-end router, matches a prefix pair of the far-end router and the origin router according to the utilization rate of each link, the network utilization expected value and the AS connection mapping relation, and determines an AS path increasing list needing to increase the AS length and an AS path length needing to increase the AS length or determines a route filtering list needing to filter the route;

the origin router generates an AS path control attribute including the AS path increment list and the AS path length that needs to be incremented, or a route filter attribute including the route filter list.

7. A system for scheduling traffic between non-direct connected autonomous systems, comprising:

the origin router is configured to carry a type length value TLV (type length value) of a newly defined routing function advertisement attribute aiming at an internet route corresponding to traffic to be scheduled when advertising the internet service route to a transit router positioned in a transit AS, wherein the routing function advertisement attribute comprises an AS path control attribute or a routing filtering attribute;

and the transfer router is configured to analyze the routing function advertisement attribute in the TLV and execute corresponding routing advertisement action.

8. The inter-non-direct autonomous system traffic scheduling system of claim 7,

the route filtering attribute includes: the transit router filters the internet traffic routes for remote routers belonging to third party ASs in the route filtering list.

9. The non-direct connection autonomous system traffic scheduling system of claim 8, further comprising a controller, wherein,

establishing an External Border Gateway Protocol (EBGP) connection between the originating router and the transit router, acquiring an AS connection mapping relation between the transit router and a remote router, synchronizing the AS connection mapping relation to a controller, and generating an AS path control attribute according to an AS path increase list sent by the controller and an AS path length required to be increased, or generating a route filtering attribute according to a route filtering list;

the controller is configured to determine a network utilization expected value according to a bandwidth and a utilization rate of each link composed of the origin router, the transit router and the remote router, match a prefix pair of the remote router and the origin router according to the utilization rate of each link, the network utilization expected value and an AS connection mapping relation, and determine an AS path addition list and an AS path length which need to be added, wherein the AS path addition list needs to be added in the AS length, or determine a route filtering list which needs to filter Internet service routes to routers belonging to a predetermined third-party AS.

10. A system for traffic scheduling between non-direct autonomous systems, comprising:

a memory; and

a processor coupled to the memory, the processor configured to perform the method of non-direct inter-autonomous system traffic scheduling of any of claims 1-6 based on instructions stored in the memory.

11. A computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement the method of inter-non-direct autonomous system traffic scheduling of any of claims 1 to 6.