CN108429699B - Congestion avoidance mechanism and device based on two-dimensional routing - Google Patents

Congestion avoidance mechanism and device based on two-dimensional routing Download PDF

Info

Publication number
CN108429699B
CN108429699B CN201810552054.7A CN201810552054A CN108429699B CN 108429699 B CN108429699 B CN 108429699B CN 201810552054 A CN201810552054 A CN 201810552054A CN 108429699 B CN108429699 B CN 108429699B
Authority
CN
China
Prior art keywords
path
cost
node
link
congestion
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
CN201810552054.7A
Other languages
Chinese (zh)
Other versions
CN108429699A (en
Inventor
陈文龙
陈赫阳
唐晓岚
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Capital Normal University
Original Assignee
Capital Normal University
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 Capital Normal University filed Critical Capital Normal University
Priority to CN201810552054.7A priority Critical patent/CN108429699B/en
Publication of CN108429699A publication Critical patent/CN108429699A/en
Application granted granted Critical
Publication of CN108429699B publication Critical patent/CN108429699B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/126—Shortest path evaluation minimising geographical or physical path length
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/20—Hop count for routing purposes, e.g. TTL
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/66—Layer 2 routing, e.g. in Ethernet based MAN's
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/122—Avoiding congestion; Recovering from congestion by diverting traffic away from congested entities

Abstract

The invention discloses a congestion avoidance mechanism and a device based on two-dimensional routing, wherein the mechanism comprises the following components: in the target directed congestion link, shunting the flow which is expected to pass through the link to a forwarding path, wherein the forwarding path does not contain the path of the target directed congestion link; performing flow shunting path calculation according to path flows between the congestion starting point and the area output point to obtain a weight of each path so as to determine the next changed path, wherein when the length of the current path and the number of changed routes of the current node meet preset conditions, the current node is selected to enter a shortest path tree; and adding a two-dimensional route to the router node needing to be changed according to the next changed path, and performing shunt forwarding through the two-dimensional route to avoid congestion. The method has the advantages of reducing congestion influence, improving the bandwidth utilization rate and improving the use experience.

Description

Congestion avoidance mechanism and device based on two-dimensional routing
Technical Field
The invention relates to the technical field of networks, in particular to a congestion avoidance mechanism and device based on two-dimensional routing.
Background
LFA is a fast failure protection type congestion control technology which is built at a network layer and is easy to deploy, and the core of the technology is to quickly react to a link or node failure by calculating a loop-free backup path in advance. The decomposition storage greatly improves the utilization rate of the line card, and the total number of items which can be stored in the past can be multiplied through the decomposition. The storage overlapping and redundancy conditions are well solved, and although a certain virtual routing entry exists, the waste of space relative to the overlapping storage is negligible. The method has the advantages that the calculation process is distributed, any support of other equipment is not needed, once the link failure occurs, the fast switching can be realized, and the possibility of loop occurrence is avoided; however, the node and link protection range which can be achieved by the method is greatly influenced by topology.
The IP fast rerouting method based on the tunnel technology triggers the tunnel node from the vicinity of the congestion occurrence point when congestion occurs so that transmission is normally performed, and limits the selection of the tunnel end point so that the node behind the transmission tunnel can not return data. The calculation of the tunnel end point adopts a method of acquiring coincident nodes in the reachable range of the starting node and the destination node.
Conventional mechanisms usually shunt traffic in a link to a certain destination to achieve the effect of congestion control, but if traffic destined for a certain destination is shunted completely, on one hand, the purpose of traffic reduction may not be achieved yet, and on the other hand, the link may be completely idle.
Disclosure of Invention
The present invention is directed to solving, at least to some extent, one of the technical problems in the related art.
Therefore, an object of the present invention is to provide a congestion avoidance mechanism based on two-dimensional routing, which has the advantages of reducing congestion influence, improving bandwidth utilization, and improving usage experience.
The invention also aims to provide a congestion avoiding device based on two-dimensional routing.
In order to achieve the above object, an embodiment of the present invention provides a congestion avoidance mechanism based on two-dimensional routing, including the following steps: in a target directed congested link, shunting traffic which is expected to pass through the link to a forwarding path, wherein the forwarding path does not include a path of the target directed congested link; performing flow diversion path calculation according to path flows between a congestion starting point and a region output point to obtain a weight of each path so as to determine a next changed path, wherein when the length of the current path and the number of changed routes of the current node meet preset conditions, the current node is selected to enter a shortest path tree; and adding a two-dimensional route to the router node needing to be changed according to the next changed path, and performing shunt forwarding through the two-dimensional route to avoid congestion.
According to the congestion avoidance mechanism based on the two-dimensional routing, the shortest shunt path is obtained through calculation by a shortest path algorithm considering the composite update cost, and the flow expected to pass through the congestion link is shunted to the forwarding path.
In addition, the congestion avoidance mechanism based on two-dimensional routing according to the above embodiment of the present invention may also have the following additional technical features:
further, in an embodiment of the present invention, in the target directional congested link, the offloading traffic that is expected to pass through the link to a forwarding path, where the forwarding path does not include a path of the target directional congested link, further includes: and starting path calculation from the upstream node of the congested link to reduce the interference of congestion shunt on other nodes.
Further, in an embodiment of the present invention, the recalculating the path of the traffic diversion by using the method from the congestion starting point to the area output point further includes a shortest path algorithm considering the composite update cost, and specifically includes: and adding the total link cost after the next hop to the current link and selecting the total changed route number after the current next hop node to realize the shortest path algorithm considering the composite update cost.
Further, in an embodiment of the present invention, the recalculating the path of the traffic diversion by using the method from the congestion starting point to the area output point further includes:
setting the cost of the congested link in the topology to be infinite to realize the elimination of the congested link;
calculating next hops of all nodes in the topology to reach a traffic outlet;
if a certain node to be selected in the calculation path is not the next hop from the last selected node to the flow outlet, the superposed c-Cost is added with a route change number;
combining shortest path tree nodes as U ═ NupAnd the other nodes are V ═ G- { N }upSelecting nodes N which enable the product of superposed l-Cost and c-Cost to be minimum from all nodes which can be connected with U in V from the nodes in U;
adding the node N into the set U, and removing the node N from the set V;
until node D appears in set U, the calculation is by NupThe cost-optimized path to D.
Further, in an embodiment of the present invention, the method for collecting reliable data of a wireless sensor network based on a logical node is characterized in that, adding a two-dimensional route to a router node that needs to be changed according to the next changed path, and performing split forwarding through the two-dimensional route to avoid congestion includes: obtaining an optimal path and a composite cost from a plurality of flows in the congestion link; and sequentially selecting the flow with the minimum composite cost for shunting until a new forwarding path is obtained.
In order to achieve the above object, an embodiment of another aspect of the present invention provides a congestion avoidance apparatus based on two-dimensional routing, including: the system comprises a selection module, a forwarding module and a traffic distribution module, wherein the selection module is used for shunting the traffic which is expected to pass through a link to a forwarding path in a target directed congestion link, and the forwarding path does not contain the path of the target directed congestion link; the calculation module is used for carrying out flow shunting path calculation according to the path flow between the congestion starting point and the area output point to obtain the weight of each path so as to determine the next changed path, wherein when the length of the current path and the number of changed routes of the current node meet the preset conditions, the current node is selected to enter the shortest path tree; and the adding module is used for adding a two-dimensional route to the router node needing to be changed according to the next changed path and carrying out shunt forwarding through the two-dimensional route so as to avoid congestion.
The congestion avoiding device based on the two-dimensional routing calculates the shortest shunting path by considering the shortest path algorithm of the composite updating cost, and shunts the flow expected to pass through the congestion link to the forwarding path, so that the congestion avoiding device has the advantages of reducing the congestion influence, improving the bandwidth utilization rate and improving the use experience.
In addition, the congestion avoiding device based on two-dimensional routing according to the above embodiment of the present invention may further have the following additional technical features:
further, in an embodiment of the present invention, path computation is started from an upstream node of the congested link to reduce interference of congestion diversion to other nodes.
Further, in an embodiment of the present invention, the calculating module, wherein the shortest path algorithm considering the composite update cost specifically includes: and adding the total link cost after the next hop to the current link and selecting the total changed route number after the current next hop node to realize the shortest path algorithm considering the composite update cost.
Further, in an embodiment of the present invention, the adding module further includes:
setting the cost of the congested link in the topology to be infinite to realize the elimination of the congested link;
calculating next hops of all nodes in the topology to reach a traffic outlet;
if a certain node to be selected in the calculation path is not the next hop from the last selected node to the flow outlet, the superposed c-Cost is added with a route change number;
combining shortest path tree nodes as U ═ NupAnd the other nodes are V ═ G- { N }upSelecting nodes N which enable the product of superposed l-Cost and c-Cost to be minimum from all nodes which can be connected with U in V from the nodes in U;
adding the node N into the set U, and removing the node N from the set V;
until node D appears in set U, the calculation is by NupThe cost-optimized path to D.
Further, in an embodiment of the present invention, an optimal path and a composite cost are obtained from a plurality of flows in the congested link; and sequentially selecting the flow with the minimum composite cost for shunting until a new forwarding path is obtained.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
The foregoing and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
fig. 1 is a flowchart of a congestion avoidance mechanism based on two-dimensional routing according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a topology of a congestion avoidance mechanism based on two-dimensional routing according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a congestion avoidance device based on two-dimensional routing according to an embodiment of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are illustrative and intended to be illustrative of the invention and are not to be construed as limiting the invention.
The following describes a congestion avoidance mechanism and device based on two-dimensional routing proposed by an embodiment of the present invention with reference to the drawings, and first, the congestion avoidance mechanism based on two-dimensional routing proposed by an embodiment of the present invention will be described with reference to the drawings.
FIG. 1 is a flowchart of a congestion avoidance mechanism based on two-dimensional routing according to an embodiment of the present invention
As shown in fig. 1, the congestion avoidance mechanism based on two-dimensional routing includes the following steps:
in one embodiment of the invention, the following definitions are made: g is a network topology which needs to carry out congestion avoidance processing; n is a radical ofupAn upstream node that is a congested link; n is a radical ofdownA downstream node that is a congested link; t _ NS→DBased on directed node pairs<S,D>S is a traffic T _ NS→DD is the traffic T _ NS→DThe destination node of (1).
In step S101, in a target directional congested link, traffic that is expected to pass through the link is shunted to a forwarding path, where the forwarding path does not include a path of the target directional congested link.
In one embodiment of the present invention, let S, D be any 2 edge routers (access routers) in the autonomous domain network G, called T _ NS→DBased on directed node pairs<S,D>S is a traffic T _ NS→DD is the traffic T _ NS→DThe destination node of (1). Given a directed congested link (N)up,Ndown) Expecting traffic T _ N to be passed through the linkS→DAnd the flow is divided to other forwarding paths which do not pass through the congestion link.
In step S102, performing traffic diversion path calculation according to a path flow between the congestion starting point and the area output point to obtain a weight of each path to determine a next modified path, wherein when the length of the current path and the number of modified routes of the current node satisfy preset conditions, the current node is selected to enter the shortest path tree.
In one embodiment of the invention, a congested link is traversed (N)up,Ndown) The data flow of (A) is several, the invention expects to minimize the shunting composite cost T _ NS→DThe effluent is separated.
Further, to reduce the interference of the congestion diversion to other nodes (including forwarding and storing interference), the path computation starts from the upstream node of the congested link and computes the shortest path to the area exit of the traffic. And a shortest path algorithm considering the composite update cost is adopted in the calculation process.
In one embodiment of the invention, the composite update Cost (x-Cost) is considered in the path calculation and consists of the total link Cost (l-Cost) after adding the current link and the total modified route number (c-Cost) after selecting the current next hop node.
Expressed as:
if the shortest path from point C to point B is calculated. Then for point C, the next hop selects point F with l-Cost of 2 and C-Cost of 1 (since point F is not the original shortest path from C to B, extra route storage must be added to point C). The following is a description of the calculation process:
1) and (4) eliminating the congested link, namely setting the cost of the congested link in the topology to be infinite, and not considering the link in the calculation process.
2) And calculating the next hop of all the nodes in the topology to reach the traffic outlet D.
3) Combining shortest path tree nodes as U ═ NupAnd the other nodes are V ═ G- { N }upAnd selecting all nodes N which are connected with the U in the V and have the smallest product of the superposed l-Cost and c-Cost from the nodes in the U.
4) Adding the node N into the set U, and removing the node N from the set V;
5) repeating steps 3) -4) until node D appears in set U, then N has been calculatedupThe cost-optimized path to D.
As shown in FIG. 2, in one embodiment of the invention, when a link is present<C,D>Congestion occurs and node C calculates the traffic T _ N thereinA→BTaking the shunting as an example, the link is already excluded in the topology<C,D>。
Performing path calculation from a node C, wherein a set U is { C }, a set V is { A, E, G, F, K, D, H, B, J, I }, and l-Cost, C-Cost and x-Cost of all nodes in the set U and the set V are:
Figure GDA0003184712950000051
the composite Cost value of the F node is selected to be the minimum, the F node is selected to enter the set U, and the F node is deleted from the set V, wherein l-Cost of the set U is 2, and c-Cost of the set U is 1. Since l-Cost and c-Cost are superposed, the Cost is as follows:
Figure GDA0003184712950000052
node E is selected into set U and deleted from set V, where l-Cost is 5 and c-Cost is 2. The cost at this time is:
Figure GDA0003184712950000061
node a is selected from set U and deleted from set V, where l-Cost is 10 and c-Cost is 3. The cost at this time is:
Figure GDA0003184712950000062
the node G is selected into the set U and deleted from the set V, where l-Cost is 14 and c-Cost is 4. The cost at this time is:
Figure GDA0003184712950000063
node K is selected from set U and deleted from set V, where l-Cost is 20 and c-Cost is 5. The cost at this time is:
Figure GDA0003184712950000064
node D is selected into set U and removed from set V, where l-Cost is 22 and c-Cost is 6. The cost at this time is:
Figure GDA0003184712950000065
node H is selected from set U and deleted from set V, where l-Cost is 24 and c-Cost is 7. The cost at this time is:
Figure GDA0003184712950000071
node B is selected in set U and removed from set V, where l-Cost is 27 and c-Cost is 8.
In summary, since the destination node B has already joined the set U, the calculation may be ended at this time, and the calculated shortest path from C to B is: c → G → B → K.
In step S103, a two-dimensional route is added to the router node that needs to be changed according to the next change path, and the router node is shunted and forwarded by the two-dimensional route, so as to avoid congestion.
In one embodiment of the invention, a two-dimensional route is added at a router node that needs to change the original route so that the router can target a specific traffic T _ NS→DAnd carrying out shunting forwarding by adopting a two-dimensional route.
In one embodiment of the invention, there are typically several flows in the congested link, of which several need to be selected for egress. Then at the time of selection: calculating an optimal path and a composite cost for each flow meter in the manner; and sequentially selecting the flow distribution with the minimum composite cost until the link is not congested any more.
According to the congestion avoidance mechanism based on the two-dimensional routing, the shortest shunt path is obtained through calculation by a shortest path algorithm considering the composite update cost, and the flow expected to pass through the congestion link is shunted to the forwarding path.
Next, a congestion avoidance apparatus based on two-dimensional routing proposed according to an embodiment of the present invention is described with reference to the drawings.
Fig. 3 is a schematic structural diagram of a congestion avoidance device based on two-dimensional routing according to an embodiment of the present invention.
As shown in fig. 3, the congestion avoidance apparatus 10 based on two-dimensional routing includes: a selection module 100, a calculation module 200 and an addition module 300.
The selection module 100 is configured to, in a target directed congested link, shunt traffic that is expected to pass through the link to a forwarding path, where the forwarding path does not include a path of the target directed congested link. The calculation module 200 is configured to perform traffic diversion path calculation according to a path flow between a congestion starting point and a regional output point to obtain a weight of each path to determine a next modified path, where when a current path length and a modified route number of a current node satisfy preset conditions, the current node is selected to enter a shortest path tree. The adding module 300 is configured to add a two-dimensional route to a router node that needs to be changed according to the next changed path, and perform split forwarding through the two-dimensional route to avoid congestion. The congestion avoiding device 10 based on the two-dimensional routing has the advantages of reducing congestion influence, improving the bandwidth utilization rate and improving the use experience.
Further, in an embodiment of the present invention, path computation is started from an upstream node of the congested link to reduce interference of congestion diversion to other nodes.
Further, in an embodiment of the present invention, the calculating module, wherein the shortest path algorithm considering the composite update cost specifically includes: and adding the total link cost after the next hop to the current link and selecting the total changed route number after the current next hop node to realize the shortest path algorithm considering the composite update cost.
Further, in an embodiment of the present invention, the adding module further includes:
setting the cost of the congested link in the topology to be infinite to realize the elimination of the congested link;
calculating next hops of all nodes in the topology to reach a traffic outlet;
if a certain node to be selected in the calculation path is not the next hop from the last selected node to the flow outlet, the superposed c-Cost is added with a route change number;
combining shortest path tree nodes as U ═ NupAnd the other nodes are V ═ G- { N }upSelecting nodes N which enable the product of superposed l-Cost and c-Cost to be minimum from all nodes which can be connected with U in V from the nodes in U;
adding the node N into the set U, and removing the node N from the set V;
until node D appears in set U, the calculation is by NupThe cost-optimized path to D.
Further, in an embodiment of the present invention, an optimal path and a composite cost are obtained from a plurality of flows in the congested link; and sequentially selecting the flow with the minimum composite cost for shunting until a new forwarding path is obtained.
It should be noted that the foregoing explanation of the embodiment of the congestion avoidance mechanism based on two-dimensional routing is also applicable to the congestion avoidance apparatus based on two-dimensional routing in this embodiment, and is not described herein again.
The congestion avoiding device based on the two-dimensional routing calculates the shortest shunting path by considering the shortest path algorithm of the composite updating cost, and shunts the flow expected to pass through the congestion link to the forwarding path, so that the congestion avoiding device has the advantages of reducing the congestion influence, improving the bandwidth utilization rate and improving the use experience.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In the description of the present invention, "a plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.

