CN108768858B - MBB path calculation method and system based on bandwidth - Google Patents
MBB path calculation method and system based on bandwidth Download PDFInfo
- Publication number
- CN108768858B CN108768858B CN201810432535.4A CN201810432535A CN108768858B CN 108768858 B CN108768858 B CN 108768858B CN 201810432535 A CN201810432535 A CN 201810432535A CN 108768858 B CN108768858 B CN 108768858B
- Authority
- CN
- China
- Prior art keywords
- new path
- bandwidth
- node
- path
- mbb
- 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
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
- H04L45/12—Shortest path evaluation
- H04L45/125—Shortest path evaluation based on throughput or bandwidth
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a bandwidth-based MBB path calculation method and a system, and relates to the field of communication path establishment. The method comprises the following steps: when a new path needs to be established, acquiring the MBB information of the original path, wherein the MBB information comprises the initial available bandwidth of the link between the adjacent 2 nodes; calculating new path attribute information according with the bandwidth occupied by the new path according to the MBB information; the standards for meeting the bandwidth occupied by the new path include: the initial available bandwidth of the links between the adjacent 2 nodes in the original path occupies more than the bandwidth of the new path. The invention can establish a new path by utilizing the original path on the basis of the available bandwidth of the original path and the occupied bandwidth of the new path; the invention has higher path calculation precision, can reduce the packet loss rate when a new path is established, has higher working efficiency and can ensure the communication quality.
Description
Technical Field
The invention relates to the field of communication path establishment, in particular to a bandwidth-based MBB (Make Before Break) path calculation method and system.
Background
The MBB establishes a new Path (also called a Modify LSP) before an original LSP (Label Switch Path) is torn down; and a mechanism of changing tunnel attributes (for example, changing the bandwidth of an original path, or modifying a path, deactivating an original partial path, and replacing with another path, etc.) of an MPLS TE (Multi-Protocol Label Switching Traffic Engineering) on the premise of not losing data or occupying extra bandwidth as much as possible during Traffic Switching.
The traditional method for realizing MBB by MPLS-TE comprises the following steps: when the tunnel attribute needs to be changed, the MBB is triggered to establish a new path with proper bandwidth. When the new path and the original path have partially shared nodes (the nodes are routers or other gateways), the shared link needs to be allocated with specified extra occupied bandwidth (since the original path is still in use, there will be already used bandwidth and available bandwidth), and the unshared path is allocated with the extra occupied bandwidth which is the same as the occupied bandwidth of the new path.
However, the above method has the following problems in use:
(1) when the existing MBB establishes a new path, whether the available bandwidth of the original path is more than the bandwidth occupied by the new path or not is judged, if so, the node of the original path is continuously used, and otherwise, the new path is considered to be incapable of being established.
(2) Since the used bandwidth of the original path cannot be known, it is necessary to first obtain the port information (e.g., IP address, next hop, etc.) of each node and the used bandwidth of the link between 2 neighboring nodes after receiving a new path requirement for changing the tunnel attribute and before triggering the MBB, and the process of obtaining the port information (e.g., IP address, next hop, etc.) of each node and the used bandwidth of the link between neighboring nodes is complicated; specifically, each of the other nodes except the first node sends port information and bandwidth of a link between adjacent nodes to the first node, which not only reduces the working efficiency, but also causes a packet loss phenomenon.
Disclosure of Invention
Aiming at the defects in the prior art, the invention solves the technical problems that: how to establish a new path by using an original path on the basis of the available bandwidth of the original path and the occupied bandwidth required by the new path. The invention has higher path calculation precision, can reduce the packet loss rate when a new path is established, has higher working efficiency and can ensure the communication quality.
In order to achieve the above purpose, the MBB route calculation method based on bandwidth provided by the invention obtains the MBB information of the original path when a new path needs to be established, wherein the MBB information comprises the initial available bandwidth of the links between the adjacent 2 nodes; calculating new path attribute information according with the bandwidth occupied by the new path according to the MBB information; the standards for meeting the bandwidth occupied by the new path include: the initial available bandwidth of the links between the adjacent 2 nodes in the original path occupies more than the bandwidth of the new path.
On the basis of the technical scheme, the initial available bandwidth is equal to the sum of the used bandwidth and the available bandwidth of the links between the adjacent 2 nodes, and the new path attribute information comprises the extra occupied bandwidth of the links between the adjacent 2 nodes; in the process of calculating the attribute information of the new path, when 2 adjacent nodes of the new path exist in the MBB information, setting extra occupied bandwidth according to the occupied bandwidth of the new path and the corresponding used bandwidth in the MBB information; and when 1 of the adjacent 2 nodes of the new path does not exist in the MBB information, setting extra occupied bandwidth according to the occupied bandwidth of the new path.
On the basis of the above technical solution, the process of calculating new path attribute information conforming to the bandwidth occupied by the new path according to the MBB information includes:
step 1: taking the first node of the original path as a new path node, selecting the first node as a current node, and turning to the step 2;
step 2: judging whether the MBB information has an adjacent node of the current node, if so, turning to the step 3, otherwise, turning to the step 4;
and step 3: judging the initial available bandwidth of the link between the current node and the adjacent node, judging whether the bandwidth is occupied by the new path or not and whether the adjacent node meets the path node indication requirement or not, if so, taking the adjacent node as the new path node, setting additional occupied bandwidth for the link between the current node and the new path node according to the new path occupied bandwidth and the corresponding bandwidth in the MBB information, and turning to the step 5; otherwise go to step 4;
and 4, step 4: acquiring all available nodes which are adjacent to the current node, have the actual available bandwidth of the link between the nodes above the bandwidth occupied by the new path and meet the indication requirement of the path node; selecting a new path node from all available nodes according to a path selection rule, setting an extra occupied bandwidth for a link between the current node and the new path node according to the occupied bandwidth of the new path, and turning to the step 5;
and 5: judging whether the new path node is a tail node of the original path, if so, turning to a step 6, otherwise, turning to a step 2 by taking the new path node as a current node;
step 6: and forming new path attribute information by using the port information of all the new path nodes and the extra occupied bandwidth of the links between the adjacent 2 new path nodes.
On the basis of the above technical solution, the path node indication requirement includes a designated use node and a prohibited use node, and the nodes meeting the path node indication requirement in steps 3 and 4 are: the node is a designated using node or the node is not a forbidden node.
On the basis of the above technical solution, the process of setting an extra occupied bandwidth according to the occupied bandwidth of the new path and the corresponding used bandwidth in the MBB information is as follows: the extra occupied bandwidth is defined as B2, the occupied bandwidth of the new path is defined as B1, the corresponding used bandwidth in the MBB information is B3, when B3 is larger than or equal to B1, B2 is 0, when B3 is smaller than B1, B2 is B1-B3.
The MBB route calculation system based on the bandwidth comprises an MBB route calculation module, which is used for: acquiring MBB information of an original path, wherein the MBB information comprises initial available bandwidth of links between 2 adjacent nodes; calculating new path attribute information according with the bandwidth occupied by the new path according to the MBB information; the standards for meeting the bandwidth occupied by the new path include: the initial available bandwidth of the links between the adjacent 2 nodes in the original path occupies more than the bandwidth of the new path.
On the basis of the technical scheme, the MBB route calculation module comprises an MBB information acquisition module, a new route calculation module and a new route creation module;
the MBB information acquisition module is used for: after the original path is established and communicated, port information of each node in the original path, the used bandwidth of links between the adjacent 2 nodes and the initial available bandwidth of the links between the adjacent 2 nodes, wherein the initial available bandwidth is equal to the sum of the used bandwidth and the available bandwidth of the links between the adjacent 2 nodes, so as to form MBB information;
the new path calculation module is used for: when a new path needs to be established, calculating new path attribute information meeting the requirements of the new path according to the MBB information; the new path requirement comprises the bandwidth occupied by the new path, and the attribute information of the new path comprises the port information of each node in the new path and the extra occupied bandwidth of the links between the adjacent 2 nodes; in the process of calculating the attribute information of the new path, when 2 adjacent nodes of the new path exist in the MBB information, setting extra occupied bandwidth according to the occupied bandwidth of the new path and the corresponding used bandwidth in the MBB information; when 1 of the 2 adjacent nodes of the new path does not exist in the MBB information, setting extra occupied bandwidth according to the occupied bandwidth of the new path, and sending a new path establishing signal to a new path establishing module;
the new path creation module is to: and after receiving the new path establishing signal, establishing a new path according to the new path attribute information.
On the basis of the technical scheme, the new path requirement in the new path calculation module further comprises a head node and a tail node of the new path and a path node indication requirement, and the head node and the tail node of the new path are the same as those of the original path; the work flow of the new path calculation module comprises the following steps:
new path calculation step 1: taking the first node as a new path node, selecting the first node as a current node, and turning to a new path calculation step 2;
and a new path calculation step 2: judging whether the MBB information has an adjacent node of the current node, if so, turning to a new path calculation step 3, otherwise, turning to a new path calculation step 4;
and a new path calculation step 3: judging the initial available bandwidth of the link between the current node and the adjacent node, judging whether the bandwidth is occupied by the new path or not and whether the adjacent node meets the path node indication requirement or not, if so, taking the adjacent node as the new path node, setting additional occupied bandwidth for the link between the current node and the new path node according to the new path occupied bandwidth and the corresponding bandwidth in the MBB information, and turning to a new path routing step 5; otherwise, turning to a new path calculation step 4;
and a new path calculation step 4: acquiring all available nodes which are adjacent to the current node, have the actual available bandwidth of the link between the nodes above the bandwidth occupied by the new path and meet the indication requirement of the path node; selecting new path nodes from all available nodes according to a path selection rule, setting extra occupied bandwidth for a link between the current node and the new path nodes according to the occupied bandwidth of the new path, and turning to a new path calculation step 5;
and a new path calculation step 5: judging whether the new path node is a tail node, if so, turning to a new path calculation step 6, otherwise, turning to a new path calculation step 2 by taking the new path node as a current node;
and a new path calculation step 6: and forming new path attribute information by using the port information of all the new path nodes and the extra occupied bandwidth of the links between the adjacent 2 new path nodes.
On the basis of the above technical solution, the path node indication requirement includes a designated use node and a prohibited use node, and the new path calculation module determines that the node meeting the path node indication requirement is: the node is a designated using node or the node is not a forbidden node.
On the basis of the technical scheme, the new path calculation module sets the flow of additionally occupying bandwidth according to the bandwidth occupied by the new path and the corresponding used bandwidth in the MBB information as follows: the extra occupied bandwidth is defined as B2, the occupied bandwidth of the new path is defined as B1, the corresponding used bandwidth in the MBB information is B3, when B3 is larger than or equal to B1, B2 is 0, when B3 is smaller than B1, B2 is B1-B3.
Compared with the prior art, the invention has the advantages that:
(1) because the original path is torn down after the new path is established, the available bandwidth of the original path will appear: the conditions that the bandwidth occupied by the new path is smaller than that occupied by the original path before the original path is removed and the bandwidth occupied by the new path after the original path is removed are met. The invention can adapt the new path directly according to the initial available bandwidth of the original path when the available bandwidth of the original path is more than the occupied bandwidth required by the new path, thereby avoiding the occurrence of the above conditions.
Furthermore, the invention can automatically calculate the new path attribute information which meets the requirements of the new path, and adjust the extra occupied bandwidth of the link between the corresponding adjacent nodes in the new path attribute information according to the used bandwidth of the link between the adjacent nodes in the original path; therefore, the path calculation method is high in path calculation accuracy and not prone to errors.
(2) After the original path is established and communicated, the invention obtains the MBB information containing the port information and the used bandwidth of each node in the original path. Therefore, compared with the prior art that the original path information is respectively obtained from a plurality of nodes after the path requirement for changing the tunnel attribute is received and before the MBB is triggered, the method and the device can directly obtain the MBB information when the MBB is triggered, thereby not only improving the working efficiency, but also reducing the packet loss rate.
Drawings
FIG. 1 is a flow chart of a bandwidth-based MBB way calculation method according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a path calculation scenario of an original path and a new path in the sixth embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples.
The MBB path calculation method based on the bandwidth in the embodiment of the invention comprises the following steps: when a new path needs to be established (namely, the attribute of the path needs to be changed), acquiring MBB information of the original path, wherein the MBB information comprises an initial available bandwidth of a link between 2 adjacent nodes (the initial available bandwidth is equal to the sum of the used bandwidth and the available bandwidth of the link between 2 adjacent nodes, and the initial available bandwidth is an available bandwidth allocated to the link between the adjacent nodes when the original path is established and can be understood as a maximum bandwidth under the condition that reserved bandwidth is not considered); calculating new path attribute information according with the bandwidth occupied by the new path according to the MBB information; the criteria for complying with the bandwidth occupied by the new path include: the initial available bandwidth of the links between the adjacent 2 nodes in the original path is more than the occupied bandwidth of the corresponding links in the new path.
The standard can ensure that the original path can still be used for establishing the new path when the initial available bandwidth of the original path meets the bandwidth occupied by the new path but the used bandwidth of the original path is more than the bandwidth occupied by the new path. For example, the occupied bandwidth requirement of the new path is 30M, the current node is R1, the adjacent nodes are R2 in the MBB information, the initial available bandwidth of the link between R1 and R2 is 30M, and the use of R1 and R2 occupies 10M bandwidth; in this case, since the original path is to be torn down after the new path is established, and the available bandwidth of the link between R1 and R2 is 30M after the new path is torn down, this is in accordance with the occupied bandwidth requirement of the new path.
The process of the invention is illustrated below by means of six examples.
The first embodiment is as follows: referring to fig. 1, the MBB path computation method based on bandwidth in the embodiment of the present invention specifically includes the following steps:
s1: after the original LSP path is established and communicated, the port information of each node in the original path, the used bandwidth of the links between the adjacent 2 nodes, and the initial available bandwidth of the links between the adjacent 2 nodes are formed into MBB information, and the flow goes to S2.
S2: when a new path needs to be established, calculating new path attribute information meeting the requirements of the new path according to the MBB information; the new path requirement comprises the bandwidth occupied by the new path, and the new path attribute information comprises the port information of each node in the new path and the extra occupied bandwidth of the links between the adjacent 2 nodes. In the process of calculating the attribute information of the new path, when 2 adjacent nodes of the new path exist in the MBB information, setting extra occupied bandwidth according to the occupied bandwidth of the new path and the corresponding used bandwidth in the MBB information; when 1 of the adjacent 2 nodes of the new path does not exist in the MBB information, the additional occupied bandwidth is set according to the occupied bandwidth of the new path, and the flow goes to S3.
In the process of executing S3, the communication of the original path is maintained, so that after the new path is established, only the data packet being received is sent, the normal sending rate of the data packet is ensured, the packet loss rate is reduced, and the communication quality is further improved.
S3: and according to the new path attribute information, after the corresponding new path is established, the original path is removed so as to ensure that the communication is not interrupted in the process.
Example two: on the basis of the first embodiment, the new path requirement further comprises a head node and a tail node of the new path and a path node indication requirement, and the head node and the tail node of the new path are the same as those of the original path; the flow of S2 includes:
s201: and taking the first node as a new path node, selecting the first node as a current node, and turning to S202.
S202: judging whether the MBB information has an adjacent node of the current node, if so, turning to S203, otherwise, turning to S204;
s203: judging whether the initial available bandwidth of the link between the current node and the adjacent node is more than the bandwidth occupied by the new path and whether the adjacent node meets the path node indication requirement, if so, taking the adjacent node as the new path node, setting additional occupied bandwidth for the link between the current node and the new path node according to the bandwidth occupied by the new path and the corresponding bandwidth in the MBB information, and turning to S205; otherwise go to S204.
S204: acquiring all available nodes which are adjacent to the current node and have the actual available bandwidth of the link between the nodes (namely the actual available bandwidth after the new path is established) which is more than the bandwidth occupied by the new path and meets the indication requirement of the path node; and according to the path selection rule, selecting a new path node from all available nodes, setting an extra occupied bandwidth for a link between the current node and the new path node according to the occupied bandwidth of the new path, and turning to S205.
S205: and judging whether the new path node is a tail node, if so, turning to S206, otherwise, turning to S202 by taking the new path node as a current node.
S206: and forming new path attribute information by using the port information of all the new path nodes and the extra occupied bandwidth of the links between the adjacent 2 new path nodes.
The Path selection rule in the second embodiment is a CSPF algorithm (Constrained short Path First, Shortest Constrained Path First algorithm), that is, a node selected according to the algorithm is a node closest to the selected node; in practical application, the path selection rule can be customized according to different requirements of the user.
Example three: on the basis of the first embodiment, the path node indication requirement includes a designated use node and a prohibited use node, and the nodes meeting the path node indication requirement in the second embodiment are: the node is a designated using node or the node is not a forbidden node.
Example four: on the basis of the first embodiment, in S2, according to the new path occupied bandwidth and the corresponding used bandwidth in the MBB information, the process of setting the extra occupied bandwidth is as follows: the extra occupied bandwidth is defined as B2, the occupied bandwidth of the new path is defined as B1, the corresponding used bandwidth in the MBB information is B3, when B3 is larger than or equal to B1, B2 is 0, when B3 is smaller than B1, B2 is B1-B3.
Example five: on the basis of the first embodiment, the process of establishing the new path according to the new path attribute information in S3 includes: and acquiring all nodes in the new path attribute information, and allocating bandwidth to the links between the corresponding 2 nodes according to the extra occupied bandwidth of the links between the adjacent 2 nodes in the new path attribute information.
Example six: referring to fig. 2, nodes of the original path are R1, R2, and R3, an available bandwidth of a link between R1 and R2 is 20M, an already-used bandwidth is 10M, an available bandwidth of a link between R2 and R3 is 30M, and an already-used bandwidth is 10M, where the method of the present invention:
the original path information storage process: the port information of R1, R2, and R3, the used bandwidth (10M) of the link between R1 and R2, and the used bandwidth (10M) of the link between R2 and R3 are formed into MBB information and saved to node R1 (head node).
And (3) a new path calculation process: and triggering the MBB, wherein the triggered new path requires that the bandwidth occupied by the new path is 30M, the head node of the path is R1, the tail node of the path is R3, and the path node indication requirement is that the designated using node is R4 and no using-forbidden node exists.
Selecting the available bandwidth of a link between R4, R1 and R4 of adjacent nodes R1 as a new path node, wherein the available bandwidth of the link between R4 and R3526 is 40M (> 30M), and the extra occupied bandwidth of the link between R1 and R4 is set as 30M;
searching an adjacent node R2 of the node R4 according to a path selection rule, wherein the available bandwidth of a link between R4 and R2 is 30M (more than or equal to 30M), taking R2 as a new path node, and setting the extra occupied bandwidth of the link between R4 and R2 as 30M;
the MBB information has the adjacent nodes R3 of R2, the initial available bandwidth of the link between R2 and R3 is 30M (more than or equal to 30M), and R3 is taken as a new path node; the port information of R2 and R3 in the new path attribute information is the same as the MBB information (i.e. the used bandwidth of the link between R2 and R3 is 10M, which is a shared link between the original path and the new path), and at this time, the extra occupied bandwidth of the link between R2 and R3 is set to 20M (30 — the used 10 of the original path);
r3 is a tail node, and forms new path attribute information with port information of R1, R2, R3 and R4, and an additional occupied bandwidth of a link between adjacent nodes.
And (3) a new path establishing process: acquiring port information of R1, R4, R2 and R3, allocating 30M bandwidth for a link between R1 and R4 and a link between R4 and R2, allocating 20M bandwidth for a link between R2 and R3, and removing the original path after bandwidth allocation is completed.
The MBB route calculation system based on the bandwidth in the embodiment of the invention comprises an MBB route calculation module, which is used for: acquiring MBB information of an original path, wherein the MBB information comprises initial available bandwidth of links between 2 adjacent nodes; calculating new path attribute information according with the bandwidth occupied by the new path according to the MBB information; the criteria for complying with the bandwidth occupied by the new path include: the initial available bandwidth of the links between the adjacent 2 nodes in the original path occupies more than the bandwidth of the new path.
The MBB route calculation module comprises an MBB information acquisition module, a new route calculation module and a new route creation module.
The MBB information acquisition module is used for: after the original path is established and communicated, the port information of each node in the original path, the used bandwidth of the links between the adjacent 2 nodes and the initial available bandwidth of the links between the adjacent 2 nodes, wherein the initial available bandwidth is equal to the sum of the used bandwidth and the available bandwidth of the links between the adjacent 2 nodes, so as to form MBB information.
The new path calculation module is used for: when a new path needs to be established, calculating new path attribute information meeting the requirements of the new path according to the MBB information; the new path requirements include the bandwidth occupied by the new path, the head node and the tail node of the new path, and path node indication requirements (the head node and the tail node of the new path are the same as the original path). The new path attribute information comprises port information of each node in the new path and extra occupied bandwidth of links between the adjacent 2 nodes; in the process of calculating the attribute information of the new path, when 2 adjacent nodes of the new path exist in the MBB information, setting extra occupied bandwidth according to the occupied bandwidth of the new path and the corresponding used bandwidth in the MBB information; and when 1 of the 2 adjacent nodes of the new path does not exist in the MBB information, setting an extra occupied bandwidth according to the occupied bandwidth of the new path, and sending a new path creating signal to a new path creating module.
The work flow of the new path calculation module comprises the following steps:
new path calculation step 1: taking the first node as a new path node, selecting the first node as a current node, and turning to a new path calculation step 2;
and a new path calculation step 2: judging whether the MBB information has an adjacent node of the current node, if so, turning to a new path calculation step 3, otherwise, turning to a new path calculation step 4;
and a new path calculation step 3: judging the initial available bandwidth of the link between the current node and the adjacent node, judging whether the bandwidth is occupied above the new path or not, and the adjacent node accords with the path node indication requirement, wherein the path node indication requirement comprises an appointed use node and a forbidden use node, and the node which accords with the path node indication requirement is as follows: the node is a designated using node or the node is not a forbidden node; if yes, taking the adjacent node as a new path node, setting extra occupied bandwidth for a link between the current node and the new path node according to the occupied bandwidth of the new path and the corresponding bandwidth in the MBB information, and turning to a new path routing step 5; otherwise, turning to a new path calculation step 4;
according to the bandwidth occupied by the new path and the corresponding used bandwidth in the MBB information, the process of additionally occupying the bandwidth is set as follows: defining the extra occupied bandwidth as B2, the new path occupied bandwidth as B1, and the corresponding used bandwidth in the MBB information as B3, when B3 is greater than or equal to B1, B2 is 0, when B3 is less than B1, B2 is B1-B3;
and a new path calculation step 4: acquiring all available nodes which are adjacent to the current node, have the actual available bandwidth of the link between the nodes above the bandwidth occupied by the new path and meet the indication requirement of the path node; selecting new path nodes from all available nodes according to a path selection rule, setting extra occupied bandwidth for a link between the current node and the new path nodes according to the occupied bandwidth of the new path, and turning to a new path calculation step 5;
and a new path calculation step 5: judging whether the new path node is a tail node, if so, turning to a new path calculation step 6, otherwise, turning to a new path calculation step 2 by taking the new path node as a current node;
and a new path calculation step 6: and forming new path attribute information by using the port information of all the new path nodes and the extra occupied bandwidth of the links between the adjacent 2 new path nodes.
The new path creation module is to: and after receiving the new path establishing signal, establishing a new path according to the new path attribute information.
It should be noted that: in the system provided in the embodiment of the present invention, when performing inter-module communication, only the division of each functional module is illustrated, and in practical applications, the above function distribution may be completed by different functional modules as needed, that is, the internal structure of the system is divided into different functional modules to complete all or part of the above described functions.
Further, the present invention is not limited to the above-mentioned embodiments, and it will be apparent to those skilled in the art that various modifications and improvements can be made without departing from the principle of the present invention, and these modifications and improvements are also considered to be within the scope of the present invention. Those not described in detail in this specification are within the skill of the art.
Claims (7)
1. A MBB path calculation method based on bandwidth is characterized in that: when a new path needs to be established, acquiring the MBB information of the original path, wherein the MBB information comprises the initial available bandwidth of the link between the adjacent 2 nodes; calculating new path attribute information according with the bandwidth occupied by the new path according to the MBB information; the standards for meeting the bandwidth occupied by the new path include: the initial available bandwidth of the links between the adjacent 2 nodes in the original path occupies more than the bandwidth of the new path;
the initial available bandwidth is equal to the sum of the used bandwidth and the available bandwidth of the links between the adjacent 2 nodes, and the new path attribute information comprises the extra occupied bandwidth of the links between the adjacent 2 nodes; in the process of calculating the attribute information of the new path, when 2 adjacent nodes of the new path exist in the MBB information, setting extra occupied bandwidth according to the occupied bandwidth of the new path and the corresponding used bandwidth in the MBB information; when 1 of the 2 adjacent nodes of the new path does not exist in the MBB information, setting extra occupied bandwidth according to the occupied bandwidth of the new path;
wherein, the process of calculating the new path attribute information according with the bandwidth occupied by the new path according to the MBB information comprises the following steps:
step 1: taking the first node of the original path as a new path node, selecting the first node as a current node, and turning to the step 2;
step 2: judging whether the MBB information has an adjacent node of the current node, if so, turning to the step 3, otherwise, turning to the step 4;
and step 3: judging the initial available bandwidth of the link between the current node and the adjacent node, judging whether the bandwidth is occupied by the new path or not and whether the adjacent node meets the path node indication requirement or not, if so, taking the adjacent node as the new path node, setting additional occupied bandwidth for the link between the current node and the new path node according to the new path occupied bandwidth and the corresponding bandwidth in the MBB information, and turning to the step 5; otherwise go to step 4;
and 4, step 4: acquiring all available nodes which are adjacent to the current node, have the actual available bandwidth of the link between the nodes above the bandwidth occupied by the new path and meet the indication requirement of the path node; selecting a new path node from all available nodes according to a path selection rule, setting an extra occupied bandwidth for a link between the current node and the new path node according to the occupied bandwidth of the new path, and turning to the step 5;
and 5: judging whether the new path node is a tail node of the original path, if so, turning to a step 6, otherwise, turning to a step 2 by taking the new path node as a current node;
step 6: and forming new path attribute information by using the port information of all the new path nodes and the extra occupied bandwidth of the links between the adjacent 2 new path nodes.
2. The bandwidth-based MBB way-computing method of claim 1, wherein: the path node indication requirement comprises a designated using node and a forbidden using node, and the nodes meeting the path node indication requirement in the steps 3 and 4 are as follows: the node is a designated using node or the node is not a forbidden node.
3. The bandwidth-based MBB computation method of any one of claims 1 to 2, wherein: the process of setting extra occupied bandwidth according to the occupied bandwidth of the new path and the corresponding used bandwidth in the MBB information is as follows: the extra occupied bandwidth is defined as B2, the occupied bandwidth of the new path is defined as B1, the corresponding used bandwidth in the MBB information is B3, when B3 is larger than or equal to B1, B2 is 0, when B3 is smaller than B1, B2 is B1-B3.
4. A bandwidth-based MBB path computation system is characterized in that: the system includes an MBB way computation module for: acquiring MBB information of an original path, wherein the MBB information comprises initial available bandwidth of links between 2 adjacent nodes; calculating new path attribute information according with the bandwidth occupied by the new path according to the MBB information; the standards for meeting the bandwidth occupied by the new path include: the initial available bandwidth of the links between the adjacent 2 nodes in the original path occupies more than the bandwidth of the new path;
the MBB route calculation module comprises an MBB information acquisition module, a new route calculation module and a new route creation module;
the MBB information acquisition module is used for: after the original path is established and communicated, port information of each node in the original path, the used bandwidth of links between the adjacent 2 nodes and the initial available bandwidth of the links between the adjacent 2 nodes, wherein the initial available bandwidth is equal to the sum of the used bandwidth and the available bandwidth of the links between the adjacent 2 nodes, so as to form MBB information;
the new path calculation module is used for: when a new path needs to be established, calculating new path attribute information meeting the requirements of the new path according to the MBB information; the new path requirement comprises the bandwidth occupied by the new path, and the attribute information of the new path comprises the port information of each node in the new path and the extra occupied bandwidth of the links between the adjacent 2 nodes; in the process of calculating the attribute information of the new path, when 2 adjacent nodes of the new path exist in the MBB information, setting extra occupied bandwidth according to the occupied bandwidth of the new path and the corresponding used bandwidth in the MBB information; when 1 of the 2 adjacent nodes of the new path does not exist in the MBB information, setting extra occupied bandwidth according to the occupied bandwidth of the new path, and sending a new path establishing signal to a new path establishing module;
the new path creation module is to: and after receiving the new path establishing signal, establishing a new path according to the new path attribute information.
5. The bandwidth-based MBB computation path system of claim 4, wherein: the new path requirement in the new path calculation module also comprises a head node and a tail node of the new path and a path node indication requirement, and the head node and the tail node of the new path are the same as those of the original path; the work flow of the new path calculation module comprises the following steps:
new path calculation step 1: taking the first node as a new path node, selecting the first node as a current node, and turning to a new path calculation step 2;
and a new path calculation step 2: judging whether the MBB information has an adjacent node of the current node, if so, turning to a new path calculation step 3, otherwise, turning to a new path calculation step 4; and a new path calculation step 3: judging the initial available bandwidth of the link between the current node and the adjacent node, judging whether the bandwidth is occupied by the new path or not and whether the adjacent node meets the path node indication requirement or not, if so, taking the adjacent node as the new path node, setting additional occupied bandwidth for the link between the current node and the new path node according to the new path occupied bandwidth and the corresponding bandwidth in the MBB information, and turning to a new path routing step 5; otherwise, turning to a new path calculation step 4; and a new path calculation step 4: acquiring all available nodes which are adjacent to the current node, have the actual available bandwidth of the link between the nodes above the bandwidth occupied by the new path and meet the indication requirement of the path node; selecting new path nodes from all available nodes according to a path selection rule, setting extra occupied bandwidth for a link between the current node and the new path nodes according to the occupied bandwidth of the new path, and turning to a new path calculation step 5;
and a new path calculation step 5: judging whether the new path node is a tail node, if so, turning to a new path calculation step 6, otherwise, turning to a new path calculation step 2 by taking the new path node as a current node;
and a new path calculation step 6: all new path node port information, and neighbor 2
And the additional occupied bandwidth of the links among the nodes of the new path forms the attribute information of the new path.
6. The bandwidth-based MBB computation path system of claim 5, wherein: the path node indication requirement comprises a designated using node and a forbidden using node, and the new path calculation module determines that the nodes meeting the path node indication requirement are as follows: the node is a designated using node or the node is not a forbidden node.
7. The bandwidth-based MBB computational routing system according to any one of claims 4 to 6, wherein: the new path calculation module sets the flow of additionally occupying bandwidth according to the new path occupied bandwidth and the corresponding used bandwidth in the MBB information as follows: the extra occupied bandwidth is defined as B2, the occupied bandwidth of the new path is defined as B1, the corresponding used bandwidth in the MBB information is B3, when B3 is larger than or equal to B1, B2 is 0, when B3 is smaller than B1, B2 is B1-B3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810432535.4A CN108768858B (en) | 2018-05-08 | 2018-05-08 | MBB path calculation method and system based on bandwidth |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810432535.4A CN108768858B (en) | 2018-05-08 | 2018-05-08 | MBB path calculation method and system based on bandwidth |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108768858A CN108768858A (en) | 2018-11-06 |
| CN108768858B true CN108768858B (en) | 2021-08-03 |
Family
ID=64009479
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810432535.4A Active CN108768858B (en) | 2018-05-08 | 2018-05-08 | MBB path calculation method and system based on bandwidth |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108768858B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101193047A (en) * | 2006-11-24 | 2008-06-04 | 中兴通讯股份有限公司 | Establishment method of resource share path |
| US7652983B1 (en) * | 2001-06-25 | 2010-01-26 | At&T Intellectual Property Ii, L.P. | Method for restoration and normalization in a mesh network |
| CN102223280A (en) * | 2011-06-17 | 2011-10-19 | 中兴通讯股份有限公司 | Method and network element for rebuilding tunnel |
| EP3065357A1 (en) * | 2015-03-06 | 2016-09-07 | Juniper Networks, Inc. | Rsvp make-before-break label reuse |
-
2018
- 2018-05-08 CN CN201810432535.4A patent/CN108768858B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7652983B1 (en) * | 2001-06-25 | 2010-01-26 | At&T Intellectual Property Ii, L.P. | Method for restoration and normalization in a mesh network |
| CN101193047A (en) * | 2006-11-24 | 2008-06-04 | 中兴通讯股份有限公司 | Establishment method of resource share path |
| CN102223280A (en) * | 2011-06-17 | 2011-10-19 | 中兴通讯股份有限公司 | Method and network element for rebuilding tunnel |
| EP3065357A1 (en) * | 2015-03-06 | 2016-09-07 | Juniper Networks, Inc. | Rsvp make-before-break label reuse |
Non-Patent Citations (3)
| Title |
|---|
| P2MP and MP2MP LSP Setup with LDP;IJ. Wijnands, Ed.;《RFC 6388》;20111130;全文 * |
| Real-life Multipath TCP based Make-Before-Break Vertical Handover;Jari Kellokoski;《2013 IEEE Symposium on Computers and Communications (ISCC)》;20140306;全文 * |
| RSVP-TE: Extensions to RSVP for LSP Tunnels;D. Awduche;《rfc3209》;20011231;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108768858A (en) | 2018-11-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8406124B2 (en) | Method and network device for realizing shared mesh protection | |
| ES2654817T3 (en) | Method, device and system for bandwidth adjustment without interruptions | |
| US11075833B2 (en) | Packet forwarding method and node device based on BIER-TE, and storage medium | |
| US8787750B2 (en) | Information processing method in optical network, optical communication apparatus and system | |
| CN101986622A (en) | Method and system for automatically identifying state attribute of path computation element (PCE) | |
| CN113037527B (en) | Network slice creation method, message forwarding method and device thereof | |
| CN101159695A (en) | Link selecting method and apparatus | |
| CN110830394B (en) | Method for generating routing table based on RapidIO network | |
| CN111917645A (en) | SDN-based path optimization method and system for mobile network | |
| CN101646105A (en) | Method, system and equipment for service recovery | |
| CN114124781A (en) | SRv6 message forwarding method, system, electronic equipment and storage medium | |
| EP2469775B1 (en) | Information transmission method, communication device and communication system | |
| JP2010193012A (en) | Apparatus and method for calculating route | |
| CN108768858B (en) | MBB path calculation method and system based on bandwidth | |
| CN110062301B (en) | Routing method, device, equipment and storage medium | |
| CN105763348B (en) | Method and system for recovering optical layer service | |
| CN103780514B (en) | Method and device for selecting bandwidth | |
| EP4075739B1 (en) | Service chain forwarding control methods and devices | |
| CN101997760B (en) | A kind of method and system determining head and the tail node on forwarding adjacency label switched path | |
| CN101193047B (en) | Establishment method of resource share path | |
| CN110581806A (en) | method, device and equipment for automatically segmenting network and storage medium | |
| CN100518382C (en) | Shortest path searching method and device under multi-restraint conditions in automatic switching optical network | |
| EP3057269B1 (en) | Control channel establishment method, apparatus and system | |
| CN105656542B (en) | Pretection switch method, system and node | |
| CN101193048A (en) | Establishment system of resource share path |
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 |