CN102523156B - Routing method based on hop count constraint - Google Patents
Routing method based on hop count constraint Download PDFInfo
- Publication number
- CN102523156B CN102523156B CN201110409949.3A CN201110409949A CN102523156B CN 102523156 B CN102523156 B CN 102523156B CN 201110409949 A CN201110409949 A CN 201110409949A CN 102523156 B CN102523156 B CN 102523156B
- Authority
- CN
- China
- Prior art keywords
- lsp
- topology layer
- jumping
- shortest path
- indirectly connected
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
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 optical communication technique field, particularly a kind of route selecting method based on hop count constraint.
Background technology
The extensive use of the Internet makes the demand of bandwidth day by day increase, and the development of GMPLS (Generalized Multiprotocol Label Switching, general multiple protocols label exchange network) has promoted the development of optical-fiber network.Transmission node in optical-fiber network is comprised 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, for obtaining efficient resource utilization, need effective TE (Traffic Engineering, traffic engineering) and traffic grooming scheme.But due to the invisibility to multilayer network resource, network node self can not provide multitiered network traffic engineering solution, need PCE (Path Computation Element, path-calculating element) to solve this problem.Traffic engineering information in PCE collection of link state information and layer, replaces network node realizing route computing function.Because PCE is used for calculating path completely, network size can be extended to more node and layer.
PCE, as a kind of computational entity, realizes the path computing based on restrictive condition specially.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 (without available path).
In many PCE cooperations, calculate in the vertical conceptual design on road, every layer has a PCE.Fig. 1 is that the vertical scheme schematic diagram on road is calculated in existing PCE cooperation, and as shown in Figure 1, it is divided into GMPLS network two-layer, comprises higher virtual topology layer and lower physical topology layer.PCE (being L-PCE in Fig. 1) in the PCE of virtual topology layer (being H-PCE in Fig. 1) and physical topology layer is responsible for respectively path computing and the network topology of place layer and safeguards.Physical topology layer PCE links and informs that virtual topology layer network, the virtual network topology of formation can be used to calculate LSP route the end-to-end link of physical topology layer of having built up as TE.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 all may have been crossed over one or more physical topology layers at the LSP of same layer.When a LSP is established in one deck, it can be used as data link by upper strata.That is to say, a LSP can set up on a plurality of existing LSP.
Thisly on existing LSP basis, set up the way of new LSP, although saved the wavelength resource of optical-fiber network, and reduced the amount of calculation of again calculating road,, it also may cause serious flow redundancy issue.
Fig. 2 is flow redundant description schematic diagram.Take Fig. 2 as example, without loss of generality, now make the following assumptions:
(1), routing algorithm has been collected the LSP path of having built up in advance;
(2) LSP, collecting is in turn: 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, is all set to 1.
When PCE receives the road construction request of LSP3, Jing Suan road is arranged in it in existing LSP1 and LSP2 light path.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 has flow redundancy between node 2 and node 3.
Summary of the invention
(1) technical problem that will solve
The technical problem to be solved in the present invention is: how a kind of route selecting method based on hop count constraint is provided, to reduce flow redundancy, and then reduces the blocking rate of network, improve resource utilization.
(2) technical scheme
For solving the problems of the technologies described above, the invention provides a kind of route selecting method based on hop count constraint, it comprises step:
B: judge according to road construction request whether virtual topology layer exists the direct-connected LSP meeting the demands, if so, the described direct-connected LSP of take sets up new LSP as basis at virtual topology layer; Otherwise, execution step C;
C: judge whether virtual topology layer exists the indirectly connected LSP meeting the demands, if so, calculate described indirectly connected LSP at the jumping figure of physical topology layer correspondence, then perform step D; Otherwise, at physical topology layer, set up new LSP;
D: at physical topology layer, calculate a shortest path, and and then calculate the jumping figure of described shortest path;
E: according to jumping figure corresponding to described indirectly connected LSP and the jumping figure of shortest path, calculate normalization jumping figure ratio, judge that whether described jumping figure than is greater than predetermined threshold value, if so, set up new LSP at physical topology layer; Otherwise the described indirectly connected LSP of take sets up new LSP as basis at virtual topology layer.
Preferably, before described step B, also comprise steps A: node sends the road construction request of setting up new LSP to PCE.
Preferably, described step B specifically comprises step:
B1:PCE receives road construction request;
B2: described PCE judges according to road construction request whether virtual topology layer exists the direct-connected LSP that bandwidth is enough, if so, execution step B3; Otherwise, execution step C;
B3: accept described road construction request, the described direct-connected LSP of take sets up new LSP as basis at virtual topology layer.
Preferably, described step C specifically comprises step:
C1:PCE judges whether virtual topology layer exists following indirectly connected LSP: described indirectly connected LSP is constituted by the enough existing LSP's of a plurality of bandwidth, and the source of described indirectly connected LSP, destination node are all same as source, the destination node that described road construction request requires; If so, execution step C2; Otherwise, execution step C3;
C2: calculate described indirectly connected LSP at the jumping figure of physical topology layer correspondence, then perform step D;
C3: described PCE judges whether physical topology layer remains enough bandwidth, if so, sets up new LSP according to shortest path first at physical topology layer; Otherwise, refuse described road construction request.
Preferably, the shortest path first in described step C3 is Dijkstra shortest path first.
Preferably, in described step D, adopt Dijkstra shortest path first to calculate a shortest path at physical topology layer, and and then calculate the jumping figure of described shortest path.
Preferably, described step e specifically comprises step:
E1:PCE, according to jumping figure corresponding to described indirectly connected LSP and the jumping figure of shortest path, calculates normalization jumping figure ratio;
E2: described PCE judges that whether described jumping figure than is greater than predetermined threshold value, if so, execution step E3; Otherwise the described indirectly connected LSP of take sets up new LSP as basis at virtual topology layer;
E3: described PCE judges whether physical topology layer remains enough bandwidth, if so, sets up new LSP according to shortest path first at physical topology layer; Otherwise, refuse described road construction request.
Preferably, described in described step e 1, jumping figure is as follows than the computing formula of R:
R＝(k-n)/n；
Wherein, k represents jumping figure corresponding to described indirectly connected LSP; N represents the jumping figure of described shortest path.
Preferably, the shortest path first in described step e 3 is Dijkstra shortest path first.
(3) beneficial effect
Route selecting method based on hop count constraint of the present invention, by increasing threshold decision, the hop count of newly-built LSP is retrained, thereby avoided blindly with existing LSP, setting up the flow redundancy issue that new LSP causes, and then reduced the blocking rate of network, improved resource utilization.
Accompanying drawing explanation
Fig. 1 is that the vertical scheme schematic diagram on road is calculated in existing PCE cooperation;
Fig. 2 is flow redundant description schematic diagram;
Fig. 3 is the route selecting method flow chart based on hop count constraint described in the embodiment of the present invention.
Embodiment
Below in conjunction with drawings and Examples, the specific embodiment of the present invention is described in further detail.Following examples are used for illustrating the present invention, but are not used for limiting the scope of the invention.
Fig. 3 is the route selecting method flow chart based on hop count constraint described in the embodiment of the present invention.As shown in the figure, described method comprises:
Steps A: node sends the road construction request of setting up new LSP to PCE.
Step B:PCE judges according to road construction request whether virtual topology layer exists the direct-connected LSP meeting the demands, and if so, the described direct-connected LSP of take sets up new LSP as basis at virtual topology layer; Otherwise, execution step C.
Described step B specifically comprises:
Step B1:PCE receives described road construction request.
Step B2: described PCE judges according to road construction request whether virtual topology layer exists the direct-connected LSP that bandwidth is enough, if so, execution step B3; Otherwise, execution step C.Described direct-connected LSP refers to described road construction request and requires the LSP of foundation to have the existing LSP of identical source, destination node.
Step B3: described PCE accepts described road construction request, the described direct-connected LSP of take sets up new LSP as basis at virtual topology layer.In this case, described PCE is without again calculating road, and directly according to the requirement of described road construction request, on described direct-connected LSP, reserved corresponding resource can complete the task of setting up new LSP.
Step C: judge whether virtual topology layer exists the indirectly connected LSP meeting the demands, if so, calculate described indirectly connected LSP at the jumping figure of physical topology layer correspondence, then perform step D; Otherwise, at physical topology layer, set up new LSP.
Described step C specifically comprises:
Step C1: described PCE judges whether virtual topology layer exists following indirectly connected LSP: described indirectly connected LSP is constituted by the enough existing LSP's of a plurality of bandwidth, and the source of described indirectly connected LSP, destination node are all same as source, the destination node that described road construction request requires; If so, execution step C2; Otherwise, execution step C3;
Step C2: calculate described indirectly connected LSP at the jumping figure of physical topology layer correspondence, then perform step D;
Step C3: described PCE judges whether physical topology layer remains enough bandwidth, if so, sets up new LSP according to Dijkstra (a kind of existing shortest path first) shortest path first at physical topology layer; Otherwise, refuse described road construction request.
Step D: described PCE is with Dijkstra shortest path first, calculates a shortest path at physical topology layer, and and then calculates the jumping figure of described shortest path.
Step e: according to the jumping figure n of the jumping figure k of described indirectly connected LSP and shortest path, calculate normalization jumping figure than R, judge whether described jumping figure is greater than predetermined threshold value T than R, if so, set up new LSP at physical topology layer; Otherwise the described indirectly connected LSP of take sets up new LSP as basis at virtual topology layer.Described predetermined threshold value T is different and different with topology of networks with network size, can be according to test determination, and its empirical value is generally 2.When described jumping figure is greater than described predetermined threshold value T than R, show that described indirectly connected LSP may exist serious flow redundancy, therefore, be now chosen in physical topology floor and again calculate road, set up described new LSP.
Described step e specifically comprises:
Step e 1:PCE, according to the jumping figure n of the jumping figure k of described indirectly connected LSP and shortest path, calculates normalization jumping figure and compares R.Described in described step e 1, jumping figure is as follows than the computing formula of R:
R＝(k-n)/n。
Step e 2: described PCE judges that whether described jumping figure than is greater than predetermined threshold value T, if so, execution step E3; Otherwise the described indirectly connected LSP of take sets up new LSP as basis at virtual topology layer.
Step e 3: described PCE judges whether physical topology layer remains enough bandwidth, if so, sets up new LSP according to shortest path first at physical topology layer; Otherwise, refuse described road construction request.
Route selecting method based on hop count constraint described in the embodiment of the present invention, by increasing threshold decision, the hop count of newly-built LSP is retrained, thereby avoided blindly with existing LSP, setting up the flow redundancy issue that new LSP causes, and then reduced the blocking rate of network, improved resource utilization.
Above execution mode is only for illustrating the present invention; and be not limitation of the present invention; the those of ordinary skill in relevant technologies field; without departing from the spirit and scope of the present invention; can also make a variety of changes 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 hop count constraint, is characterized in that, comprises step:
B: judge according to road construction request whether virtual topology layer exists the direct-connected label switching path LSP meeting the demands, if so, the described direct-connected LSP of take sets up new LSP as basis at virtual topology layer; Otherwise, execution step C;
C: judge whether virtual topology layer exists the indirectly connected LSP meeting the demands, if so, calculate described indirectly connected LSP at the jumping figure of physical topology layer correspondence, then perform step D; Otherwise, at physical topology layer, set up new LSP;
D: at physical topology layer, calculate a shortest path, and and then calculate the jumping figure of described shortest path;
E: according to jumping figure corresponding to described indirectly connected LSP and the jumping figure of shortest path, calculate normalization jumping figure ratio, judge that whether described jumping figure than is greater than predetermined threshold value, if so, set up new LSP at physical topology layer; Otherwise the described indirectly connected LSP of take sets up new LSP as basis at virtual topology layer.
2. the method for claim 1, is characterized in that, also comprises steps A before described step B: node sends the road construction request of setting up new LSP to path-calculating element PCE.
3. the method for claim 1, is characterized in that, described step B specifically comprises step:
B1:PCE receives road construction request;
B2: described PCE judges according to road construction request whether virtual topology layer exists the direct-connected LSP that bandwidth is enough, if so, execution step B3; Otherwise, execution step C;
B3: described PCE accepts described road construction request, the described direct-connected LSP of take sets up new LSP as basis at virtual topology layer.
4. the method for claim 1, is characterized in that, described step C specifically comprises step:
C1:PCE judges whether virtual topology layer exists following indirectly connected LSP: described indirectly connected LSP consists of the enough existing LSP of a plurality of bandwidth, and the source of described indirectly connected LSP, destination node are all same as source, the destination node that described road construction request requires; If so, execution step C2; Otherwise, execution step C3;
C2: calculate described indirectly connected LSP at the jumping figure of physical topology layer correspondence, then perform step D;
C3: described PCE judges whether physical topology layer remains enough bandwidth, if so, sets up new LSP according to shortest path first at physical topology layer; Otherwise, refuse described road construction request.
5. method as claimed in claim 4, is characterized in that, the shortest path first in described step C3 is Dijkstra shortest path first.
6. the method for claim 1, is characterized in that, in described step D, adopts Dijkstra shortest path first to calculate a shortest path at physical topology layer, and and then calculates the jumping figure of described shortest path.
7. the method for claim 1, is characterized in that, described step e specifically comprises step:
E1:PCE, according to jumping figure corresponding to described indirectly connected LSP and the jumping figure of shortest path, calculates normalization jumping figure ratio;
E2: described PCE judges that whether described jumping figure than is greater than predetermined threshold value, if so, execution step E3; Otherwise the described indirectly connected LSP of take sets up new LSP as basis at virtual topology layer;
E3: described PCE judges whether physical topology layer remains enough bandwidth, if so, sets up new LSP according to shortest path first at physical topology layer; Otherwise, refuse described road construction request.
8. method as claimed in claim 7, is characterized in that, described in described step e 1, jumping figure is as follows than the computing formula of R:
R＝(k-n)/n；
Wherein, k represents jumping figure corresponding to described indirectly connected LSP; N represents the jumping figure of described shortest path.
9. method as claimed in claim 7, is characterized in that, the shortest path first in described step e 3 is 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 CN102523156A (en) | 2012-06-27 |
| CN102523156B true 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) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106470083B (en) * | 2015-08-19 | 2018-11-02 | 中国移动通信集团公司 | A kind of synchronizing network detection method and device |
| CN112866109B (en) * | 2021-02-05 | 2023-02-03 | 北方工业大学 | 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 (6)
| Title |
|---|
| A path finding implementation for multi-layer networks;Dijkstra F等;《Future Generation Computer Systems》;20090228;第25卷;全文 * |
| Bijan JABBARI等.On Constraints for Path Computation in Multi-Layer Switched Networks.《IEICE TRANSACTIONS on Communications》.2007,1922-1927. * |
| Dijkstra F等.A path finding implementation for multi-layer networks.《Future Generation Computer Systems》.2009,第25卷142-146. * |
| Distributed schemes for diverse path computation in multidomain MPLS networks;Ricciato F等;《Communications Magazine, IEEE》;20050630;第43卷;全文 * |
| On Constraints for Path Computation in Multi-Layer Switched Networks;Bijan JABBARI等;《IEICE TRANSACTIONS on Communications》;20070801;全文 * |
| Ricciato F等.Distributed schemes for diverse path computation in multidomain MPLS networks.《Communications Magazine, IEEE》.2005,第43卷138-146页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102523156A (en) | 2012-06-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9602387B2 (en) | Network topology optimization | |
| CN101313528B (en) | Multi-domain route computation method and system | |
| EP2237501B1 (en) | Routing computation method and system, and path computation element | |
| US20150222557A1 (en) | Mpls and gmpls tunnel flap dampening in traffic engineered networks | |
| US8681634B2 (en) | Systems and methods for determining protection paths in a multi-domain network | |
| JP5596149B2 (en) | Method for improving service restoration speed and path calculation element in transmission network | |
| US9231852B2 (en) | Greening the network with the power consumption statuses of network components | |
| CN1783785A (en) | Restoration in a telecommunication network | |
| CN101483539A (en) | Method, path computing unit and system for obtaining path | |
| CN110289996A (en) | A kind of business route computing method based on SR | |
| 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 | |
| CN102523156B (en) | Routing method based on hop count constraint | |
| CN105430538B (en) | A kind of inter-domain routing method based on optical-fiber network subtopology figure | |
| CN101258715B (en) | Method for bandwidth allocation of replacement router within remote communication network and system for managing router of guaranteed bandwidth services with remote communication network | |
| CN102394768B (en) | A kind of tunnel path re-optimization method and device | |
| WO2012103852A2 (en) | Method and device for wavelength-division multiplexing network planning | |
| Koulougli et al. | Joint optimization of routing and flexible ethernet assignment in multi-layer multi-domain networks | |
| CN103731366B (en) | The adaptive weight leading method of dynamic service flow in optical-fiber network | |
| CN102348138B (en) | Collision avoidance wavelength assignment method based on PCE (Personal Computer Equipment) | |
| 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 | |
| CN100417086C (en) | Dynamic optical network resource management | |
| CN102316008B (en) | Method and device for optimizing resources | |
| US9351056B2 (en) | Planning of optical connections in a WDM optical network |
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 |