Nothing Special   »   [go: up one dir, main page]

CN101399748B - Route computing method and router - Google Patents

Route computing method and router Download PDF

Info

Publication number
CN101399748B
CN101399748B CN2007101513391A CN200710151339A CN101399748B CN 101399748 B CN101399748 B CN 101399748B CN 2007101513391 A CN2007101513391 A CN 2007101513391A CN 200710151339 A CN200710151339 A CN 200710151339A CN 101399748 B CN101399748 B CN 101399748B
Authority
CN
China
Prior art keywords
bandwidth
link
cost value
network
tunnel
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.)
Expired - Fee Related
Application number
CN2007101513391A
Other languages
Chinese (zh)
Other versions
CN101399748A (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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN2007101513391A priority Critical patent/CN101399748B/en
Priority to PCT/CN2008/071633 priority patent/WO2009039736A1/en
Publication of CN101399748A publication Critical patent/CN101399748A/en
Application granted granted Critical
Publication of CN101399748B publication Critical patent/CN101399748B/en
Expired - Fee Related 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
    • H04L45/00—Routing or path finding of packets in data switching networks
    • 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/125—Shortest path evaluation based on throughput or bandwidth

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本发明公开一种路由计算方法，包括：获得流量工程隧道预留带宽并计算剩余带宽；根据所述剩余带宽计算链路的路径成本值；计算到达目的地的各链路的路径成本值的和；从所述各链路中选择一链路集合作为最优路径指导非流量工程隧道流量的转发。本发明还提供一种路由计算方法，包括：在网络实际流量带宽到达设定阈值后，计算剩余带宽，根据所述剩余带宽计算链路的路径成本值；计算到达目的地的各链路的路径成本值的和，从所述各链路中选择一链路集合作为最优路径指导非流量工程隧道流量的转发。本发明还相应提供一种路由器。本发明技术方案能够准确反映网络实际路由情况，可靠地指导网络流量的转发。

Figure 200710151339

The invention discloses a routing calculation method, comprising: obtaining the reserved bandwidth of the traffic engineering tunnel and calculating the remaining bandwidth; calculating the path cost value of the link according to the remaining bandwidth; calculating the sum of the path cost values of the links reaching the destination ; Select a link set from the links as the optimal path to guide the forwarding of non-traffic engineering tunnel traffic. The present invention also provides a route calculation method, including: after the actual network traffic bandwidth reaches the set threshold, calculate the remaining bandwidth, calculate the path cost value of the link according to the remaining bandwidth; calculate the path of each link to the destination A sum of cost values, selecting a link set from the links as an optimal path to guide the forwarding of non-traffic engineering tunnel traffic. The invention also correspondingly provides a router. The technical solution of the invention can accurately reflect the actual routing situation of the network, and reliably guide the forwarding of the network flow.

Figure 200710151339

Description

Route computing method and router
Technical field
The present invention relates to communication technical field, be specifically related to a kind of route computing method and router.
Background technology
In present network, the core router in the backbone network uses MPLS-TE (MultiProtocol Label Switching Traffic Engineer, multi protocol label exchange-traffic engineering) technology to guarantee the bandwidth of miscellaneous service in a large number.
In the prior art; Router operation OSPF (Open Shortest Path First Protocol; OSPF)/ISIS (Intermediate System to Intermediate System RoutingProtocol; When intermediate system to intermediate syst) carrying out route calculating, be to select the path, with the COST value addition of each the bar link that arrives the destination according to the COST value of every link; The link set that obtains minimum COST value place is exactly a shortest path, and is used in reference to wire guide network forwarding of flow.
When using the MPLS-TE technology, need distribute the bandwidth that takies in advance, just exist in the network non-TE-Tunnel flow and TE-Tunnel forwarding of flow for TE-Tunnel (Traffic Engineer-Tunnel, traffic engineering tunnel).Transmitting for the TE-Tunnel flow, is that MPLS transmits, and is specified by the user, and is to use the link of having reserved bandwidth.And transmit for non-TE-Tunnel flow, calculate COST (path cost) value of link by following formula: COST=is with reference to radix/band width in physical.Wherein, be one with reference to radix and set numerical value, be greater than maximum link bandwidth when setting usually, and band width in physical is meant the total bandwidth into link assignment.Draw the COST value of every link according to formula after, with the COST value addition of each the bar link that arrives the destination, the link set that obtains minimum COST value place is exactly a shortest path, is used to instruct non-TE-Tunnel forwarding of flow.
In research and practice process to prior art; The inventor finds that there is following problem in prior art: after having used the MPLS-TE technology to carry out the bandwidth guarantee of miscellaneous service; When certain bar link is taken some bandwidth by one or more TE-Tunnel; Or even after taking whole bandwidth, when operation OSPF/ISIS agreement was carried out route calculating, the COST value of the link of use calculated by the said existing formula in front; And in the prior art formula, do not consider the bandwidth that is taken by TE-Tunnel.Like this; Carrying out the shortest path that route calculates probably is TE-Tunnel that shortest path of occupied bandwidth; So when non-TE-Tunnel flow is transmitted; Because TE-Tunnel traffic prioritization height will be by preferential forwarding, thereby cause non-TE-Tunnel flow when bandwidth resources are not enough, can abandoned even all abandon by part.Can find that thus transmit for non-TE-Tunnel flow, if continue to use the computational methods of prior art, the shortest path that finally draws is inaccurate, so prior art is carried out the route Calculation Method and can not accurately be reflected the actual routing condition of network.
Summary of the invention
The technical problem that the embodiment of the invention will solve provides a kind of route computing method and router, can accurately reflect the actual routing condition of network, instructs the forwarding of network traffics reliably.
For solving the problems of the technologies described above, embodiment provided by the present invention realizes through following technical scheme:
The embodiment of the invention provides a kind of route computing method, comprising: obtain the traffic engineering tunnel bandwidth reserved and calculate remaining bandwidth; Calculate the path cost value of link according to said remaining bandwidth; Calculate to arrive the destination each link the path cost value with; From said each link, select a link set to instruct non-traffic engineering tunnel forwarding of flow as optimal path.
The embodiment of the invention provides a kind of route computing method, comprising: after the actual flow bandwidth of network arrives setting threshold, calculate remaining bandwidth, calculate the path cost value of link according to said remaining bandwidth; Wherein, the actual flow bandwidth of said network comprises the actual bandwidth that actual bandwidth that the traffic engineering tunnel bandwidth reserved is used and non-traffic engineering tunnel flow use; Calculate to arrive the destination each link the path cost value with, from said each link, select a link set to instruct non-traffic engineering tunnel forwarding of flow as optimal path.
The embodiment of the invention provides a kind of router, comprising: first computing unit, and be used to obtain the traffic engineering tunnel bandwidth reserved and calculate remaining bandwidth, calculate the path cost value of link according to said remaining bandwidth; Second computing unit, be used to calculate each link that arrives the destination the path cost value with, from said each link, select a link set to instruct non-traffic engineering tunnel forwarding of flow as optimal path.
The embodiment of the invention provides a kind of router, comprising: threshold cell is used to the actual flow bandwidth of network setting threshold is set; First computing unit; Be used for after the actual flow bandwidth of network arrives the setting threshold of threshold cell setting; Calculate remaining bandwidth; Calculate the path cost value of link according to said remaining bandwidth, the actual flow bandwidth of said network comprises the actual bandwidth that the traffic engineering tunnel bandwidth reserved is used and the actual bandwidth value of non-traffic engineering tunnel flow use; Second computing unit, be used to calculate each link that arrives the destination the path cost value with, from said each link, select a link set to instruct non-traffic engineering tunnel forwarding of flow as optimal path.
Technique scheme can be found out; The COST value of the link that when carrying out route calculating, uses in the prior art is not considered the situation of the bandwidth that is taken by TE-Tunnel; And the embodiment of the invention is considered to calculate under the TE-Tunnel occupied bandwidth situation in the COST value of carrying out using when route is calculated, and when calculating the COST value of link, obtains the traffic engineering tunnel bandwidth reserved and calculates remaining bandwidth; Calculate the path cost value of link according to said remaining bandwidth; Perhaps after the actual flow bandwidth of network arrives setting threshold, calculate remaining bandwidth, calculate the path cost value of link according to said remaining bandwidth; The actual flow bandwidth of said network comprises the actual bandwidth that actual bandwidth that the traffic engineering tunnel bandwidth reserved is used and non-traffic engineering tunnel flow use; So the shortest path that calculate according to the COST value this moment is only the shortest path that meets actual routing condition, just accurately reflects the actual routing condition of network, instructs the forwarding of network traffics reliably.
Description of drawings
Fig. 1 is the embodiment of the invention one a route computing method flow chart;
Fig. 2 is the embodiment of the invention two route computing method flow charts;
Fig. 3 is the embodiment of the invention three route computing method flow charts;
Fig. 4 is embodiment of the invention router one structural representation;
Fig. 5 is embodiment of the invention router two structural representations.
Embodiment
The embodiment of the invention provides a kind of route computing method, can accurately reflect the actual routing condition of network.
The embodiment of the invention is considered to calculate under the TE-Tunnel occupied bandwidth situation in the COST value of carrying out using when route is calculated, and the shortest path that calculate according to the COST value this moment is only the shortest path that meets actual routing condition.
Below dynamically to adjust the COST value according to the TE-Tunnel occupied bandwidth and to describe according to the instance that the actual bandwidth operating position is dynamically adjusted the COST value but be not limited to this; Wherein the adjustment of COST value can also define through other management methods, such as methods such as the user set up on their own.
Suppose in one network, comprise many routers, every router abbreviates a node as in network; In the network topology; There is one or more accessibility link between each node, therefore need carries out route and calculate, select shortest path to instruct forwarding of flow.
Seeing also Fig. 1, is the embodiment of the invention one route computing method flow chart.
Embodiment one dynamically adjusts the COST value according to the TE-Tunnel occupied bandwidth, specifically comprises step:
Behind step 101, the network design TE-Tunnel, the bandwidth that record TE-Tunnel takies in advance;
Step 102, pass to each node having disposed the bandwidth information that TE-Tunnel takies in advance behind the TE-Tunnel;
Step 103, calculate the COST value, and the COST value that obtains is flooded to the whole network according to the band width in physical that deducts after the bandwidth that TE-Tunnel takies in advance;
Each node in the network, operation OSPF/ISIS agreement is calculated the COST value of the link of this node.
This moment, the computing formula of COST value was:
COST=is with reference to radix/(band width in physical-TE-Tunnel bandwidth reserved)
The TE-Tunnel bandwidth reserved is the bandwidth that TE-Tunnel takies in advance behind the network design TE-Tunnel; Node operation OSPF/ISIS agreement; Band width in physical is deducted the TE-Tunnel bandwidth reserved draw the back remaining bandwidth of being taken of each interface of this node by TE-Tunnel; And then will remove in remaining bandwidth with reference to radix, calculate the COST value of the link after this node updates, and the link-state information that handle carries this node of this COST value is flooded to the whole network.
The COST value that step 104, basis calculate calculates shortest path.
After each node is collected the link-state information after the renewal of all nodes; Operation OSPF/ISIS agreement; Calculate the shortest path that arrives the destination according to the link COST value in the link-state information that receives, and finally be used for instructing non-TE-Tunnel forwarding of flow.
Seeing also Fig. 2, is the embodiment of the invention two route computing method flow charts.
Embodiment two dynamically adjusts the COST value according to the TE-Tunnel occupied bandwidth; But with implement one and different be, the COST value that calculates among the embodiment one itself is flooded to the whole network through the OSPF/ISIS agreement, node directly can receive the COST value of the link that other nodes calculate in the network; And embodiment two is according to the TE-Tunnel occupied bandwidth information that is flooded to the whole network; Obtain the bandwidth usage of the whole network node, calculate the COST value of the link of each node at this node, carry out route then and calculate; Obtain shortest path, instruct non-TE-Tunnel forwarding of flow.
Fig. 2 specifically comprises step:
Behind step 201, the network design TE-Tunnel, the bandwidth that record TE-Tunnel takies in advance;
Step 202, pass to each node having disposed the bandwidth information that TE-Tunnel takies in advance behind the TE-Tunnel, each node is flooded to the whole network with it;
Each node also can be to the whole network with remaining bandwidth information from flooding after deducting the bandwidth that TE-Tunnel takies in advance.
Step 203, according to the bandwidth usage of the whole network node that obtains, calculate the COST value of the link of each node in the network;
Each node in the network, the COST value of the link of other nodes in the COST value of the link of this node of operation OSPF/ISIS agreement calculating and the network.
This moment, the computing formula of COST value was:
COST=is with reference to radix/(band width in physical-TE-Tunnel bandwidth reserved)
The TE-Tunnel bandwidth reserved is the bandwidth that TE-Tunnel takies in advance behind the network design TE-Tunnel; Operation OSPF/ISIS agreement; Band width in physical is deducted the TE-Tunnel bandwidth reserved draw the back remaining bandwidth of being taken of each each interface of node by TE; And then will remove in remaining bandwidth, thereby calculate the COST value after each node updates with reference to radix.
The COST value that step 204, basis calculate calculates shortest path.
Each node operation OSPF/ISIS agreement calculates the shortest path of arrival destination according to the link COST value of each node that calculates, and finally is used for instructing non-TE-Tunnel forwarding of flow.
Seeing also Fig. 3, is the embodiment of the invention three route computing method flow charts.
Different with the foregoing description one and embodiment two is that embodiment three is according to real network flow dynamics adjustment COST value, specifically comprises step:
The bandwidth of step 301, computing network actual flow;
The bandwidth of network actual flow is meant actual occupied bandwidth in the network, comprises the actual bandwidth value that actual bandwidth that the TE-Tunnel bandwidth reserved is used and non-TE-Tunnel flow use.Though behind the network design TE-Tunnel; For TE-Tunnel has reserved occupied bandwidth; But the bandwidth that TE-Tunnel not necessarily can absorb reserves; Perhaps reserved but reality does not take, thus among this embodiment no matter how many occupied bandwidths TE-Tunnel has reserved, actual occupied bandwidth in each node computing network.
Step 302, update calculation COST value when arriving threshold value, and the COST value that obtains is flooded to the whole network;
Each node in the network, operation OSPF/ISIS agreement is calculated the COST value of the link of this node.
This moment, the computing formula of COST value was:
COST=is with reference to radix/(bandwidth of band width in physical-network actual flow)
Be divided into different ranks to the network actual flow in the present embodiment,, set different threshold values, when arriving threshold value, upgrade the COST value according to the size of actual flow.The bandwidth that for example takies according to actual flow is different, and several threshold values are set, and for example can set 3 threshold values, and the value of threshold value is the ratio value that accounts for said band width in physical according to the actual flow bandwidth of network, and can establish proportion is 30%, 60% and 90%.
The bandwidth that takies when actual flow be whole band width in physical 30% the time, by the dynamic COST value of adjustment of above-mentioned formula; By that analogy, the bandwidth that takies when actual flow be whole band width in physical 60% the time, by the dynamic COST value of adjustment of above-mentioned formula, the bandwidth that takies when actual flow be whole band width in physical 90% the time, dynamically adjust a COST value by above-mentioned formula again.
Each node operation OSPF/ISIS agreement according to the shared bandwidth situation of actual flow, calculates the COST value of the link of this node after the renewal, when the COST value changes, is flooded to the whole network to the link-state information of this node that carries this COST value.
The COST value that step 303, basis calculate calculates shortest path.
After each node is collected the link-state information after the renewal of all nodes; Operation OSPF/ISIS agreement; Calculate the shortest path that arrives the destination according to the link COST value in the link-state information that receives, and finally be used for instructing non-TE-Tunnel forwarding of flow.
Need to prove; Embodiment of the invention method is applicable to too carries out CSPF (the Constraint-based Shortest Path First that route is calculated among the traffic engineering TE; Constraint Shortest Path First) algorithm; Can realize through revising the CSPF algorithm, in collection network information, COST value and bandwidth information associated according to the CSPF algorithm; Carry out no longer to consider when route is calculated the influence of bandwidth like this, directly use the COST value that obtains according to the occupied situation of bandwidth to carry out route and calculate.Existing CSPF algorithm detailed process is to select link according to the COST value earlier; Calculate the remaining bandwidth after current actual physical bandwidth deducts the TE-TUNNEL occupied bandwidth again, judge then whether result calculated satisfies the link bandwidth of reserving, if do not satisfy; Just find second shortest path; See whether satisfy, look for down according to this order, and the COST value is constant in this process again.Calculate the thought of COST value according to embodiment of the invention method; Can select the link merging with the first step according to COST value calculating the process that current actual physical bandwidth deducts this step of remaining bandwidth behind the TE-TUNNEL occupied bandwidth; Promptly according to occupied bandwidth update calculation COST value, thereby directly find suitable link according to the COST value of renewal.
Foregoing has been introduced the embodiment of the invention in detail and has been carried out the route Calculation Method, and corresponding, the embodiment of the invention provides a kind of router.
Seeing also Fig. 4, is embodiment of the invention router one structural representation.
Router among Fig. 4 comprises first computing unit 401 and second computing unit 402.
First computing unit 401 is used to obtain the traffic engineering tunnel bandwidth reserved and calculates remaining bandwidth, calculates the path cost value of link according to said remaining bandwidth.Calculating remaining bandwidth is specially and band width in physical is deducted the traffic engineering tunnel bandwidth reserved obtains remaining bandwidth.
Second computing unit 402; Be used to calculate each link that arrives the destination the path cost value with; From said each link, select a link set to instruct non-traffic engineering tunnel forwarding of flow, for example select and be that the link set of minimum value instructs non-traffic engineering tunnel forwarding of flow as optimal path as optimal path.
Said first computing unit 401 is concrete by following formula calculating path value at cost:
COST=is with reference to radix/(band width in physical-TE-Tunnel bandwidth reserved)
The TE-Tunnel bandwidth reserved is the bandwidth that TE-Tunnel takies in advance behind the network design TE-Tunnel; Router operation OSPF/ISIS agreement; By first computing unit band width in physical is deducted the TE-Tunnel bandwidth reserved and draw the back remaining bandwidth of being taken of each interface of router by TE-Tunnel; And then will remove in remaining bandwidth with reference to radix, calculate the COST value of the link after router upgrades.
First computing unit 401 can only calculate the COST value of the link of this router, is flooded to the whole network to the link-state information of this router that carries this COST value then, and other routers just can receive the COST value that has calculated; First computing unit 401 also can be the bandwidth usage according to each router in the whole network, calculates the COST value of the link of each router of network at this router.
When second computing unit 402 calculates shortest path; If 401 of first computing units calculate the COST value of the link of this router; The COST value that then further calculates and be flooded to the link of the whole network according to other routers that receive obtains shortest path, instructs non-TE-Tunnel forwarding of flow.If first computing unit 401 has calculated the COST value of the link of each router of network, then can obtain shortest path directly according to the COST value of the link that calculates, instruct non-TE-Tunnel forwarding of flow.
Seeing also Fig. 5, is embodiment of the invention router two structural representations.
Router among Fig. 5 comprises threshold cell 501, first computing unit 502 and second computing unit 503.
Threshold cell 501 is used to the actual flow bandwidth of network setting threshold is set.Specifically be to be divided into different ranks to the network actual flow; Size according to actual flow; Set different threshold values; The value of threshold value is the ratio value that accounts for said band width in physical according to the actual flow bandwidth of network, for example can set 3 threshold values, and establishing proportion respectively is 30%, 60% and 90%.
First computing unit 502; Be used for after the actual flow bandwidth of network arrives the setting threshold of threshold cell 501 settings; Calculate remaining bandwidth; Calculate the path cost value of link according to said remaining bandwidth, the actual flow bandwidth of said network comprises the actual bandwidth that the traffic engineering tunnel bandwidth reserved is used and the actual bandwidth value of non-traffic engineering tunnel flow use.Calculating remaining bandwidth is specially and band width in physical is deducted the actual flow bandwidth of network obtains remaining bandwidth.
Second computing unit 503; Be used to calculate each link that arrives the destination the path cost value with; From said each link, select a link set to instruct non-traffic engineering tunnel forwarding of flow, for example select and be that the link set of minimum value instructs non-traffic engineering tunnel forwarding of flow as optimal path as optimal path.
Said first computing unit 502 is concrete by following formula calculating path value at cost:
COST=is with reference to radix/(bandwidth of band width in physical-network actual flow)
If threshold cell 501 is set 3 threshold values, establishing proportion respectively is 30%, 60% and 90%.The bandwidth that takies when actual flow be whole band width in physical 30% the time, by the dynamic COST value of adjustment of above-mentioned formula; By that analogy, the bandwidth that takies when actual flow be whole band width in physical 60% the time, by the dynamic COST value of adjustment of above-mentioned formula, the bandwidth that takies when actual flow be whole band width in physical 90% the time, dynamically adjust a COST value by above-mentioned formula again.
What first computing unit 502 calculated is the COST value of the link of this router, is flooded to the whole network to the link-state information of this router that carries this COST value then, and other routers just can receive the COST value that has calculated.
When second computing unit 503 calculates shortest path; First computing unit 502 has calculated the COST value of the link of this router; The COST value that then further calculates and be flooded to the link of the whole network according to other routers that receive obtains shortest path, instructs non-TE-Tunnel forwarding of flow.
In sum; The COST value of the link that when carrying out route calculating, uses in the prior art is not considered the situation of the bandwidth that is taken by TE-Tunnel; And the embodiment of the invention is considered to calculate under the TE-Tunnel occupied bandwidth situation in the COST value of carrying out using when route is calculated, and when calculating the COST value of link, obtains the traffic engineering tunnel bandwidth reserved and calculates remaining bandwidth; Calculate the path cost value of link according to said remaining bandwidth; Perhaps after the actual flow bandwidth of network arrives setting threshold, calculate remaining bandwidth, calculate the path cost value of link according to said remaining bandwidth; The actual flow bandwidth of said network comprises the actual bandwidth that actual bandwidth that the traffic engineering tunnel bandwidth reserved is used and non-traffic engineering tunnel flow use; So the shortest path that calculate according to the COST value this moment is only the shortest path that meets actual routing condition, just accurately reflects the actual routing condition of network, instructs the forwarding of network traffics reliably.
Further, can be the path cost value of calculating the link of this node when calculating the path cost value of link according to remaining bandwidth, the path cost value of the link of this node that will calculate then is flooded to the whole network; Or according to the path cost value of the link of each node in the bandwidth usage computing network of each node that is flooded to the whole network.
More than a kind of route computing method and router that the embodiment of the invention provided have been carried out detailed introduction; For one of ordinary skill in the art; Thought according to the embodiment of the invention; The part that on embodiment and range of application, all can change, in sum, this description should not be construed as limitation of the present invention.

Claims (11)

1.一种路由计算方法，其特征在于，包括：1. A routing calculation method, characterized in that, comprising: 获得流量工程隧道TE-Tunnel预留带宽；Obtain the reserved bandwidth of the traffic engineering tunnel TE-Tunnel; 网络中的每个节点根据减去所述TE-Tunnel预留带宽后的物理带宽计算链路的路径成本COST值，并把携带此COST值的本节点的链路状态信息泛洪到全网；Each node in the network calculates the path cost COST value of the link according to the physical bandwidth after subtracting the reserved bandwidth of the TE-Tunnel, and floods the link state information of the node carrying the COST value to the entire network; 各节点收集到所有节点的更新后的链路状态信息后，根据接收到的链路状态信息中的链路COST值计算出到达目的地的最短路径，并最终用来指导非TE-Tunnel流量的转发。After each node collects the updated link state information of all nodes, it calculates the shortest path to the destination according to the link COST value in the received link state information, and finally uses it to guide the routing of non-TE-Tunnel traffic. Forward. 2.根据权利要求1所述的路由计算方法，其特征在于：2. The routing calculation method according to claim 1, characterized in that: 所述根据减去所述TE-Tunnel预留带宽后的物理带宽计算链路的路径成本COST值具体为：The path cost COST value of the link calculated according to the physical bandwidth after subtracting the reserved bandwidth of the TE-Tunnel is specifically: 按以下公式计算路径成本值：The route cost value is calculated according to the following formula: 链路的路径成本值＝参考基数/(物理带宽-流量工程隧道预留带宽)；Path cost value of link=reference base number/(physical bandwidth-traffic engineering tunnel reserved bandwidth); 其中，所述参考基数为预先设定数值，所述物理带宽指为链路分配的总带宽。Wherein, the reference base is a preset value, and the physical bandwidth refers to a total bandwidth allocated for a link. 3.一种路由计算方法，其特征在于，包括：3. A routing calculation method, characterized in that, comprising: 获得流量工程隧道TE-Tunnel预留带宽；各节点将减去所述TE-Tunnel预留带宽后剩余的带宽信息泛洪到全网；网络中的每个节点，计算本节点的链路的路径成本COST值和网络中其他节点的链路的COST值，各节点根据计算得到的各节点的链路COST值计算出到达目的地的最短路径，并最终用来指导非TE-Tunnel流量的转发。Obtain the reserved bandwidth of the traffic engineering tunnel TE-Tunnel; each node will flood the remaining bandwidth information after subtracting the reserved bandwidth of the TE-Tunnel to the entire network; each node in the network calculates the path of the link of the node The cost COST value and the COST value of the links of other nodes in the network. Each node calculates the shortest path to the destination according to the calculated link COST value of each node, and finally uses it to guide the forwarding of non-TE-Tunnel traffic. 4.根据权利要求3所述的路由计算方法，其特征在于：4. The routing calculation method according to claim 3, characterized in that: 其中，COST值的计算公式为：Among them, the calculation formula of COST value is: COST＝参考基数/(物理带宽-TE-Tunnel预留带宽)COST=reference base number/(physical bandwidth-TE-Tunnel reserved bandwidth) 其中，所述参考基数为预先设定数值，所述物理带宽指为链路分配的总带宽。Wherein, the reference base is a preset value, and the physical bandwidth refers to a total bandwidth allocated for a link. 5.一种路由计算方法，其特征在于，包括：5. A routing calculation method, characterized in that, comprising: 在网络实际流量带宽到达设定阈值后，计算剩余带宽，根据所述剩余带宽计算链路的路径成本值；其中，所述计算剩余带宽为：将物理带宽减去网络实际流量带宽得到剩余带宽；After the actual network traffic bandwidth reaches the set threshold, calculate the remaining bandwidth, and calculate the path cost value of the link according to the remaining bandwidth; wherein, the calculation of the remaining bandwidth is: subtracting the actual network traffic bandwidth from the physical bandwidth to obtain the remaining bandwidth; 其中，所述网络实际流量带宽包括流量工程隧道预留带宽被使用的实际带宽和非流量工程隧道流量使用的实际带宽；Wherein, the actual network traffic bandwidth includes the actual bandwidth used by traffic engineering tunnel reserved bandwidth and the actual bandwidth used by non-traffic engineering tunnel traffic; 计算到达目的地的各链路的路径成本值的和，从所述各链路中选择一链路集合作为最优路径指导非流量工程隧道流量的转发。The sum of the path cost values of the links to the destination is calculated, and a link set is selected from the links as an optimal path to guide the forwarding of non-traffic engineering tunnel traffic. 6.根据权利要求5所述的路由计算方法，其特征在于：6. The routing calculation method according to claim 5, characterized in that: 所述根据剩余带宽计算链路的路径成本值具体为：The path cost value of the link calculated according to the remaining bandwidth is specifically: 按以下公式计算路径成本值：The route cost value is calculated according to the following formula: 链路的路径成本值＝参考基数/(物理带宽-网络实际流量带宽)；The path cost value of the link=reference base/(physical bandwidth-network actual traffic bandwidth); 其中，所述参考基数为预先设定数值，所述物理带宽指为链路分配的总带宽。Wherein, the reference base is a preset value, and the physical bandwidth refers to a total bandwidth allocated for a link. 7.根据权利要求5或6所述的路由计算方法，其特征在于：7. The routing calculation method according to claim 5 or 6, characterized in that: 所述设定阈值具体为根据所述网络实际流量带宽占所述物理带宽的比例取值。The set threshold is specifically determined according to the ratio of the actual traffic bandwidth of the network to the physical bandwidth. 8.一种路由器，其特征在于，包括：8. A router, characterized in that, comprising: 第一计算单元，用于获得流量工程隧道预留带宽并计算剩余带宽，根据所述剩余带宽计算链路的路径成本COST值；把携带此COST值的本路由器的链路状态信息泛洪到全网，或者，根据全网中各路由器的带宽使用情况，在本路由器计算出网络每一个路由器的链路的COST值；The first calculation unit is used to obtain the reserved bandwidth of the traffic engineering tunnel and calculate the remaining bandwidth, and calculate the path cost COST value of the link according to the remaining bandwidth; flood the link state information of the router carrying the COST value to the entire network network, or, according to the bandwidth usage of each router in the entire network, calculate the COST value of the link of each router in the network on this router; 第二计算单元，用于计算最短路径时，如果第一计算单元401只计算出本路由器的链路的COST值，则进一步根据接收的其他路由器计算出并泛洪到全网的链路的COST值得到最短路径，指导非流量工程隧道TE-Tunnel流量的转发；如果第一计算单元已经计算出网络每一个路由器的链路的COST值，则可以直接根据计算的链路的COST值，得到最短路径，指导非TE-Tunnel流量的转发。The second calculation unit is used to calculate the shortest path. If the first calculation unit 401 only calculates the COST value of the link of this router, it further calculates the COST value of the link received by other routers and floods it to the entire network. value to obtain the shortest path to guide the forwarding of non-traffic engineering tunnel TE-Tunnel traffic; if the first calculation unit has calculated the COST value of the link of each router in the network, the shortest path can be obtained directly based on the calculated link COST value Path, guiding the forwarding of non-TE-Tunnel traffic. 9.根据权利要求8所述的路由器，其特征在于：9. The router according to claim 8, characterized in that: 所述第一计算单元计算剩余带宽具体为将物理带宽减去流量工程隧道预留带宽得到剩余带宽；The calculation of the remaining bandwidth by the first calculation unit is specifically to obtain the remaining bandwidth by subtracting the reserved bandwidth of the traffic engineering tunnel from the physical bandwidth; 所述根据剩余带宽计算链路的路径成本值具体为：按以下公式计算路径成本值：The calculation of the path cost value of the link according to the remaining bandwidth is specifically: calculating the path cost value according to the following formula: 链路的路径成本值＝参考基数/(物理带宽-流量工程隧道预留带宽)；Path cost value of link=reference base number/(physical bandwidth-traffic engineering tunnel reserved bandwidth); 其中，所述参考基数为预先设定数值，所述物理带宽指为链路分配的总带宽。Wherein, the reference base is a preset value, and the physical bandwidth refers to a total bandwidth allocated for a link. 10.一种路由器，其特征在于，包括：10. A router, characterized in that, comprising: 阈值单元，用于为网络实际流量带宽设置设定阈值；The threshold unit is used to set the threshold for the actual traffic bandwidth of the network; 第一计算单元，用于在网络实际流量带宽到达阈值单元设置的设定阈值后，计算剩余带宽，根据所述剩余带宽计算链路的路径成本值，所述网络实际流量带宽包括流量工程隧道预留带宽被使用的实际带宽和非流量工程隧道流量使用的实际带宽值；The first calculation unit is used to calculate the remaining bandwidth after the actual network traffic bandwidth reaches the set threshold set by the threshold unit, and calculate the path cost value of the link according to the remaining bandwidth, and the actual network traffic bandwidth includes traffic engineering tunnel preset The actual bandwidth used by reserved bandwidth and the actual bandwidth value used by non-traffic engineering tunnel traffic; 第二计算单元，用于计算到达目的地的各链路的路径成本值的和，从所述各链路中选择一链路集合作为最优路径指导非流量工程隧道流量的转发；The second calculation unit is used to calculate the sum of the path cost values of the links to the destination, and select a link set from the links as the optimal path to guide the forwarding of non-traffic engineering tunnel traffic; 其中，所述第一计算单元计算剩余带宽具体为将物理带宽减去网络实际流量带宽得到剩余带宽。Wherein, the calculation of the remaining bandwidth by the first calculation unit is specifically to obtain the remaining bandwidth by subtracting the actual network traffic bandwidth from the physical bandwidth. 11.根据权利要求10所述的路由器，其特征在于：11. The router according to claim 10, characterized in that: 所述根据剩余带宽值计算链路的路径成本值具体为：The calculation of the path cost value of the link according to the remaining bandwidth value is specifically: 按以下公式计算路径成本值：The route cost value is calculated according to the following formula: 链路的路径成本值＝参考基数/(物理带宽-网络实际流量带宽值)；Path cost value of link=reference base/(physical bandwidth-network actual traffic bandwidth value); 其中，所述参考基数为预先设定数值，所述物理带宽指为链路分配的总带宽。Wherein, the reference base is a preset value, and the physical bandwidth refers to a total bandwidth allocated for a link.
CN2007101513391A 2007-09-25 2007-09-25 Route computing method and router Expired - Fee Related CN101399748B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN2007101513391A CN101399748B (en) 2007-09-25 2007-09-25 Route computing method and router
PCT/CN2008/071633 WO2009039736A1 (en) 2007-09-25 2008-07-14 Route calculating method and router

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2007101513391A CN101399748B (en) 2007-09-25 2007-09-25 Route computing method and router

Publications (2)

Publication Number Publication Date
CN101399748A CN101399748A (en) 2009-04-01
CN101399748B true CN101399748B (en) 2012-07-04

Family

ID=40510752

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2007101513391A Expired - Fee Related CN101399748B (en) 2007-09-25 2007-09-25 Route computing method and router

Country Status (2)

Country Link
CN (1) CN101399748B (en)
WO (1) WO2009039736A1 (en)

Families Citing this family (12)

* 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
CN103346979B (en) * 2013-06-21 2017-02-08 杭州华三通信技术有限公司 Flow distribution method and equipment in SPBM network
CN103312620A (en) * 2013-06-26 2013-09-18 华为技术有限公司 Method and device for processing network congestion
CN103650435B (en) * 2013-08-14 2016-11-09 华为技术有限公司 Routing traffic method of adjustment, device and controller
WO2015196494A1 (en) * 2014-06-28 2015-12-30 华为技术有限公司 Path calculation method and apparatus
CN104283807B (en) * 2014-09-17 2018-07-24 新华三技术有限公司 A kind of traffic engineering tunnel method for building up and device
CN104333881B (en) * 2014-10-10 2018-06-12 新华三技术有限公司 A kind of traffic engineering tunnel building method and device
CN104618256B (en) * 2015-01-22 2018-07-10 盛科网络（苏州）有限公司 The method that OSPF dynamics adjust link load
CN106961399B (en) * 2016-01-08 2021-01-08 中兴通讯股份有限公司 Method and system for distributing reserved bandwidth of tunnel exit port
CN108259342B (en) * 2018-03-09 2021-11-30 华洋通信科技股份有限公司 Network local congestion processing method based on OSPF protocol
CN112671631B (en) * 2020-12-15 2022-03-04 湖北工业大学 A kind of optimization method and system of packet transport network
CN115277537B (en) * 2022-06-24 2024-12-03 新华三技术有限公司合肥分公司 Method for calculating routing and controlling equipment board overhead and network equipment

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1592302A (en) * 2004-06-10 2005-03-09 上海交通大学 Method for realizing passive light network running and managing
CN1649315A (en) * 2004-01-30 2005-08-03 富士通株式会社 Network control device and path control method thereof
US7065044B2 (en) * 1999-03-19 2006-06-20 Lucent Technologies Inc. Managing congestion and traffic flow by considering the minimization of link utilization values

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7020087B2 (en) * 2003-01-13 2006-03-28 Motorola, Inc. Segmented and distributed path optimization in a communication network
CN1705286A (en) * 2004-06-03 2005-12-07 华为技术有限公司 Data message transmission method

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7065044B2 (en) * 1999-03-19 2006-06-20 Lucent Technologies Inc. Managing congestion and traffic flow by considering the minimization of link utilization values
CN1649315A (en) * 2004-01-30 2005-08-03 富士通株式会社 Network control device and path control method thereof
CN1592302A (en) * 2004-06-10 2005-03-09 上海交通大学 Method for realizing passive light network running and managing

Also Published As

Publication number Publication date
WO2009039736A1 (en) 2009-04-02
CN101399748A (en) 2009-04-01

Similar Documents

Publication Publication Date Title
CN101399748B (en) Route computing method and router
EP3264695B1 (en) Bandwidth management for resource reservation protocol lsps and non-resource reservation protocol lsps
CN100454841C (en) Multi-domain routing computation method and system
US9923798B1 (en) Dynamic load balancing of network traffic on a multi-path label switched path using resource reservation protocol with traffic engineering
CN101001200B (en) Flow engineering full network counting method and system between regions
US7580359B2 (en) Method and system for maximizing network capacity utilization in multiprotocol label switched networks by moving label switched paths
CN101312464B (en) Method for realizing load balance in automatic exchange optical network
CN102281193B (en) Method and fiber channel (FC) equipment for realizing message forwarding in fiber channel network
EP1890436B1 (en) Method and apparatus for managing and transmitting fine granularity services
JP2006109454A (en) Route selection method and apparatus in telecommunication network
CN101986622A (en) Method and system for automatically identifying state attribute of path computation element (PCE)
CN102098596B (en) Route establishing method and device in optical network
US10200280B2 (en) Software-defined network for temporal label switched path tunnels
Li et al. Dynamic routing with inaccurate link state information in integrated IP-over-WDM networks
CN103491002B (en) Method and system for obtaining link cost value of IP link
JP4978520B2 (en) Network control system, network control device, traffic control method, and program
CN102123089B (en) Tunnel establishing method and device
CN105430538B (en) A kind of inter-domain routing method based on optical-fiber network subtopology figure
CN102487352B (en) Service distributing method and device
CN101945048A (en) Method, system and device for establishing label switch path
Szviatovszki et al. Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing
JP3925468B2 (en) Path capacity and path route changing method, and node device
CN108234355B (en) Network resource reservation method, PCE (personal computer equipment) and SDN (software defined network) system
EP3419228B1 (en) Service path establishment method, node device, and system
CN100459588C (en) A bandwidth preservation method and device based on network equipment

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20120704

Termination date: 20160925