CN106034076A - Method and system for realizing path calculation, and path calculation node - Google Patents
Method and system for realizing path calculation, and path calculation node Download PDFInfo
- Publication number
- CN106034076A CN106034076A CN201510108812.2A CN201510108812A CN106034076A CN 106034076 A CN106034076 A CN 106034076A CN 201510108812 A CN201510108812 A CN 201510108812A CN 106034076 A CN106034076 A CN 106034076A
- Authority
- CN
- China
- Prior art keywords
- information
- interface
- node
- path
- rro
- 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.)
- Withdrawn
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/46—Interconnection of networks
Abstract
The invention discloses a method and system for realizing path calculation, and a path calculation node. The method comprises: all nodes from a destination terminal to a source terminal send interface information to a path calculation node respectively; and the path calculation node carries out path calculation based on a path calculation demand and the received interface information. According to the invention, path calculation during a tunnel establishment process is realized by obtaining the interface information of all nodes during the path calculation process, so that a tunnel establishment failure caused by a loose point factor can be avoided.
Description
Technical field
The present invention relates to data network communications technology, espespecially a kind of logic based MINLP
(RSVP-TE) method, system and the road operator node that a kind of realizing route calculates.
Background technology
Logic based MINLP (RSVP-TE, Resource Reservation
Protocol-Traffic Engineer) it is a kind of traffic engineering based on multiprotocol label switching (MPLS)
Technology.Four parts are forwarded to realize Business Stream by information issue, path computing, Signalling exchange and flow
Amount forwarding in traffic engineering tunnel.
In RSVP-TE standard, it is proposed that three kinds of reserved styles: asterisk wildcard wave filter (WF,
Wildcard-Filter), fixed filters (FF, Fixed-Filter), shared display (SE, Shared
Explicit).The tag changeable path that wherein SE style is different under referring to same tunnel (Tunnel)
(LSP, Label Switch Path) can share resource in footpath.Fig. 1 is that the same tunnel packet of prior art contains
The schematic diagram of different LSP, as it is shown in figure 1, the source of Tunnel1 is node 1 (R1), destination
For node 3 (R3).There are two different LSP of LSP1 with LSP2 in Tunnel1；Wherein, LSP1
Path be the path of R1-R2-R3, LSP2 be R1-R4-R2-R3.R2 exists common outgoing interface
B, if SE style, LSP1 and LSP2 can share in the resource that this interface is reserved；Here with band
As a example by wide resource, if a width of 50M of the band of LSP1, need the bandwidth money of reserved 50M on b interface
Source；If a width of 70M of the band of LSP2, need the bandwidth resources of reserved 70M on b interface, due to
Being SE style, 70M reserved for LSP2 can share the 50M bandwidth money using LSP1 to reserve
Source, so, it is only necessary on b interface, additionally reserve 20M bandwidth resources again.So LSP1,
LSP2 reserves the bandwidth resources of 70M on b interface altogether.
In actual shared procedure, for LSP1 and LSP2, rear calculate path it is to be appreciated that in tunnel
LSP can share the interface message of resource, in order to can share resource path computing when.At figure
In 1, it is assumed that LSP2 calculates path and is later than LSP1 calculating path, then LSP2 calculates path when,
It is to be appreciated that LSP1 can share the shared bandwidth resource information of the interface a and interface b of resource.In source
The when that end R1, LSP2 calculating path, need the shared 50M bandwidth resources of interface a and interface b
Information is submitted to calculate path unit, otherwise, if there is inadequate resource, then possibly cannot calculate LSP2
Path.If b interface bandwidth is 80M, the 50M that deduction LSP1 takies when setting up, remain 30M
Bandwidth resources, if LSP2 is calculated path, do not carry the 50M that b interface LSP1 shares
Bandwidth resources, remaining 30M bandwidth resources are not enough to the 70M bandwidth needed for reserved LSP2.Therefore,
For the node of path computing, it is to be appreciated that it is most important to share interface message.In actual deployment tunnel
Time, there is loose point, do not comprise the routing information of whole piece LSP at tunnel head node, the most just cannot carry
For sharing the information of interface.Fig. 2 is the tunnel schematic diagram that there is loose point, as in figure 2 it is shown, Tunnel1
LSP1 path is set up the loosest to R2, then source R1 calculates path when, can only calculate R1-R2
Between concrete path, the path of R2-R3 needs again to calculate on R2.For this situation LSP1
Can only provide a interface as the interface of shared resource, and the interface of the shared resource on R2-R3 path letter
Breath is due to the reason of loose point, it is impossible to provide, and causes the failure of follow-up LSP path computing, and then result in
Tunnel is set up unsuccessfully, causes service disconnection.
Summary of the invention
In order to solve above-mentioned technical problem, the present invention provide a kind of method that realizing route calculates, system,
Node and road operator node, it is possible to the interface message of all nodes during acquisition approach calculating, it is achieved path
Calculate, it is to avoid failed problem is set up in the tunnel caused due to loose some reason.
In order to reach the object of the invention, the invention provides a kind of method that realizing route calculates, including:
Starting each node to source from destination, transmission interface information is to road operator node respectively；
Road operator node, according to the demand of path computing and the interface message that receives, carries out path computing.
Further, transmission interface information specifically includes to road operator node:
By generating record routing object RRO information in reserving message RESV and mailing to road operator node；
Described RRO information records the RESV interface message through path.
Further, the road operator node road operator node demand according to path computing and the letter of the interface through path
Breath, carries out path computing and specifically includes:
Road operator node is from the interface message through path obtaining record from the RRO information of each node；
The road operator node demand according to path computing and the interface message of acquisition, carry out path computing.
Further, interface message comprises incoming interface information and outgoing interface information；
Incoming interface information and outgoing interface information are remembered in RRO information by sequence and the position pre-set
Record；Or,
Labelling is made a distinction by untapped field in RRO information subobject.
Further, interface message includes: share resource information and available resource information.
On the other hand, the application also provides for the system that a kind of realizing route calculates, including: destination starts
Node and road operator node to source；Wherein,
Each node, for transmission interface information to road operator node；
Road operator node includes computing unit, is used for the demand according to path computing and the interface message received,
Carry out path computing.
Further, each node specifically for,
By generating record routing object RRO information in reserving message RESV and mailing to road operator node；
The described RRO information record RESV interface message through path；
Described road operator node also includes acquiring unit, for obtaining from from the RRO information of each node
The interface message through path of record.
Further, each node, specifically for by generating record RESV through passing by one's way in RESV
The RRO information of the interface message comprising incoming interface information and outgoing interface information in footpath also mails to road operator node.
Described incoming interface information and outgoing interface information by the sequence pre-set and position in RRO information
Middle record；Or,
Labelling is made a distinction by untapped field in RRO information subobject.
Another further aspect, the application also provides for the road operator node of the system that a kind of realizing route calculates, including:
Acquiring unit and computing unit；Wherein,
Acquiring unit, starts to obtain note in the RRO information sent to each node of source for destination
The interface message through path of record；
Computing unit, for the demand according to path computing and the interface message through path, carries out path
Calculate.
Compared with prior art, technical scheme includes: start each node to source from destination,
Transmission interface information is to road operator node respectively；Road operator node is according to the demand of path computing and connecing of receiving
Message ceases, and carries out path computing.The interface letter of the present invention all nodes during being calculated by acquisition approach
Breath, it is achieved that the path computing in tunnel establishment procedure, it is to avoid owing to loose some reason causes tunnel to be built
Stand unsuccessfully.
Accompanying drawing explanation
Accompanying drawing described herein is used for providing a further understanding of the present invention, constitutes of the application
Point, the schematic description and description of the present invention is used for explaining the present invention, is not intended that the present invention's
Improper restriction.In the accompanying drawings:
Fig. 1 is that the same tunnel packet of prior art is containing different LSP schematic diagrams；
Fig. 2 is the tunnel schematic diagram that there is loose point；
Fig. 3 is the flow chart of the method that realizing route of the present invention calculates；
Fig. 4 is the structured flowchart of the system that realizing route of the present invention calculates；
Fig. 5 is the structural representation that in IPV4, RRO information subobject represents interface message；
Fig. 6 is the structural representation that in IPV6, RRO information subobject represents interface message.
Detailed description of the invention
For making the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing
Embodiments of the invention are described in detail.It should be noted that in the case of not conflicting, this Shen
Embodiment in please and the feature in embodiment can mutual combination in any.
Fig. 3 is the flow chart of the method that realizing route of the present invention calculates, as it is shown on figure 3, include:
Step 300, starting each node to source from destination, transmission interface information calculates joint to road respectively
Point.
In this step, transmission interface information specifically includes to road operator node:
By generating record routing object (RRO) information in reserving message (RESV) and mailing to road
Operator node；
RRO information records the RESV interface message through path.
It should be noted that in path calculation process, due to the existence of loose point, road operator node may
Cannot obtain the interface message of node, therefore, the inventive method is by generating RRO in RESV information
Information, it is achieved the transmission of interface message, the method for concrete generation RRO information belongs to art technology
The conventional techniques means of personnel.
On the other hand, transmission interface information individually can be sent to road operator node by each node, it is also possible to
Using destination to source as information transfer directions, progressively transfer information to road operator node；The most also
Can improve effectiveness and quality by setting routing algorithm, road interface message transmitted is calculated
Node, belongs to the conventional techniques means of those skilled in the art.
Step 301, road operator node, according to the demand of path computing and the interface message that receives, carry out road
Footpath calculates.
The road operator node demand according to path computing and the interface message through path, carry out path computing tool
Body includes:
Road operator node is from the interface message through path obtaining record from the RRO information of each node；
Operator node road, the road operator node demand according to path computing and the interface message of acquisition, carry out path meter
Calculate.
Preferably, interface message comprises incoming interface information and outgoing interface information；
Incoming interface information and outgoing interface information are remembered in RRO information by sequence and the position pre-set
Record；Or,
Labelling is made a distinction by untapped field in RRO information subobject.
Preferably, interface message includes: share resource information and available resource information.
It should be noted that road operator node obtains the method that the method for interface message belongs to information processing, logical
Cross and analyze the position that RRO information is stored, utilize existing information extracting method to carry out interface message
Obtain, belong to the conventional techniques means of those skilled in the art.
The present invention is the interface message of all nodes during being calculated by acquisition approach, it is achieved that tunnel is set up
During path computing, it is to avoid owing to loose some reason causes tunnel to be set up unsuccessfully.
Fig. 4 is the structured flowchart of the system that realizing route of the present invention calculates, as shown in Figure 4, including: mesh
End start to the node of source and road operator node；Wherein,
Each node, for transmission interface information to road operator node；
Road operator node includes computing unit, is used for the demand according to path computing and the interface message received,
Carry out path computing.
Each node specifically for,
By generating record routing object (RRO) information in reserving message (RES) V and mailing to road
Operator node；
The RRO information record RESV interface message through path；
Road operator node also includes acquiring unit, for from obtaining record from the RRO information of each node
The interface message through path.
Each node, specifically for by RESV generate record RESV through path comprise into
The RRO information of the interface message of interface message and outgoing interface information also mails to road operator node.
Described incoming interface information and outgoing interface information by the sequence pre-set and position in RRO information
Middle record；Or,
Labelling is made a distinction by untapped field in RRO information subobject.
The road operator node of the system that a kind of realizing route calculates, including: acquiring unit and computing unit；Its
In,
Acquiring unit, starts to obtain note in the RRO information sent to each node of source for destination
The interface message through path of record；
Computing unit, for the demand according to path computing and the interface message through path, carries out path
Calculate.
Carry out understanding that detailed description, embodiment are only used for the inventive method below by way of specific embodiment
The statement present invention, is not limited to the protection domain of the inventive method.
Embodiment 1
In the present embodiment a kind of RRO of differentiation information of offer, the interface through path is incoming interface or goes out to connect
The method of mouth.
It is marked by untapped field in RRO information subobject, concrete, in RRO information
Subobject in comprise the Flag of 8bit size, according to actually used situation, have been defined at present wherein
Five bit in order to represent relevant definition.Remaining three bit positions is 0x10,0x40 and 0x80 respectively,
One bit position of 0x10,0x40 and 0x80 any of which can be chosen for representing that interface is incoming interface
Or outgoing interface.General RRO the most only carries incoming interface information, the RRO letter of the inventive method interior joint
Breath comprises incoming interface information and outgoing interface information, can give tacit consent to and represent incoming interface information with 0；Represent with 1
Outgoing interface information；Or be configured according to use habit, carry out incoming interface information by bit position and go out to connect
The differentiation of message breath, can well be with existing system definition compatibility.Fig. 5 is RRO information in IPV4
Subobject represents the structural representation of interface message；Fig. 6 is that in IPV6, RRO information subobject represents and connects
The structural representation of message breath, can realize the differentiation of incoming interface and outgoing interface by Fig. 5 Yu Fig. 6.
Embodiment 2
The present embodiment still to understand the implementation environment of detailed description, Fig. 2 in Fig. 2 as the inventive method
It is SE pattern that middle unidirectional tunnel 1 reserves pattern, source end node 1 (R1), destination node 3 (R3),
Middle loose to node 2 (R2), the LSP in tunnel 1 requires the available band of band a width of 50M, interface b
A width of 80M, interface e available bandwidth is 40M, and the available bandwidth of other interfaces is all 1G.In source
R1, sets up LSP1, and can only calculate path to R2, path is R1-R2, calculates path at R2
For R2-R3 (the interface e bandwidth in R2-R4-R3 is not enough, so calculating less than on this paths).R3
Transmission RESV message, to R2, has the information of interface d, passes through RRO simultaneously in the RRO information carried
The subobject tag slot of information is divided into interface and outgoing interface, determines that interface d is incoming interface information.R2 to
R1 sends RESV message, has interface c, interface b, the information of interface d in the RRO message carried.
It is divided into interface and outgoing interface by the subobject tag slot of RRO information simultaneously, determines that interface b is to connect
Mouthful, interface b and interface d is incoming interface information.
Road operator node (R1) receives RESV message, disappears by obtaining the RRO in RESV message
Breath, the outgoing interface obtaining downstream is b.
In the present embodiment, owing to generation bandwidth in tunnel changes, the bandwidth of Tunnel1 is revised for 70M (i.e.
Path computing demand is 70M), tunnel re-establishes LSP on R2, path computing when,
Interface b and the resource of interface a can be shared, represented here as 50M bandwidth resources.Owing to b interface is permissible
Sharing 50M bandwidth, b interface available bandwidth is 30M, as long as again reserving 20M from available bandwidth
Bandwidth can meet requirement, and the LSP path newly calculated is R1-R4-R2-R3.
If it should be noted that do not determine interface message by the inventive method, in path computing being then
Cannot obtain shared resource is 50M bandwidth, then, from the point of view of the available bandwidth from display is 30M, bandwidth provides
Source is not enough, it is impossible to carries out path computing, therefore can cause the situation that cannot generate path.
Although the embodiment that disclosed herein is as above, but described content only readily appreciates the present invention
And the embodiment used, it is not limited to the present invention.Technology people in any art of the present invention
Member, on the premise of without departing from the spirit and scope that disclosed herein, can be in the form implemented and thin
Any amendment and change is carried out on joint, but the scope of patent protection of the present invention, still must be with appended right
Claim is defined in the range of standard.
Claims (9)
1. the method that a realizing route calculates, it is characterised in that including:
Starting each node to source from destination, transmission interface information is to road operator node respectively；
Road operator node, according to the demand of path computing and the interface message that receives, carries out path computing.
Method the most according to claim 1, it is characterised in that described transmission interface information is calculated to road
Node specifically includes:
By generating record routing object RRO information in reserving message RESV and mailing to road operator node；
Described RRO information records the RESV interface message through path.
Method the most according to claim 2, it is characterised in that operator node road, described road operator node root
Demand according to path computing and the interface message through path, carry out path computing and specifically include:
Road operator node is from the interface message through path obtaining record from the RRO information of each node；
The road operator node demand according to path computing and the interface message of acquisition, carry out path computing.
4. according to the method described in any one of claims 1 to 3, it is characterised in that described interface message
Comprise incoming interface information and outgoing interface information；
Described incoming interface information and outgoing interface information by the sequence pre-set and position in RRO information
Middle record；Or,
Labelling is made a distinction by untapped field in RRO information subobject.
5. according to the method described in any one of claims 1 to 3, it is characterised in that described interface message
Including: share resource information and available resource information.
6. the system that a realizing route calculates, it is characterised in that including: destination starts to source
Node and road operator node；Wherein,
Each node, for transmission interface information to road operator node；
Road operator node includes computing unit, is used for the demand according to path computing and the interface message received,
Carry out path computing.
System the most according to claim 6, it is characterised in that described each node specifically for,
By generating record routing object RRO information in reserving message RESV and mailing to road operator node；
The described RRO information record RESV interface message through path；
Described road operator node also includes acquiring unit, for obtaining from from the RRO information of each node
The interface message through path of record.
System the most according to claim 7, it is characterised in that described each node, specifically for
Incoming interface information and outgoing interface information is comprised through path by generating record RESV in RESV
The RRO information of interface message also mails to road operator node；
Described incoming interface information and outgoing interface information by the sequence pre-set and position in RRO information
Middle record；Or,
Labelling is made a distinction by untapped field in RRO information subobject.
9. the road operator node of the system of a realizing route calculating, it is characterised in that including: acquiring unit
And computing unit；Wherein,
Acquiring unit, starts to obtain note in the RRO information sent to each node of source for destination
The interface message through path of record；
Computing unit, for the demand according to path computing and the interface message through path, carries out path
Calculate.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510108812.2A CN106034076A (en) | 2015-03-12 | 2015-03-12 | Method and system for realizing path calculation, and path calculation node |
| PCT/CN2015/087388 WO2016141677A1 (en) | 2015-03-12 | 2015-08-18 | Path calculation method, system and path calculation node |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510108812.2A CN106034076A (en) | 2015-03-12 | 2015-03-12 | Method and system for realizing path calculation, and path calculation node |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106034076A true CN106034076A (en) | 2016-10-19 |
Family
ID=56879870
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510108812.2A Withdrawn CN106034076A (en) | 2015-03-12 | 2015-03-12 | Method and system for realizing path calculation, and path calculation node |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN106034076A (en) |
| WO (1) | WO2016141677A1 (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101170477A (en) * | 2006-10-24 | 2008-04-30 | 华为技术有限公司 | A link resource management method and transmission method and network device |
| CN101193047A (en) * | 2006-11-24 | 2008-06-04 | 中兴通讯股份有限公司 | Establishment method of resource share path |
| CN101193048A (en) * | 2006-11-24 | 2008-06-04 | 中兴通讯股份有限公司 | Establishment system of resource share path |
| CN102647340A (en) * | 2012-03-22 | 2012-08-22 | 中兴通讯股份有限公司 | Loose node in RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel and path calculation method of loose node |
| WO2014008080A1 (en) * | 2012-07-03 | 2014-01-09 | Cisco Technology, Inc. | Signaling co-routed and non co-routed lsps of a bidirectional packet te tunnel |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101945049B (en) * | 2010-09-20 | 2015-12-16 | 中兴通讯股份有限公司 | The method for building up of multiprotocol label switching system, node device and bidirectional tunnel |
| CN102123089B (en) * | 2011-02-21 | 2013-09-18 | 杭州华三通信技术有限公司 | Tunnel establishing method and device |
-
2015
- 2015-03-12 CN CN201510108812.2A patent/CN106034076A/en not_active Withdrawn
- 2015-08-18 WO PCT/CN2015/087388 patent/WO2016141677A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101170477A (en) * | 2006-10-24 | 2008-04-30 | 华为技术有限公司 | A link resource management method and transmission method and network device |
| CN101193047A (en) * | 2006-11-24 | 2008-06-04 | 中兴通讯股份有限公司 | Establishment method of resource share path |
| CN101193048A (en) * | 2006-11-24 | 2008-06-04 | 中兴通讯股份有限公司 | Establishment system of resource share path |
| CN102647340A (en) * | 2012-03-22 | 2012-08-22 | 中兴通讯股份有限公司 | Loose node in RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel and path calculation method of loose node |
| WO2014008080A1 (en) * | 2012-07-03 | 2014-01-09 | Cisco Technology, Inc. | Signaling co-routed and non co-routed lsps of a bidirectional packet te tunnel |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2016141677A1 (en) | 2016-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8817591B2 (en) | Inter-domain signaling to update remote path computation elements after a call set-up failure | |
| US7602702B1 (en) | Fast reroute of traffic associated with a point to multi-point network tunnel | |
| WO2017156987A1 (en) | Method and apparatus for establishing flexible ethernet (flexe) path | |
| CN105594167B (en) | Method, controller, forwarding device and the network system to E-Packet | |
| CN100372337C (en) | Route selection method for implementing cross-domain constraint-based routing | |
| EP3472981B1 (en) | Connections and accesses for hierarchical path computation element (pce) | |
| US20110090913A1 (en) | Apparatus and method of controlling lsp of rsvp-te protocol using label with availability of end-to-end range | |
| CN110417651B (en) | Tunnel establishment method, device and system | |
| CN101552711B (en) | Method and device for establishing pseudowire mapping | |
| CN108881017B (en) | Method for changing bandwidth constraint of each hop in multi-path label switching path and router | |
| CN104429030A (en) | Signaling co-routed and non co-routed lsps of bidirectional packet te tunnel | |
| CN102647340A (en) | Loose node in RSVP-TE (Resource Reservation Protocol-Traffic Engineer) tunnel and path calculation method of loose node | |
| CN102630384A (en) | Method of realizing service transport over optical transport network, device and system for implementing method thereof | |
| CN101645822B (en) | Traffic engineering tunnel building method and system | |
| CN102546409B (en) | Method and RB (route bridge) for processing message based on TRILL (Transparent Interconnection of Lots of Links) network | |
| CN102130829B (en) | Method and device for establishing label switch paths (LSP) | |
| CN103650421B (en) | End-to-end two-way method, system and the node switched of a kind of 1+1 | |
| CN105681190A (en) | Tunnel restraint information sending, receiving method and device | |
| CN106034076A (en) | Method and system for realizing path calculation, and path calculation node | |
| CN101193047B (en) | Establishment method of resource share path | |
| EP2624505A1 (en) | Method and system for establishing, grafting and cutting bidirectional point-to-multipoint label switched path | |
| CN104067539B (en) | Support that combination grain business shares processing method and the node of resource | |
| CN105681195B (en) | Method and device for collecting LSP path affinity attribute | |
| CN101222407A (en) | Method for evading loose node automatic loop circuit | |
| WO2018205887A1 (en) | Delay collection method and apparatus |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20161019 |
|
| WW01 | Invention patent application withdrawn after publication |