CN104253710B - The service management of MPLS three-layer VPNs optimizes system and method - Google Patents
The service management of MPLS three-layer VPNs optimizes system and method Download PDFInfo
- Publication number
- CN104253710B CN104253710B CN201410474782.2A CN201410474782A CN104253710B CN 104253710 B CN104253710 B CN 104253710B CN 201410474782 A CN201410474782 A CN 201410474782A CN 104253710 B CN104253710 B CN 104253710B
- Authority
- CN
- China
- Prior art keywords
- lsp
- nhlfe
- binding
- tree
- node
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Optimize system and method the invention discloses a kind of MPLS three-layer VPNs service management, be related to data and IP transmission equipments field, this method comprises the following steps：Construct the LSP of NHLFE trees, binding tree and unbound tree, management NHLFE and NHLFE bindings：LSP is first generated, when generating after NHLFE, and NHLFE is bound according to binding principle selection LSP；When NHLFE is first generated, it is unsatisfactory for binding the LSP of principle, waits after LSP generations, then bind；When NHLFE and LSP have been generated and bound, if preferred LSP is generated, then modification is tied to preferred LSP；When NHLFE and LSP have been generated and bound, if deleting the LSP of binding, NHLFE selects the LSP bindings of a suboptimum；If releasing the binding relationship with LSP without available LSP, NHLFE.Only processing needs the NHLFE and LSP updated binding relationship to the present invention, can effectively reduce the occupancy to system resource, quickening business is switched.
Description
Technical field
The present invention relates to data and IP transmission equipments field, a kind of MPLS three-layer VPNs service management optimization is specifically related to
System and method.
Background technology
With 3G (3rd-generation, 3rd generation mobile communication technology) and LTE (Long Term Evolution, length
Phase evolution) business large scale deployment with it is fast-developing, data service turns into the main body of carrying, network IP (Internet
The agreement interconnected between Protocol, network) change the main trend also developed as carrier class carrier network, SDH
(Synchronous Digital Hierarchy, Synchronous Digital Hierarchy) traditional TDM (Time Division
Multiplex, time division multiplexing) network capacity extension pattern that exclusively enjoys pipeline is difficult to support, and the bearer network of packetizing is built turns into one
Plant irreversible trend.
MPLS (Multi-Protocol Label Switching, multiprotocol label switching) three-layer VPN (Virtual
Private Network, VPN) dynamic group net mode is used, the carrying demand of integrated service can be fully met,
Realize that resource during multiple service supporting is uniformly coordinated and control plane unified management, the comprehensive operation ability of lifting operator.
MPLS three-layer VPNs enter row label using BGP (Border Gateway Protocol, i.e. Border Gateway Protocol)
Distribution and the distribution of route, are a kind of classification transmission technologies, by the way that the packet with identical forward process mode is classified as into a class,
Referred to as FEC (Forwarding Equivalence Class, forwarding equivalence class), in the IP of traditional use Longest prefix match algorithm
In forwarding, all messages to same destination address are exactly a FEC.For common IP messages, the flow of business forwarding
It is to look for routing table and jumps into capable forwarding by next, and for the MPLS three-layer VPNs using label forwarding, the flow of business forwarding is
Encapsulated first according to route querying NHLFE (Next Hop Label Forwarding Entry, next-hop Label Forwarding Information Base)
VPN label, corresponding tunnel, and encapsulation tunnel label are chosen further according to tunnel binding strategy.
BGP has the mode of two kinds of label distribution：Based on every VPN per label and based on often route per label.It is every based on every VPN
Label is to generate end in route, and all routes all distribute identical label；It is to generate end in route based on often routeing per label, often
The different label of bar route assignment.Typically routing table entry can reach million on Large Copacity router, if BGP is using every
Mode of the route per label distributes label, then can all generate a next-hop Label Forwarding Information Base NHLFE for each route,
There are million next-hop Label Forwarding Information Base NHLFE, control plane will manage all next-hop Label Forwarding Information Base NHLFE and every
LSP (Label Switched Path, label switched path) relation of individual next-hop Label Forwarding Information Base NHLFE bindings.
Network may have link disconnection, link-recovery, node leaves or new node is added always in dynamic change,
This inevitably results in frequently deleting for LSP and builds and refresh, and each LSP changes will refresh all next-hop Label Forwarding Information Base
NHLFE and LSP binding relationship, substantial amounts of next-hop Label Forwarding Information Base NHLFE can take substantial amounts of system resource, can also cause
Substantial amounts of time loss, it is impossible to the requirement that the business that meets quickly is switched.
The content of the invention
The invention aims to overcome the shortcomings of above-mentioned background technology, there is provided a kind of MPLS three-layer VPNs service management
Optimize system and method, only processing needs the NHLFE and LSP updated binding relationship, it is to avoid large-scale traversing operation, energy
Enough occupancy effectively reduced to system resource, significantly save the time spent by business convergence, and quickening business is switched.
The present invention provides a kind of MPLS three-layer VPNs service management optimization system, including structural unit and administrative unit, its
In：
The structural unit is used for：Construct next-hop Label Forwarding Information Base NHLFE trees, binding tree and unbound tree, NHLFE trees
All label switching path LSPs that have been bound to are deposited in all NHLFE information created of middle storage, binding tree
All NHLFE information for being not bound to LSP are deposited in NHLFE information, unbound tree；Binding tree and the pass of unbound tree interior joint
Key word value is NHLFE distal end next-hop；In binding tree and unbound tree a ltsh chain table, hash chain are hung below each node
The key value of the node of table is nodal information, and the nodal information includes node type, the node for depositing NHLFE information
Data；All answer back LSP NHLFE information of the corresponding distal loop of node that should be tied to all are added into the hash chain of the node
In table；
NHLFE and LSP binding principle is：
(1) NHLFE next-hop and LSP distal loop are answered back identical；
(2) if being configured with tunnel binding strategy, then NHLFE selects to meet tunnel in all LSP for meeting condition (1)
The LSP of road strategy is bound；If being configured without tunnel binding strategy, then NHLFE will be tied to the satisfaction that first bar is generated
The LSP of condition (1)；
The administrative unit is used for the LSP for managing NHLFE and NHLFE bindings：
When first generating as LSP, generating after NHLFE, NHLFE is bound according to binding principle selection LSP；
When NHLFE is first generated, it is unsatisfactory for binding the LSP of principle, it is impossible to bind, waits after LSP generations, then bound；
When NHLFE and LSP have been generated and bound, now if more preferred LSP is generated, then modification is tied to excellent
On the LSP of choosing；
When NHLFE and LSP have been generated and bound, if now deleting the LSP of binding, NHLFE one suboptimum of selection
LSP is bound；If releasing the binding relationship with LSP without available LSP, NHLFE.
On the basis of above-mentioned technical proposal, the administrative unit sets up subelement, the LSP FTN including LSP FTN
Setting up subelement is used for：LSP is created, LSP FTN is generated, LSP FTN is added in LSP FTN trees, node key value is
Distal loop is answered back, respectively confirm binding tree and unbound tree in the NHLFE that same distal loop is answered back whether need bind or
Renewal is tied on this LSP；
Confirm whether there is NHLFE to need to be tied on this LSP in unbound tree, answered back using LSP distal loop and be used as key
Word value searches the nodal information of all ltsh chain tables below node, traverse node：To each nodal information, if do not matched somebody with somebody
Tunnel binding strategy is put, then carries out NHLFE and LSP binding, and record in NHLFE；If being configured with tunnel binding strategy,
Then match whether current LSP meets binding principle, bound if meeting, otherwise without binding；To having bound LSP
Nodal information, to be moved to from unbound tree binding tree in；
Confirm whether there is NHLFE to need renewal to be tied on this LSP in binding tree, answered back using LSP distal loop and be used as pass
Key word value searches the nodal information of all ltsh chain tables below node, traverse node：To each nodal information, if do not had
Configured tunneling technique binding strategy, it is not necessary to update binding relationship；If being configured with tunnel binding strategy, LSP meets condition, and should
LSP is higher than the LSP priority of node current bindings, then updates and be tied to current LSP.
On the basis of above-mentioned technical proposal, the administrative unit also includes LSP FTN and deletes subelement, the LSP
FTN, which deletes subelement, to be used for：With LSP distal loop answer back for key value search binding tree in node, if search less than,
Then without any processing；If found, the nodal information of the ltsh chain table below traverse node：Each node is believed
Breath, it is without any processing if not being tied to the LSP to be deleted；If the LSP is had been bound to, according to tunnel binding
Strategy is handled；Node for being configured without tunnel binding strategy, if other available LSP, is then bound；If not yet
There are other available LSP, then by node from binding tree is moved to unbound tree；If being configured with tunnel binding strategy, work as presence
When being answered back to same distal loop and meeting the LSP of binding strategy configuration, then bound；If searched less than meeting condition
LSP, then by node from binding tree is moved to unbound tree.
On the basis of above-mentioned technical proposal, the administrative unit also sets up subelement, the BGP including BGP FTN
FTN, which sets up subelement, to be used for：During BGP FTN tables generation, searched first using next-hop, outlet, outgoing label as key value
Either with or without the node of same keyword value in NHLFE trees, if looking for sky, NHLFE nodal informations corresponding with its are created,
And NHLFE is added in NHLFE trees, reference count is 1；If corresponding node, then the reference count only to NHLFE adds
1；
The corresponding strategies of BGP FTN are searched in tunnel binding strategy, are looked into using NHLFE distal end next-hop as key value
LSP FTN trees are looked for, if finding the node that correspondence distal loop is answered back, all LSP chained lists below traverse node, checking is
It is no to meet tunnel binding strategy, if it is satisfied, then being bound, and the corresponding nodal informations of NHLFE are added in binding tree；
Otherwise it is added in unbound tree；If the node answered back less than correspondence distal loop is searched in LSP FTN trees, by NHLFE pairs
The node answered is added to unbound tree.
On the basis of above-mentioned technical proposal, the administrative unit includes BGP FTN and deletes subelement, the BGP FTN
Deleting subelement is used for：During BGP FTN tables generation, NHLFE trees are searched using next-hop, outlet, outgoing label as key value first
In node, respectively unbound tree with search the corresponding nodal informations of NHLFE in binding tree, this NHLFE pairs is deleted after finding
The nodal information answered, while subtracting 1 by NHLFE reference count, when reference count is changed into 0, being deleted from NHLFE trees should
NHLFE, and discharge corresponding internal memory.
The present invention also provides a kind of MPLS three-layer VPN service management optimization methods based on said system, including following step
Suddenly：
All NHLFE information created are deposited in A, construction NHLFE trees, binding tree and unbound tree, NHLFE trees,
Deposited in binding tree in all NHLFE information for having been bound to LSP, unbound tree and deposit all NHLFE for being not bound to LSP
It is every in the distal end next-hop that the key value of information, binding tree and unbound tree interior joint is NHLFE, binding tree and unbound tree
A ltsh chain table is hung below individual node, the key value of the node of ltsh chain table is nodal information, and nodal information includes node
Type, the node data for depositing NHLFE information, all corresponding distal loops of node that should be tied to are answered back LSP NHLFE
Information is all added into the ltsh chain table of the node；
NHLFE and LSP binding principle is：
(1) NHLFE next-hop and LSP distal loop are answered back identical；
(2) if being configured with tunnel binding strategy, then NHLFE selects to meet tunnel in all LSP for meeting condition (1)
The LSP of road strategy is bound；If being configured without tunnel binding strategy, then NHLFE will be tied to the satisfaction that first bar is generated
The LSP of condition (1)；
B, management NHLFE and the LSP of NHLFE bindings：
When first generating as LSP, generating after NHLFE, NHLFE is bound according to binding principle selection LSP；
When NHLFE is first generated, it is unsatisfactory for binding the LSP of principle, it is impossible to bind, waits after LSP generations, then bound；
When NHLFE and LSP have been generated and bound, now if more preferred LSP is generated, then modification is tied to excellent
On the LSP of choosing；
When NHLFE and LSP have been generated and bound, if now deleting the LSP of binding, NHLFE one suboptimum of selection
LSP is bound；If releasing the binding relationship with LSP without available LSP, NHLFE.
On the basis of above-mentioned technical proposal, step B includes 4 processes carried out side by side：LSP FTN are set up, BGP FTN
Set up, LSP FTN are deleted, BGP FTN are deleted；
The LSP FTN set up and specifically include following steps：
Step 101, establishment LSP, generate LSP FTN, and LSP FTN are added in binding tree and unbound tree, node pass
Key word value is answered back for distal loop, confirms whether needed to the NHLFE that same distal loop is answered back in binding tree and unbound tree respectively
Binding or renewal are tied on this LSP；
Whether there is NHLFE to need to be tied on this LSP in step 102, the unbound tree of confirmation, answered back with LSP distal loop
The nodal information of all ltsh chain tables below node, traverse node is searched as key value：To each nodal information, such as
Fruit is configured without tunnel binding strategy, then carries out NHLFE and LSP binding, and record in NHLFE；If being configured with tunnel
Binding strategy, then match whether current LSP meets binding principle, is bound if meeting, otherwise without binding；It is right
LSP nodal information has been bound, to be moved to from unbound tree in binding tree；
Whether there is NHLFE to need renewal to be tied on this LSP in step 103, confirmation binding tree, with LSP remote loopback
Mouth searches the nodal information of all ltsh chain tables below node, traverse node as key value：To each nodal information,
If being configured without tunnel binding strategy, it is not necessary to update binding relationship；If being configured with tunnel binding strategy, LSP meets bar
Part, and the LSP is higher than the LSP priority of node current bindings, then updates and be tied to current LSP.
On the basis of above-mentioned technical proposal, the LSP FTN are deleted and are specifically included following steps：
Answered back with LSP distal loop and search the node bound in tree for key value, if searched less than without appointing
Manage where；If found, the nodal information of the ltsh chain table below traverse node：To each nodal information, if do not had
Have and be tied to the LSP to be deleted, it is without any processing；If having been bound to the LSP, located according to tunnel binding strategy
Reason；Node for being configured without tunnel binding strategy, if other available LSP, is then bound；If can without other
With LSP, then by node from binding tree is moved to unbound tree；If being configured with tunnel binding strategy, when existing to same remote
When end ring is answered back and meets the LSP of binding strategy configuration, then bound；, will section if searching the LSP less than the condition that meets
Point is from binding tree is moved to unbound tree.
On the basis of above-mentioned technical proposal, the BGP FTN set up and specifically include following steps：
When step 201, BGP FTN tables generation, NHLFE is searched using next-hop, outlet, outgoing label as key value first
Either with or without the node of same keyword value in tree, if looking for sky, NHLFE nodal informations corresponding with its are created, and will
NHLFE is added in NHLFE trees, and reference count is 1；If corresponding node, then the reference count only to NHLFE adds 1；
Step 202, the corresponding strategies of lookup BGP FTN in tunnel binding strategy, using NHLFE distal end next-hop as pass
Key word value searches LSP FTN trees, if finding the node that correspondence distal loop is answered back, all LSP chains below traverse node
Table, checks whether to meet tunnel binding strategy, if it is satisfied, then being bound, and the corresponding nodal informations of NHLFE is added to
In binding tree；Otherwise it is added in unbound tree；If searching the node answered back less than correspondence distal loop in LSP FTN trees,
The corresponding nodes of NHLFE are added to unbound tree.
On the basis of above-mentioned technical proposal, the BGP FTN are deleted and are specifically included following steps：
During BGP FTN tables generation, the section in NHLFE trees is searched as key value using next-hop, outlet, outgoing label first
Point, respectively in unbound tree nodal information corresponding with NHLFE is searched in binding tree, deletes the corresponding sections of the NHLFE after finding
Point information, while subtracting 1 by NHLFE reference count, when reference count is changed into 0, deletes the NHLFE, and release from NHLFE trees
Put corresponding internal memory.
Compared with prior art, advantages of the present invention is as follows：
All NHLFE information for having been bound to LSP are deposited in present invention construction binding tree and unbound tree, binding tree,
All NHLFE information for being not bound to LSP are deposited in unbound tree, so when LSP is deleted, just for the node in binding tree
Do solution binding or update bindings；The operation bound is done for unbound tree when LSP is added, to the section in binding tree
Point does the operation for updating binding.The distal end next-hop that the key value of binding tree and unbound tree interior joint is NHLFE, so exists
Some LSP delete build or update operation when, the distal loop using LSP is answered back as key value, binding tree and do not tie up
Searched, operated just for the node of associated NHLFE distal ends next-hop in fixed tree, eliminate major part not
Need nodal information to be processed.When there is LSP changes, positioning first should handle binding tree or unbound tree, then with the remote of LSP
End ring is answered back and searches node as key value, and the LSP that the ltsh chain table information of node mounting is changed may influence
All NHLFE information.Only processing needs the NHLFE and LSP updated binding relationship to the present invention, it is to avoid large-scale traversal behaviour
Make, can effectively reduce the occupancy to system resource, significantly save the time spent by business convergence, quickening business is switched.
Brief description of the drawings
Fig. 1 is the structured flowchart of MPLS three-layer VPNs service management optimization system in the embodiment of the present invention.
Fig. 2 is the flow chart of LSP FTN foundation in the embodiment of the present invention.
Fig. 3 is the flow chart of BGP FTN foundation in the embodiment of the present invention.
Embodiment
Below in conjunction with the accompanying drawings and specific embodiment the present invention is described in further detail.
Shown in Figure 1, the embodiment of the present invention provides a kind of MPLS three-layer VPNs service management optimization system, including construction
Unit and administrative unit.
Structural unit is used for：Construct NHLFE trees, binding to set and unbound tree, all created is deposited in NHLFE trees
Deposited in NHLFE information, binding tree in all NHLFE information for having been bound to LSP, unbound tree and deposit all be not bound to
LSP NHLFE information, so when LSP is deleted, does solution binding just for the node in binding tree or updates bindings；
The operation bound is done for unbound tree when LSP is added, the operation for updating binding is done to the node in binding tree.Binding tree
The distal end next-hop that key value with unbound tree interior joint is NHLFE, so deletes in some LSP and builds or update behaviour
When making, the distal loop using LSP is answered back as key value, is searched in binding tree and unbound tree (for having tied up
Surely LSP NHLFE is arrived, LSP distal loop is answered back identical with NHLFE next hop information), it is remote just for associated NHLFE
The node of end next-hop is operated, and eliminates most of nodal information that need not be handled at all.Simultaneously to each distal end
Next-hop may have multiple NHLFE information, so hanging a ltsh chain table below each node in binding tree and unbound tree, breathe out
The key value of the node of uncommon chained list is nodal information, and nodal information includes node type, the node for depositing NHLFE information
Data, all answer back LSP NHLFE information of the corresponding distal loop of node that should be tied to all are added into the hash chain of the node
In table.
NHLFE and LSP binding principle is：
(1) NHLFE next-hop and LSP distal loop are answered back identical.
(2) if being configured with tunnel binding strategy, then NHLFE selects to meet tunnel in all LSP for meeting condition (1)
The LSP of road strategy is bound；If being configured without tunnel binding strategy, then NHLFE will be tied to the satisfaction that first bar is generated
The LSP of condition (1).
Administrative unit is used for：Manage the LSP of NHLFE and NHLFE bindings：
When first generating as LSP, generating after NHLFE, NHLFE is bound according to binding principle selection LSP；
When NHLFE is first generated, it is unsatisfactory for binding the LSP of principle, it is impossible to bind, waits after LSP generations, then bound；
When NHLFE and LSP have been generated and bound, now if more preferred LSP is generated, then modification is tied to excellent
On the LSP of choosing；
When NHLFE and LSP have been generated and bound, if now deleting the LSP of binding, NHLFE one suboptimum of selection
LSP is bound；If releasing the binding relationship with LSP without available LSP, NHLFE.
Shown in Figure 1, administrative unit includes LSP FTN (FEC To NHLFE map, FEC to NHLFE mapping table)
Set up subelement, LSP FTN deletions subelement, BGP FTN set up subelement and BGP FTN delete subelement.
LSP FTN, which set up subelement, to be used for：LSP is created, LSP FTN is generated, LSP FTN is added in LSP FTN trees,
Node key value is answered back for distal loop, confirms that the NHLFE answered back in binding tree and unbound tree to same distal loop is respectively
It is no to need binding or update to be tied on this LSP；
Confirm whether there is NHLFE to need to be tied on this LSP in unbound tree, answered back using LSP distal loop and be used as key
Word value searches the nodal information of all ltsh chain tables below node, traverse node：To each nodal information, if do not matched somebody with somebody
Tunnel binding strategy is put, then carries out NHLFE and LSP binding, and record in NHLFE；If being configured with tunnel binding strategy,
Then match whether current LSP meets binding principle, bound if meeting, otherwise without binding；To having bound LSP
Nodal information, to be moved to from unbound tree binding tree in；
Confirm whether there is NHLFE to need renewal to be tied on this LSP in binding tree, answered back using LSP distal loop and be used as pass
Key word value searches the nodal information of all ltsh chain tables below node, traverse node：To each nodal information, if do not had
Configured tunneling technique binding strategy, it is not necessary to update binding relationship；If being configured with tunnel binding strategy, LSP meets condition, and should
LSP is higher (for example than the LSP priority of node current bindings：The primary LSP of RSVP is better than standby LSP), then
Renewal is tied to current LSP.
LSP FTN, which delete subelement, to be used for：Answered back with LSP distal loop and search the node bound in tree for key value,
If searched less than without any processing；If found, the nodal information of the ltsh chain table below traverse node：
It is without any processing if not being tied to the LSP to be deleted to each nodal information；If having been bound to the LSP,
Then handled according to tunnel binding strategy；Node for being configured without tunnel binding strategy, if other can use LSP, then
Bound；If without other available LSP, by node from binding tree is moved to unbound tree；If being configured with tunnel
Binding strategy, when there is to same distal loop the LSP for answering back and meeting binding strategy configuration, is then bound；If searched
Less than the LSP for the condition that meets, then by node from binding tree is moved to unbound tree.
BGP FTN, which set up subelement, to be used for：During BGP FTN tables generation, first using next-hop, outlet, outgoing label as key
Word value searches the node either with or without same keyword value in NHLFE trees, if looking for sky, creates NHLFE corresponding with its
Nodal information, and NHLFE is added in NHLFE trees, reference count is 1；If corresponding node, then only to NHLFE's
Reference count adds 1；
The corresponding strategies of BGP FTN are searched in tunnel binding strategy, are looked into using NHLFE distal end next-hop as key value
LSP FTN trees are looked for, if finding the node that correspondence distal loop is answered back, all LSP chained lists below traverse node, checking is
It is no to meet tunnel binding strategy, if it is satisfied, then being bound, and the corresponding nodal informations of NHLFE are added in binding tree；
Otherwise it is added in unbound tree；If the node answered back less than correspondence distal loop is searched in LSP FTN trees, by NHLFE pairs
The node answered is added to unbound tree.
BGP FTN, which delete subelement, to be used for：During BGP FTN tables generation, first using next-hop, outlet, outgoing label as key
Word value searches the node in NHLFE trees, respectively in unbound tree nodal information corresponding with NHLFE is searched in binding tree, finds
After delete the corresponding nodal informations of the NHLFE, while subtract 1 by NHLFE reference count, when reference count is changed into 0, from
The NHLFE is deleted in NHLFE trees, and discharges corresponding internal memory.
A kind of MPLS three-layer VPN service management optimization methods based on said system of offer of the embodiment of the present invention, including with
Lower step：
All NHLFE information created are deposited in A, construction NHLFE trees, binding tree and unbound tree, NHLFE trees,
Deposited in binding tree in all NHLFE information for having been bound to LSP, unbound tree and deposit all NHLFE for being not bound to LSP
Information, so when LSP is deleted, does solution binding just for the node in binding tree or updates bindings；When LSP is added
The operation bound is done for unbound tree, the operation for updating binding is done to the node in binding tree.Binding tree and unbound tree
The key value of interior joint is NHLFE distal end next-hop, so when some LSP is deleted and built or update operation, is used
LSP distal loop is answered back as key value, is searched in binding tree and unbound tree (for having been bound to LSP's
NHLFE, LSP distal loop are answered back identical with NHLFE next hop information), just for associated NHLFE distal ends next-hop
Node is operated, and eliminates most of nodal information that need not be handled at all.Simultaneously may to each distal end next-hop
There are multiple NHLFE information, so hanging a ltsh chain table, the section of ltsh chain table below each node in binding tree and unbound tree
The key value of point is nodal information, and nodal information includes node type, the node data for depositing NHLFE information, owns
Answer back LSP NHLFE information of the corresponding distal loop of node should be tied to all to be added into the ltsh chain table of the node.
NHLFE and LSP binding principle is：
(1) NHLFE next-hop and LSP distal loop are answered back identical.
(2) if being configured with tunnel binding strategy, then NHLFE selects to meet tunnel in all LSP for meeting condition (1)
The LSP of road strategy is bound；If being configured without tunnel binding strategy, then NHLFE will be tied to the satisfaction that first bar is generated
The LSP of condition (1).
B, management NHLFE and the LSP of NHLFE bindings：
When first generating as LSP, generating after NHLFE, NHLFE is bound according to binding principle selection LSP；
When NHLFE is first generated, it is unsatisfactory for binding the LSP of principle, it is impossible to bind, waits after LSP generations, then bound；
When NHLFE and LSP have been generated and bound, now if more preferred LSP is generated, then modification is tied to excellent
On the LSP of choosing；
When NHLFE and LSP have been generated and bound, if now deleting the LSP of binding, NHLFE one suboptimum of selection
LSP is bound；If releasing the binding relationship with LSP without available LSP, NHLFE.
Step B includes 4 processes carried out side by side：LSP FTN are set up, BGP FTN are set up, LSP FTN are deleted, BGP
FTN is deleted, and does not have strict priority to put in order between this 4 processes.
Shown in Figure 2, LSP FTN set up and specifically include following steps：
Step 101, establishment LSP, generate LSP FTN, and LSP FTN are added in binding tree and unbound tree, node pass
Key word value is answered back for distal loop, confirms whether needed to the NHLFE that same distal loop is answered back in binding tree and unbound tree respectively
Binding or renewal are tied on this LSP；
Whether there is NHLFE to need to be tied on this LSP in step 102, the unbound tree of confirmation, answered back with LSP distal loop
The nodal information of all ltsh chain tables below node, traverse node is searched as key value：To each nodal information, such as
Fruit is configured without tunnel binding strategy, then carries out NHLFE and LSP binding, and record in NHLFE；If being configured with tunnel
Binding strategy, then match whether current LSP meets binding principle, is bound if meeting, otherwise without binding；It is right
LSP nodal information has been bound, to be moved to from unbound tree in binding tree；
Whether there is NHLFE to need renewal to be tied on this LSP in step 103, confirmation binding tree, with LSP remote loopback
Mouth searches the nodal information of all ltsh chain tables below node, traverse node as key value：To each nodal information,
If being configured without tunnel binding strategy, it is not necessary to update binding relationship；If being configured with tunnel binding strategy, LSP meets bar
Part, and the LSP is higher (for example than the LSP priority of node current bindings：The primary LSP of RSVP is better than standby
With LSP), then update and be tied to current LSP.
LSP FTN are deleted and are specifically included following steps：
Answered back with LSP distal loop and search the node bound in tree for key value, if searched less than without appointing
Manage where；If found, the nodal information of the ltsh chain table below traverse node：To each nodal information, if do not had
Have and be tied to the LSP to be deleted, it is without any processing；If having been bound to the LSP, located according to tunnel binding strategy
Reason；Node for being configured without tunnel binding strategy, if other available LSP, is then bound；If can without other
With LSP, then by node from binding tree is moved to unbound tree；If being configured with tunnel binding strategy, when existing to same remote
When end ring is answered back and meets the LSP of binding strategy configuration, then bound；, will section if searching the LSP less than the condition that meets
Point is from binding tree is moved to unbound tree.
Shown in Figure 3, BGP FTN set up and specifically include following steps：
When step 201, BGP FTN tables generation, NHLFE is searched using next-hop, outlet, outgoing label as key value first
Either with or without the node of same keyword value in tree, if looking for sky, NHLFE nodal informations corresponding with its are created, and will
NHLFE is added in NHLFE trees, and reference count is 1；If corresponding node, then the reference count only to NHLFE adds 1；
Step 202, the corresponding strategies of lookup BGP FTN in tunnel binding strategy, using NHLFE distal end next-hop as pass
Key word value searches LSP FTN trees, if finding the node that correspondence distal loop is answered back, all LSP chains below traverse node
Table, checks whether to meet tunnel binding strategy, if it is satisfied, then being bound, and the corresponding nodal informations of NHLFE is added to
In binding tree；Otherwise it is added in unbound tree；If searching the node answered back less than correspondence distal loop in LSP FTN trees,
The corresponding nodes of NHLFE are added to unbound tree.
BGP FTN are deleted and are specifically included following steps：
During BGP FTN tables generation, the section in NHLFE trees is searched as key value using next-hop, outlet, outgoing label first
Point, respectively in unbound tree nodal information corresponding with NHLFE is searched in binding tree, deletes the corresponding sections of the NHLFE after finding
Point information, while subtracting 1 by NHLFE reference count, when reference count is changed into 0, deletes the NHLFE, and release from NHLFE trees
Put corresponding internal memory.
The principle of the embodiment of the present invention is elaborated as follows：
In catenet, although LSP change is very frequent, but setting up LSP core, the number of aggregation node is
Very limited amount of, the number of node determines that LSP number and LSP distal loop are answered back.LSP answers back generally according to distal loop
Deposit, NHLFE and LSP binding principle are：NHLFE next-hop must answer back identical with LSP distal loop, it is possible to make
NHLFE and LSP binding relationship are managed as key message with next-hop.
LSP FTN information is stored in LSP FTN trees, wherein the key value of each node is answered back for LSP distal loop,
The LSP answered back to a plurality of identical distal loop, is articulated on the LSP chained lists below node.
All NHLFE information for having been bound to LSP are deposited in construction binding tree and unbound tree, binding tree, it is unbound
All NHLFE information for being not bound to LSP are deposited in tree, so when LSP is deleted, are unbinded just for the node in binding tree
Fixed or renewal bindings；The operation bound is done for unbound tree when LSP is added, the node in binding tree is done more
The operation newly bound.The distal end next-hop that the key value of binding tree and unbound tree interior joint is NHLFE, so at some
LSP delete build or update operation when, the distal loop using LSP is answered back as key value, binding tree and unbound tree in
(NHLFE for having been bound to LSP, LSP distal loop are answered back identical with NHLFE next hop information) is searched, only
Operated for the node of same NHLFE distal ends next-hop, eliminate most of nodal information that need not be handled at all.Together
When may have multiple NHLFE information to each distal end next-hop, so being hung in binding tree and unbound tree below each node
One ltsh chain table, the key value of the node of ltsh chain table is nodal information, and nodal information includes node type, for depositing
The node data of NHLFE information, all answer back LSP NHLFE information of the corresponding distal loop of node that should be tied to all are added into
Into the ltsh chain table of the node.
When there is LSP changes, positioning should handle binding tree or unbound tree first, then be answered back work with LSP distal loop
Node is searched for key value, the ltsh chain table information of node mounting seeks to all NHLFE that LSP may the influence letters updated
Breath, only processing needs the NHLFE and LSP updated binding relationship, it is to avoid large-scale traversing operation, has significantly saved business
The convergence spent time, and then meet the requirement quickly switched.
Those skilled in the art can carry out various modifications and variations to the embodiment of the present invention, if these modifications and change
Type is within the scope of the claims in the present invention and its equivalent technologies, then these modifications and variations are also in protection scope of the present invention
Within.
The prior art that the content not being described in detail in specification is known to the skilled person.
Claims (10)
1. a kind of MPLS three-layer VPNs service management optimizes system, it is characterised in that：Including structural unit and administrative unit, wherein：
The structural unit is used for：Construct and deposited in next-hop Label Forwarding Information Base NHLFE trees, binding tree and unbound tree, NHLFE trees
Put and all NHLFE letters for having been bound to label switching path LSP are deposited in all NHLFE information created, binding tree
All NHLFE information for being not bound to LSP are deposited in breath, unbound tree；Binding tree and the key value of unbound tree interior joint
For NHLFE distal end next-hop；In binding tree and unbound tree a ltsh chain table, the section of ltsh chain table are hung below each node
The key value of point is nodal information, and the nodal information includes node type, the node data for depositing NHLFE information；
All answer back LSP NHLFE information of the corresponding distal loop of node that should be tied to all are added into the ltsh chain table of the node；
NHLFE and LSP binding principle is：
(1) NHLFE next-hop and LSP distal loop are answered back identical；
(2) if being configured with tunnel binding strategy, then NHLFE selects to meet tunnel plan in all LSP for meeting condition (1)
LSP slightly is bound；If being configured without tunnel binding strategy, then NHLFE meets condition by be tied to that first bar generates
(1) LSP；
The administrative unit is used for the LSP for managing NHLFE and NHLFE bindings：
When first generating as LSP, generating after NHLFE, NHLFE is bound according to binding principle selection LSP；
When NHLFE is first generated, it is unsatisfactory for binding the LSP of principle, it is impossible to bind, waits after LSP generations, then bound；
When NHLFE and LSP have been generated and bound, now if more preferred LSP is generated, then modification is tied to preferred
On LSP；
When NHLFE and LSP have been generated and bound, if now deleting the LSP of binding, NHLFE selects the LSP of a suboptimum to tie up
It is fixed；If releasing the binding relationship with LSP without available LSP, NHLFE.
2. MPLS three-layer VPNs service management as claimed in claim 1 optimizes system, it is characterised in that：The administrative unit bag
Include LSP FTN and set up subelement, the LSP FTN, which set up subelement, to be used for：LSP is created, LSP FTN is generated, LSP FTN is added
Enter into LSP FTN trees, node key value is answered back for distal loop, confirm to arrive same distal end in binding tree and unbound tree respectively
Whether the NHLFE of loopback mouthful, which needs to bind or update, is tied on this LSP；
Confirm whether there is NHLFE to need to be tied on this LSP in unbound tree, answered back using LSP distal loop and be used as key value
Search the nodal information of all ltsh chain tables below node, traverse node：To each nodal information, if being configured without tunnel
Road binding strategy, then carry out NHLFE and LSP binding, and record in NHLFE；If being configured with tunnel binding strategy,
Binding principle whether is met with current LSP, is bound if meeting, otherwise without binding；Section to having bound LSP
Point information, will be moved to from unbound tree in binding tree；
Confirm whether there is NHLFE to need renewal to be tied on this LSP in binding tree, answered back using LSP distal loop and be used as keyword
Value searches the nodal information of all ltsh chain tables below node, traverse node：To each nodal information, if be configured without
Tunnel binding strategy, it is not necessary to update binding relationship；If being configured with tunnel binding strategy, LSP meets condition, and the LSP
LSP priority than node current bindings is higher, then updates and be tied to current LSP.
3. MPLS three-layer VPNs service management as claimed in claim 2 optimizes system, it is characterised in that：The administrative unit is also
Subelement is deleted including LSP FTN, the LSP FTN, which delete subelement, to be used for：Answered back and looked into for key value with LSP distal loop
The node looked in binding tree, if searched less than without any processing；If found, the Kazakhstan below traverse node
The nodal information of uncommon chained list：It is without any processing if not being tied to the LSP to be deleted to each nodal information；If
The LSP is had been bound to, then is handled according to tunnel binding strategy；Node for being configured without tunnel binding strategy, if
There are other available LSP, then bound；If without other available LSP, node is moved into unbound tree from binding tree
In；If being configured with tunnel binding strategy, when there is to same distal loop the LSP for answering back and meeting binding strategy configuration, then
Bound；If searching the LSP less than the condition that meets, by node from binding tree is moved to unbound tree.
4. MPLS three-layer VPNs service management as claimed in claim 2 or claim 3 optimizes system, it is characterised in that：The administrative unit
Subelement also is set up including BGP FTN, the BGP FTN, which set up subelement, to be used for：During BGP FTN tables generation, first with next
Jump, export, outgoing label is that key value searches the node either with or without same keyword value in NHLFE trees, if looking for sky,
NHLFE nodal informations corresponding with its are created, and NHLFE is added in NHLFE trees, reference count is 1；If corresponding
Node, the then reference count only to NHLFE adds 1；
The corresponding strategies of BGP FTN are searched in tunnel binding strategy, are searched by key value of NHLFE distal end next-hop
LSP FTN trees, if finding the node that correspondence distal loop is answered back, all LSP chained lists below traverse node are checked whether
Tunnel binding strategy is met, if it is satisfied, then being bound, and the corresponding nodal informations of NHLFE are added in binding tree；It is no
Then it is added in unbound tree；If searching the node answered back less than correspondence distal loop in LSP FTN trees, by NHLFE correspondences
Node be added to unbound tree.
5. MPLS three-layer VPNs service management as claimed in claim 4 optimizes system, it is characterised in that：The administrative unit bag
Include BGP FTN and delete subelement, the BGP FTN, which delete subelement, to be used for：BGP FTN tables generation when, first with next-hop,
Outlet, outgoing label are the node in key value lookup NHLFE trees, search NHLFE pairs in unbound tree and binding tree respectively
The nodal information answered, deletes the corresponding nodal informations of the NHLFE, while subtracting 1 by NHLFE reference count, works as reference after finding
When counting is changed into 0, the NHLFE is deleted from NHLFE trees, and discharge corresponding internal memory.
6. the MPLS three-layer VPN service management optimization methods based on system described in claim 1, it is characterised in that including following
Step：
All NHLFE information created are deposited in A, construction NHLFE trees, binding tree and unbound tree, NHLFE trees, are bound
Deposited in tree and all NHLFE letters for being not bound to LSP are deposited in all NHLFE information for having been bound to LSP, unbound tree
It is each in the distal end next-hop that the key value of breath, binding tree and unbound tree interior joint is NHLFE, binding tree and unbound tree
A ltsh chain table is hung below node, the key value of the node of ltsh chain table is nodal information, and nodal information includes node class
Type, the node data for depositing NHLFE information, it is all should be tied to the corresponding distal loop of node answer back LSP NHLFE letter
Breath is all added into the ltsh chain table of the node；
NHLFE and LSP binding principle is：
(1) NHLFE next-hop and LSP distal loop are answered back identical；
(2) if being configured with tunnel binding strategy, then NHLFE selects to meet tunnel plan in all LSP for meeting condition (1)
LSP slightly is bound；If being configured without tunnel binding strategy, then NHLFE meets condition by be tied to that first bar generates
(1) LSP；
B, management NHLFE and the LSP of NHLFE bindings：
When first generating as LSP, generating after NHLFE, NHLFE is bound according to binding principle selection LSP；
When NHLFE is first generated, it is unsatisfactory for binding the LSP of principle, it is impossible to bind, waits after LSP generations, then bound；
When NHLFE and LSP have been generated and bound, now if more preferred LSP is generated, then modification is tied to preferred
On LSP；
When NHLFE and LSP have been generated and bound, if now deleting the LSP of binding, NHLFE selects the LSP of a suboptimum to tie up
It is fixed；If releasing the binding relationship with LSP without available LSP, NHLFE.
7. MPLS three-layer VPNs service management optimization method as claimed in claim 6, it is characterised in that：Step B includes 4 simultaneously
Arrange the process carried out：LSP FTN are set up, BGP FTN are set up, LSP FTN are deleted, BGP FTN are deleted；
The LSP FTN set up and specifically include following steps：
Step 101, establishment LSP, generate LSP FTN, LSP FTN are added in binding tree and unbound tree, node key
It is worth and is answered back for distal loop, confirms whether need binding to the NHLFE that same distal loop is answered back in binding tree and unbound tree respectively
Or renewal is tied on this LSP；
Step 102, confirm whether there is NHLFE to need to be tied on this LSP in unbound tree, using LSP distal loop answer back as
Key value searches the nodal information of all ltsh chain tables below node, traverse node：To each nodal information, if do not had
There is configured tunneling technique binding strategy, then carry out NHLFE and LSP binding, and record in NHLFE；If being configured with tunnel binding
Strategy, then match whether current LSP meets binding principle, is bound if meeting, otherwise without binding；To binding
LSP nodal information, will be moved to from unbound tree in binding tree；
Step 103, confirm whether there is NHLFE to need renewal to be tied on this LSP in binding tree, answered back work with LSP distal loop
The nodal information of all ltsh chain tables below node, traverse node is searched for key value：To each nodal information, if
It is configured without tunnel binding strategy, it is not necessary to update binding relationship；If being configured with tunnel binding strategy, LSP meets condition, and
And the LSP is higher than the LSP priority of node current bindings, then updates and be tied to current LSP.
8. MPLS three-layer VPNs service management optimization method as claimed in claim 7, it is characterised in that：The LSP FTN are deleted
Specifically include following steps：
Answered back with LSP distal loop and search the node bound in tree for key value, if searched less than without any place
Reason；If found, the nodal information of the ltsh chain table below traverse node：To each nodal information, if do not tied up
Determine to the LSP to be deleted, it is without any processing；If having been bound to the LSP, handled according to tunnel binding strategy；It is right
In the node for being configured without tunnel binding strategy, if other available LSP, then bound；If available without other
LSP, then by node from binding tree is moved to unbound tree；If being configured with tunnel binding strategy, when existing to same distal end
Loopback mouthful and when meeting the LSP of binding strategy configuration, then bound；If the LSP less than the condition that meets is searched, by node
From binding tree is moved to unbound tree.
9. MPLS three-layer VPNs service management optimization method as claimed in claim 7 or 8, it is characterised in that：The BGP FTN
Foundation specifically includes following steps：
When step 201, BGP FTN tables generation, searched first using next-hop, outlet, outgoing label as key value in NHLFE trees
Either with or without the node of same keyword value, if looking for sky, corresponding with its nodal informations of NHLFE are created, and by NHLFE
It is added in NHLFE trees, reference count is 1；If corresponding node, then the reference count only to NHLFE adds 1；
Step 202, the corresponding strategies of lookup BGP FTN in tunnel binding strategy, the distal end next-hop using NHLFE is keyword
Value searches LSP FTN trees, if finding the node that correspondence distal loop is answered back, and all LSP chained lists below traverse node are looked into
See whether meet tunnel binding strategy, if it is satisfied, then being bound, and the corresponding nodal informations of NHLFE are added to binding
In tree；Otherwise it is added in unbound tree；, will if searching the node answered back less than correspondence distal loop in LSP FTN trees
The corresponding nodes of NHLFE are added to unbound tree.
10. MPLS three-layer VPNs service management optimization method as claimed in claim 9, it is characterised in that：The BGP FTN are deleted
Except specifically including following steps：
During BGP FTN tables generation, the node in NHLFE trees is searched as key value using next-hop, outlet, outgoing label first, point
Not in unbound tree nodal information corresponding with NHLFE is searched in binding tree, the corresponding node letters of the NHLFE are deleted after finding
Breath, while subtracting 1 by NHLFE reference count, when reference count is changed into 0, deletes the NHLFE, and discharge phase from NHLFE trees
The internal memory answered.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410474782.2A CN104253710B (en) | 2014-09-17 | 2014-09-17 | The service management of MPLS three-layer VPNs optimizes system and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410474782.2A CN104253710B (en) | 2014-09-17 | 2014-09-17 | The service management of MPLS three-layer VPNs optimizes system and method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104253710A CN104253710A (en) | 2014-12-31 |
| CN104253710B true CN104253710B (en) | 2017-08-01 |
Family
ID=52188277
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410474782.2A Active CN104253710B (en) | 2014-09-17 | 2014-09-17 | The service management of MPLS three-layer VPNs optimizes system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104253710B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9998361B2 (en) * | 2015-09-30 | 2018-06-12 | Juniper Networks, Inc. | MLDP multicast only fast re-route over remote loop-free alternate backup path |
| CN108833278B (en) * | 2018-07-17 | 2020-12-01 | 中国联合网络通信集团有限公司 | Platform equipment and establishing method for MPLS L3VPN service |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1700671A (en) * | 2004-05-18 | 2005-11-23 | 华为技术有限公司 | A method for establishing static label transmitting route |
| EP2618526A1 (en) * | 2012-01-23 | 2013-07-24 | ADVA Optical Networking SE | Method and network access device for accessing a virtual private network |
-
2014
- 2014-09-17 CN CN201410474782.2A patent/CN104253710B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1700671A (en) * | 2004-05-18 | 2005-11-23 | 华为技术有限公司 | A method for establishing static label transmitting route |
| EP2618526A1 (en) * | 2012-01-23 | 2013-07-24 | ADVA Optical Networking SE | Method and network access device for accessing a virtual private network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104253710A (en) | 2014-12-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106664252B (en) | Realize method, equipment and the system of service chaining | |
| US7551551B2 (en) | Fast reroute (FRR) protection at the edge of a RFC 2547 network | |
| CN104521191B (en) | Installed using the level label distribution in the acyclic route topological of the route arc of the multi-level rank of ring topology and route | |
| CN100454841C (en) | Multi-domain routing computation method and system | |
| CN105471744B (en) | A kind of virtual machine migration method and device | |
| CN104272679B (en) | Communication system, control device, communication means and recording medium | |
| US8462783B2 (en) | Method and a node device for transferring a message based on traffic engineering tunnels | |
| CN104283791B (en) | Three etale topologies in a kind of SDN determine method and apparatus | |
| CN105871722A (en) | Tag structure and tag message forwarding method and device | |
| CN105634940A (en) | SR information acquisition method and route segment network establishment method | |
| CN107070798A (en) | Network area division methods, the network equipment and system | |
| CN104219147A (en) | Implementation method and device of VPN (virtual private network) for edge equipment | |
| CN106603413B (en) | Method and device for transmitting flow through designated path | |
| KR101457317B1 (en) | Prioritization of routing information updates | |
| CN113285876B (en) | Routing method, routing device and computer readable storage medium | |
| CN108259341A (en) | A kind of prefix label distribution method and SDN controllers | |
| CN106059924A (en) | Information management method, devices and system | |
| CN102394819A (en) | Electoral machinery and device of appointed VLAN (virtual local area network) transmitter in TRILL network | |
| US9832121B1 (en) | Next hop instruction associations for forwarding unit programming within a network device | |
| CN105577502A (en) | Service transport method and device | |
| CN109660460A (en) | Processing method, server and the storage medium of BIER-TE information | |
| WO2014180448A1 (en) | Method and device for protecting ptn network service | |
| CN102394804A (en) | VPN system building method and VPN system | |
| CN104796339A (en) | Rapid flooding treatment method and rapid flooding treatment device | |
| KR101318001B1 (en) | Linking inner and outer mpls labels |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |