WO2015051709A1 - 一种控制网络流量路径的方法和装置 - Google Patents

一种控制网络流量路径的方法和装置 Download PDF

Info

Publication number
WO2015051709A1
WO2015051709A1 PCT/CN2014/087487 CN2014087487W WO2015051709A1 WO 2015051709 A1 WO2015051709 A1 WO 2015051709A1 CN 2014087487 W CN2014087487 W CN 2014087487W WO 2015051709 A1 WO2015051709 A1 WO 2015051709A1
Authority
WO
WIPO (PCT)
Prior art keywords
network
routing
routing node
node
route
Prior art date
Application number
PCT/CN2014/087487
Other languages
English (en)
French (fr)
Inventor
庄顺万
闫长江
于凤青
陈飞
王丽丽
欧阳沅斌
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to EP14851634.7A priority Critical patent/EP3046295B1/en
Priority to EP22163803.4A priority patent/EP4089982A1/en
Publication of WO2015051709A1 publication Critical patent/WO2015051709A1/zh
Priority to US15/094,621 priority patent/US10812368B2/en
Priority to US17/035,239 priority patent/US11528216B2/en
Priority to US17/985,647 priority patent/US11805047B2/en

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/04Interdomain routing, e.g. hierarchical routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/123Evaluation of link metrics
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/20Hop count for routing purposes, e.g. TTL
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/42Centralised routing

Definitions

  • the present invention relates to the field of computer technologies, and in particular, to a method and apparatus for controlling a network traffic path.
  • Border Gateway Protocol is a dynamic routing protocol used between autonomous systems (ASs) and BGP spokespersons who exchange messages with each other. BGP spokespersons. Only the routes that you use are advertised to the peers. When the data flows from the BGP peer to the peer, only the data import routing node connected to the BGP speaker and the data export routing node connected to the peer can be configured.
  • a routing node passing data from the data import routing node to the data exit routing node is selected by a route reflector, because the data import routing node and the data exit routing node All routing nodes between them are neighbor nodes of the route reflector, so that when the routing node is selected, when the route reflector selects the next hop node of one routing node, the next hop routing node and the The selected routing nodes are not adjacent, so there is a technical problem that the next hop routing node that cannot select the routing node by neighbors is the adjacent node.
  • the embodiment of the present application provides a method and device for controlling a network traffic path, which is used to solve the technical problem that the next hop routing node that cannot select a routing node by neighboring neighbors is a neighboring node in the prior art.
  • a method of controlling a network traffic path includes: receiving routing information from the first network to the second network; determining, according to the route publishing information, all routing nodes included in the path that the data flows from the second network to the first network; Each routing node configures a next hop routing node, wherein the next hop routing node is a node of all routing nodes included in the path, and adjacent to the configured routing node, the The configured routing node does not include the routing node of the first network and the routing node of the second network.
  • the determining, according to the routing information, determining, by the second network, all the routing nodes that are included in the path that the first network passes through specifically: Determining, according to the route advertisement information and the received route planning information between the first network and the second network, all routing nodes included in a path that the data flows from the second network to the first network
  • the planning node in the routing planning information includes N routing nodes between the first network and the second network
  • the determined routing node includes the N routing nodes
  • N is a positive integer .
  • the routing information based on the route and the received route between the first network and the second network Determining, by the planning information, all the routing nodes that are included in the path that the data flows from the second network to the first network, and the method includes: publishing the information based on the route, and receiving the first network and the second network Between the route planning information, determining a routing node that the data flows from the second network to the first network that meets a preset constraint condition.
  • the routing information is based on the route and the received route between the first network and the second network Determining, by the planning information, the routing node that the data flows from the second network to the first network that meets the preset constraint, specifically: selecting a routing node connected to the second network; and selecting each routing node for the routing Performing the following operations until the selected routing node is connected to the first network: determining whether one of the N routing nodes exists in the routing node connected to the selected routing node; determining that the N exists When one of the routing nodes is one of the routing nodes, one of the N routing nodes is selected as the next hop routing node; When there is one of the N routing nodes, the routing node that meets the preset constraint is selected from the routing nodes connected to the selected routing node as the next hop routing node.
  • the determining, according to the routing information, determining, by the second network, all the routing nodes that are included in the path that the first network passes through specifically: Determining, according to the route publishing information, a routing node that the data flows from the second network to the first network that meets the preset constraint condition.
  • determining, according to the route publishing information, a preset constraint that the data flows from the second network to the first network a routing node in the condition comprising: selecting a routing node connected to the second network; performing the following operations for each selected routing node until the selected routing node is connected to the first network: from the selected routing node A routing node that meets the preset constraint is selected as a next hop routing node among the connected routing nodes.
  • the selecting the next hop that meets the preset constraint from the routing node connected to the selected routing node includes: when data of the plurality of the second network needs to be transmitted to the first network, for one of the second networks, from all the routing nodes that are not selected to be connected to the selected routing node The routing node that meets the preset constraint is selected as the next hop routing node.
  • a second aspect of the present invention provides an apparatus for controlling a network traffic path, the apparatus comprising: a receiving unit, configured to receive route advertisement information from a first network to a second network; and a route determining unit, configured to receive the Receiving, by the receiving unit, the route publishing information, and determining, according to the route publishing information, all routing nodes included in a path that the data flows from the second network to the first network; and a configuration unit, configured to receive the route Determining, by the determining unit, all the routing nodes that are sent by the unit, configuring a next hop routing node for each determined routing node, wherein the next hop routing node is a node of all routing nodes included in the path, And adjacent to the configured routing node, the configured routing node does not include the routing node of the first network and the routing node of the second network.
  • the route determining unit includes a first route determining subunit, configured to release information based on the route, and receive the first network and the second Route planning information between the networks, determining all routing nodes included in the path that the data flows from the second network to the first network, where the planning node in the routing planning information includes the first network and the N routing nodes between the second networks, the determined routing nodes include the N routing nodes, and N is a positive integer.
  • the first route determining subunit is specifically configured to release information and the received first network based on the route And routing information between the second network and the routing node that determines that the data flows from the second network to the first network and meets a preset constraint.
  • the first route determining subunit is specifically configured to select a routing node connected to the second network, and select Each routing node performs the following operations until the selected routing node is connected to the first network, and determines whether there is one routing node of the N routing nodes in the routing node connected to the selected routing node, and When it is determined that one of the N routing nodes exists, selecting one of the N routing nodes as a next hop routing node, and determining that one of the N routing nodes does not exist At the time of the node, the routing node that meets the preset constraint is selected from the routing nodes connected to the selected routing node as the next hop routing node.
  • the route determining unit includes a second route determining subunit, configured to determine, according to the route publishing information, data flowing from the second network to the first A routing node that the network passes to meet the preset constraints.
  • the second route determining subunit is specifically configured to select a routing node connected to the second network, and select Each routing node performs the following operations until the selected routing node is connected to the first network, and selects a routing node that meets the preset constraint from the routing node connected to the selected routing node as the next hop route. node.
  • the configuration unit is further configured to transmit data to the second network
  • a routing node that meets the preset constraint is selected from all unselected routing nodes connected to the selected routing node as a next hop routing node.
  • a third aspect of the present invention provides an apparatus for controlling a network traffic path, the apparatus comprising: a receiver for receiving route advertisement information from a first network to a second network; and a controller for using the route according to the route Publishing information, determining all routing nodes included in the path through which the data flows from the second network to the first network, and configuring a next hop routing node for each determined routing node, wherein the next hop routing node Is a node of all the routing nodes included in the path, and adjacent to the configured routing node, the configured routing node does not include the routing node of the first network and the second network Routing node.
  • the controller is specifically configured to: advertise information based on the route and received route planning information between the first network and the second network Determining, by the second network, all routing nodes included in the path through which the first network passes, wherein the planning node in the routing planning information includes between the first network and the second network N routing nodes, the determined routing node includes the N routing nodes, and N is a positive integer.
  • the controller is specifically configured to release information based on the route and the received first network and the first The route planning information between the two networks determines, by the routing node, the data flows from the second network to the first network and meets a preset constraint condition.
  • the controller is specifically configured to select a routing node connected to the second network, and for each route selected The node performs the following operations until the selected routing node is connected to the first network, and determines whether a routing node of the N routing nodes exists in the routing node connected to the selected routing node, and determines that there is some When one of the N routing nodes is described, Selecting one of the N routing nodes as a next hop routing node, and when determining that one of the N routing nodes does not exist, selecting a matching from the routing nodes connected to the selected routing node The routing node of the preset constraint is used as a next hop routing node.
  • the controller is further configured to determine, according to the route publishing information, that the data flows from the second network to the first network and meets the pre- Set the routing node for the constraint.
  • the controller is specifically configured to select a routing node connected to the second network, and for each route selected The node performs the following operations until the selected routing node is connected to the first network, and selects a routing node that meets the preset constraint from the routing node connected to the selected routing node as the next hop routing node.
  • the controller is further configured to: when a plurality of the second network data needs to be transmitted to the When the first network is described, for one of the second networks, a routing node that meets the preset constraint is selected from all unselected routing nodes connected to the selected routing node as a next hop routing node.
  • the technical solution of the present application is to receive routing information from the first network to the second network, and then, according to the route publishing information, determine a path that the data flows from the second network to the first network. All the routing nodes are included, and the next hop routing node is configured for each determined routing node. Since the technical solution of the present application configures the next hop routing node for each determined routing node, the data is determined to the determination. When each routing node is used, the data is automatically transmitted to the next hop routing node, thereby solving the technical problem in the prior art that the next hop routing node of the neighboring routing node is a neighboring node.
  • FIG. 1 is a first flowchart of a method for controlling a network traffic path according to an embodiment of the present invention
  • FIG. 2 is a first structural diagram of communication between a first network and a second network according to an embodiment of the present invention
  • FIG. 3 is a second flowchart of a method for controlling a network traffic path according to an embodiment of the present invention
  • FIG. 4 is a third flowchart of a method for controlling a network traffic path according to an embodiment of the present invention.
  • FIG. 5 is a second structural diagram of communication between a first network and a second network according to an embodiment of the present invention.
  • FIG. 6 is a first structural diagram of an apparatus for controlling a network traffic path according to an embodiment of the present invention.
  • FIG. 7 is a second structural diagram of an apparatus for controlling a network traffic path according to an embodiment of the present invention.
  • the technical solution of the embodiment of the present invention firstly receives the route advertisement information from the first network to the second network, and then determines the information according to the route, and then determines the technical problem.
  • Data flowing from the second network to all routing nodes included in the path through which the first network passes, and configuring a next hop routing node for each determined routing node such that data is passed to each of the determined routing nodes The data is automatically transmitted to the next hop routing node, thereby solving the technical problem that the next hop routing node that cannot select the routing node is a neighboring node in the prior art, thereby implementing the neighboring routing node.
  • the technical effect of the one-hop routing node is the neighboring node.
  • the next-hop routing node that can select the routing node by neighboring neighbors is the neighboring node.
  • Embodiment 1 is a diagrammatic representation of Embodiment 1:
  • the first embodiment of the present invention provides a method for controlling a network traffic path. As shown in FIG. 1 , the specific processing procedure of the method is as follows:
  • Step 101 Receive route release information from the first network to the second network.
  • Step 102 Determine, according to the route publishing information, all routing nodes included in a path that the data flows from the second network to the first network;
  • Step 103 Configure a next hop routing node for each determined routing node, where the next hop routing node is a node of all routing nodes included in the path, and is configured with the routing node. Adjacent, the configured routing node does not include the routing node of the first network and the routing node of the second network.
  • step 101 routing information from the first network to the second network is received.
  • the first network and the second network are, for example, a metropolitan area network, and the two metropolitan area networks communicate with each other through a backbone network, for example, a Chengdu metropolitan area network and a Beijing metropolitan area network are adopted.
  • the routing information is generated when the first network sends a route to the second network.
  • the A metropolitan area network when the first network is the A metropolitan area network and the second network is the B metropolitan area network, when the A metropolitan area network is routed to the B metropolitan area network, the A metropolitan area network will be the A metropolitan area network IP. It is 200.1.1.240, 200.1.1.244, 200.1.2.240, 200.1.2.244, 200.1.3.240, etc. to route the B-communication network, and receive the route advertisement information generated when the A metropolitan area network performs route advertisement to the A metropolitan area network. Including the IP address of the A metropolitan area network and the IP address of the B metropolitan area network, and/or, and the IP addresses of all routing nodes through which data flows from the A metropolitan area network to the B metropolitan area network.
  • step 102 is performed.
  • the route publishing information according to the route publishing information, all routing nodes included in the path through which the data flows from the second network to the first network are determined.
  • the routing information may be obtained according to the route, and all the routing nodes that the data flows from the second network to the first network are obtained, and one path is selected from all the routing nodes, so that the data can pass through the The path is transmitted from the second network to the first network.
  • all the determined routing nodes necessarily include the routing node of the first network and the routing node of the second network, And determining that the routing node of the first network is a destination node.
  • the metropolitan area network AS1 routes the route to the metropolitan area network (AS2).
  • the routing controller B1 advertises the information according to the route of AS1.
  • the AS1 and AS2 are connected through the backbone network AS10 to obtain data flow from AS2. All routing nodes that AS1 needs to pass include routing nodes D1, D2, D3, and D4, and routing nodes P1, P2, P3, P4, and P5, and routing nodes of AS1. Routing node A2 of A1 and AS2.
  • the data may be transmitted from the AS2 to the AS1 through multiple paths after the data is obtained from the AS2 to the AS1.
  • the multiple paths may be, for example, A2->D3->P4->P1->D1.
  • one path can be randomly selected from the plurality of paths as a path for data to flow from AS2 to AS1, assuming that one path randomly selected from the plurality of paths is A2->D3->P3- >D1->A1, it is determined that all routing nodes included in the path through which AS2 flows to AS1 are A2, D3, P3, D1 and A1.
  • the data may be sent from the second network to the first network based on the route advertisement information and the received route planning information between the first network and the second network. All the routing nodes included in the path, wherein the planning node in the routing planning information includes N routing nodes between the first network and the second network, and the determined routing node includes the N Routing nodes, N is a positive integer.
  • the route planning information may be obtained before the first network sends a route to the second network, or may be obtained during the process of publishing the route, and may also be obtained after the route is published.
  • the application is not subject to specific restrictions.
  • the N routing nodes refer to nodes that data must pass through from the second network to the first network, and the N values may take values of 1, 2, 5, 10, and 30.
  • the N routing nodes may be part or all of the routing nodes through which data flows from the second network to the first network, where the N routing nodes flow data from the second network to the
  • a part of the routing node of the routing node that passes through the first network is a routing node
  • the N routing nodes are part of the routing node of the routing node that flows when the data flows from the second network to the first network, Deriving the routing information and the received route planning information between the first network and the second network, and determining a routing node that the data flows from the second network to the first network that meets preset constraints .
  • the N routing nodes are data flowing from the second network to the first network
  • some other nodes may also be randomly selected from the routing nodes between the first network and the second network, so that data passes through the other nodes and the N routes.
  • a node flows from the second network to the first network.
  • the metropolitan area network AS1 routes the route to the metropolitan area network (AS2).
  • the routing controller B1 advertises the information according to the route of AS1.
  • the AS1 and AS2 are connected through the backbone network AS10 to obtain data flow from AS2. All routing nodes that AS1 needs to pass include routing nodes D1, D2, D3, and D4, as well as routing nodes P1, P2, P3, P4, and P5, and routing nodes A1 of AS1 and routing node A2 of AS2.
  • the routing controller B1 When the route controller B1 receives the route planning information of the route planning information from AS2 to AS1 as D3->P4->P1->D1, the routing controller B1 has two routing entries destined for DEST_IP:
  • the routing controller B1 executes the request of the planning node, detects that it has a route that satisfies the exit D1, and translates the path into a route along the path:
  • A2->D3->P4->P1->D1->A1 arrives at AS1, so that the path of data flowing from AS2 to AS1 conforms to the routing planning information, while in the existing technology, data flows from AS2 to AS1, each of which The selected routing node selects the next hop routing node according to the calculation result of the IGP, so that the path of the data flowing from the AS2 to the AS1 in the prior art does not meet the routing planning information, and the foregoing technical solution of the present application makes The path of the data flowing from the AS2 to the AS1 is in accordance with the routing planning information, and the routing information can be performed by the unused routing node, thereby fully utilizing the routing node to transmit data.
  • the N routing nodes are a part of the routing nodes of the routing node that flows through the second network to the first network as an example:
  • the routing controller B1 when the routing controller B1 receives the routing planning information of the data flowing from AS2 to AS1, the planning node only includes P3, and the path that the routing controller B1 can select is: A2->D3->P3->D1- >A1,A2->D3->P3->D2->A1,A2->D3->P4->P1->P3->D1->A1,A2->D3->P4->P1->P3 ->D2->A1.
  • the publishing information and the received a routing plan information between the network and the second network determining all routing nodes included in the path that the data flows from the second network to the first network, specifically: publishing information based on the route and receiving The routing plan information between the first network and the second network determines a routing node that the data flows from the second network to the first network that meets a preset constraint condition.
  • the route may also be determined in the foregoing manner.
  • the preset constraint may be a condition for limiting one or more of bandwidth, routing cost, reliability, delay, load, etc., for example, the preset condition may be that the bandwidth is not less than 10M, and the routing cost is the lowest, and it can also be the condition that the bandwidth is not less than 20M or the routing cost is the lowest.
  • the determining, according to the route advertisement information and the received route planning information between the first network and the second network, determining a conformity of data flowing from the second network to the first network includes the following steps:
  • the above steps include:
  • Step 301 Select a routing node connected to the second network.
  • Step 302 Perform the following operations for each selected routing node until the selected routing node is connected to the first network:
  • Step 302 includes step 3021, step 3022, and step 3023, as follows:
  • Step 3021 Determine whether one of the N routing nodes exists in the routing node connected to the selected routing node.
  • step 3022 is performed to select one of the N routing nodes as a next hop routing node
  • step 3023 is executed to select a routing node that meets the preset constraint as a next hop routing node from the routing nodes connected to the selected routing node.
  • step 301 a routing node connected to the second network is selected.
  • the routing controller B1 when the routing controller B1 receives the routing planning information of the data flowing from AS2 to AS1, the planning node only includes P3, since the routing node connected to AS2 has only D3, the route connected to AS2 can be determined.
  • the node is D3.
  • the preset constraint condition is the routing cost. The lowest is an example.
  • step 3021 is performed to determine whether one of the N routing nodes exists in the routing node connected to the selected routing node.
  • D3 when selecting a routing node connected to D3, D3 is based on the routing controller B1. Routing entries, so that the routing nodes that can obtain the connection with D3 include P2, P3, P4, and D4, thereby determining whether P2, P3, P4, and D4 contain one of the N routing nodes, due to the The N routing nodes are P3, and P2, P3, P4, and D4 include P3, and step 3022 is performed, and P3 is used as the routing node of the next hop of D3.
  • step 3021 is performed to determine whether one of the N routing nodes exists in the routing node connected to the selected routing node.
  • P3 when selecting the next hop routing node of P3, P3 is based on the routing entry in the routing controller B1, so that the routing node that can obtain the connection with P3 includes P1, D1, D2, and P2, due to the N
  • the routing node is P3, so that it can be determined that one of the N routing nodes is not included in P1, D1, D2, and P2, and step 3023 is performed to select the matching from the routing nodes connected to the selected routing node.
  • the routing node of the preset constraint is used as a next hop routing node.
  • D1 since D1 is connected to the routing node A1 of AS1, it can be determined that the path of data flowing from AS2 to AS1 is A2->D3->P3->D1->A1.
  • routing information for all the routing nodes included in the path that the data flows from the second network to the first network, according to the routing information, when the routing planning information is not received, And determining, according to the route publishing information, a routing node that the data flows from the second network to the first network that meets the preset constraint condition.
  • the determining, according to the route publishing information, the routing node that the data flows from the second network to the first network that meets a preset constraint specifically includes the following steps:
  • Step 401 Select a routing node connected to the second network.
  • Step 402 Perform the following operations for each selected routing node until the selected routing node is connected to the first network;
  • Step 402 includes step 4021, which is specifically as follows:
  • Step 4021 Select, from the routing nodes connected to the selected routing node, a routing node that meets the preset constraint as the next hop routing node.
  • step 401 a routing node connected to the second network is selected.
  • the routing controller B1 when the routing controller B1 receives the routing plan information of the data flowing from AS2 to AS1, the planning node only includes P3, since the routing node connected to AS2 has only D3, it can be determined that the connection with AS2 is connected.
  • the routing node is D3.
  • the preset constraint condition is the routing cost. The lowest is an example.
  • step 4021 is executed, and a routing node that meets the preset constraint condition is selected from the routing nodes connected to the selected routing node as the next hop routing node.
  • a routing node connected to the selected routing node has multiple routing nodes that satisfy the preset constraint
  • one routing node is selected from the multiple routing nodes as a next hop routing node
  • the preset constraint is that the bandwidth is not less than 10M and the reliability is not less than 80%. See Figure 2, taking D3 as an example.
  • the routing nodes connected to D3 include P2, P3, P4 and D4.
  • P2 and P3 are satisfied
  • a routing node may be randomly selected from P2 and P3 as the next hop routing node of D3, or the path between one routing node and D3 may be selected from P2 and P3 according to the routing algorithm as the optimal path. .
  • D3 when selecting a routing node connected to D3, D3 is based on the routing entry in the routing controller B1, so that the routing node that can obtain the connection with D3 includes P2, P3, P4, and D4, and then from P1, D1.
  • the routing node that meets the preset constraint is selected as the next hop routing node in D2 and P2.
  • the bandwidth of D3 to P2 is assumed to be 10M.
  • the routing cost of D3 to D3 is 1, and when the bandwidth of D3 to P4 is 50M, then The routing cost of D3 to D1 is 2, and when the bandwidth of D3 to D4 is 20M, the routing cost of D3 to D1 is 5, and since 1 ⁇ 2 ⁇ 5 ⁇ 10, it can be determined that the routing cost of D3 to P3 is the lowest, then Determine the next hop routing node of D3 as P3.
  • P3 when selecting the next hop routing node of P3, P3 is based on the routing entry in the routing controller B1, so that the routing node that can obtain the connection with P3 includes P1, D1, D2, and P2, and then from P1.
  • a routing node that meets the preset constraint is selected as a next hop routing node among D1, D2, and P2.
  • P1 and P2 can be removed from routing nodes P1, D1, D2, and P2 connected to P3, and D1 and D2 are selected.
  • the D1 is connected to the routing node A1 of the AS1, and the data flows from the AS2 to the AS1.
  • the A1 is the destination node, and the next hop routing node of the D1 is determined to be A1, so that the path from the AS2 to the AS1 is A2.
  • -> D3 -> P3 -> D1 -> A1 so that in the above manner, since each of the determined routes conforms to the preset constraint, the path of the data flowing from AS2 to AS1 can conform to the preset constraint. Conditions, but also minimize the routing cost of the determined route, enabling data to be transmitted more stably and quickly.
  • the selecting the next hop routing node from the all routing nodes includes: removing the routing information from all the routing nodes.
  • the next hop routing node is selected among the selected routing nodes.
  • next hop routing node selected from the selected routing nodes is removed from all the routing nodes, as shown in FIG. 2, taking D3 as an example, and
  • the routing nodes of the connection of D3 include P2, P3, P4 and D4.
  • P3 has been selected
  • the next hop routing node of D3 is selected from P2, P4 and D4, so that each traffic path does not cross.
  • it can prevent the occurrence of multiple branching paths after the convergence point occurs, and realizes the technical effect that multiple traffic paths do not have convergence points.
  • the first step is to select the routing node connected to AS2 as D3 and the routing node connected to AS3 as D4, where D3 and D4.
  • the preset constraint conditions are met, and the preset constraint condition is the lowest route cost.
  • the routing nodes connected to D3 are P4, P3, P2, and D4. Since D4 has been selected, the routing node with the least cost between D3 and P3 is selected as the next hop routing node from P4, P3, and P2. If the cost between P4 and D3 is 5, the cost between P3 and D3 is 3, and the cost between P3 and D3 is 10. Since 3 ⁇ 5 ⁇ 10, P3 is selected as the next hop node of D3.
  • the routing nodes connected to D4 are D3, P1, P2, and P5. Since D3 has been selected, the routing node with the least cost between D4 and P4 is selected as the next hop routing node from P1, P2, and P5. If the cost between P1 and D4 is 6, the cost between P2 and D4 is 4, and the cost between P5 and D4 is 9. Since 4 ⁇ 6 ⁇ 9, P2 is selected as the next hop node of D4.
  • the routing nodes connected to P3 are P1, D1, D2, D3, and P2. Since P2 and D3 have been selected, the routing node with the least cost between P3 and P3 is selected from P1, D1, and D2. For a one-hop routing node, if the cost between P1 and P3 is 20, the cost between D1 and P3 is 7, and the cost between D2 and P3 is 15. Since 7 ⁇ 15 ⁇ 20, D1 is selected as the next hop node of P3. .
  • the routing nodes connected to P2 are D3, P1, P3, D2, P5, and D4. Since D4, D3, and P3 have been selected, the least cost between P1, D2, and P5 is selected. The routing node is the next hop routing node. If the cost between P1 and P2 is 13, the cost between D1 and P2 is 1, and the cost between D2 and P2 is 35. Since 1 ⁇ 13 ⁇ 35, D2 is selected as P2. Next hop node.
  • step 103 is performed, in which a next hop routing node is configured for each determined routing node, wherein the next hop routing node is a node of all routing nodes included in the path, and Adjacent to the configured routing node, the configured routing node does not include a routing node of the first network and a routing node of the second network.
  • routing node of the first network is the destination node and the routing node of the second network is the starting node, all the routing nodes included in the determined path necessarily include the first network.
  • the routing node and the routing node of the second network, and the routing node of the first network does not have a next hop routing node.
  • the execution body of the method for controlling the network traffic path cannot normally be controlled.
  • a routing node of the second network therefore, after determining that all data is included in the path that the data flows from the second network to the first network, the routing node of the first network and the first The routing node of the second network is removed, and then the next hop routing node is configured for each determined routing node, so that when the data arrives at each determined routing node, each determined routing node automatically transmits the data to the next. Jump routing nodes to improve data forwarding efficiency.
  • the next hop routing node is a node of all the routing nodes included in the path, and is adjacent to the configured routing node, that is, the next hop routing node and the trait are characterized.
  • the configured routing nodes are neighbor nodes, and the neighbor nodes are nodes directly connected to one routing node. When one routing node and another routing node are neighbor nodes, the routing node can be determined.
  • the other routing node is an adjacent node.
  • D3 and P4 are neighbor nodes, and D3 and P3 are mutually neighbor nodes, and D3 and P2 is also a neighbor node, and D3 and D4 are mutually neighbor nodes.
  • the routing nodes directly connected to P3 are P1, D1, D2, D3, and P2, then it can be determined that P3 and P1 are neighbor nodes, and P3 and D1 are mutually neighbor nodes, and P3 and D2 is also a neighbor node.
  • P3 and D3 are also neighbor nodes.
  • P3 and P2 are also neighbor nodes, and P3 is not directly connected to P4 and P5.
  • P3 and P4 are not neighbor nodes, that is, P3 and P4 are not represented.
  • Adjacent nodes, and P3 and P5 are not neighbor nodes, that is, P3 and P5 are not adjacent nodes.
  • the routing controller B1 when it is determined that the path from the AS2 to the AS1 is A2->D3->P3->D1->A1, the routing controller B1 sends a route to the D3:
  • the routing controller B1 when the data is transmitted from AS2 to D3, because the routing controller B1 has configured the next hop route to P3 for D3, D3 will directly transmit the data to P3.
  • the routing controller B1 When the data is received by P3, the routing controller B1 is used.
  • the P3 is configured with the next hop route as D1, which causes P3 to directly transmit data to D1.
  • D1 transmits the data directly to AS1, thereby implementing the next hop routing node of the neighbor-by-neighbor routing node.
  • the technical effect of the neighboring node is that the next hop routing node of the routing node can be selected as a neighboring node by neighboring neighbors.
  • the routing node can be removed in the determined route. In addition to the nodes, fine-grained and flexible traffic grooming can be achieved.
  • the routing controller B1 sends a route to the D4:
  • the routing controller B1 P2 has been configured with the next hop route as D2, which causes P2 to directly transmit data to D2, and then D2 transmits the data directly to AS1, thereby implementing the next hop routing node of the neighbor-by-neighbor routing node.
  • the technical effect of the neighboring node is that the next hop routing node of the routing node can be selected as a neighboring node by neighboring neighbors.
  • the routing node can be removed in the determined route. In addition to the nodes, fine-grained and flexible traffic grooming can be achieved.
  • the following operations are performed to detect whether each of the N routing nodes has been selected.
  • the planning node of the route planning information from AS2 to AS1 is: D3->P3->D1
  • the routing path of data from AS3 to AS1 is: A3->D4- >P2->P3->D2->A1
  • Route planning information if the routing path of data from AS3 to AS1 is: A3->D4->P2->D2->A1, since each routing node of D3, P3, and D1 is not selected, data can be determined.
  • the routing node that flows from AS2 to AS1 is A2->D3->P3->D1->A1.
  • the planning nodes included in the routing planning information can be verified, so that each traffic path does not cross, and the multiple traffic paths can be prevented from being bifurcated after the convergence point occurs.
  • the strip traffic path does not have the technical effect of the convergence point.
  • the technical solution of the present application is to receive routing information from the first network to the second network, and then, according to the route publishing information, determine a path that the data flows from the second network to the first network. All the routing nodes are included, and the next hop routing node is configured for each determined routing node. Since the technical solution of the present application configures the next hop routing node for each determined routing node, the data is determined to the determination. When each routing node is used, the data is automatically transmitted to the next hop routing node, thereby solving the technical problem in the prior art that the next hop routing node of the neighboring routing node is a neighboring node.
  • Embodiment 2 is a diagrammatic representation of Embodiment 1:
  • Embodiment 2 of the present invention provides an apparatus for controlling a network traffic path.
  • the apparatus includes: a receiving unit 601, configured to receive route advertisement information from a first network to a second network; and a route determining unit 602. And receiving, by the receiving unit 601, the route publishing information, and determining, according to the route publishing information, all routing nodes included in a path that the data flows from the second network to the first network; and a configuration unit 603, All routing nodes for receiving the determination sent by the route determining unit 602, configuring a next hop routing node for each determined routing node, wherein the next hop routing node is all routes included in the path a node in the node, and adjacent to the configured routing node, the configured routing node does not include the routing node of the first network and the routing node of the second network.
  • all the determined routing nodes necessarily include the routing node of the first network and the route of the second network. a node, and can determine that the routing node of the first network is a destination node.
  • the receiving unit 601 may obtain, according to the route advertisement information, all routing nodes that the data flows from the second network to the first network, and are in all routing nodes.
  • a path is selected to enable data to be transmitted from the second network to the first network through the path.
  • the route determining unit 602 includes a first route determining sub-unit 604, configured to determine data from the routing information and the received routing plan information between the first network and the second network.
  • the second network flows to all routing nodes included in the path that the first network passes, where the planning node in the routing planning information includes N routing nodes between the first network and the second network
  • the determined routing node includes the N routing nodes, and N is a positive integer.
  • the route planning information may be obtained before the first network sends a route to the second network, or may be obtained during the process of publishing the route, and may also be obtained after the route is published.
  • the application is not subject to specific restrictions.
  • the N routing nodes refer to nodes that data must pass through from the second network to the first network, and the N values may take values of 1, 2, 5, 10, and 30.
  • the N routing nodes may be some or all of the routing nodes through which data flows from the second network to the first network.
  • the N routing nodes are part of the routing node of the routing node that flows when the data flows from the second network to the first network
  • the N routing nodes are data from the second
  • the first routing determining subunit 604 is configured to release information based on the routing and the received first network and the second network.
  • the routing plan information determines the routing node that the data flows from the second network to the first network and meets a preset constraint condition.
  • the N routing nodes are a part of routing nodes of the routing node that flows when the data flows from the second network to the first network, between the first network and the second network. Randomly selecting some other nodes in the routing node to pass data through the other nodes And the N routing nodes flow from the second network to the first network.
  • the first route determining sub-unit 604 is specifically configured to select a routing node connected to the second network, and perform the following operations for each selected routing node until the selected routing node and the first network Connecting, determining whether one of the N routing nodes exists in the routing node connected to the selected routing node, and selecting the N when determining that one of the N routing nodes exists.
  • One of the routing nodes is a next hop routing node, and when it is determined that one of the N routing nodes does not exist, the routing node connected to the selected routing node is selected to meet the preset.
  • the routing node of the constraint acts as the next hop routing node.
  • the preset constraint may be a condition for limiting one or more of bandwidth, routing cost, reliability, delay, load, etc., for example, the preset condition may be a bandwidth of not less than 10M, and routing The lowest cost, but also the condition that the bandwidth is not less than 20M or the routing cost is the lowest.
  • the route planning information that the routing controller B1 receives data flowing from AS2 to AS1 includes only P3, since the routing node connected to AS2 has only D3, it can be determined that the routing node connected to AS2 is D3.
  • the preset constraint as the lowest routing cost as an example, for the selected routing node D3, when selecting the routing node connected to D3, D3 is based on the routing entry in the routing controller B1, so that D3 can be obtained.
  • the connected routing nodes include P2, P3, P4, and D4, thereby determining whether P2, P3, P4, and D4 include one of the N routing nodes, because the N routing nodes are P3, and P2, P3, P4 and D4 contain P3, and P3 is used as the routing node of the next hop of D3.
  • P3 is based on the routing entry in the routing controller B1, so that the routing node that can obtain the connection with P3 includes P1, D1, D2, and P2, because the N routes are
  • the node is P3, so that it can be determined that one of the N routing nodes is not included in P1, D1, D2, and P2, and then the preset constraint is selected from the routing nodes connected to the selected routing node.
  • the routing node acts as the next hop routing node, and since the data needs to flow from AS2 to AS1, it can be from the routing nodes P1, D1, D2 and P2 connected to P3. P1 and P2 are removed, and the routing node of the next hop is selected from D1 and D2.
  • D1 since D1 is connected to the routing node A1 of AS1, it can be determined that the path of data flowing from AS2 to AS1 is A2->D3->P3->D1->A1.
  • the route determining unit 602 includes a second route determining sub-unit 605, configured to determine, according to the route publishing information, a routing node that the data flows from the second network to the first network that meets the preset constraint.
  • the second route determining sub-unit 605 is specifically configured to select a routing node connected to the second network, and perform the following operations for each selected routing node until the selected routing node and the first network Connecting, and selecting a routing node that meets the preset constraint from the routing node connected to the selected routing node as the next hop routing node.
  • a routing node connected to the selected routing node has multiple routing nodes that satisfy the preset constraint
  • one routing node is selected from the multiple routing nodes as a next hop routing node
  • the preset constraint is that the bandwidth is not less than 10M and the reliability is not less than 80%. See Figure 2, taking D3 as an example.
  • the routing nodes connected to D3 include P2, P3, P4 and D4.
  • P2 and P3 are satisfied
  • a routing node may be randomly selected from P2 and P3 as the next hop routing node of D3, or the path between one routing node and D3 may be selected from P2 and P3 according to the routing algorithm as the optimal path. .
  • the configuration unit 603 is further configured to: when data of the plurality of the second network needs to be transmitted to the first network, for a second network, not connected to the selected routing node Among the selected routing nodes, the routing node that meets the preset constraint is selected as the next hop routing node.
  • next hop routing node selected from the selected routing nodes is removed from all the routing nodes, as shown in FIG. 2, taking D3 as an example, and
  • the routing nodes of the connection of D3 include P2, P3, P4 and D4.
  • P3 has been selected
  • the next hop routing node of D3 is selected from P2, P4 and D4, so that each traffic path does not cross.
  • it can prevent the occurrence of multiple branching paths after the convergence point occurs, and realizes the technical effect that multiple traffic paths do not have convergence points.
  • the technical solution of the present application is to receive routing information from the first network to the second network, and then, according to the route publishing information, determine a path that the data flows from the second network to the first network. All the routing nodes are included, and the next hop routing node is configured for each determined routing node. Since the technical solution of the present application configures the next hop routing node for each determined routing node, the data is determined to the determination. When each routing node is used, the data is automatically transmitted to the next hop routing node, thereby solving the technical problem in the prior art that the next hop routing node of the neighboring routing node is a neighboring node.
  • Embodiment 3 is a diagrammatic representation of Embodiment 3
  • Embodiment 2 of the present invention provides an apparatus for controlling a network traffic path.
  • the apparatus includes: a receiver 701, configured to receive route release information from a first network to a second network; and a controller 702, And configured to determine, according to the route publishing information, all routing nodes included in a path that the data flows from the second network to the first network, and configure a next hop routing node for each determined routing node, where The next hop routing node is a node of all the routing nodes included in the path, and is adjacent to the configured routing node, and the configured routing node does not include the routing node of the first network. And a routing node of the second network.
  • the receiver 701 may be, for example, a WIFI module, an antenna, or the like. Further, the controller 702 may be a separate processing chip or may be integrated into the processor of the device.
  • all the determined routing nodes necessarily 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.
  • the device may obtain, according to the route advertisement information, all the routing nodes that the data flows from the second network to the first network, from all the routing nodes. Selecting a path from the routing node to enable data to pass the A path is transmitted from the second network to the first network.
  • the controller 702 is specifically configured to determine, according to the route advertisement information and the received route planning information between the first network and the second network, that data flows from the second network to the All routing nodes included in the path through which the first network passes, wherein the planning node in the routing planning information includes N routing nodes between the first network and the second network, and the determined routing node includes The N routing nodes, N is a positive integer.
  • the route planning information may be obtained before the first network sends a route to the second network, or may be obtained during the process of publishing the route, and may also be obtained after the route is published.
  • the application is not subject to specific restrictions.
  • the N routing nodes refer to nodes that data must pass through from the second network to the first network, and the N values may take values of 1, 2, 5, 10, and 30.
  • the N routing nodes may be some or all of the routing nodes through which data flows from the second network to the first network.
  • the N routing nodes are part of the routing node of the routing node that flows when the data flows from the second network to the first network
  • the N routing nodes are data from the second
  • the controller 702 is specifically configured to release information based on the route and the received route between the first network and the second network.
  • the planning information determines a routing node that the data flows from the second network to the first network and meets a preset constraint.
  • the N routing nodes are a part of routing nodes of the routing node that flows when the data flows from the second network to the first network, between the first network and the second network. Some other nodes are randomly selected among the routing nodes such that data flows from the second network to the first network through the other nodes and the N routing nodes.
  • the controller 702 is specifically configured to select a routing node connected to the second network, and perform the following operations for each selected routing node until the selected routing node is connected to the first network, and determine Whether there is one of the N routing nodes in the routing node connected to the selected routing node, and determining that one of the N routing nodes exists When the node is selected, one of the N routing nodes is selected as the next hop routing node, and when it is determined that one of the N routing nodes does not exist, the route connected to the selected routing node is selected. A routing node that meets the preset constraint is selected as a next hop routing node.
  • the preset constraint may be a condition for limiting one or more of bandwidth, routing cost, reliability, delay, load, etc., for example, the preset condition may be a bandwidth of not less than 10M, and routing The lowest cost, but also the condition that the bandwidth is not less than 20M or the routing cost is the lowest.
  • the controller 702 is further configured to determine, according to the route publishing information, a routing node that the data flows from the second network to the first network that meets the preset constraint.
  • the controller 702 is specifically configured to select a routing node connected to the second network, and perform the following operations for each selected routing node until the selected routing node is connected to the first network, and A routing node that meets the preset constraint is selected as a next hop routing node among the routing nodes connected to the selected routing node.
  • a routing node connected to the selected routing node has multiple routing nodes that satisfy the preset constraint
  • one routing node is selected from the multiple routing nodes as a next hop routing node
  • the preset constraint is that the bandwidth is not less than 10M and the reliability is not less than 80%. See Figure 2, taking D3 as an example.
  • the routing nodes connected to D3 include P2, P3, P4 and D4.
  • P2 and P3 are satisfied
  • a routing node may be randomly selected from P2 and P3 as the next hop routing node of D3, or the path between one routing node and D3 may be selected from P2 and P3 according to the routing algorithm as the optimal path. .
  • the controller 702 is further configured to: when data of the plurality of the second network needs to be transmitted to the first network, for a second network, not connected to the selected routing node Among the selected routing nodes, the routing node that meets the preset constraint is selected as the next hop routing node.
  • next hop routing node selected from the selected routing nodes is removed from all the routing nodes, as shown in FIG. 2, taking D3 as an example, and
  • the routing nodes of the connection of D3 include P2, P3, P4 and D4.
  • P3 has been selected
  • the next hop routing node of D3 is selected from P2, P4 and D4, so that each traffic path does not cross.
  • it can prevent the occurrence of multiple branching paths after the convergence point occurs, and realizes the technical effect that multiple traffic paths do not have convergence points.
  • the technical solution of the present application is to receive routing information from the first network to the second network, and then, according to the route publishing information, determine a path that the data flows from the second network to the first network. All the routing nodes are included, and the next hop routing node is configured for each determined routing node. Since the technical solution of the present application configures the next hop routing node for each determined routing node, the data is determined to the determination. When each routing node is used, the data is automatically transmitted to the next hop routing node, thereby solving the technical problem in the prior art that the next hop routing node of the neighboring routing node is a neighboring node.
  • embodiments of the present invention can be provided as a method, apparatus (device), or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) including computer usable program code.
  • a computer-usable storage media including but not limited to disk storage, CD-ROM, optical storage, etc.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.

Abstract

本发明公开了一种控制网络流量路径的方法及装置,接收从第一网络向第二网络的路由发布信息;根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点;为确定的每一个路由节点配置下一跳路由节点,其中,所述下一跳路由节点是所述路径中所包含的所有路由节点中的节点,且与所述被配置的路由节点相邻,所述被配置的路由节点不包括所述第一网络的路由节点和所述第二网络的路由节点。

Description

一种控制网络流量路径的方法和装置
本申请要求于2013年10月11日提交中国专利局、申请号为CN201310474162.4、发明名称为“一种控制网络流量路径的方法及装置”的中国专利申请的优先权,其全部内容通过引用结合在本申请中。
技术领域
本发明涉及计算机技术领域,具体涉及一种控制网络流量路径的方法和装置。
背景技术
边界网关协议(Border Gateway Protocol,简称BGP)是一种用于自治系统(Autonomous System简称AS)之间的动态路由协议,且相互交换消息的BGP发言人之间互称对等体,BGP发言人只把自己使用的路由通告给对等体,进而使得数据从BGP发言人流向对等体时,只能配置与BGP发言人连接的数据进口路由节点和与对等体连接的数据出口路由节点。
现有技术中,数据从所述数据进口路由节点到所述数据出口路由节点之间经过的路由节点是通过路由反射器来进行选择的,由于所述数据进口路由节点和所述数据出口路由节点之间的所有路由节点均为路由反射器的邻居节点,导致在选择经过的路由节点时,路由反射器在选择一个路由节点的下一跳路节点时,所述下一跳路由节点与所述选择的路由节点并不相邻,从而存在无法逐邻居选择路由节点的下一跳路由节点为相邻节点的技术问题。
发明内容
本申请实施例通过提供一种控制网络流量路径的方法及装置,用于解决现有技术中存在无法逐邻居选择路由节点的下一跳路由节点为相邻节点的技术问题。
根据本发明的第一方面,提供了一种控制网络流量路径的方法,所述方 法包括:接收从第一网络向第二网络的路由发布信息;根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点;为确定的每一个路由节点配置下一跳路由节点,其中,所述下一跳路由节点是所述路径中所包含的所有路由节点中的节点,且与所述被配置的路由节点相邻,所述被配置的路由节点不包括所述第一网络的路由节点和所述第二网络的路由节点。
结合第一方面,在第一种可能的实现方式中,所述根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,具体包括:基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点;其中,所述路由规划信息中的规划节点包括所述第一网络和所述第二网络之间的N个路由节点,所述确定的路由节点包括所述N个路由节点,N为正整数。
结合第一方面的第一种可能的实现方式,在第二种可能的实现方式中,所述基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,具体包括:基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的符合预设约束条件的路由节点。
结合第一方面的第二种可能的实现方式,在第三种可能的实现方式中,所述基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的符合预设约束条件的路由节点,具体包括:选择与所述第二网络连接的路由节点;针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接:判断与选择的路由节点连接的路由节点中是否存在有所述N个路由节点中的一个路由节点;在判断存在有所述N个路由节点中的一个路由节点时,选择所述N个路由节点中的一个路由节点为下一跳路由节点;在判断未 存在所述N个路由节点中的一个路由节点时,从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
结合第一方面,在第四种可能的实现方式中,所述根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,具体包括:根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的符合所述预设约束条件的路由节点。
结合第一方面的第四种可能的实现方式,在第五种可能的实现方式中,根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的符合预设约束条件中的路由节点,包括:选择与所述第二网络连接的路由节点;针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接:从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
结合第一方面的第三种或第五种可能的实现方式,在第六种可能的实现方式中,所述从与选择的路由节点连接的路由节点中选择符合预设约束条件的下一跳路由节点,包括:在有多个所述第二网络的数据需要传输给所述第一网络时,针对一个所述第二网络,从与选择的路由节点连接的未被选择的所有路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
本发明的第二方面提供了一种控制网络流量路径的装置,所述装置包括:接收单元,用于接收从第一网络向第二网络的路由发布信息;路由确定单元,用于接收所述接收单元发送的所述路由发布信息,并根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点;配置单元,用于接收所述路由确定单元发送的所述确定的所有路由节点,为确定的每一个路由节点配置下一跳路由节点,其中,所述下一跳路由节点是所述路径中所包含的所有路由节点中的节点,且与所述被配置的路由节点相邻,所述被配置的路由节点不包括所述第一网络的路由节点和所述第二网络的路由节点。
结合第二方面,在第一种可能的实现方式中,所述路由确定单元包括第一路由确定子单元,用于基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,其中,所述路由规划信息中的规划节点包括所述第一网络和所述第二网络之间的N个路由节点,所述确定的路由节点包括所述N个路由节点,N为正整数。
结合第二方面的第一种可能的实现方式,在第二种可能的实现方式中,所述第一路由确定子单元,具体用于基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的符合预设约束条件的路由节点。
结合第二方面的第二种可能的实现方式,在第三种可能的实现方式中,所述第一路由确定子单元,具体用于选择与所述第二网络连接的路由节点,并针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接,判断与选择的路由节点连接的路由节点中是否存在有所述N个路由节点中的一个路由节点,以及在判断存在有所述N个路由节点中的一个路由节点时,选择所述N个路由节点中的一个路由节点为下一跳路由节点,以及在判断未存在所述N个路由节点中的一个路由节点时,从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
结合第二方面,在第四种可能的实现方式中,所述路由确定单元包括第二路由确定子单元,用于根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的符合所述预设约束条件的路由节点。
结合第二方面的第四种可能的实现方式,在第五种可能的实现方式中,所述第二路由确定子单元,具体用于选择与所述第二网络连接的路由节点,并针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接,以及从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
结合第二方面的第三种或第五种可能的实现方式,在第六种可能的实现方式中,所述配置单元,还用于在有多个所述第二网络的数据需要传输给所述第一网络时,针对一个所述第二网络,从与选择的路由节点连接的未被选择的所有路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
本发明的第三方面提供了一种控制网络流量路径的装置,所述装置包括:接收器,用于接收从第一网络向第二网络的路由发布信息;控制器,用于根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,以及为确定的每一个路由节点配置下一跳路由节点,其中,所述下一跳路由节点是所述路径中所包含的所有路由节点中的节点,且与所述被配置的路由节点相邻,所述被配置的路由节点不包括所述第一网络的路由节点和所述第二网络的路由节点。
结合第三方面,在第一种可能的实现方式中,所述控制器,具体用于基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,其中,所述路由规划信息中的规划节点包括所述第一网络和所述第二网络之间的N个路由节点,所述确定的路由节点包括所述N个路由节点,N为正整数。
结合第三方面的第一种可能的实现方式,在第二种可能的实现方式中,所述控制器,具体用于基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的符合预设约束条件的路由节点。
结合第三方面的第二种可能的实现方式,在第三种可能的实现方式中,所述控制器,具体用于选择与所述第二网络连接的路由节点,并针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接,判断与选择的路由节点连接的路由节点中是否存在有所述N个路由节点中的一个路由节点,以及在判断存在有所述N个路由节点中的一个路由节点时, 选择所述N个路由节点中的一个路由节点为下一跳路由节点,以及在判断未存在所述N个路由节点中的一个路由节点时,从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
结合第三方面,在第四种可能的实现方式中,所述控制器,还用于根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的符合所述预设约束条件的路由节点。
结合第三方面的第四种可能的实现方式,在第五种可能的实现方式中,所述控制器,具体用于选择与所述第二网络连接的路由节点,并针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接,以及从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
结合第三方面的第三种或第五种可能的实现方式,在第六种可能的实现方式中,所述控制器,还用于在有多个所述第二网络的数据需要传输给所述第一网络时,针对一个所述第二网络,从与选择的路由节点连接的未被选择的所有路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
本发明有益效果如下:
本发明实施例中,本申请技术方案是接收从第一网络向第二网络的路由发布信息,再根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,以及为确定的每一个路由节点配置下一跳路由节点,由于本申请的技术方案为所述确定的每一个路由节点配置了下一跳路由节点,使得数据到所述确定的每一个路由节点时,数据会被自动传输给下一跳路由节点,从而解决了现有技术中存在逐逐邻居选择路由节点的下一跳路由节点为相邻节点的技术问题。
附图说明
图1为本发明实施例中控制网络流量路径的方法的第一种流程图;
图2为本发明实施例对第一网络和第二网络进行通信的第一种结构图;
图3为本发明实施例中控制网络流量路径的方法的第二种流程图;
图4为本发明实施例中控制网络流量路径的方法的第三种流程图;
图5为本发明实施例对第一网络和第二网络进行通信的第二种结构图;
图6为本发明实施例中控制网络流量路径的装置的第一种结构图;
图7为本发明实施例中控制网络流量路径的装置的第二种结构图。
具体实施方式
针对现有技术中存在无法逐邻居选择路由节点的技术问题,本发明实施例提出的技术方案中,首先接收从第一网络向第二网络的路由发布信息,再根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,以及为确定的每一个路由节点配置下一跳路由节点,使得数据到所述确定的每一个路由节点时,数据会被自动传输给下一跳路由节点,从而解决了现有技术中存在无法逐邻居选择路由节点的下一跳路由节点为相邻节点的技术问题,从而实现了逐邻居选择路由节点的下一跳路由节点为相邻节点的技术效果,由于能够逐逐邻居选择路由节点的下一跳路由节点为相邻节点,当一路由节点中的网络流量较大时,从而可以将所述路由节点去除在所述确定的路由节点之外,进而能够实现细粒度、灵活的流量疏导。
下面结合各个附图对本发明实施例技术方案的主要实现原理、具体实施方式及其对应能够达到的有益效果进行详细地阐述。
实施例一:
本发明实施例一提出了一种控制网络流量路径的方法,如图1所示,该方法具体处理过程如下:
步骤101:接收从第一网络向第二网络的路由发布信息;
步骤102:根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点;
步骤103:为确定的每一个路由节点配置下一跳路由节点,其中,所述下一跳路由节点是所述路径中所包含的所有路由节点中的节点,且与所述被配置的路由节点相邻,所述被配置的路由节点不包括所述第一网络的路由节点和所述第二网络的路由节点。
其中,在步骤101中,接收从第一网络向第二网络的路由发布信息。在具体实施过程中,所述第一网络和所述第二网络例如是城域网,两个城域网之间是通过骨干网进行通信的,例如成都城域网和北京城域网是通过163骨干网连接的,在所述第一网络向所述第二网络进行路由发布时,接收所述第一网络向所述第二网络进行路由发布时产生的所述路由发布信息。
例如,以第一网络为A城域网以及以第二网络为B城域网为例,在A城域网向B城域网进行路由发布时,A城域网将A城域网IP例如是200.1.1.240,200.1.1.244,200.1.2.240,200.1.2.244,200.1.3.240等向B城域网进行路由发布,并接收A城域网向A城域网进行路由发布时产生的路由发布信息包括A城域网的IP地址和B城域网路的IP地址,和/或,以及数据从A城域网流向B城域网时经过的所有路由节点的IP地址。
接下来执行步骤102,在该步骤中,根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点。
在具体实施过程中,可以根据所述路由发布信息,获取到数据从所述第二网络流向第一网络经过的所有路由节点,在从所有的路由节点中选择一条路径,以使得数据能够通过所述路径从所述第二网络传输到所述第一网络。
具体的,由于所述是从所述第二网络流向所述第一网络的,导致所述确定的所有路由节点必然包含有所述第一网络的路由节点和所述第二网络的路由节点,并可以确定所述第一网络的路由节点为目的节点。
例如,参见图2,在城域网AS1向城域网AS2进行了路由发布,路由控制器B1根据AS1的路由发布信息,其中,AS1和AS2之间通过骨干网AS10连接,获取数据从AS2流向AS1需要经过的所有路由节点包括路由节点D1、D2、D3和D4,以及路由节点P1、P2、P3、P4和P5,以及AS1的路由节点 A1和AS2的路由节点A2。
其中,在获取数据从AS2流向AS1需要经过的所有路由节点之后,数据可以通过多条路径从AS2传输到AS1,所述多条路径例如可以是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等,可以从所述多条路径中随机选择一条路径作为数据从AS2流向AS1的路径,假设从所述多条路径中随机选择的一条路径为A2->D3->P3->D1->A1,则确定数据从AS2流向AS1经过的路径包含的所有路由节点为A2,D3,P3,D1和A1。
在具体实施过程中,还可以基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,其中,所述路由规划信息中的规划节点包括所述第一网络和所述第二网络之间的N个路由节点,所述确定的路由节点包括所述N个路由节点,N为正整数。
其中,所述路由规划信息可以在所述第一网络向所述第二网络进行路由发布之前获取,也可以在进行所述路由发布的过程中获取,还可以在所述路由发布之后获取,本申请不作具体限制。
具体的,所述N个路由节点是指数据从所述第二网络流向所述第一网络是必须经过的节点,所述N个值可以取1,2,5,10,30等值,所述N个路由节点可以是数据从所述第二网络流向所述第一网络时经过的路由节点中的一部分或全部路由节点,在所述N个路由节点为数据从所述第二网络流向所述第一网络时经过的路由节点的一部分路由节点时,在所述N个路由节点为数据从所述第二网络流向所述第一网络时经过的路由节点的一部分路由节点时,可以基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的符合预设约束条件的路由节点。
当然,在所述N个路由节点为数据从所述第二网络流向所述第一网络时 经过的路由节点的一部分路由节点时,还可以从所述第一网络与所述第二网络之间的路由节点中随机选择一些其它节点,以使得数据通过所述其它节点和所述N个路由节点从所述第二网络流向所述第一网络。
下面以所述N个路由节点为数据从所述第二网络流向所述第一网络时经过的路由节点的全部路由节点为例:
例如,参见图2,在城域网AS1向城域网AS2进行了路由发布,路由控制器B1根据AS1的路由发布信息,其中,AS1和AS2之间通过骨干网AS10连接,获取数据从AS2流向AS1需要经过的所有路由节点包括路由节点D1、D2、D3和D4,以及路由节点P1、P2、P3、P4和P5,以及AS1的路由节点A1和AS2的路由节点A2。
当路由控制器B1接收到数据从AS2流向AS1的路由规划信息的规划节点为D3->P4->P1->D1时,路由控制器B1上有去往DEST_IP的2条路由表项:
Dest:   NextHop:
DEST_IP D1
DEST_IP D2
路由控制器B1执行所述规划节点的要求,检测到自己有满足出口为D1的路由,于是将路径翻译成该路径沿途各点的路由:
给D1下发路由:
Dest:   NextHop:
DEST_IP A1
给P1下发路由:
Dest:  NextHop:
DEST_IP D1
给P4下发路由:
Dest: NextHop:
DEST_IP P1
给D3选择路由:
Dest: NextHop:
DEST_IP P4
从而使得从AS2访问AS1的数据将顺着路径:
A2->D3->P4->P1->D1->A1,到达AS1,使得数据从AS2流向AS1的路径符合所述路由规划信息,而现有的技术中数据从AS2流向AS1时,每一个选择的路由节点均是根据IGP的计算结果来选择下一跳路由节点,进而使得现有技术中的数据从AS2流向AS1的路径不符合所述路由规划信息,而本申请的上述技术方案,使得数据从AS2流向AS1的路径符合所述路由规划信息,可以将未经使用的路由节点来进行所述路由规划信息,进而实现充分利用路由节点来传输数据。
下面以所述N个路由节点为数据从所述第二网络流向所述第一网络时经过的路由节点的一部分路由节点为例:
参见图2,当路由控制器B1接收到数据从AS2流向AS1的路由规划信息的规划节点仅包含P3时,则路由控制器B1可以选择的路径为:A2->D3->P3->D1->A1,A2->D3->P3->D2->A1,A2->D3->P4->P1->P3->D1->A1,A2->D3->P4->P1->P3->D2->A1。
具体的,在所述N个路由节点为数据从所述第二网络流向所述第一网络时经过的路由节点的一部分路由节点时,所述基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,具体包括:基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的符合预设约束条件的路由节点。
当然,在所述N个路由节点为数据从所述第二网络流向所述第一网络时经过的路由节点的全部路由节点时,也可以按照上述方式来确定路由。
其中,所述预设约束条件可以是针对带宽,路由成本、可靠性、时延、负载等中一种或多种进行限制的条件,例如所述预设条件可以是带宽不小于 10M,且路由成本最低,还可以仅是带宽不小于20M或者路由成本最低的条件。
具体的,所述基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的符合预设约束条件的路由节点,具体包括以下步骤:
参见图3,上述步骤包括:
步骤301:选择与所述第二网络连接的路由节点;
步骤302:针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接:
其中,步骤302包括步骤3021、步骤3022和步骤3023,具体如下:
步骤3021:判断与选择的路由节点连接的路由节点中是否存在有所述N个路由节点中的一个路由节点;
在判断存在有所述N个路由节点中的一个路由节点时,执行步骤3022,选择所述N个路由节点中的一个路由节点为下一跳路由节点;
在判断未存在所述N个路由节点中的一个路由节点时,执行步骤3023,从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
其中,在步骤301中,选择与所述第二网络连接的路由节点。
例如,参见图2,当路由控制器B1接收到数据从AS2流向AS1的路由规划信息的规划节点仅包含P3时,由于与AS2连接的路由节点仅有D3,因此,可以确定与AS2连接的路由节点为D3。
接下来执行步骤302,由于与AS2连接的路由节点仅有D3,进而使得AS2的路由节点A2到D3的带宽参数等参数均满足所述预设约束条件,以所述预设约束条件为路由成本最低为例。
针对选择的路由节点D3,执行步骤3021,判断与选择的路由节点连接的路由节点中是否存在有所述N个路由节点中的一个路由节点。
参见图2,在选择与D3连接的路由节点时,D3根据路由控制器B1中的 路由表项,从而可以得到与D3的连接的路由节点包括P2,P3,P4和D4,从而判断P2,P3,P4和D4是否包含有所述N个路由节点中的一个路由节点,由于所述N个路由节点为P3,而P2,P3,P4和D4中包含有P3,进行执行步骤3022,将P3作为D3的下一跳的路由节点。
接下来针对P3,执行步骤3021,判断与选择的路由节点连接的路由节点中是否存在有所述N个路由节点中的一个路由节点。
参见图2,在选择P3的下一跳路由节点时,P3根据路由控制器B1中的路由表项,从而可以得到与P3的连接的路由节点包括P1,D1,D2和P2,由于所述N个路由节点为P3,从而可以判定P1,D1,D2和P2中未包括有所述N个路由节点中的一个路由节点,则执行步骤3023,从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
进一步的,参见图2,针对P3,根据路由拓扑结构,由于数据需要从AS2流向AS1,因此,可以从与P3连接的路由节点P1,D1,D2和P2中去除掉P1和P2,从D1和D2中进行选择下一跳的路由节点,假设P3到D1的带宽为100M,则P3到D1的路由成本为:cost=10^8/100M=1,而P3到D2的带宽为16M时,则P3到D2的路由成本为:cost=10^8/16M=6,由于P3到D1的路由成本小于P3到D2的路由成本,且所述预设预设条件为路由成本最低,进而可以判定D1为P3的下一跳路由节点。
针对D1,由于D1与AS1的路由节点A1连接,进而可以确定数据从AS2流向AS1的路径为A2->D3->P3->D1->A1。
具体来讲,针对所述所述根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,在未接收到所述路由规划信息时,可以根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的符合所述预设约束条件的路由节点。
具体的,所述根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的符合预设约束条件中的路由节点,具体包括以下步骤:
参见图4,上述步骤包括:
步骤401:选择与所述第二网络连接的路由节点;
步骤402:针对选择的每一个路由节点执行以下操作,直到选择的路由节点与第一网络连接;
其中,步骤402包括步骤4021,具体如下:
步骤4021:从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
其中,在步骤401中,选择与所述第二网络连接的路由节点。
例如,参见图2,当路由控制器B1接收到数据从AS2流向AS1的路由规划信息中的规划节点仅包含P3时,由于与AS2连接的路由节点仅有D3,因此,可以确定与AS2连接的路由节点为D3。
接下来执行步骤302,由于与AS2连接的路由节点仅有D3,进而使得AS2的路由节点A2到D3的带宽参数等参数均满足所述预设约束条件,以所述预设约束条件为路由成本最低为例。
针对选择的路由节点D3,执行步骤4021,从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
具体来讲,在与选择的路由节点连接的路由节点有多个路由节点满足所述预设约束条件时,从所述多个路由节点中选择一个路由节点作为下一跳路由节点,例如所述预设约束条件为带宽不小于10M,可靠性不低于80%时,参见图2,以D3为例,与D3连接的路由节点包括P2,P3,P4和D4,当P2和P3均满足所述预设约束条件时,可以从P2和P3随机选择一个路由节点为D3的下一跳路由节点,也可以根据路由算法从P2和P3中选择一个路由节点与D3之间的路径为最佳路径。
参见图2,在选择与D3连接的路由节点时,D3根据路由控制器B1中的路由表项,从而可以得到与D3的连接的路由节点包括P2,P3,P4和D4,再从P1,D1,D2和P2中选择符合所述预设约束条件的路由节点作为下一跳路由节点,在所述预设约束条件为路由成本最低时,假设D3到P2的带宽为10M, 则P3到D1的路由成本为:cost=10^8/10M=10,在D3到P3的带宽为100M时,则D3到D3的路由成本为1,在D3到P4的带宽为50M时,则D3到D1的路由成本为2,在D3到D4的带宽为20M时,则D3到D1的路由成本为5,由于1<2<5<10,从而可以确定D3到P3的路由成本最低,则确定D3的下一跳路由节点为P3。
参见图2,在选择P3的下一跳路由节点时,P3根据路由控制器B1中的路由表项,从而可以得到与P3的连接的路由节点包括P1,D1,D2和P2,再从P1,D1,D2和P2中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
进一步的,针对P3,根据路由拓扑结构,由于数据需要从AS2流向AS1,因此,可以从与P3连接的路由节点P1,D1,D2和P2中去除掉P1和P2,从D1和D2中进行选择下一跳的路由节点,假设P3到D1的带宽为100M,则P3到D1的路由成本为:cost=10^8/100M=1,而P3到D2的带宽为16M时,则P3到D2的路由成本为:cost=10^8/16M=6,由于P3到D1的路由成本小于P3到D2的路由成本,且所述预设预设条件为路由成本最低,进而可以判定D1为P3的下一跳路由节点。
针对D1,由于D1与AS1的路由节点A1连接,而数据是从AS2流向AS1,导致A1为目的节点,进而可以确定D1的下一跳路由节点为A1,使得数据从AS2流向AS1的路径为A2->D3->P3->D1->A1,进而使得通过上述方式,由于确定的每一个路由均符合所述预设约束条件,进而使得数据从AS2流向AS1的路径能够符合所述预设约束条件,而且还能使得所述确定的路由的路由成本最低,使得数据能够更稳定和快速的进行传输。
在具体实施过程中,在所述所有路由节点中存在已被选中的路由节点时,所述从所述所有路由节点中选中下一跳路由节点,具体包括:从所述所有路由节点中除去所述已被选中的路由节点中选中下一跳路由节点。
具体来讲,在一个路由节点已被选中时,从所述所有路由节点中除去所述已被选中的路由节点中选中下一跳路由节点,参见图2,以D3为例,与 D3的连接的路由节点包括P2,P3,P4和D4,在P3已被选中时,则从P2,P4和D4中选择D3的下一跳路由节点,使得每一条流量路径不会出现交叉的情况,进而能够防止出现多条流量路径出现汇聚点后再分叉的情况,实现了多条流量路径不出现汇聚点的技术效果。
例如,参见图5,在AS1向AS2和城域网AS3进行路由发布时,首先执行步骤:分别选择与AS2连接的路由节点为D3和选择与AS3连接的路由节点为D4,其中,D3和D4均符合所述预设约束条件,以所述预设约束条件为路由成本最低为例。
接下来针对D3,与D3连接的路由节点为P4、P3、P2和D4,由于D4已被选中,则从P4、P3和P2中选择与D3间的cost最小的路由节点为下一跳路由节点,若P4与D3间的cost为5,P3与D3间的cost为3,P3与D3间的cost为10,由于3<5<10,则选择P3为D3的下一跳节点。
接下来针对D4,与D4连接的路由节点为D3、P1、P2和P5,由于D3已被选中,则从P1、P2和P5中选择与D4间的cost最小的路由节点为下一跳路由节点,若P1与D4间的cost为6,P2与D4间的cost为4,P5与D4间的cost为9,由于4<6<9,则选择P2为D4的下一跳节点。
接下来针对P3,与P3连接的路由节点为P1、D1、D2、D3和P2,由于P2和D3已被选中,则从P1、D1和D2中选择与P3间的cost最小的路由节点为下一跳路由节点,若P1与P3间的cost为20,D1与P3间的cost为7,D2与P3间的cost为15,由于7<15<20,则选择D1为P3的下一跳节点。
接下来针对P2,与P2连接的路由节点为D3,P1,P3、D2、P5和D4,由于D4、D3和P3已被选中,则从P1,D2和P5中选择与P2间的cost最小的路由节点为下一跳路由节点,若P1与P2间的cost为13,D1与P2间的cost为1,D2与P2间的cost为35,由于1<13<35,则选择D2为P2的下一跳节点。
接下来针对D1,由于D1与AS1的路由节点A1连接,而数据是从AS2流向AS1,导致A1为目的节点,进而可以确定D1的下一跳路由节点为A1, 使得数据从AS2流向AS1的路径为A2->D3->P3->D1->A1。
接下来针对D2,由于D2与AS1的路由节点A1连接,而数据是从AS3流向AS1,导致A1为目的节点,进而可以确定D1的下一跳路由节点为A1,使得数据从AS3流向AS1的路径为A3->D4->P2->D2->A1,进而使得获取的两条流量路径没有出现汇聚点,实现了多条流量路径不出现汇聚点的技术效果。
接下来执行步骤103,在该步骤中,为确定的每一个路由节点配置下一跳路由节点,其中,所述下一跳路由节点是所述路径中所包含的所有路由节点中的节点,且与所述被配置的路由节点相邻,所述被配置的路由节点不包括所述第一网络的路由节点和所述第二网络的路由节点。
在具体实施过程中,由于所述第一网络的路由节点为目的节点以及所述第二网络的路由节点为起始节点,导致所述确定的路径包含的所有路由节点必然包含所述第一网络的路由节点和所述第二网络的路由节点,而且会导致所述第一网络的路由节点没有下一跳路由节点,另外,所述控制网络流量路径的方法的执行主体通常情况下并不能控制所述第二网络的路由节点,因此,在确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点之后,需要将所述第一网络的路由节点和所述第二网络的路由节点去除掉,再为确定的每一个路由节点配置下一跳路由节点,以使得数据到达确定的每一个路由节点时,所述确定的每一个路由节点自动将数据传输到下一跳路由节点,以提高数据的转发效率。
具体的,所述下一跳路由节点是所述路径中所包含的所有路由节点中的节点,且与所述被配置的路由节点相邻,即表征所述下一跳路由节点与所述被配置的路由节点互为邻居节点,所述邻居节点是指一个路由节点与另一个路由节点直接相连的节点,在一个路由节点与另一个路由节点互为邻居节点时,可以确定所述一个路由节点与所述另一个路由节点为相邻节点。
例如,参见图5,针对D3,与D3直接相连的路由节点为P4、P3、P2和D4,则可以确定D3与P4互为邻居节点,D3与P3也互为邻居节点,D3与 P2也互为邻居节点,D3与D4也互为邻居节点。
又例如,参见图5,针对P3,与P3直接相连的路由节点为P1、D1、D2、D3和P2,则可以确定P3与P1互为邻居节点,P3与D1也互为邻居节点,P3与D2也互为邻居节点,P3与D3也互为邻居节点,P3与P2也互为邻居节点,而P3与P4以及P5并不直接相连,导致P3和P4不是邻居节点,即表征P3和P4不是相邻节点,以及P3与P5不是邻居节点,即表征P3与P5不是相邻节点。
例如,参见图5,在确定数据从AS2流向AS1的路径为A2->D3->P3->D1->A1时,则路由控制器B1给D3下发路由:
Dest: NextHop:
DEST_IP P3
给P3下发路由:
Dest: NextHop:
DEST_IP D1
给D1下发路由:
Dest: NextHop:
DEST_IP A1
如此,在数据从AS2传输到D3时,由于路由控制器B1已经给D3配置了下一跳路由为P3,导致D3会直接将数据传输给P3,在P3接收到数据时,由于路由控制器B1已经给P3配置了下一跳路由为D1,导致P3也会直接将数据传输给D1,然后D1将数据直接传输给AS1,进而实现了实现了逐邻居选择路由节点的下一跳路由节点为相邻节点的技术效果,由于能够逐邻居选择路由节点的下一跳路由节点为相邻节点,当一路由节点中的数据流量较大时,从而可以将所述路由节点去除在所述确定的路由节点之外,进而能够实现细粒度、灵活的流量疏导。
以及在确定数据从AS3流向AS1的路径为A3->D4->P2->D2->A1时,则路由控制器B1给D4下发路由:
Dest: NextHop:
DEST_IP P2
给P3下发路由:
Dest: NextHop:
DEST_IP D2
给D2下发路由:
Dest: NextHop:
DEST_IP A1
如此,在数据从AS3传输到D3时,由于路由控制器B1已经给D4配置了下一跳路由为P2,导致D4会直接将数据传输给P2,在P2接收到数据时,由于路由控制器B1已经给P2配置了下一跳路由为D2,导致P2也会直接将数据传输给D2,然后D2将数据直接传输给AS1,进而实现了实现了逐邻居选择路由节点的下一跳路由节点为相邻节点的技术效果,由于能够逐邻居选择路由节点的下一跳路由节点为相邻节点,当一路由节点中的数据流量较大时,从而可以将所述路由节点去除在所述确定的路由节点之外,进而能够实现细粒度、灵活的流量疏导。
在另一实施例中,在所述基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息之后,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点之前,针对所述N个路由节点中的每一个路由节点,执行以下操作,检测所述N个路由节点中的每一个路由节点是否已被选中。
在具体实施过程中,在所述N个路由节点中的每一个路由节点都未被选中时,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点;否则,则发送提示信息,用以提示所述路由规划信息不正确。
例如,参见图5,在TI时刻,数据从AS2流向AS1的路由规划信息的规划节点为:D3->P3->D1,且数据从AS3流向AS1的经过的路由路径为:A3->D4->P2->P3->D2->A1,检测D3,P3和D1中的每一个路由节点是否已被 选中,由于P3已被选中,则发送语音数据“路由规划信息不正确”给用户,以提示所述路由规划信息不正确,还可以将P3已被选中的信息发送给客户端,以方便重新设置路由规划信息;若数据从AS3流向AS1的经过的路由路径为:A3->D4->P2->D2->A1,由于D3,P3和D1每一个路由节点均未被选中,则可以确定数据从AS2流向AS1经过的路由节点为A2->D3->P3->D1->A1。
如此,能够对所述路由规划信息包含的规划节点进行校验,使得每一条流量路径不会出现交叉的情况,进而能够防止出现多条流量路径出现汇聚点后再分叉的情况,实现了多条流量路径不出现汇聚点的技术效果。
本发明实施例中,本申请技术方案是接收从第一网络向第二网络的路由发布信息,再根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,以及为确定的每一个路由节点配置下一跳路由节点,由于本申请的技术方案为所述确定的每一个路由节点配置了下一跳路由节点,使得数据到所述确定的每一个路由节点时,数据会被自动传输给下一跳路由节点,从而解决了现有技术中存在逐逐邻居选择路由节点的下一跳路由节点为相邻节点的技术问题。
实施例二:
本发明的实施例二提供了一种控制网络流量路径的装置,参见图6,所述装置包括:接收单元601,用于接收从第一网络向第二网络的路由发布信息;路由确定单元602,用于接收接收单元601发送的所述路由发布信息,并根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点;配置单元603,用于接收路由确定单元602发送的所述确定的所有路由节点,为确定的每一个路由节点配置下一跳路由节点,其中,所述下一跳路由节点是所述路径中所包含的所有路由节点中的节点,且与所述被配置的路由节点相邻,所述被配置的路由节点不包括所述第一网络的路由节点和所述第二网络的路由节点。
其中,由于所述是从所述第二网络流向所述第一网络的,导致所述确定的所有路由节点必然包含有所述第一网络的路由节点和所述第二网络的路由 节点,并可以确定所述第一网络的路由节点为目的节点。
具体的,接收单元601在接收到所述路由发布信息之后,可以根据所述路由发布信息,获取到数据从所述第二网络流向第一网络经过的所有路由节点,在从所有的路由节点中选择一条路径,以使得数据能够通过所述路径从所述第二网络传输到所述第一网络。
较佳的,路由确定单元602包括第一路由确定子单元604,用于基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,其中,所述路由规划信息中的规划节点包括所述第一网络和所述第二网络之间的N个路由节点,所述确定的路由节点包括所述N个路由节点,N为正整数。
其中,所述路由规划信息可以在所述第一网络向所述第二网络进行路由发布之前获取,也可以在进行所述路由发布的过程中获取,还可以在所述路由发布之后获取,本申请不作具体限制。
具体的,所述N个路由节点是指数据从所述第二网络流向所述第一网络是必须经过的节点,所述N个值可以取1,2,5,10,30等值,所述N个路由节点可以是数据从所述第二网络流向所述第一网络时经过的路由节点中的一部分或全部路由节点。
较佳的,在所述N个路由节点为数据从所述第二网络流向所述第一网络时经过的路由节点的一部分路由节点时,在所述N个路由节点为数据从所述第二网络流向所述第一网络时经过的路由节点的一部分路由节点时,第一路由确定子单元604,用于基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的符合预设约束条件的路由节点。
当然,在所述N个路由节点为数据从所述第二网络流向所述第一网络时经过的路由节点的一部分路由节点时,还可以从所述第一网络与所述第二网络之间的路由节点中随机选择一些其它节点,以使得数据通过所述其它节点 和所述N个路由节点从所述第二网络流向所述第一网络。
较佳的,第一路由确定子单元604,具体用于选择与所述第二网络连接的路由节点,并针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接,判断与选择的路由节点连接的路由节点中是否存在有所述N个路由节点中的一个路由节点,以及在判断存在有所述N个路由节点中的一个路由节点时,选择所述N个路由节点中的一个路由节点为下一跳路由节点,以及在判断未存在所述N个路由节点中的一个路由节点时,从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
其中,所述预设约束条件可以是针对带宽,路由成本、可靠性、时延、负载等中一种或多种进行限制的条件,例如所述预设条件可以是带宽不小于10M,且路由成本最低,还可以仅是带宽不小于20M或者路由成本最低的条件。
例如,参见图2,当路由控制器B1接收到数据从AS2流向AS1的路由规划信息仅包含P3时,由于与AS2连接的路由节点仅有D3,因此,可以确定与AS2连接的路由节点为D3,以所述预设约束条件为路由成本最低为例,针对选择的路由节点D3,在选择与D3连接的路由节点时,D3根据路由控制器B1中的路由表项,从而可以得到与D3的连接的路由节点包括P2,P3,P4和D4,从而判断P2,P3,P4和D4是否包含有所述N个路由节点中的一个路由节点,由于所述N个路由节点为P3,而P2,P3,P4和D4中包含有P3,则将P3作为D3的下一跳的路由节点。
其中,在选择P3的下一跳路由节点时,P3根据路由控制器B1中的路由表项,从而可以得到与P3的连接的路由节点包括P1,D1,D2和P2,由于所述N个路由节点为P3,从而可以判定P1,D1,D2和P2中未包括有所述N个路由节点中的一个路由节点,则从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点,而且由于数据需要从AS2流向AS1,因此,可以从与P3连接的路由节点P1,D1,D2和P2 中去除掉P1和P2,从D1和D2中进行选择下一跳的路由节点,假设P3到D1的带宽为100M,则P3到D1的路由成本为:cost=10^8/100M=1,而P3到D2的带宽为16M时,则P3到D2的路由成本为:cost=10^8/16M=6,由于P3到D1的路由成本小于P3到D2的路由成本,且所述预设预设条件为路由成本最低,进而可以判定D1为P3的下一跳路由节点。
针对D1,由于D1与AS1的路由节点A1连接,进而可以确定数据从AS2流向AS1的路径为A2->D3->P3->D1->A1。
路由确定单元602包括第二路由确定子单元605,用于根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的符合所述预设约束条件的路由节点。
较佳的,第二路由确定子单元605,具体用于选择与所述第二网络连接的路由节点,并针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接,以及从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
具体来讲,在与选择的路由节点连接的路由节点有多个路由节点满足所述预设约束条件时,从所述多个路由节点中选择一个路由节点作为下一跳路由节点,例如所述预设约束条件为带宽不小于10M,可靠性不低于80%时,参见图2,以D3为例,与D3连接的路由节点包括P2,P3,P4和D4,当P2和P3均满足所述预设约束条件时,可以从P2和P3随机选择一个路由节点为D3的下一跳路由节点,也可以根据路由算法从P2和P3中选择一个路由节点与D3之间的路径为最佳路径。
较佳的,配置单元603,还用于在有多个所述第二网络的数据需要传输给所述第一网络时,针对一个所述第二网络,从与选择的路由节点连接的未被选择的所有路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
具体来讲,在一个路由节点已被选中时,从所述所有路由节点中除去所述已被选中的路由节点中选中下一跳路由节点,参见图2,以D3为例,与 D3的连接的路由节点包括P2,P3,P4和D4,在P3已被选中时,则从P2,P4和D4中选择D3的下一跳路由节点,使得每一条流量路径不会出现交叉的情况,进而能够防止出现多条流量路径出现汇聚点后再分叉的情况,实现了多条流量路径不出现汇聚点的技术效果。
本发明实施例中,本申请技术方案是接收从第一网络向第二网络的路由发布信息,再根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,以及为确定的每一个路由节点配置下一跳路由节点,由于本申请的技术方案为所述确定的每一个路由节点配置了下一跳路由节点,使得数据到所述确定的每一个路由节点时,数据会被自动传输给下一跳路由节点,从而解决了现有技术中存在逐逐邻居选择路由节点的下一跳路由节点为相邻节点的技术问题。
实施例三:
本发明的实施例二提供了一种控制网络流量路径的装置,参见图7,所述装置包括:接收器701,用于接收从第一网络向第二网络的路由发布信息;控制器702,用于根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,以及为确定的每一个路由节点配置下一跳路由节点,其中,所述下一跳路由节点是所述路径中所包含的所有路由节点中的节点,且与所述被配置的路由节点相邻,所述被配置的路由节点不包括所述第一网络的路由节点和所述第二网络的路由节点。
其中,接收器701例如可以是WIFI模块,天线等电子设备,进一步的,控制器702可以是单独的处理芯片,也可以集成在所述装置的处理器中。
其中,由于所述是从所述第二网络流向所述第一网络的,导致所述确定的所有路由节点必然包含有所述第一网络的路由节点和所述第二网络的路由节点,并可以确定所述第一网络的路由节点为目的节点。
具体的,接收器701在接收到所述路由发布信息之后,所述装置可以根据所述路由发布信息,获取到数据从所述第二网络流向第一网络经过的所有路由节点,在从所有的路由节点中选择一条路径,以使得数据能够通过所述 路径从所述第二网络传输到所述第一网络。
较佳的,控制器702,具体用于基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,其中,所述路由规划信息中的规划节点包括所述第一网络和所述第二网络之间的N个路由节点,所述确定的路由节点包括所述N个路由节点,N为正整数。
其中,所述路由规划信息可以在所述第一网络向所述第二网络进行路由发布之前获取,也可以在进行所述路由发布的过程中获取,还可以在所述路由发布之后获取,本申请不作具体限制。
具体的,所述N个路由节点是指数据从所述第二网络流向所述第一网络是必须经过的节点,所述N个值可以取1,2,5,10,30等值,所述N个路由节点可以是数据从所述第二网络流向所述第一网络时经过的路由节点中的一部分或全部路由节点。
较佳的,在所述N个路由节点为数据从所述第二网络流向所述第一网络时经过的路由节点的一部分路由节点时,在所述N个路由节点为数据从所述第二网络流向所述第一网络时经过的路由节点的一部分路由节点时,控制器702,具体用于基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的符合预设约束条件的路由节点。
当然,在所述N个路由节点为数据从所述第二网络流向所述第一网络时经过的路由节点的一部分路由节点时,还可以从所述第一网络与所述第二网络之间的路由节点中随机选择一些其它节点,以使得数据通过所述其它节点和所述N个路由节点从所述第二网络流向所述第一网络。
较佳的,控制器702,具体用于选择与所述第二网络连接的路由节点,并针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接,判断与选择的路由节点连接的路由节点中是否存在有所述N个路由节点中的一个路由节点,以及在判断存在有所述N个路由节点中的一个路 由节点时,选择所述N个路由节点中的一个路由节点为下一跳路由节点,以及在判断未存在所述N个路由节点中的一个路由节点时,从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
其中,所述预设约束条件可以是针对带宽,路由成本、可靠性、时延、负载等中一种或多种进行限制的条件,例如所述预设条件可以是带宽不小于10M,且路由成本最低,还可以仅是带宽不小于20M或者路由成本最低的条件。
较佳的,控制器702,还用于根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的符合所述预设约束条件的路由节点。
较佳的,控制器702,具体用于选择与所述第二网络连接的路由节点,并针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接,以及从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
具体来讲,在与选择的路由节点连接的路由节点有多个路由节点满足所述预设约束条件时,从所述多个路由节点中选择一个路由节点作为下一跳路由节点,例如所述预设约束条件为带宽不小于10M,可靠性不低于80%时,参见图2,以D3为例,与D3连接的路由节点包括P2,P3,P4和D4,当P2和P3均满足所述预设约束条件时,可以从P2和P3随机选择一个路由节点为D3的下一跳路由节点,也可以根据路由算法从P2和P3中选择一个路由节点与D3之间的路径为最佳路径。
较佳的,控制器702,还用于在有多个所述第二网络的数据需要传输给所述第一网络时,针对一个所述第二网络,从与选择的路由节点连接的未被选择的所有路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
具体来讲,在一个路由节点已被选中时,从所述所有路由节点中除去所述已被选中的路由节点中选中下一跳路由节点,参见图2,以D3为例,与 D3的连接的路由节点包括P2,P3,P4和D4,在P3已被选中时,则从P2,P4和D4中选择D3的下一跳路由节点,使得每一条流量路径不会出现交叉的情况,进而能够防止出现多条流量路径出现汇聚点后再分叉的情况,实现了多条流量路径不出现汇聚点的技术效果。
本发明实施例中,本申请技术方案是接收从第一网络向第二网络的路由发布信息,再根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,以及为确定的每一个路由节点配置下一跳路由节点,由于本申请的技术方案为所述确定的每一个路由节点配置了下一跳路由节点,使得数据到所述确定的每一个路由节点时,数据会被自动传输给下一跳路由节点,从而解决了现有技术中存在逐逐邻居选择路由节点的下一跳路由节点为相邻节点的技术问题。
本领域的技术人员应明白,本发明的实施例可提供为方法、装置(设备)、或计算机程序产品。因此,本发明可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且,本发明可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本发明是参照根据本发明实施例的方法、装置(设备)和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器,使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中,使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品,该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上,使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理,从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
尽管已描述了本发明的优选实施例,但本领域内的技术人员一旦得知了基本创造性概念,则可对这些实施例作出另外的变更和修改。所以,所附权利要求意欲解释为包括优选实施例以及落入本发明范围的所有变更和修改。
显然,本领域的技术人员可以对本发明进行各种改动和变型而不脱离本发明的精神和范围。这样,倘若本发明的这些修改和变型属于本发明权利要求及其等同技术的范围之内,则本发明也意图包含这些改动和变型在内。

Claims (14)

  1. 一种控制网络流量路径的方法,其特征在于,所述方法包括:
    接收从第一网络向第二网络的路由发布信息;
    根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点;
    为确定的每一个路由节点配置下一跳路由节点,其中,所述下一跳路由节点是所述路径中所包含的所有路由节点中的节点,且与所述被配置的路由节点相邻,所述被配置的路由节点不包括所述第一网络的路由节点和所述第二网络的路由节点。
  2. 如权利要求1所述的方法,其特征在于,所述根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,具体包括:
    基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点;
    其中,所述路由规划信息中的规划节点包括所述第一网络和所述第二网络之间的N个路由节点,所述确定的路由节点包括所述N个路由节点,N为正整数。
  3. 如权利要求2所述的方法,其特征在于,所述基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,具体包括:
    基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的符合预设约束条件的路由节点。
  4. 如权利要求3所述的方法,其特征在于,所述基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从 所述第二网络流向所述第一网络经过的符合预设约束条件的路由节点,具体包括:
    选择与所述第二网络连接的路由节点;
    针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接:
    判断与选择的路由节点连接的路由节点中是否存在有所述N个路由节点中的一个路由节点;
    在判断存在有所述N个路由节点中的一个路由节点时,选择所述N个路由节点中的一个路由节点为下一跳路由节点;
    在判断未存在所述N个路由节点中的一个路由节点时,从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
  5. 如权利要求1所述的方法,其特征在于,所述根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,具体包括:
    根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的符合所述预设约束条件的路由节点。
  6. 如权利要求5所述的方法,其特征在于,根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的符合预设约束条件中的路由节点,包括:
    选择与所述第二网络连接的路由节点;
    针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接:
    从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
  7. 如权利要求4或6所述的方法,其特征在于,所述从与选择的路由节点连接的路由节点中选择符合预设约束条件的下一跳路由节点,包括:
    在有多个所述第二网络的数据需要传输给所述第一网络时,针对一个所述第二网络,从与选择的路由节点连接的未被选择的所有路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
  8. 一种控制网络流量路径的装置,其特征在于,所述装置包括:
    接收单元,用于接收从第一网络向第二网络的路由发布信息;
    路由确定单元,用于接收所述接收单元发送的所述路由发布信息,并根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点;
    配置单元,用于接收所述路由确定单元发送的所述确定的所有路由节点,为确定的每一个路由节点配置下一跳路由节点,其中,所述下一跳路由节点是所述路径中所包含的所有路由节点中的节点,且与所述被配置的路由节点相邻,所述被配置的路由节点不包括所述第一网络的路由节点和所述第二网络的路由节点。
  9. 如权利要求8所述的装置,其特征在于,所述路由确定单元包括第一路由确定子单元,用于基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的路径包含的所有路由节点,其中,所述路由规划信息中的规划节点包括所述第一网络和所述第二网络之间的N个路由节点,所述确定的路由节点包括所述N个路由节点,N为正整数。
  10. 如权利要求9所述的装置,其特征在于,所述第一路由确定子单元,具体用于基于所述路由发布信息和接收到的所述第一网络与所述第二网络之间的路由规划信息,确定数据从所述第二网络流向所述第一网络经过的符合预设约束条件的路由节点。
  11. 如权利要求10所述的装置,其特征在于,所述第一路由确定子单元,具体用于选择与所述第二网络连接的路由节点,并针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接,判断与选择的路由节点连接的路由节点中是否存在有所述N个路由节点中的一个路由节 点,以及在判断存在有所述N个路由节点中的一个路由节点时,选择所述N个路由节点中的一个路由节点为下一跳路由节点,以及在判断未存在所述N个路由节点中的一个路由节点时,从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
  12. 如权利要求8所述的装置,其特征在于,所述路由确定单元包括第二路由确定子单元,用于根据所述路由发布信息,确定数据从所述第二网络流向所述第一网络经过的符合所述预设约束条件的路由节点。
  13. 如权利要求12所述的装置,其特征在于,所述第二路由确定子单元,具体用于选择与所述第二网络连接的路由节点,并针对选择的每一个路由节点执行以下操作,直到选择的路由节点与所述第一网络连接,以及从与选择的路由节点连接的路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
  14. 如权利要求11或13所述的装置,其特征在于,所述配置单元,还用于在有多个所述第二网络的数据需要传输给所述第一网络时,针对一个所述第二网络,从与选择的路由节点连接的未被选择的所有路由节点中选择符合所述预设约束条件的路由节点作为下一跳路由节点。