Claims (8)

1. A congestion avoidance mechanism based on two-dimensional routing is characterized by comprising the following steps:
in a target directed congested link, shunting traffic which is expected to pass through the link to a forwarding path, wherein the forwarding path does not include a path of the target directed congested link;
performing flow diversion path calculation according to path flows between a congestion starting point and a region output point to obtain a weight of each path so as to determine a next changed path, wherein when the length of the current path and the number of changed routes of the current node meet preset conditions, the current node is selected to enter a shortest path tree;
adding a two-dimensional route to a router node needing to be changed according to the next changed path, and performing shunt forwarding through the two-dimensional route to avoid congestion;
the method for calculating the flow shunting path according to the path flow between the congestion starting point and the area output point comprises the following steps:
setting the cost of the congested link in the topology to be infinite to realize the elimination of the congested link;
calculating next hops of all nodes in the topology to reach a traffic outlet;
if a certain node to be selected in the calculation path is not the next hop from the last selected node to the flow outlet, the superposed c-Cost is added with a route change number;
combining shortest path tree nodes as U ═ NupAnd the other nodes are V ═ G- { N }upSelecting nodes N which enable the product of superposed l-Cost and c-Cost to be minimum from all nodes which can be connected with U in V from the nodes in U;
adding the node N into the set U, and removing the node N from the set V;
until node D appears in set U, the calculation is by NupA cost-optimal path to D;
wherein G is a network topology requiring congestion avoidance processing, NupFor congested linksA trip node, wherein (l-Cost) is the total link Cost after adding the current link, and (c-Cost) is the total changed route number after selecting the current next hop node, and D is the flow T _ NS→DThe destination node of (1).
2. The two-dimensional routing based congestion avoidance mechanism according to claim 1, wherein the shunting, in a target directional congested link, traffic expected to pass through the link to a forwarding path, wherein the forwarding path does not include a path of the target directional congested link, further comprises:
and starting path calculation from the upstream node of the congested link to reduce the interference of congestion shunt on other nodes.
3. The congestion avoidance mechanism based on two-dimensional routing according to claim 1, wherein the performing of the traffic diversion path calculation according to the path flow between the congestion starting point and the area output point further includes a shortest path algorithm considering the composite update cost, and specifically includes:
and adding the total link cost after the next hop to the current link and selecting the total changed route number after the current next hop node to realize the shortest path algorithm considering the composite update cost.
4. The method according to claim 1, wherein the adding a two-dimensional route to a router node that needs to be changed according to the next changed path and performing flow-splitting forwarding through the two-dimensional route to avoid congestion comprises:
obtaining an optimal path and a composite cost from a plurality of flows in the congestion link;
and sequentially selecting the flow with the minimum composite cost for shunting until a new forwarding path is obtained.
5. A congestion avoidance device based on two-dimensional routing is characterized by comprising:
the system comprises a selection module, a forwarding module and a traffic distribution module, wherein the selection module is used for shunting the traffic which is expected to pass through a link to a forwarding path in a target directed congestion link, and the forwarding path does not contain the path of the target directed congestion link;
the calculation module is used for carrying out flow shunting path calculation according to the path flow between the congestion starting point and the area output point to obtain the weight of each path so as to determine the next changed path, wherein when the length of the current path and the number of changed routes of the current node meet the preset conditions, the current node is selected to enter the shortest path tree;
the adding module is used for adding a two-dimensional route to the router node needing to be changed according to the next changed path and carrying out shunt forwarding through the two-dimensional route so as to avoid congestion;
wherein the adding module further comprises:
setting the cost of the congested link in the topology to be infinite to realize the elimination of the congested link;
calculating next hops of all nodes in the topology to reach a traffic outlet;
if a certain node to be selected in the calculation path is not the next hop from the last selected node to the flow outlet, the superposed c-Cost is added with a route change number;
combining shortest path tree nodes as U ═ NupAnd the other nodes are V ═ G- { N }upSelecting nodes N which enable the product of superposed l-Cost and c-Cost to be minimum from all nodes which can be connected with U in V from the nodes in U;
adding the node N into the set U, and removing the node N from the set V;
until node D appears in set U, the calculation is by NupA cost-optimal path to D;
wherein G is a network topology requiring congestion avoidance processing, NupFor the upstream node of the congested link, (l-Cost) is the total link Cost after the current link is added, (c-Cost) is the total modified route number after the current next hop node is selected, and D is the flow T _ NS→DThe destination node of (1).
6. The congestion avoidance device based on two-dimensional routing of claim 5, wherein path calculation is started from an upstream node of the congested link to reduce interference of congestion diversion to other nodes.
7. The congestion avoidance device based on two-dimensional routing according to claim 5, wherein the calculation module is configured to perform a shortest path algorithm considering the composite update cost, and specifically includes:
and adding the total link cost after the next hop to the current link and selecting the total changed route number after the current next hop node to realize the shortest path algorithm considering the composite update cost.
8. The congestion avoidance device based on two-dimensional routing of claim 5, wherein the optimal path and composite cost are obtained from a plurality of flows in the congested link; and sequentially selecting the flow with the minimum composite cost for shunting until a new forwarding path is obtained.
CN201810552054.7A 2018-05-31 2018-05-31 Congestion avoidance mechanism and device based on two-dimensional routing Active CN108429699B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810552054.7A CN108429699B (en) 2018-05-31 2018-05-31 Congestion avoidance mechanism and device based on two-dimensional routing

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810552054.7A CN108429699B (en) 2018-05-31 2018-05-31 Congestion avoidance mechanism and device based on two-dimensional routing

