Patent Description:
A border gateway protocol (Border Gateway Protocol, referred to as BGP) is a dynamic routing protocol used between autonomous systems (Autonomous System, referred to as AS). BGP speakers interchanging messages call each other a peer. A BGP speaker only advertises routing used by the BGP speaker to a peer, so that when data flow from the BGP speaker to the peer, only a data ingress routing node connected to the BGP speaker and a data egress routing node connected to the peer may be configured.

In the prior art, a routing node through which data pass when flowing from the data ingress routing node to the data egress routing node is selected by a route reflector. All routing nodes between the data ingress routing node and the data egress routing node are neighbor nodes of the route reflector, resulting in a technical problem that, when the routing node through which data pass when flowing from the data ingress routing node to the data egress routing node is selected, and when the route reflector selects a next hop routing node of a routing node, the next hop routing node is not adjacent to the selected routing node, and thus an adjacent node cannot be selected as the next hop routing node of the routing node neighbor by neighbor.

<CIT> discloses a control unit for dynamically controlling the routing within a network comprising a plurality of network elements, comprising a request processing entity adapted for receiving requests coming from said network elements and adapted for performing processing of said requests; a path computation entity adapted for computing a network path upon request from the request processing entity, based on a network graph and applying constraints, said computed network path comprising a number of said plurality of network elements; said path computation entity being linked with a traffic engineering database which is updated with the computed network paths; a flow control entity adapted for establishing a forwarding entry in the forwarding information base of a network element of the computed network path, upon request from the request processing entity.

Embodiments of the present application provide a method and an apparatus for controlling a network traffic path, so as to solve a technical problem in the prior art that an adjacent node cannot be selected as a next hop routing node of a routing node neighbor by neighbor.

The present invention has the following beneficial effects.

In the embodiments of the present invention, technical solutions of the present application include: receiving the routing advertisement information from the first network to the second network, determining all the routing nodes included in the path through which the data pass when flowing from the second network to the first network according to the routing advertisement information, and configuring the next hop routing node for each determined routing node. Since the next hop routing node is configured for each determined routing node in the technical solutions of the present application, when the data arrive at each determined routing node, the data will be automatically transmitted to the next hop routing node, and thus the technical problem in the prior art that the adjacent node cannot be selected as the next hop routing node of the routing node neighbor by neighbor is solved.

In view of a technical problem in the prior art that a routing node cannot be selected neighbor by neighbor, a technical solution provided by an embodiment of the present invention includes: receiving routing advertisement information from a first network to a second network, determining all routing nodes included in a path through which data pass when flowing from the second network to the first network according to the routing advertisement information, and configuring a next hop routing node for each determined routing node, so that when the dada arrive at the each determined routing node, the data may be automatically transmitted to the next hop routing node, thus a technical problem in the prior art that an adjacent node cannot be selected as a next hop routing node of a routing node neighbor by neighbor is solved, and a technical effect of selecting the next hop routing node of the routing node as the adjacent node neighbor by neighbor is achieved. Since the adjacent node may be selected as the next hop routing node of the routing node neighbor by neighbor, when a network traffic in a routing node is heavier, the routing node may be excluded from the determined routing nodes, and thus fine and flexible traffic dispersion may be achieved.

Main achievement principles, specific implementation manners and corresponding achievable beneficial effects of technical solutions of embodiments of the present invention will be illustrated below in detail in combination with the accompanying drawings.

A first embodiment of the present invention provides a method for controlling a network traffic path, and as shown in <FIG>, specific processing procedures of the method is as follows:.

In step <NUM>, the routing advertisement information from the first network to the second network is received. In a specific implementation process, for example, the first network and the second network are metropolitan area networks, the two metropolitan area networks communicate through a backbone network, for example, a metropolitan area network of Chengdu and a metropolitan area network of Beijing are connected through a <NUM> backbone network, and when the first network performs routing advertisement to the second network, routing advertisement information generated when the first network performs the routing advertisement to the second network is received.

For example, taking it as an example that the first network is a metropolitan area network A and the second network is a metropolitan area network B, when the metropolitan area network A performs routing advertisement to the metropolitan area network B, the metropolitan area network A performs routing advertisement on an IP of the metropolitan area network A, for example, <NUM>. <NUM>, <NUM>. <NUM>, <NUM>. <NUM>, <NUM>. <NUM>, <NUM>. <NUM>, or the like, to the metropolitan area network B, and routing advertisement information generated when the metropolitan area network A performs routing advertisement to the metropolitan area network A, including an IP address of the metropolitan area network A and an IP address of the metropolitan area network B, and/or, IP addresses of all routing nodes through which data pass when flowing from the metropolitan area network A to the metropolitan area network B, is received.

Then, step <NUM> is executed, in the step, all the routing nodes included in the path through which the data pass when flowing from the second network to the first network are determined according to the routing advertisement information.

In a specific implementation process, all the routing nodes through which the data pass when flowing from the second network to the first network may be obtained according to the routing advertisement information, and a path is selected from all the routing nodes, so that the data may be transmitted from the second network to the first network through the path.