PCT/CN2014/087487 2013-10-11 2014-09-26 一种控制网络流量路径的方法和装置 WO2015051709A1 (zh)

Priority Applications (5)

Application Number Priority Date Filing Date Title
EP14851634.7A EP3046295B1 (en) 2013-10-11 2014-09-26 Method and apparatus for controlling network traffic path
EP22163803.4A EP4089982A1 (en) 2013-10-11 2014-09-26 Method and apparatus for controlling network traffic path
US15/094,621 US10812368B2 (en) 2013-10-11 2016-04-08 Method and apparatus for controlling network traffic path
US17/035,239 US11528216B2 (en) 2013-10-11 2020-09-28 Method and apparatus for controlling network traffic path
US17/985,647 US11805047B2 (en) 2013-10-11 2022-11-11 Method and apparatus for controlling network traffic path

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201310474162.4A CN104579992B (zh) 2013-10-11 2013-10-11 一种控制网络流量路径的方法及装置
CN201310474162.4 2013-10-11

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US15/094,621 Continuation US10812368B2 (en) 2013-10-11 2016-04-08 Method and apparatus for controlling network traffic path

Publications (1)

Publication Number Publication Date
WO2015051709A1 true WO2015051709A1 (zh) 2015-04-16

Family

ID=52812519

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/087487 WO2015051709A1 (zh) 2013-10-11 2014-09-26 一种控制网络流量路径的方法和装置

Country Status (4)

Country Link
US (3) US10812368B2 (zh)
EP (2) EP4089982A1 (zh)
CN (1) CN104579992B (zh)
WO (1) WO2015051709A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104954894A (zh) * 2015-06-26 2015-09-30 网宿科技股份有限公司 一种视频流量引导方法、装置及一种电子设备

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104579992B (zh) * 2013-10-11 2018-05-29 华为技术有限公司 一种控制网络流量路径的方法及装置
CN108462639B (zh) * 2016-12-13 2020-04-28 腾讯科技(深圳)有限公司 自治系统中的流量传输控制方法和系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1479496A (zh) * 2002-08-27 2004-03-03 华为技术有限公司 在三层网络中查找路由下一跳的方法
CN1893419A (zh) * 2005-07-06 2007-01-10 华为技术有限公司 一种路由更新方法
WO2007047867A2 (en) * 2005-10-20 2007-04-26 Cisco Technology, Inc. Constructing and implementing backup paths in autonomous systems
CN101076029A (zh) * 2007-07-12 2007-11-21 中兴通讯股份有限公司 一种边界网关协议递归路由更新的方法

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8693323B1 (en) * 2004-04-05 2014-04-08 Verizon Business Global Llc System and method for managing communications in an access network
US20060291446A1 (en) * 2005-06-24 2006-12-28 Donald Caldwell Systems, methods, and devices for managing routing
US7769888B2 (en) * 2007-06-15 2010-08-03 Silver Spring Networks, Inc. Method and system for providing network and routing protocols for utility services
US8451750B2 (en) * 2008-10-01 2013-05-28 Cisco Technology, Inc. Validation of routes advertised by border gateway protocol
JP5408243B2 (ja) * 2009-03-09 2014-02-05 日本電気株式会社 OpenFlow通信システムおよびOpenFlow通信方法
EP2409459A1 (en) * 2009-03-16 2012-01-25 Telefonaktiebolaget L M Ericsson (PUBL) Inter-domain advertisements in multi-domain networks
US8773992B2 (en) * 2010-10-11 2014-07-08 At&T Intellectual Property I, L.P. Methods and apparatus for hierarchical routing in communication networks
EP2487844B1 (en) * 2011-02-02 2014-08-06 Alcatel Lucent Control unit and method for dynamically controlling the routing within a network
CN102273133B (zh) * 2011-04-29 2013-04-17 华为技术有限公司 网络故障诊断方法及装置和系统
US9148223B2 (en) * 2011-07-07 2015-09-29 Ciena Corporation Ethernet private local area network systems and methods
US9307044B2 (en) * 2012-03-28 2016-04-05 At&T Intellectual Property I, L.P. System and method for routing content based on real-time feedback
US9306800B2 (en) * 2013-05-10 2016-04-05 Telefonaktiebolaget L M Ericsson (Publ) Inter-domain fast reroute methods and network devices
CN104579992B (zh) * 2013-10-11 2018-05-29 华为技术有限公司 一种控制网络流量路径的方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1479496A (zh) * 2002-08-27 2004-03-03 华为技术有限公司 在三层网络中查找路由下一跳的方法
CN1893419A (zh) * 2005-07-06 2007-01-10 华为技术有限公司 一种路由更新方法
WO2007047867A2 (en) * 2005-10-20 2007-04-26 Cisco Technology, Inc. Constructing and implementing backup paths in autonomous systems
CN101076029A (zh) * 2007-07-12 2007-11-21 中兴通讯股份有限公司 一种边界网关协议递归路由更新的方法

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104954894A (zh) * 2015-06-26 2015-09-30 网宿科技股份有限公司 一种视频流量引导方法、装置及一种电子设备
CN104954894B (zh) * 2015-06-26 2019-03-26 网宿科技股份有限公司 一种视频流量引导方法、装置及一种电子设备

Also Published As

Publication number Publication date
US20160226750A1 (en) 2016-08-04
EP4089982A1 (en) 2022-11-16
EP3046295A1 (en) 2016-07-20
US20230084470A1 (en) 2023-03-16
CN104579992A (zh) 2015-04-29
EP3046295A4 (en) 2016-10-05
US11528216B2 (en) 2022-12-13
US20210099377A1 (en) 2021-04-01
US10812368B2 (en) 2020-10-20
US11805047B2 (en) 2023-10-31
EP3046295B1 (en) 2022-08-17
CN104579992B (zh) 2018-05-29

Similar Documents

Publication Publication Date Title
ES2732864T3 (es) Procedimiento de obtención de información de enrutamiento por segmentos y procedimiento de establecimiento de red de enrutamiento por segmentos
US8837292B2 (en) Relayed CSPF computation for multiple areas and multiple autonomous systems
US9178798B2 (en) Fast reroute using loop free alternate next hops for multipoint label switched paths
US9699077B2 (en) Method for determining a packet forwarding path, network device, and control device
US9094340B2 (en) LDP IGP synchronization for broadcast networks
EP2928125B1 (en) Multi-domain route computation method and device, path computation element, and routing network
WO2015010518A1 (zh) 确定业务传输路径的方法、装置及系统
US8667174B2 (en) Method and system for survival of data plane through a total control plane failure
US11528216B2 (en) Method and apparatus for controlling network traffic path
EP2735126A1 (en) Signaling a label switched path (lsp) tunneling model
US20190123995A1 (en) Method, apparatus and system for controlling routing information advertising
WO2016150093A1 (zh) 报文转发方法、装置及服务提供商网络边缘pe设备
CN104158736B (zh) 一种确定下一跳、发布路由信息的方法和装置
CN106254241B (zh) 一种基于igp的跨区域cspf全网计算实现方法
KR101289890B1 (ko) 트래픽 엔지니어링 토폴로지 생성을 위한 장치 및 방법
CN103560956A (zh) 一种路由生成方法及设备

Legal Events

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

Ref document number: 14851634

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

REEP Request for entry into the european phase

Ref document number: 2014851634

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2014851634

Country of ref document: EP