Publications (2)

Publication Number Publication Date
CN108429699A CN108429699A (en) 2018-08-21
CN108429699B true CN108429699B (en) 2021-12-07

Family

ID=63164183

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810552054.7A Active CN108429699B (en) 2018-05-31 2018-05-31 Congestion avoidance mechanism and device based on two-dimensional routing

Country Status (1)

Country Link
CN (1) CN108429699B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109587049B (en) * 2018-12-05 2021-02-02 首都师范大学 Two-dimensional routing-based external access flow control and rapid self-healing mechanism and device
CN112019435B (en) * 2020-07-28 2022-07-01 首都师范大学 Intelligent routing method for reducing network vibration
CN114124825B (en) * 2021-10-26 2023-05-16 中国联合网络通信集团有限公司 Method, system, device and storage medium for data transmission

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104601485A (en) * 2015-02-12 2015-05-06 清华大学 Network traffic distribution method and routing method for network traffic distribution
CN105119840A (en) * 2015-09-01 2015-12-02 华东师范大学 Data center network load balancing method based on SDN and employing fat-tree topological structure

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103841040A (en) * 2012-11-20 2014-06-04 英业达科技有限公司 Network system and load balance method

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104601485A (en) * 2015-02-12 2015-05-06 清华大学 Network traffic distribution method and routing method for network traffic distribution
CN105119840A (en) * 2015-09-01 2015-12-02 华东师范大学 Data center network load balancing method based on SDN and employing fat-tree topological structure

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Two dimensional-IP routing;Mingwei Xu 等;《2013 International Conference on Computing, Networking and Communications (ICNC)》;20131231;第835-839页 *
针对域内流量均衡的二维路由方案;赵成安等;《西安交通大学学报》;20170630(第06期);第129-137页 *