Specifically, since the data flow from the second network to the first network, all the determined routing nodes absolutely include the routing node of the first network and the routing node of the second network, and the routing node of the first network may be determined as a destination node.

For example, referring to <FIG>, a metropolitan area network AS1 performs routing advertisement to a metropolitan area network AS2, a routing controller B1 obtains all routing nodes through which data need to pass when flowing from AS2 to AS1 according to routing advertisement information of AS1, where AS1 and AS2 are connected through a backbone network AS10, and all the routing nodes include routing nodes D1, D2, D3 and D4, routing nodes P1, P2, P3, P4 and P5, a routing node A1 of AS1 and a routing node A2 of AS2.

After all the routing nodes through which the data need to pass when flowing from AS2 to AS1 are obtained, the data may be transmitted from AS2 to AS1 through multiple paths, for example, the multiple paths may be A2->D3->P4->P1->D1->A1, A2->D3->P3->D1->A1, A2->D3->P3->D2->A1, A2->D3->P4->P1->P3->D1->A1, A2->D3->P4->P1->P3->D2->A1, A2->D3->P2->P3->D1->A1, A2->D3->P2->P3->D2->A1, and the like. A path may be randomly selected from the multiple paths as a path of the data flowing from AS2 to AS1. Assuming that a path randomly selected from the multiple paths is A2->D3->P3->D1->A1, and then all routing nodes included in the path through which the data pass when flowing from AS2 to AS1 are determined as A2, D3, P3, D1 and A1.

In a specific implementation process, all the routing nodes included in the path through which the data pass when flowing from the second network to the first network may also be determined according to the routing advertisement information and received routing plan information between the first network and the second network, where plan nodes in the routing plan information include N routing node(s) between the first network and the second network, and the determined routing nodes include the N routing node(s), and N is a positive integer.

The routing plan information may be obtained before the first network performs the routing advertisement to the second network, may also be obtained in a process of performing the routing advertisement and may also be obtained after performing the routing advertisement, which is not specifically limited in the present application.

Specifically, the N routing nodes refer to nodes through which the data must pass when flowing from the second network to the first network, a value of N may be <NUM>, <NUM>, <NUM>, <NUM>, or the like. The N routing node refers to a node through which the data must pass when flowing from the second network to the first network, a value of N may be <NUM>. The N routing node may be a part or all of the routing nodes through which the data pass when flowing from the second network to the first network, and when the N routing node is a part of the routing nodes through which the data pass when flowing from the second network to the first network, a routing node through which the data pass when flowing from the second network to the first network and conforming to a preset constraint condition may be determined according to the routing advertisement information and the received routing plan information between the first network and the second network.

Certainly, when the N routing node is a part of the routing nodes through which the data pass when flowing from the second network to the first network, some other nodes may also be randomly selected from routing nodes between the first network and the second network, for enabling the data to flow from the second network to the first network through the other nodes and the N routing node.

It is taken as an example below that the N routing nodes are all of the routing nodes through which the data pass when flowing from the second network to the first network.

For example, referring to <FIG>, the metropolitan area network AS1 performs routing advertisement to the metropolitan area network AS2, the routing controller B1 obtains all the routing nodes through which the data need to pass when flowing from AS2 to AS1 according to the routing advertisement information of AS1, where AS1 and AS2 are connected through the backbone network AS10, and all the routing nodes include the routing nodes D1, D2, D3 and D4, the routing nodes P1, P2, P3, P4 and P5, the routing node A1 of AS1 and the routing node A2 of AS2.

When plan nodes of the routing plan information of the data flowing from AS2 to AS1 received by the routing controller B1 are D3 -> P4 -> P1 -> D1, the routing controller B1 has two routing table entries destining for DEST_IP:
Dest: NextHop:.

The routing controller B1 executes requirements of the plan nodes, detects that it has a route satisfying that an egress is D1, and then translates a path into a route of each node on the path.

Thereby the data from AS2 to AS1 will arrive at AS1 along a path A2->D3->P4->P1->D1->A1, accordingly, the path of the data flowing from AS2 to AS1 conforms to the routing plan information. However, in the prior art, when data flow from AS2 to AS1, a next hop routing node of each selected routing node is selected according to a calculation result of IGP, accordingly, a path of the data flowing from AS2 to AS1 in the prior art does not conform to the routing plan information. By adopting the above technical solution of the present application, the path of the data flowing from AS2 to AS1 conforms to the routing plan information, unused routing nodes may be applied to the routing plan information, thus making full use of routing nodes to transmit data is achieved.

It is taken as an example below that the N routing node is a part of the routing nodes through which the data pass when flowing from the second network to the first network.

Referring to <FIG>, when a plan node of routing plan information of the data flowing from AS2 to AS1 received by the routing controller B1 only includes P3, paths may be selected by the routing controller B1 are: A2->D3->P3 ->D1->A1, A2->D3->P3->D2->A1, A2->D3->P4->P1 ->P3 ->D1 ->A1, A2->D3->P4 ->P1 ->P3 ->D2 ->A1.

Specifically, when the N routing node is a part of the routing nodes through which the data pass when flowing from the second network to the first network, the determining all the routing nodes included in the path through which the data pass when flowing from the second network to the first network according to the routing advertisement information and the received routing plan information between the first network and the second network specifically includes: determining a routing node through which the data pass when flowing from the second network to the first network and conforming to a preset constraint condition according to the routing advertisement information and the received routing plan information between the first network and the second network.

Certainly, when the N routing nodes are all of the routing nodes through which the data pass when flowing from the second network to the first network, a route may also be determined according to the above-mentioned manner.

The preset constraint condition may be a condition constraining one or more of a bandwidth, a routing cost, a reliability, a time delay, a load and the like. For example, the preset constraint condition may be that the bandwidth is not less than <NUM> and the routing cost is the lowest, and may also only be that the bandwidth is not less than <NUM> or the routing cost is the lowest.

Specifically, the determining the routing nodes through which the data pass when flowing from the second network to the first network and conforming to the preset constraint condition according to the routing advertisement information and the received routing plan information between the first network and the second network specifically includes the following steps.

Referring to <FIG>, the above-mentioned steps include:.

In step <NUM>, the routing node connected to the second network is selected.

For example, referring to <FIG>, when the plan node of the routing plan information of the data flowing from AS2 to AS1 received by the routing controller B1 only includes P3, the routing node connected to AS2 is D3, therefore the routing node connected to AS2 may be determined as D3.

Then, step <NUM> is executed, since the routing node connected to AS2 is D3, such parameters as a bandwidth parameter from the routing node A2 of AS2 to D3 and the like satisfy the preset constraint condition, and it is taken as an example that the preset constraint condition is that the routing cost is the lowest.

With respect to the selected routing node D3, step <NUM> is executed to determine whether a routing node in the N routing node exists in the routing nodes connected to the selected routing node.

Referring to <FIG>, when selecting routing nodes connected to D3, according to a routing table entry in the routing controller B <NUM>, it may be obtained that the routing nodes connected to D3 include P2, P3, P4 and D4, thus whether P2, P3, P4 and D4 include a routing node in the N routing node is determined, since the N routing node is P3, and P2, P3, P4 and D4 include P3, so step <NUM> is executed to determine P3 as a next hop routing node of D3.

Then, with respect to P3, step <NUM> is executed to determine whether a routing node in the N routing node exists in the routing nodes connected to the selected routing node.

Referring to <FIG>, when selecting a next hop routing node of P3, according to a routing table entry in the routing controller B <NUM>, it may be obtained that routing nodes connected to P3 include P1, D1, D2 and P2, since the N routing node is P3, it may be determined that the P1, D1, D2 and P2 do not include a routing node in the N routing node, and then step <NUM> is executed to select a routing node conforming to the preset constraint condition from the routing nodes connected to the selected routing node as the next hop routing node.

Further, referring to <FIG>, with respect to P3, according to a routing topology structure, since the data need to flow from AS2 to AS1, P1 and P2 may be removed from the routing nodes P1, D1, D2 and P2 connected to P3, and the next hop routing node is selected from D1 and D2. Assuming a the bandwidth from P3 to D1 is <NUM>, then a routing cost from P3 to D1 is: cost=<NUM>^<NUM>/<NUM>=<NUM>, while when a bandwidth from P3 to D2 is <NUM>, a routing cost from P3 to D2 is: cost=<NUM>^<NUM>/<NUM>=<NUM>, as the routing cost from P3 to D1 is less than the routing cost from P3 to D2, and the preset constraint condition is that the routing cost is the lowest, therefore it may be determined that D1 is the next hop routing node of P3.

With respect to D1, since D1 is connected to the routing node A1 of AS1, the path of the data flowing from AS2 to AS1 may be determined as A2->D3->P3->D1 ->A1.

Specifically, when determining all the routing nodes included in the path through which the data pass when flowing from the second network to the first network according to the routing advertisement information, and when the routing plan information is not received, the routing node through which the data pass when flowing from the second network to the first network and conforming to the preset constraint condition may be determined according to the routing advertisement information.

Specifically, determining the routing node through which the data pass when flowing from the second network to the first network and conforming to the preset constraint condition according to the routing advertisement information specifically includes the following steps.

For example, referring to <FIG>, when the plan node of the routing plan information of the data flowing from AS2 to AS1 received by the routing controller B1 only includes P3, since the routing node connected to AS2 is D3, the routing node connected to AS2 may be determined as D3.

With respect to the selected routing node D3, step <NUM> is executed to select a routing node conforming to the preset constraint condition from the routing nodes connected to the selected routing node as the next hop routing node.

Specifically, when a plurality of routing nodes in the routing nodes connected to the selected routing node satisfy the preset constraint condition, a routing node is selected from the plurality of routing nodes as the next hop routing node. For example, the preset constraint condition is that the bandwidth is not less than <NUM> and the reliability is not less than <NUM>%, referring to <FIG>, taking D3 as an example, routing nodes connected to D3 include P2, P3, P4 and D4, when P2 and P3 satisfy the preset constraint condition, a routing node may be randomly selected from P2 and P3 as a next hop routing node of D3, and a routing node may also be selected from P2 and P3 according to a routing algorithm, where a path between the routing node and D3 is an optimal path.

Referring to <FIG>, when selecting routing nodes connected to D3, according to a routing table entry in the routing controller B1, it may be obtained that the routing nodes connected to D3 include P2, P3, P4 and D4, a routing node conforming to the preset constraint condition is selected from P1, D1, D2 and P2 as a next hop routing node. When the preset constraint condition is that the routing cost is the lowest, assuming that a bandwidth from D3 to P2 is <NUM>, then a routing cost from P3 to D1 is: cost=<NUM>^<NUM>/<NUM>=<NUM>, when a bandwidth from D3 to P3 is <NUM>, a routing cost from D3 to D3 is <NUM>, when a bandwidth from D3 to P4 is <NUM>, a routing cost from D3 to D1 is <NUM>, when a bandwidth from D3 to D4 is <NUM>, a routing cost from D3 to D1 is <NUM>, since <NUM><<NUM><<NUM><<NUM>, it may be determined that the bandwidth from D3 to P3 is the lowest, and then the next hop routing node of D3 is determined as P3.

Referring to <FIG>, when selecting a next hop routing node of P3, according to a routing table entry in the routing controller B1, it may be obtained that routing nodes connected to P3 include P1, D1, D2 and P2, and a routing node conforming to the preset constraint condition is selected from P1, D1, D2 and P2 as the next hop routing node.

Further, with respect to P3, according to the routing topology structure, since the data need to flow from AS2 to AS1, P1 and P2 may be removed from the routing nodes P1, D1, D2 and P2 connected to P3, and the next hop routing node is selected from D1 and D2. Assuming that a bandwidth from P3 to D1 is <NUM>, then a routing cost from P3 to D1 is: cost=<NUM>^<NUM>/<NUM>=<NUM>, while when a bandwidth from P3 to D2 is <NUM>, a routing cost from P3 to D2 is: cost=<NUM>^<NUM>/<NUM>=<NUM>, as the routing cost from P3 to D1 is less than the routing cost from P3 to D2, and the preset constraint condition is that the routing cost is the lowest, therefore it may be determined that D1 is the next hop routing node of P3.

With respect to D1, since D1 is connected to the routing node A1 of AS1, and the data flow from AS2 to AS1, resulting in that A1 is a destination node, then a next hop routing node of D1 may be determined as A1, and a path of the data flowing from AS2 to AS1 is A2->D3->P3->D1->A1. By means of the above-mentioned manner, since each determined routing satisfies the preset constraint condition, the path of the data flowing from AS2 to AS1 may conform to the preset constraint condition, moreover, a routing cost of the determined routing may be the lowest, and the data may be transmitted more stably and quickly.

In a specific implementation process, when a selected routing node exists in all the routing nodes, selecting a next hop routing node from all the routing nodes specifically includes: selecting the next hop routing node from all the routing nodes with the selected routing node removed.

Specifically, when a routing node has been selected, the next hop routing node is selected from all the routing nodes with the selected routing node removed. Referring to <FIG>, taking D3 as an example, routing nodes connected to D3 include P2, P3, P4 and D4, when P3 has been selected, then a next hop routing node of D3 is selected from P2, P4 and D4, accordingly each traffic path is free of a crossing condition, so that a condition that a plurality of traffic paths are forked after generating an aggregation point may be avoided, and a technical effect of no aggregation point of the plurality of traffic paths is achieved.

For example, referring to <FIG>, when AS1 performs routing advertisement to AS2 and a metropolitan area network AS3, the following step is executed at first: respectively selecting a routing node D3 connected to AS2 and a routing node D4 connected to AS3, where both D3 and D4 conform to a preset constraint condition, and it is taken as an example that the preset constraint condition is that the routing cost is the lowest.

Then, with respect to D3, routing nodes connected to D3 are P4, P3, P2 and D4, since D4 has been selected, a routing node having the lowest cost with D3 is selected from P4, P3 and P2, if a cost between P4 and D3 is <NUM>, a cost between P3 and D3 is <NUM>, and a cost between P3 and D3 is <NUM>, since <NUM><<NUM><<NUM>, P3 is selected as a next hop routing node of D3.

Then, with respect to D4, routing nodes connected to D4 are D3, P1, P2 and P5, since D3 has been selected, a routing node having the lowest cost with D4 is selected from P1, P2 and P5, if a cost between P1 and D4 is <NUM>, a cost between P2 and D4 is <NUM>, and a cost between P5 and D4 is <NUM>, since <NUM><<NUM><<NUM>, P2 is selected as a next hop routing node of D4.

Then, with respect to P3, routing nodes connected to P3 are P1, D1, D2, D3 and P2, since P2 and D3 have been selected, a routing node having the lowest cost with P3 is selected from P1, D1 and D2, if a cost between P1 and P3 is <NUM>, a cost between D1 and P3 is <NUM>, and a cost between D2 and P3 is <NUM>, since <NUM><<NUM><<NUM>, D1 is selected as a next hop routing node of P3.

Then, with respect to P2, routing nodes connected to P2 are D3, P1, P3, D2, P5 and D4, since D4, D3 and P3 have been selected, a routing node having the lowest cost with P2 is selected from P1, D2 and P5, if a cost between P1 and P2 is <NUM>, a cost between D1 and P2 is <NUM>, and a cost between D2 and P2 is <NUM>, since <NUM><<NUM><<NUM>, D2 is selected as a next hop routing node of P2.

Then, with respect to D1, since D1 is connected to the routing node A1 of AS1, and data flow from AS2 to AS1, resulting in that A1 is a destination node, then a next hop routing node of D1 may be determined as A1, and a path of the data flowing from AS2 to AS1 is A2->D3->P3->D1->A1.

Then, with respect to D2, since D2 is connected to the routing node A1 of AS1, and data flow from AS3 to AS1, resulting in that A1 is a destination node, then a next hop routing node of D1 may be determined as A1, and a path of the data flowing from AS3 to AS1 is A3->D4->P2->D2->A1, so that two obtained traffic paths have no aggregation point, and a technical effect of no aggregation point of a plurality of traffic paths is achieved.

Then, step <NUM> is executed, in the step, the next hop routing node is configured for each determined routing node, where the next hop routing node is a node in all the routing nodes included in the path and is adjacent to the routing node for which the next hop routing node is configured, and the routing node for which the next hop routing node is configured does not include the routing node of the first network or the routing node of the second network.

In a specific implementation process, the routing node of the first network is a destination node and the routing node of the second network is a starting node, resulting in that all the routing nodes included in the determined path absolutely include the routing node of the first network and the routing node of the second network, and that the routing node of the first network has no next hop routing node, in addition, an executive body of the method for controlling a network traffic path cannot control the routing node of the second network in general, therefore after determining all the routing nodes included in the path through which the data pass when flowing from the second network to the first network, the routing node of the first network and the routing node of the second network need to be removed, and then the next hop routing node is configured for each determined routing node, so that when the data arrive at each determined routing node, each determined routing node automatically transmits the data to the next hop routing node, so as to improve a data forwarding efficiency.

Specifically, the next hop routing node is a node in all the routing nodes included in the path and is adjacent to the routing node for which the next hop routing node is configured, namely, representing that the next hop routing node and the routing node for which the next hop routing node is configured are mutual neighbor nodes, the neighbor nodes means nodes in which a routing node is directly connected to another routing node, and when a routing node and another routing node are mutual neighbor nodes, it may be determined that the routing node and another routing node are adjacent nodes.

For example, referring to <FIG>, with respect to D3, routing nodes directly connected to D3 are P4, P3, P2 and D4, then it may be determined that D3 and P4 are mutual neighbor nodes, D3 and P3 are also mutual neighbor nodes, D3 and P2 are also mutual neighbor nodes, and D3 and D4 are also mutual neighbor nodes.

As another example, referring to <FIG>, with respect to P3, routing nodes directly connected to P3 are P1, D1, D2, D3 and P2, then it may be determined that P3 and P1 are mutual neighbor nodes, P3 and D1 are also mutual neighbor nodes, P3 and D2 are also mutual neighbor nodes, P3 and D3 are also mutual neighbor nodes, P3 and P2 are also mutual neighbor nodes. However P3, P4 and P5 are not directly connected, resulting in that P3 and P4 are not neighbor nodes, namely, representing that P3 and P4 are not adjacent nodes, and that P3 and P5 are not neighbor nodes, namely, representing that P3 and P5 are not adjacent nodes.

For example, referring to <FIG>, when determining a path of data flowing from AS2 to AS1 as A2->D3->P3->D1->A1, a routing controller B1 sends the following route to D3:.

In this way, when the data are transmitted from AS2 to AS1, the routing controller B1 has configured a next hop route for D3 as P3, resulting in that D3 will directly transmit the data to P3, when P3 receives the data, since the routing controller B1 has configured a next hop route for P3 as D1, P3 will directly transmit the data to D1, and then D1 directly transmits the data to AS1. As a result, a technical effect of selecting a next hop routing node of a routing node as an adjacent node neighbor by neighbor is achieved, and since the adjacent node may be selected as the next hop routing node of the routing node neighbor by neighbor, when a network traffic in a routing node is heavier, the routing node may be excluded from the determined routing nodes, and thus fine and flexible traffic dispersion may be achieved.

Moreover, when determining a path of data flowing from AS3 to AS1 as A3->D4->P2->D2->A1, the routing controller B1 sends the following route to D4:.

In this way, when the data are transmitted from AS3 to D3, the routing controller B1 has configured a next hop route for D4 as P2, resulting in that D4 will directly transmit the data to P2, when P2 receives the data, since the routing controller B1 has already configured a next hop route for P2 as D2, P2 will directly transmit the data to D2, and then D2 directly transmits the data to AS1. As a result, a technical effect of selecting a next hop routing node of a routing node as an adjacent node neighbor by neighbor is achieved, and since the adjacent node may be selected as the next hop routing node of the routing node neighbor by neighbor, when a network traffic in a routing node is heavier, the routing node may be excluded from the determined routing nodes, and thus fine and flexible traffic dispersion may be achieved.

In another embodiment, before the determining all the routing nodes included in the path through which the data pass when flowing from the second network to the first network according to the routing advertisement information and the received routing plan information between the first network and the second network, the following operation is executed for each routing node in the N routing node: detecting whether each routing node in the N routing node has been selected.

In a specific implementation process, when each routing node in the N routing node is not selected, all the routing nodes included in the path through which the data pass when flowing from the second network to the first network are determined; and otherwise, prompt information is sent to prompt that the routing plan information is incorrect.

For example, referring to <FIG>, at a TI moment, plan nodes in routing plan information of data flowing from AS2 to AS1 are D3->P3->D1, and a routing path through which data pass when flowing from AS3 to AS1 is A3->D4->P2 ->P3->D2->A1, whether each routing node in D3, P3 and D1 has been selected is detected, since P3 has been selected, voice data "the routing plan information is incorrect" are sent to a user, to prompt that the routing plan information is incorrect, and information that P3 has been selected may also be sent to a client, so as to reset the routing plan information; and if the routing path through which the data pass when flowing from AS3 to AS1 is A3->D4->P2->D2->A1, since each routing node in D3, P3 and D1 is not selected, routing nodes through which the data pass when flowing from AS2 to AS1 may be determined as A2->D3->P3->D1->A1.

In this way, the plan nodes included in the routing plan information may be checked, accordingly each traffic path is free of a crossing condition, so that a condition that a plurality of traffic paths are forked after generating an aggregation point may be avoided, and a technical effect of no aggregation point of the plurality of traffic paths is achieved.

In the embodiment of the present invention, the technical solution of the present application includes: receiving the routing advertisement information from the first network to the second network, determining all the routing nodes included in the path through which the data pass when flowing from the second network to the first network according to the routing advertisement information, and configuring the next hop routing node for each determined routing node. Since the next hop routing node is configured for each determined routing node in the technical solution of the present application, when the data arrive at each determined routing node, the data will be automatically transmitted to the next hop routing node, and thus the technical problem in the prior art that the adjacent node cannot be selected as the next hop routing node of the routing node neighbor by neighbor is solved.

The embodiment of the present invention provides an apparatus for controlling a network traffic path. Referring to <FIG>, the apparatus includes: a receiving unit <NUM>, configured to receive routing advertisement information from a first network to a second network; a routing determining unit <NUM>, configured to receive the routing advertisement information sent by the receiving unit <NUM>, and determine all routing nodes included in a path through which data pass when flowing from the second network to the first network according to the routing advertisement information; and a configuring unit <NUM>, configured to receive all the determined routing nodes sent by the routing determining unit <NUM>, and configure a next hop routing node for each determined routing node, where the next hop routing node is a node in all the routing nodes included in the path and is adjacent to the routing node for which the next hop routing node is configured, and the routing node for which the next hop routing node is configured does not include a routing node of the first network or a routing node of the second network.

Since the data flow from the second network to the first network, all the determined routing nodes absolutely include the routing node of the first network and the routing node of the second network, and the routing node of the first network may be determined as a destination node.

Specifically, after receiving the routing advertisement information, the receiving unit <NUM> may obtain all the routing nodes through which data pass when flowing from the second network to the first network according to the routing advertisement information and select a path from all the routing nodes, so that the data may be transmitted from the second network to the first network through the path.

Preferably, the routing determining unit <NUM> includes a first routing determining subunit <NUM>, configured to determine all the routing nodes included in the path through which the data pass when flowing from the second network to the first network according to the routing advertisement information and received routing plan information between the first network and the second network, where plan nodes in the routing plan information include N routing node between the first network and the second network, and the determined routing nodes include the N routing node, and N is a positive integer.

The routing plan information may be obtained before the first network performs routing advertisement to the second network, may also be obtained in a process of performing the routing advertisement and may also be obtained after performing the routing advertisement, which is not specifically limited in the present application.

Specifically, the N routing nodes refer to nodes through which the data must pass when flowing from the second network to the first network, a value of N may be <NUM>, <NUM>, <NUM>, <NUM>, or the like. The N routing node refers to a node through which the data must pass when flowing from the second network to the first network, a value of N may be <NUM>. The N routing node(s) may be a part or all of the routing nodes through which the data pass when flowing from the second network to the first network.

Preferably, when the N routing node(s) is a part of the routing nodes through which the data pass when flowing from the second network to the first network, when the N routing node(s) is a part of the routing nodes through which the data pass when flowing from the second network to the first network, the first routing determining subunit <NUM> is configured to determine a routing node through which the data pass when flowing from the second network to the first network and conforming to a preset constraint condition according to the routing advertisement information and the received routing plan information between the first network and the second network.

Certainly, when the N routing node(s) is a part of the routing nodes through which the data pass when flowing from the second network to the first network, some other nodes may also be randomly selected from routing nodes between the first network and the second network, for enabling the data to flow from the second network to the first network through the other nodes and the N routing node(s).

Preferably, the first routing determining subunit <NUM> is specifically configured to select a routing node connected to the second network, execute the following operations for each selected routing node until the selected routing node is connected to the first network, determine whether a routing node in the N routing node(s) exists in routing nodes connected to the selected routing node, when determining that the routing node in the N routing node(s) exists in the routing nodes connected to the selected routing node, select the routing node in the N routing node(s) as a next hop routing node, when determining that a routing node in the N routing node(s) does not exist in the routing nodes connected to the selected routing node, select a routing node conforming to the preset constraint condition from the routing nodes connected to the selected routing node as a next hop routing node.

For example, referring to <FIG>, when routing plan information of data flowing from AS2 to AS1 received by a routing controller B1 only includes P3, since a routing node connected to AS2 only includes D3, therefore the routing node connected to AS2 may be determined as D3, taking it as an example that the preset constraint condition is that the routing cost is the lowest, with respect to the selected routing node D3, when selecting routing nodes connected to D3, according to a routing table entry in the routing controller B <NUM>, it may be obtained that the routing nodes connected to D3 include P2, P3, P4 and D4, thus whether P2, P3, P4 and D4 include a routing node in the N routing node(s) is determined, since the N routing node(s) is P3, and P2, P3, P4 and D4 include P3, so P3 is determined as a next hop routing node of D3.

When selecting a next hop routing node of P3, according to a routing table entry in the routing controller B <NUM>, it may be obtained that routing nodes connected to P3 include P1, D1, D2 and P2, since the N routing node(s) is P3, it may be determined that the P1, D1, D2 and P2 do not include a routing node in the N routing node(s), and then a routing node conforming to the preset constraint condition is selected from the routing nodes connected to the selected routing node as the next hop routing node. Moreover, since the data need to flow from AS2 to AS1, P1 and P2 may be removed from the routing nodes P1, D1, D2 and P2 connected to P3, and the next hop routing node is selected from D1 and D2. Assuming that a bandwidth from P3 to D1 is <NUM>, then a routing cost from P3 to D1 is: cost=<NUM>^<NUM>/<NUM>=<NUM>, while when a bandwidth from P3 to D2 is <NUM>, a routing cost from P3 to D2 is: cost=<NUM>^<NUM>/<NUM>=<NUM>, as the routing cost from P3 to D1 is less than the routing cost from P3 to D2, and the preset constraint condition is that the routing cost is the lowest, therefore it may be determined that D1 is the next hop routing node of P3.

The routing determining unit <NUM> includes a second routing determining subunit <NUM>, configured to determine a routing node through which the data pass when flowing from the second network to the first network and conforming to a preset constraint condition according to the routing advertisement information.

Preferably, the second routing determining subunit <NUM> is specifically configured to select a routing node connected to the second network, execute the following operation for each selected routing node until the selected routing node is connected to the first network, select a routing node conforming to the preset constraint condition from routing nodes connected to the selected routing node as a next hop routing node.

Preferably, the configuring unit <NUM> is further configured to, when data of a plurality of the second networks need to be transmitted to the first network, for the second network, select a routing node conforming to the preset constraint condition from all unselected routing nodes connected to the selected routing node as the next hop routing node.

Specifically, when a routing node has been selected, a next hop routing node is selected from all the routing nodes with the selected routing node removed. Referring to <FIG>, taking D3 as an example, routing nodes connected to D3 include P2, P3, P4 and D4, when P3 has been selected, then a next hop routing node of D3 is selected from P2, P4 and D4, accordingly each traffic path is free of a crossing condition, so that a condition that a plurality of traffic paths are forked after generating an aggregation point may be avoided, and a technical effect of no aggregation point of the plurality of traffic paths is achieved.

The third comparative embodiment of the present invention provides an apparatus for controlling a network traffic path. Referring to <FIG>, the apparatus includes: a receiver <NUM>, configured to receive routing advertisement information from a first network to a second network; and a controller <NUM>, configured to determine all routing nodes included in a path through which data pass when flowing from the second network to the first network according to the routing advertisement information, and configure a next hop routing node for each determined routing node, where the next hop routing node is a node in all the routing nodes included in the path and is adjacent to the routing node for which the next hop routing node is configured, and the routing node for which the next hop routing node is configured does not include a routing node of the first network or a routing node of the second network.

For example, the receiver <NUM> may be an electronic device such as a WIFI module, an antenna, or the like, and further, the controller <NUM> may be a single processing chip and may also be integrated in a processor of the apparatus.

Specifically, after the receiver <NUM> receives the routing advertisement information, the apparatus may obtain all the routing nodes through which data pass when flowing from the second network to the first network according to the routing advertisement information and select a path from all the routing nodes, so that the data may be transmitted from the second network to the first network through the path.

Preferably, the controller <NUM> is specifically configured to determine all the routing nodes included in the path through which the data pass when flowing from the second network to the first network according to the routing advertisement information and received routing plan information between the first network and the second network, where plan nodes in the routing plan information include N routing node(s) between the first network and the second network, and the determined routing nodes include the N routing node(s), and N is a positive integer.

Specifically, the N routing nodes refer to nodes through which the data must pass when flowing from the second network to the first network, a value of N may be <NUM>, <NUM>, <NUM>, <NUM>, or the like. The N routing node refers to a node through which the data must pass when flowing from the second network to the first network, a value of N may be <NUM>. The N routing node(s) may be a part or all of the routing nodes in the routing nodes through which the data pass when flowing from the second network to the first network.

Preferably, when the N routing node(s) is a part of the routing nodes through which the data pass when flowing from the second network to the first network, when the N routing node(s) is a part of the routing nodes in the routing nodes through which the data pass when flowing from the second network to the first network, the controller <NUM> is specifically configured to determine a routing node through which the data pass when flowing from the second network to the first network and conforming to a preset constraint condition according to the routing advertisement information and the received routing plan information between the first network and the second network.

Preferably, the controller <NUM> is specifically configured to select a routing node connected to the second network, execute the following operations for each selected routing node until the selected routing node is connected to the first network, determine whether a routing node in the N routing node(s) exists in routing nodes connected to the selected routing node, when determining that the routing node in the N routing node(s) exists in the routing nodes connected to the selected routing node, select the routing node in the N routing node(s) as a next hop routing node, when determining that a routing node in the N routing node(s) does not exist in the routing nodes connected to the selected routing node, select a routing node conforming to the preset constraint condition from the routing nodes connected to the selected routing node as a next hop routing node.

Preferably, the controller <NUM> is further configured to determine a routing node through which the data pass when flowing from the second network to the first network and conforming to a preset constraint condition according to the routing advertisement information.

Preferably, the controller <NUM> is specifically configured to select a routing node connected to the second network, execute the following operation for each selected routing node until the selected routing node is connected to the first network, select a routing node conforming to the preset constraint condition from routing nodes connected to the selected routing node as a next hop routing node.

Specifically, when a plurality of routing nodes in the routing nodes connected to the selected routing node satisfy the preset constraint condition, a routing node is selected from the plurality of routing nodes as the next hop routing node. For example, the preset constraint condition is that the bandwidth is not less than <NUM> and the reliability is not less than <NUM>%, referring to <FIG>, taking D3 as an example, routing nodes connected to D3 include P2, P3, P4 and D4, when P2 and P3 both satisfy the preset constraint condition, a routing node may be randomly selected from P2 and P3 as a next hop routing node of D3, and a routing node may also be selected from P2 and P3 according to a routing algorithm, where a path between the routing node and D3 is an optimal path.

Preferably, the controller <NUM> is further configured to, when data of a plurality of the second networks need to be transmitted to the first network, for the second network, select a routing node conforming to the preset constraint condition from all unselected routing nodes connected to the selected routing node as the next hop routing node.

Those skilled in the art should understand that, the embodiments of the present invention may be provided as a method, an apparatus (device) or a computer program product. Therefore, the present invention may adopt the forms of complete hardware embodiments, complete software embodiments or combined embodiments of software and hardware. Moreover, the present invention may adopt the form of a computer program product implemented on one or multiple computer available storage media (including, but not limited to, a disk storage, a CD-ROM, an optical memory or the like) including computer available program codes.

The present invention is described in accordance with the method, the apparatus (device) in the embodiments of the present invention and a flowchart and/or a block diagram of the computer program product. It should be understood that, computer program instructions may achieve each flow and/or block in the flowchart and/or the block diagram and the combination of the flows and/or blocks in the flowchart and/or the block diagram. These computer program instructions may be provided to a general-purpose computer, a special-purpose computer, an embedded processor or processors of other programmable data processing devices to generate a machine, such that the instructions executed by the computers or the processors of the other programmable data processing devices generate apparatuses used for achieving appointed functions in one flow or multiple flows of the flowchart and/or one block or multiple blocks of the block diagram.

These computer program instructions may also be stored in a computer readable memory capable of guiding the computers or the other programmable data processing devices to work in particular manners, such that the instructions stored in the computer readable memory generate products including instruction apparatuses, and the instruction apparatuses realize the appointed functions in one flow or multiple flows of the flowchart and/or one block or multiple blocks of the block diagram.

Claim 1:
A method for controlling a network traffic path, comprising:
receiving (<NUM>), by a controller, routing advertisement information from a first network to a second network, and routing plan information between the first network and the second network, wherein the routing plan information comprises N routing node(s), and N is a positive integer through which the data must pass when flowing from the second network to the first network, wherein the routing advertisement information includes information of routing nodes in a third network connecting the first network and the second network; and
determining (<NUM>), by the controller, a path in the third network based on the routing advertisement information and the routing plan information, wherein the path is used for transmitting data from the second network to the first network.