CN102523156A - Routing method based on hop count constraint - Google Patents
Routing method based on hop count constraint Download PDFInfo
- Publication number
- CN102523156A CN102523156A CN2011104099493A CN201110409949A CN102523156A CN 102523156 A CN102523156 A CN 102523156A CN 2011104099493 A CN2011104099493 A CN 2011104099493A CN 201110409949 A CN201110409949 A CN 201110409949A CN 102523156 A CN102523156 A CN 102523156A
- Authority
- CN
- China
- Prior art keywords
- lsp
- jumping
- topology layer
- shortest path
- pce
- 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.)
- Granted
Links
Images
Abstract
The invention discloses a routing method based on a hop count constraint and relates to an optical communication field. The method comprises the following steps: determining whether there is a direct connected label switched path (LSP) which satisfies a requirement on a virtual topology layer; if there is the direct connected label switched path (LSP) which satisfies the requirement on the virtual topology layer, establishing the new LSP on the virtual topology layer based on the LSP; otherwise, determining whether there is an undirected-connected LSP which satisfies the requirement; if there is the undirected-connected LSP, calculating a hop count corresponding to the undirected-connected LSP on a physical topology layer and executing a step D; otherwise, establishing the new LSP on the physical topology layer; D. calculating a shortest path, calculating the hop count of the shortest path, calculating a normalization hop count ratio and determining whether the hop count ratio is greater than a preset threshold; if the hop count ratio is greater than the preset threshold, establishing the new LSP on the physical topology layer; otherwise, establishing the new LSP based on the undirected-connected LSP. By using the method of the invention, a problem that the current LSP is used to establish the new LSP blindly so as to lead to flow redundancy can be avoided; a blocking rate of a network can be reduced and a resource utilization rate can be increased.
Description
Technical field
The present invention relates to the optical communication technique field, particularly a kind of route selecting method based on the jumping figure constraint.
Background technology
Broad application of Internet makes that the development of GMPLS (Generalized Multiprotocol Label Switching, general multiple protocols label exchange network) has promoted the development of optical-fiber network to the increasing demand increase of bandwidth.Transmission node in the optical-fiber network is made up of a plurality of datum planes and a control plane, and the LSP of different switching technologies (Label Switched Path, label switched path) is supported in the set of multitiered network.
In multitiered network,, need effective TE (Traffic Engineering, traffic engineering) and flow dredging scheme for obtaining resource utilization efficiently.But owing to the invisibility to multilayer network resource, network node self can not provide the multitiered network traffic engineering solution, needs PCE (Path Computation Element, path-calculating element) to solve this problem.PCE collection of link state information and the interior traffic engineering information of layer replace network node realizing route computing function.Because PCE is used for calculating path fully, network size can be extended to more node and layer.
PCE is as a kind of computational entity, and special realization is based on the path computing of restrictive condition.The solicited message of PCC (Path Computation Clients, path computing request client) comprises source, destination node and some restrictive conditions.The response of PCE can be strict route, loose route or refusal (no available path).
Calculate in the vertical conceptual design on road in many PCE cooperations, every layer all has a PCE.Fig. 1 is that the vertical scheme sketch map on road is calculated in existing PCE cooperation, and as shown in Figure 1, it is divided into the GMPLS network two-layer, comprises higher virtual topology layer and lower physical topology layer.PCE (being L-PCE among Fig. 1) in PCE of virtual topology layer (being H-PCE among Fig. 1) and the physical topology layer is responsible for the path computing and the network topology of place layer respectively and safeguards.The end-to-end link of physical topology layer that physical topology layer PCE will build up links as TE and informs that virtual topology layer network, the virtual network topology of formation can be used to calculate the LSP route.Each PCE has a corresponding TED (Traffic Engineering Database, traffic engineering database), is used for preserving the state of network topology and TE link.
In optical-fiber network, starting point and terminal point all possibly crossed over one or more physical topology layers at the LSP with one deck.When a LSP is established in one deck, it can be used as data link by the upper strata.That is to say that a LSP can set up on a plurality of existing LSP.
Thisly on existing LSP basis, set up the way of new LSP, though saved the wavelength resource of optical-fiber network, and reduced the amount of calculation of calculating the road again,, it also may cause serious flow redundancy issue.
Fig. 2 is a flow redundant description sketch map.With Fig. 2 is example, is without loss of generality, hypothesis below existing the work:
(1), routing algorithm has been collected the LSP path of having built up in advance;
(2), the LSP that collects is in order: LSP1, LSP2, LSP3.The path of LSP1 is (1-2-3); The path of LSP2 is (3-2-5);
(3), the hinged node of LSP1 is to being (1,3), the hinged node of LSP2 is to being (3,5), the hinged node of LSP3 is to being (1,5);
(4), only consider the jumping figure of link, the weight of link is not considered, all is set to 1.
When PCE receives the road construction request of LSP3, be arranged in it on existing LSP1 and the LSP2 light path through calculating the road.Node 1 is 4 to total jumping figure of node 5, i.e. (1-2-3-2-5), and obviously this is not shortest path (shortest path is 1-2-5 or 1-6-5), and exists flow redundant between node 2 and the node 3.
Summary of the invention
The technical problem that (one) will solve
The technical problem that the present invention will solve is: how a kind of route selecting method based on the jumping figure constraint is provided, so that it is redundant to reduce flow, and then reduces the blocking rate of network, improve resource utilization.
(2) technical scheme
For solving the problems of the technologies described above, the present invention provides a kind of route selecting method based on the jumping figure constraint, and it comprises step:
B: judge according to the road construction request whether the virtual topology layer exists the direct-connected LSP that meets the demands, if serve as that new LSP is set up at the virtual topology layer in the basis with said direct-connected LSP; Otherwise, execution in step C;
C: judge whether the virtual topology layer exists the indirectly connected LSP that meets the demands, if calculate said indirectly connected LSP at the corresponding jumping figure of physical topology layer, execution in step D then; Otherwise, set up new LSP at the physical topology layer;
D: calculate a shortest path at the physical topology layer, and and then calculate the jumping figure of said shortest path;
E: according to the jumping figure of said indirectly connected LSP correspondence and the jumping figure of shortest path, calculate normalization jumping figure ratio, judge that whether said jumping figure ratio is greater than predetermined threshold value, if set up new LSP at the physical topology layer; Otherwise, serve as that new LSP is set up at the virtual topology layer in the basis with said indirectly connected LSP.
Preferably, before said step B, also comprise steps A: node sends the road construction request of setting up new LSP to PCE.
Preferably, said step B specifically comprises step:
B1:PCE receives the road construction request;
B2: said PCE judges according to the road construction request whether the virtual topology layer exists the enough direct-connected LSP of bandwidth, if, execution in step B3; Otherwise, execution in step C;
B3: accepting said road construction request, serves as that new LSP is set up at the virtual topology layer in the basis with said direct-connected LSP.
Preferably, said step C specifically comprises step:
C1:PCE judge the virtual topology layer whether exist below indirectly connected LSP: said indirectly connected LSP is constituted by the enough existing LSP's of a plurality of bandwidth, and the source of said indirectly connected LSP, destination node all are same as source, the destination node that said road construction request requires; If, execution in step C2; Otherwise, execution in step C3;
C2: calculate said indirectly connected LSP at the corresponding jumping figure of physical topology layer, execution in step D then;
C3: said PCE judges whether the physical topology layer remains enough bandwidth, if set up new LSP according to shortest path first at the physical topology layer; Otherwise, refuse said road construction request.
Preferably, the shortest path first among the said step C3 is the Dijkstra shortest path first.
Preferably, among the said step D, adopt the Dijkstra shortest path first to calculate a shortest path, and and then calculate the jumping figure of said shortest path at the physical topology layer.
Preferably, said step e specifically comprises step:
E1:PCE calculates normalization jumping figure ratio according to the jumping figure of said indirectly connected LSP correspondence and the jumping figure of shortest path;
E2: whether said PCE judges said jumping figure ratio greater than predetermined threshold value, if, execution in step E3; Otherwise, serve as that new LSP is set up at the virtual topology layer in the basis with said indirectly connected LSP;
E3: said PCE judges whether the physical topology layer remains enough bandwidth, if set up new LSP according to shortest path first at the physical topology layer; Otherwise, refuse said road construction request.
Preferably, jumping figure is following than the computing formula of R described in the said step e 1:
R＝(k-n)/n；
Wherein, k representes the corresponding jumping figure of said indirectly connected LSP; N representes the jumping figure of said shortest path.
Preferably, the shortest path first in the said step e 3 is the Dijkstra shortest path first.
(3) beneficial effect
Route selecting method based on the jumping figure constraint according to the invention; Retrain through the hop count of increase threshold decision newly-built LSP; Thereby avoided blindly setting up the flow redundancy issue that new LSP causes, and then reduced the blocking rate of network, improved resource utilization with existing LSP.
Description of drawings
Fig. 1 is that the vertical scheme sketch map on road is calculated in existing PCE cooperation;
Fig. 2 is a flow redundant description sketch map;
Fig. 3 is the said route selecting method flow chart based on the jumping figure constraint of the embodiment of the invention.
Embodiment
Below in conjunction with accompanying drawing and embodiment, specific embodiments of the invention describes in further detail.Following examples are used to explain the present invention, but are not used for limiting scope of the present invention.
Fig. 3 is the said route selecting method flow chart based on the jumping figure constraint of the embodiment of the invention.As shown in the figure, said method comprises:
Steps A: node sends the road construction request of setting up new LSP to PCE.
Step B:PCE judges according to the road construction request whether the virtual topology layer exists the direct-connected LSP that meets the demands, if serve as that new LSP is set up at the virtual topology layer in the basis with said direct-connected LSP; Otherwise, execution in step C.
Said step B specifically comprises:
Step B1:PCE receives said road construction request.
Step B2: said PCE judges according to the road construction request whether the virtual topology layer exists the enough direct-connected LSP of bandwidth, if, execution in step B3; Otherwise, execution in step C.Said direct-connected LSP is meant with said road construction request and requires the LSP of foundation to have the existing LSP of identical source, destination node.
Step B3: said PCE accepts said road construction request, serves as that new LSP is set up at the virtual topology layer in the basis with said direct-connected LSP.In this case, said PCE need not to calculate once more the road, directly according to the requirement of said road construction request, on said direct-connected LSP, reserves corresponding resource and can accomplish the task of setting up new LSP.
Step C: judge whether the virtual topology layer exists the indirectly connected LSP that meets the demands, if calculate said indirectly connected LSP at the corresponding jumping figure of physical topology layer, execution in step D then; Otherwise, set up new LSP at the physical topology layer.
Said step C specifically comprises:
Step C1: said PCE judge the virtual topology layer whether exist below indirectly connected LSP: said indirectly connected LSP is constituted by the enough existing LSP's of a plurality of bandwidth, and the source of said indirectly connected LSP, destination node all are same as source, the destination node that said road construction request requires; If, execution in step C2; Otherwise, execution in step C3;
Step C2: calculate said indirectly connected LSP at the corresponding jumping figure of physical topology layer, execution in step D then;
Step C3: said PCE judges whether the physical topology layer remains enough bandwidth, if set up new LSP according to Dijkstra (a kind of existing shortest path first) shortest path first at the physical topology layer; Otherwise, refuse said road construction request.
Step D: said PCE is with the Dijkstra shortest path first, calculates a shortest path at the physical topology layer, and and then calculates the jumping figure of said shortest path.
Step e: according to the jumping figure k of said indirectly connected LSP and the jumping figure n of shortest path, calculate the normalization jumping figure than R, judge said jumping figure than R whether greater than predetermined threshold value T, if set up new LSP at the physical topology layer; Otherwise, serve as that new LSP is set up at the virtual topology layer in the basis with said indirectly connected LSP.Said predetermined threshold value T is different with topology of networks and different with network size, can be according to test determination, and its empirical value is generally 2.When said jumping figure during greater than said predetermined threshold value T, shows that said indirectly connected LSP possibly exist serious flow redundant than R, therefore, be chosen in the physical topology layer and calculate the road again this moment, sets up said new LSP.
Said step e specifically comprises:
Step e 1:PCE calculates the normalization jumping figure and compares R according to the jumping figure k of said indirectly connected LSP and the jumping figure n of shortest path.Jumping figure is following than the computing formula of R described in the said step e 1:
R＝(k-n)/n。
Step e 2: whether said PCE judges said jumping figure ratio greater than predetermined threshold value T, if, execution in step E3; Otherwise, serve as that new LSP is set up at the virtual topology layer in the basis with said indirectly connected LSP.
Step e 3: said PCE judges whether the physical topology layer remains enough bandwidth, if set up new LSP according to shortest path first at the physical topology layer; Otherwise, refuse said road construction request.
The said route selecting method of the embodiment of the invention based on the jumping figure constraint; Retrain through the hop count of increase threshold decision newly-built LSP; Thereby avoided blindly setting up the flow redundancy issue that new LSP causes, and then reduced the blocking rate of network, improved resource utilization with existing LSP.
Above execution mode only is used to explain the present invention; And be not limitation of the present invention; The those of ordinary skill in relevant technologies field under the situation that does not break away from the spirit and scope of the present invention, can also be made various variations and modification; Therefore all technical schemes that are equal to also belong to category of the present invention, and scope of patent protection of the present invention should be defined by the claims.
Claims (9)
1. the route selecting method based on the jumping figure constraint is characterized in that, comprises step:
B: judge according to the road construction request whether the virtual topology layer exists the direct-connected LSP that meets the demands, if serve as that new LSP is set up at the virtual topology layer in the basis with said direct-connected LSP; Otherwise, execution in step C;
C: judge whether the virtual topology layer exists the indirectly connected LSP that meets the demands, if calculate said indirectly connected LSP at the corresponding jumping figure of physical topology layer, execution in step D then; Otherwise, set up new LSP at the physical topology layer;
D: calculate a shortest path at the physical topology layer, and and then calculate the jumping figure of said shortest path;
E: according to the jumping figure of said indirectly connected LSP correspondence and the jumping figure of shortest path, calculate normalization jumping figure ratio, judge that whether said jumping figure ratio is greater than predetermined threshold value, if set up new LSP at the physical topology layer; Otherwise, serve as that new LSP is set up at the virtual topology layer in the basis with said indirectly connected LSP.
2. the method for claim 1 is characterized in that, before said step B, also comprises steps A: node sends the road construction request of setting up new LSP to PCE.
3. the method for claim 1 is characterized in that, said step B specifically comprises step:
B1:PCE receives the road construction request;
B2: said PCE judges according to the road construction request whether the virtual topology layer exists the enough direct-connected LSP of bandwidth, if, execution in step B3; Otherwise, execution in step C;
B3: said PCE accepts said road construction request, serves as that new LSP is set up at the virtual topology layer in the basis with said direct-connected LSP.
4. the method for claim 1 is characterized in that, said step C specifically comprises step:
C1:PCE judge the virtual topology layer whether exist below indirectly connected LSP: said indirectly connected LSP is constituted by the enough existing LSP's of a plurality of bandwidth, and the source of said indirectly connected LSP, destination node all are same as source, the destination node that said road construction request requires; If, execution in step C2; Otherwise, execution in step C3;
C2: calculate said indirectly connected LSP at the corresponding jumping figure of physical topology layer, execution in step D then;
C3: said PCE judges whether the physical topology layer remains enough bandwidth, if set up new LSP according to shortest path first at the physical topology layer; Otherwise, refuse said road construction request.
5. method as claimed in claim 4 is characterized in that, the shortest path first among the said step C3 is the Dijkstra shortest path first.
6. the method for claim 1 is characterized in that, among the said step D, adopts the Dijkstra shortest path first to calculate a shortest path at the physical topology layer, and and then calculates the jumping figure of said shortest path.
7. the method for claim 1 is characterized in that, said step e specifically comprises step:
E1:PCE calculates normalization jumping figure ratio according to the jumping figure of said indirectly connected LSP correspondence and the jumping figure of shortest path;
E2: whether said PCE judges said jumping figure ratio greater than predetermined threshold value, if, execution in step E3; Otherwise, serve as that new LSP is set up at the virtual topology layer in the basis with said indirectly connected LSP;
E3: said PCE judges whether the physical topology layer remains enough bandwidth, if set up new LSP according to shortest path first at the physical topology layer; Otherwise, refuse said road construction request.
8. method as claimed in claim 7 is characterized in that, jumping figure is following than the computing formula of R described in the said step e 1:
R＝(k-n)/n；
Wherein, k representes the corresponding jumping figure of said indirectly connected LSP; N representes the jumping figure of said shortest path.
9. method as claimed in claim 7 is characterized in that, the shortest path first in the said step e 3 is the Dijkstra shortest path first.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110409949.3A CN102523156B (en) | 2011-12-09 | 2011-12-09 | Routing method based on hop count constraint |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110409949.3A CN102523156B (en) | 2011-12-09 | 2011-12-09 | Routing method based on hop count constraint |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102523156A true CN102523156A (en) | 2012-06-27 |
| CN102523156B CN102523156B (en) | 2014-11-26 |
Family
ID=46293955
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110409949.3A Expired - Fee Related CN102523156B (en) | 2011-12-09 | 2011-12-09 | Routing method based on hop count constraint |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102523156B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106470083A (en) * | 2015-08-19 | 2017-03-01 | 中国移动通信集团公司 | A kind of synchronizing network detection method and device |
| CN112866109A (en) * | 2021-02-05 | 2021-05-28 | 北方工业大学 | Routing method for network traffic engineering |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101155131A (en) * | 2006-09-29 | 2008-04-02 | 中国电信股份有限公司 | Method for establishing label switched path of minimized path preemption cost |
| CN101237399A (en) * | 2007-09-28 | 2008-08-06 | 华为技术有限公司 | Method, system and device for getting label switching path |
| US7606235B1 (en) * | 2004-06-03 | 2009-10-20 | Juniper Networks, Inc. | Constraint-based label switched path selection within a computer network |
-
2011
- 2011-12-09 CN CN201110409949.3A patent/CN102523156B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7606235B1 (en) * | 2004-06-03 | 2009-10-20 | Juniper Networks, Inc. | Constraint-based label switched path selection within a computer network |
| CN101155131A (en) * | 2006-09-29 | 2008-04-02 | 中国电信股份有限公司 | Method for establishing label switched path of minimized path preemption cost |
| CN101237399A (en) * | 2007-09-28 | 2008-08-06 | 华为技术有限公司 | Method, system and device for getting label switching path |
Non-Patent Citations (3)
| Title |
|---|
| BIJAN JABBARI等: "On Constraints for Path Computation in Multi-Layer Switched Networks", 《IEICE TRANSACTIONS ON COMMUNICATIONS》, 1 August 2007 (2007-08-01), pages 1922 - 1927 * |
| DIJKSTRA F等: "A path finding implementation for multi-layer networks", 《FUTURE GENERATION COMPUTER SYSTEMS》, vol. 25, 28 February 2009 (2009-02-28), pages 142 - 146 * |
| RICCIATO F等: "Distributed schemes for diverse path computation in multidomain MPLS networks", 《COMMUNICATIONS MAGAZINE, IEEE》, vol. 43, 30 June 2005 (2005-06-30), pages 138 - 146 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106470083A (en) * | 2015-08-19 | 2017-03-01 | 中国移动通信集团公司 | A kind of synchronizing network detection method and device |
| CN106470083B (en) * | 2015-08-19 | 2018-11-02 | 中国移动通信集团公司 | A kind of synchronizing network detection method and device |
| CN112866109A (en) * | 2021-02-05 | 2021-05-28 | 北方工业大学 | Routing method for network traffic engineering |
| CN112866109B (en) * | 2021-02-05 | 2023-02-03 | 北方工业大学 | Routing method for network traffic engineering |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102523156B (en) | 2014-11-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2237501B1 (en) | Routing computation method and system, and path computation element | |
| CN101313528B (en) | Multi-domain route computation method and system | |
| CN104205728B (en) | Method and apparatus for the recovery in connection-oriented network | |
| JP5596149B2 (en) | Method for improving service restoration speed and path calculation element in transmission network | |
| US20110255443A1 (en) | Virtual routers for gmpls networks | |
| US9794129B2 (en) | Building topology in communications networks | |
| CN1783785A (en) | Restoration in a telecommunication network | |
| US9231852B2 (en) | Greening the network with the power consumption statuses of network components | |
| JP4968117B2 (en) | Route calculation apparatus and route calculation system | |
| WO2009092249A1 (en) | Method and network device for realizing protection for a shared mesh | |
| EP2476224A1 (en) | Method and apparatus for path computation element and routing controller cooperation | |
| CN104869021A (en) | Multi-granularity multi-domain heterogeneous optical network resource allocation method | |
| Al-Darrab et al. | Software-Defined Networking load distribution technique for an internet service provider | |
| Hasan et al. | Development of FRR mechanism by adopting SDN notion | |
| WO2008148315A1 (en) | A method and system for establishing service path, and a node device | |
| CN102523156B (en) | Routing method based on hop count constraint | |
| WO2018053747A1 (en) | Resource sharing method, network node, and associated apparatus | |
| CN101969581B (en) | Method, device and system for switching flow of multilayer network | |
| CN101873271A (en) | Business-driven cross-layer survivability method in multilayer network | |
| EP2854351A1 (en) | Method and system for restoring and recovering traffic in multi-layer communication networks after two or more failures and virtual controller device | |
| US9351056B2 (en) | Planning of optical connections in a WDM optical network | |
| CN100417086C (en) | Dynamic optical network resource management | |
| CN102316008B (en) | Method and device for optimizing resources | |
| JP2012257128A (en) | Method and system for fault recovery path calculation | |
| KR100596390B1 (en) | Detour path decision method for dual failures restoration on optical transport network system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141126 Termination date: 20201209 |