Also Published As

Publication number Publication date
CN108429699A (en) 2018-08-21

Similar Documents

Publication Publication Date Title
CN109194577B (en) Traffic engineering method and device of segmented routing network based on partial deployment
US7948899B2 (en) Method and apparatus for communications traffic engineering
JP4828865B2 (en) Efficient and robust routing independent of traffic pattern variability
CN101601233B (en) Method for finding protected path in mesh networks
US6778531B1 (en) Multicast routing with service-level guarantees between ingress egress-points in a packet network
US6925061B2 (en) Multi-constraint routing system and method
CN108429699B (en) Congestion avoidance mechanism and device based on two-dimensional routing
US8605627B2 (en) Provider link state bridging (PLSB) computation method
US20140140216A1 (en) Network system and routing method
WO2003061194A2 (en) Multi-constraint routine system and method
Mahey et al. Capacity and flow assignment of data networks by generalized Benders decomposition
Chen et al. Congestion avoidance transmission mechanism based on two-dimensional forwarding
Alabbad et al. Localised credit based QoS routing
Burns et al. Path selection and bandwidth allocation in MPLS networks: a nonlinear programming approach
JP2003224585A (en) Device for setting communication pass
CN109729006B (en) Message processing method and device and computer readable storage medium
US11489758B1 (en) Path computation for unordered inclusion and regional revisit constraints
CN112448890B (en) Path determining method, device and storage medium
WO2022199150A1 (en) Path acquisition method, network element, and computer-readable storage medium
JP2008182423A (en) Point-to-multipoint path route calculating device and program
JP4280230B2 (en) Route calculation instruction method, calculation instruction program, and calculation instruction device
CN108282399B (en) Centralized control processing method for multiple stream requests based on distributed network
Prasad et al. Study & Analysis of Dynamic Routing Protocols in real time for Optimal Resource Utilization
JP2008060831A (en) Edge switch, core switch, network system and frame transfer method
CN115695291A (en) Routing control method, system, electronic equipment and readable storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant