CN109428813A - Heavy route method, device and storage medium - Google Patents
Heavy route method, device and storage medium Download PDFInfo
- Publication number
- CN109428813A CN109428813A CN201710748953.XA CN201710748953A CN109428813A CN 109428813 A CN109428813 A CN 109428813A CN 201710748953 A CN201710748953 A CN 201710748953A CN 109428813 A CN109428813 A CN 109428813A
- Authority
- CN
- China
- Prior art keywords
- path
- shared
- service groups
- shared risk
- heavy
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/125—Shortest path evaluation based on throughput or bandwidth
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/302—Route determination based on requested QoS
- H04L45/306—Route determination based on the nature of the carried application
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of heavy route method, device and storage medium, method therein includes: to be judged in service path based on shared risk delineation of activities rule with the presence or absence of a plurality of shared risk service path for belonging to the same shared risk service groups；If it is, marking off shared risk service groups in multiple service paths, and shared risk service path is divided in affiliated shared risk service groups；Determine the service groups heavy-route path of shared risk service groups, wherein be divided in a plurality of shared risk service path shared service group heavy-route path in the same shared risk service groups.Heavy route method, device and storage medium of the invention, it can use the division of shared risk service groups, " multi-service of a router-level topology result is shared " is realized when prefabricated heavy-route calculates, routing can be reduced to compute repeatedly, computing cost is effectively reduced, the treatment effeciency for promoting path computing, realizes the purpose of quick heavy-route.
Description
Technical field
The present invention relates to network communication technology field more particularly to a kind of heavy route methods, device and storage medium.
Background technique
Heavy-route is a kind of business recovery mode, the path for being used for business recovery is calculated, when a failure occurs it, by newly establishing
Path transmit business.Node or link in bearer network often carry a plurality of private line service, when nodes or
When link breaks down, the business of carrying can be affected simultaneously, if carrying out heavy-route calculating, meeting one by one to these business
The burden for increasing routing calculation module, causes the recovery time of business long.Therefore, how to realize that multiple services quick heavy-route is extensive
It is multiple, it is the major issue during network O&M.
Summary of the invention
In view of this, the invention solves a technical problem be to provide a kind of heavy route method, device and storage
Medium.
According to an aspect of the present invention, a kind of heavy route method is provided, comprising: based on shared risk delineation of activities rule
Judge in service path with the presence or absence of a plurality of shared risk service path for belonging to the same shared risk service groups；If
It is the shared risk service groups then to be marked off in the multiple service path, and shared risk service path is divided in
In affiliated shared risk service groups；Determine the service groups heavy-route path of the shared risk service groups, wherein be divided in same
A plurality of shared risk service path in one shared risk service groups shares service groups heavy-route path.
Optionally, the service groups heavy-route path of the determination shared risk service groups includes: to obtain described share
Risk service groups and be not belonging to any shared risk service groups other service paths recovery priority；Based on the recovery
The ranking results of priority successively determine the service groups heavy-route path or other business roads of the shared risk service groups
The business heavy-route path of diameter.
Optionally, the recovery priority for obtaining the shared risk service groups includes: to obtain and the shared risk
The corresponding multiple recovery priority of a plurality of shared risk service path belonging to service groups；Determine the multiple recovery priority
In highest restore priority, highest recovery priority is determined as the recovery priority of the shared risk service groups.
Optionally, the service groups heavy-route path of the determination shared risk service groups include: obtain with it is described total
Enjoy the corresponding multiple service bandwidths of a plurality of shared risk service path belonging to risk service groups；By the multiple service bandwidth
The sum of be determined as the shared risk service groups service groups heavy-route path demand bandwidth so that the shared risk business
The bandwidth in the service groups heavy-route path of group is greater than or equal to the demand bandwidth.
Optionally, the service groups heavy-route path of the determination shared risk service groups comprise determining that belong to it is described
The shared source node and shared destination node of a plurality of shared risk service path of shared risk service groups；It obtains and is located at described share
Service groups heavy-route path between source node and the shared destination node.
Optionally, service groups weight road of the acquisition between the shared source node and the shared destination node
It include: to obtain a plurality of shared risk service path between the shared source node and the shared destination node by path
Intermediate node or link, generate intermediate node set；To in the intermediate node set intermediate node or link carry out time
It goes through, successively excludes intermediate node or link, and judge between the shared source node and the shared destination node and band
It is wider than or whether there is equal to the shortest path of the demand bandwidth；If it is, by this shortest path be determined as in this
Intermediate node or link corresponding service groups heavy-route path simultaneously store.
Optionally, it when the connection for determining the intermediate node or link is broken down, establishes and this intermediate node or chain
The connection of road corresponding service groups heavy-route path, and by a plurality of shared risk business road belonging to the shared risk service groups
Business on diameter is switched in the connection of service groups heavy-route path.
Optionally, the shared risk delineation of activities rule includes: that source node is identical with destination node, routes identical and road
It is identical by strategy.
According to another aspect of the present invention, a kind of heavy-route device is provided, comprising: service groups determining module, for being based on
Shared risk delineation of activities rule, which judges to whether there is in service path, belongs to a plurality of total of the same shared risk service groups
Enjoy risk service path；If it is, marking off the shared risk service groups in the multiple service path, and will share
Risk service path is divided in affiliated shared risk service groups；Heavy-route determining module, for determining the shared risk
The service groups heavy-route path of service groups, wherein a plurality of shared risk business being divided in the same shared risk service groups
Share service groups heavy-route path in path.
Optionally, the heavy-route determining module is also used to obtain the shared risk service groups and is not belonging to any
The recovery priority of other service paths of shared risk service groups；Based on the ranking results for restoring priority, successively really
The service groups heavy-route path of the fixed shared risk service groups or the business heavy-route path of other service paths.
Optionally, the heavy-route determining module, comprising: priority determining unit, for obtaining and the shared risk
The corresponding multiple recovery priority of a plurality of shared risk service path belonging to service groups；Determine the multiple recovery priority
In highest restore priority, highest recovery priority is determined as the recovery priority of the shared risk service groups.
Optionally, the heavy-route determining module, comprising: bandwidth determination unit, for obtaining and the shared risk industry
The corresponding multiple service bandwidths of a plurality of shared risk service path belonging to business group；The sum of the multiple service bandwidth is determined
For the demand bandwidth in the service groups heavy-route path of the shared risk service groups, so that the business of the shared risk service groups
The bandwidth in group heavy-route path is greater than or equal to the demand bandwidth.
Optionally, the heavy-route determining module, comprising: path determining unit belongs to the shared risk for determination
The shared source node and shared destination node of a plurality of shared risk service path of service groups, obtain be located at the shared source node and
Service groups heavy-route path between the shared destination node.
Optionally, the path determining unit is located at described share for obtaining a plurality of shared risk service path
Intermediate node or link between source node and the shared destination node generate intermediate node set；To the set of intermediate nodes
Intermediate node or link in conjunction are traversed, and intermediate node or link are successively excluded, and judge to be located at the shared source node
Between the shared destination node and bandwidth whether there is more than or equal to the shortest path of the demand bandwidth；If so,
This shortest path is then determined as service groups heavy-route path corresponding with this intermediate node or link and is stored.
Optionally, service protection module, for establishing when the connection for determining the intermediate node or link is broken down
It is connected with this intermediate node or link corresponding service groups heavy-route path, and will be more belonging to the shared risk service groups
Business on shared risk service path is switched in the connection of service groups heavy-route path.
Optionally, the shared risk delineation of activities rule includes: that source node is identical with destination node, routes identical and road
It is identical by strategy.
According to another aspect of the invention, a kind of heavy-route device is provided, comprising: memory；And it is coupled to described deposit
The processor of reservoir, the processor is configured to the instruction based on storage in the memory, executes weight as described above
Method for routing.
In accordance with a further aspect of the present invention, a kind of computer readable storage medium, the computer-readable storage medium are provided
Matter is stored with computer instruction, and heavy route method as described above is realized when described instruction is executed by processor.
Heavy route method, device and storage medium of the invention divides shared risk service groups and by shared risk industry
Business path is divided in affiliated shared risk service groups, determines the service groups heavy-route path of shared risk service groups, is divided
A plurality of shared risk service path shared service group heavy-route path in the same shared risk service groups, can be using altogether
The division for enjoying risk service groups realizes the multi-service of a router-level topology result " shared " when prefabricated heavy-route calculates, can be with
It reduces routing to compute repeatedly, computing cost is effectively reduced, promotes the treatment effeciency of path computing, realizes the mesh of quick heavy-route
's.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only
Some embodiments of the present invention, for those of ordinary skill in the art, without any creative labor, also
Other drawings may be obtained according to these drawings without any creative labor.
Fig. 1 is the flow diagram of one embodiment of heavy route method according to the present invention；
Fig. 2 is the flow diagram of another embodiment of heavy route method according to the present invention；
Fig. 3 is the service path schematic diagram in one embodiment of heavy route method according to the present invention；
Fig. 4 is the module diagram of one embodiment of heavy-route device according to the present invention；
Fig. 5 is the module signal of the heavy-route determining module in one embodiment of heavy-route device according to the present invention
Figure；
Fig. 6 is the module diagram of another embodiment of heavy-route device according to the present invention.
Specific embodiment
With reference to the accompanying drawings to invention is more fully described, wherein illustrating exemplary embodiment of the present invention.Under
Face will combine the attached drawing in the embodiment of the present invention, and technical scheme in the embodiment of the invention is clearly and completely described, show
So, described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.Based on the reality in the present invention
Example is applied, every other embodiment obtained by those of ordinary skill in the art without making creative efforts all belongs to
In the scope of protection of the invention.
Fig. 1 is the flow diagram of one embodiment of heavy route method according to the present invention, as shown in Figure 1:
Step 101, judged based on shared risk delineation of activities rule same total with the presence or absence of belonging in service path
Enjoy a plurality of shared risk service path of risk service groups.Shared risk delineation of activities rule can be set to a variety of.For example, altogether
Enjoying risk delineation of activities rule includes: that source node is identical with destination node, it is identical to route identical and routing policy.
Step 102, if there is a plurality of shared risk service path for belonging to the same shared risk service groups, then more
Shared risk service groups are marked off in a service path, and shared risk service path is divided in affiliated shared risk business
In group.Can by source, destination node is identical, also identical service path divides same shared risk into the identical and routing policy of former routing
Service groups.
Step 103, the service groups heavy-route path for determining shared risk service groups, is divided in the same shared risk business
A plurality of shared risk service path shared service group heavy-route path in group." one can be realized when prefabricated heavy-route calculates
The multi-service of secondary router-level topology result is shared ", it reduces routing and computes repeatedly, computing cost is effectively reduced, reaches quick heavy-route
Purpose.
In one embodiment, shared risk service groups are obtained and is not belonging to other industry of any shared risk service groups
The recovery priority in business path successively determines the service groups weight of shared risk service groups based on the ranking results for restoring priority
The business heavy-route path of routed path or other service paths.
Determine that the recovery priority of shared risk service groups can be there are many mode.For example, obtaining and shared risk business
The corresponding multiple recovery priority of a plurality of shared risk service path belonging to group determine the highest in multiple recovery priority
Restore priority, highest recovery priority is determined as to the recovery priority of shared risk service groups, i.e. shared risk service groups
Priority it is identical as the highest business of in-group priority.
Determine that the bandwidth in the service groups heavy-route path of shared risk service groups can be there are many mode.For example, obtain with
The corresponding multiple service bandwidths of a plurality of shared risk service path belonging to shared risk service groups, by multiple service bandwidths it
With the demand bandwidth in the service groups heavy-route path for being determined as shared risk service groups so that the service groups of shared risk service groups
The bandwidth in heavy-route path is greater than or equal to demand bandwidth, i.e. bandwidth resources needed for shared risk service groups are all bandwidth in group
The sum of resource.
In one embodiment, the computation sequence of heavy-route according to priority carries out, for shared risk service groups, heavy-route
As a result all business being suitable in shared risk service groups.In calculating process, all intermediate node/links are successively excluded,
According to the routing policy of each business need, the heavy-route of each business is precalculated.
Determine the shared source node and shared destination node for belonging to a plurality of shared risk service path of shared risk service groups,
Obtain the service groups heavy-route path being located between shared source node and shared destination node.Obtain a plurality of shared risk service path
Intermediate node or link between shared source node and shared destination node generate intermediate node set.Due to a plurality of shared
The routing of risk service path can be identical, then only shortest path need to be calculated to a shared risk service path, as business
Group heavy-route path.
To in intermediate node set intermediate node or link traverse, successively exclude intermediate node or link, and sentence
Break between shared source node and shared destination node and whether bandwidth deposits more than or equal to the shortest path of demand bandwidth
?.If there is shortest path, then this shortest path is determined as service groups weight corresponding with this intermediate node or link road
By path and store.The acquisition algorithm of shortest path includes: dijkstra's algorithm, Floyd algorithm etc..
When the connection for determining intermediate node or link is broken down, industry corresponding with this intermediate node or link is established
The connection of business group heavy-route path, and the business on a plurality of shared risk service path belonging to shared risk service groups is switched to
In the connection of service groups heavy-route path.
Fig. 2 is the flow diagram of another embodiment of heavy route method according to the present invention, as shown in Figure 2:
Step 201, judge in service path with the presence or absence of a plurality of shared wind for belonging to the same shared risk service groups
Dangerous service path, if it is, 202 are entered step, if it is not, then entering step 203.
Step 202, shared risk service groups are marked off, and shared risk service path is divided in affiliated shared risk
In service groups.
Step 203, based on the ranking results for restoring priority, shared risk service groups, other service paths are traversed.By excellent
First grade traverses all business, carries out alternative path calculating, wherein only calculating for shared risk service groups primary.
Step 204, service path and all intermediate nodes and link in shared risk service groups are traversed.
Step 205, intermediate node and link are successively excluded, then calculate the source node for being located at service path and destination node it
Between shortest path.
Step 206, judge that shortest path whether there is, if it is, 207 are entered step, if it is not, then entering step
208。
Step 207, if it does, storing to alternate routing resource pool.
Step 208, if it does not exist, then the node or link failure can not restore, information is recorded auxiliary to business recovery
Auxiliary system.
Step 209, the traversal for judging whether to complete all business intermediate nodes and link, if it is, entering step
210, if not, entering step 204.
Step 210, judge whether that completing all service paths or the traversal of shared risk service groups calculates, if not, into
Enter step 203, if it is, terminating process.
As shown in figure 3, carrying 4 business altogether in the network being made of eight network element nodes.The related letter of business
Breath is as shown in table 1 below:
| Business Name | Bandwidth value | Priority | Source node | Destination node | Service path | Routing policy |
| Business 1 | 100M | 1 (highest) | A | F | A-B-E-F | Shortest path |
| Business 2 | 50M | 2 | C | F | C-B-E-F | Shortest path |
| Business 3 | 20M | 3 | A | F | A-B-E-F | Shortest path |
| Business 4 | 100M | 4 | D | E | D-B-E | Shortest path |
The relevant information table of table 1- business
Divide shared risk service groups first: business 1 meets the definition of shared risk service groups with business 3, that is, has phase
Same source, destination node, service path and routing policy, therefore be divided in same shared risk service groups, it is denoted as shared risk
Service groups 1, priority 1, bandwidth demand 120M.
According to the sequence of priority, the computation sequence of heavy-route is carried out are as follows: shared risk service groups 1, business 2, business 4.
It is calculated according to above-mentioned method, available: when B point failure, the service groups heavy-route path of shared risk service groups 1
Are as follows: A-D-G-F, the business heavy-route path of business 2 are as follows: C-D-G-F, the business heavy-route path of business 4 are as follows: D-G-E.
When E point failure, the service groups heavy-route path of shared risk service groups 1 are as follows: A-B-G-F, the business weight of business 2
Routed path are as follows: C-D-G-F.The calculated result of shared risk service groups is applicable in business 1 and business 3 simultaneously.
The heavy route method provided in above-described embodiment provides a kind of quick heavy-route based on shared risk service groups
Method can use the division of shared risk service groups, realized when prefabricated heavy-route calculates " router-level topology result it is more
Business is shared ", it is possible to reduce routing computes repeatedly, and computing cost is effectively reduced, and promotes the treatment effeciency of path computing, realizes fast
The purpose of fast heavy-route；Further, it is possible to shorten the priority that all business occupy under the premise of not influencing high-priority service
Queue further decreases computing cost, and the fault scenes by traversing all nodes and link calculate heavy-route, provides complete
Prefabricated heavy-route resource pool.
In one embodiment, as shown in figure 4, the present invention provides a kind of heavy-route device 40, comprising: service groups determine mould
Block 41, heavy-route determining module 42 and service protection module 43.
Service groups determining module 41 judges to whether there is in service path based on shared risk delineation of activities rule to be belonged to
The a plurality of shared risk service path of the same shared risk service groups, if it is, service groups determining module 41 is in multiple industry
Shared risk service groups are marked off in business path, and shared risk service path is divided in affiliated shared risk service groups
In.Heavy-route determining module 42 determines the service groups heavy-route path of shared risk service groups, is divided in the same shared risk
A plurality of shared risk service path shared service group heavy-route path in service groups.
Heavy-route determining module 42 obtains shared risk service groups and is not belonging to the other of any shared risk service groups
The recovery priority of service path.Heavy-route determining module 42 successively determines shared wind based on the ranking results for restoring priority
The service groups heavy-route path of dangerous service groups or the business heavy-route path of other service paths.
As shown in figure 5, heavy-route determining module 42 includes: priority determining unit 421, bandwidth determination unit 422 and road
Diameter determination unit 423.Priority determining unit 421 obtains and a plurality of shared risk service path belonging to shared risk service groups
Corresponding multiple recovery priority.Priority determining unit 421 determines that multiple highests restored in priority restore priority,
Highest recovery priority is determined as to the recovery priority of shared risk service groups.
Bandwidth determination unit 422 obtains corresponding with a plurality of shared risk service path belonging to shared risk service groups
Multiple service bandwidths.The sum of multiple service bandwidths are determined as the service groups weight of shared risk service groups by bandwidth determination unit 422
The demand bandwidth of routed path, so that the bandwidth in the service groups heavy-route path of shared risk service groups is greater than or equal to demand band
It is wide.
Path determining unit 423 determines the shared source section for belonging to a plurality of shared risk service path of shared risk service groups
Point and shared destination node, path determining unit 423 obtain the service groups weight road being located between shared source node and shared destination node
By path.Path determining unit 423 obtains a plurality of shared risk service path and is located between shared source node and shared destination node
Intermediate node or link, generate intermediate node set.
Path determining unit 423 in intermediate node set intermediate node or link traverse, successively exclude intermediate
Node or link, and judgement is located between shared source node and shared destination node and bandwidth is greater than or equal to demand bandwidth
Shortest path whether there is, if it is, this shortest path is determined as and this intermediate node or link by path determining unit 423
Corresponding service groups heavy-route path simultaneously stores.
When the connection for determining intermediate node or link is broken down, service protection module 43 establish with this intermediate node or
The connection of link corresponding service groups heavy-route path, and by a plurality of shared risk service path belonging to shared risk service groups
On business be switched to service groups heavy-route path connection on.
Fig. 6 is the module diagram of another embodiment of heavy-route device according to the present invention.As shown in fig. 6, the dress
Set may include memory 61, processor 62, communication interface 63 and bus 64.Memory 61 for storing instruction, processor 62
It is coupled to memory 61, processor 62 is configured as realizing above-mentioned heavy-route side based on the instruction execution that memory 61 stores
Method.
Memory 61 can be high speed RAM memory, nonvolatile memory (NoN-volatile memory) etc., deposit
Reservoir 61 is also possible to memory array.Memory 61 is also possible to by piecemeal, and block can be combined into virtually by certain rule
Volume.Processor 62 can be central processor CPU or application-specific integrated circuit ASIC (ApplicatioN Specific
INtegrated Circuit), or be arranged to implement one or more integrated circuits of heavy route method of the invention.
In one embodiment, the present invention provides a kind of computer readable storage medium, and computer readable storage medium is deposited
Computer instruction is contained, the heavy route method in as above any one embodiment is realized when instruction is executed by processor.
Heavy route method, device and the storage medium provided in above-described embodiment, division shared risk service groups simultaneously will
Shared risk service path is divided in affiliated shared risk service groups, determines the service groups weight of the shared risk service groups
Routed path, a plurality of shared risk service path being divided in the same shared risk service groups share service groups weight road
By path, a kind of fast rerouting method based on shared risk service groups is provided, can use shared risk service groups
It divides, " multi-service of a router-level topology result is shared " is realized when prefabricated heavy-route calculates, it is possible to reduce routing repeats to count
It calculates, computing cost is effectively reduced, promotes the treatment effeciency of path computing, realizes the purpose of quick heavy-route；Further, it is possible to not
Under the premise of influencing high-priority service, shortens the priority query that all business occupy, further decrease computing cost, pass through
The fault scenes for traversing all nodes and link calculate heavy-route, provide complete prefabricated heavy-route resource pool.
Method and system of the invention may be achieved in many ways.For example, can by software, hardware, firmware or
Software, hardware, firmware any combination realize method and system of the invention.The said sequence of the step of for method is only
In order to be illustrated, the step of method of the invention, is not limited to sequence described in detail above, especially says unless otherwise
It is bright.In addition, in some embodiments, also the present invention can be embodied as to record program in the recording medium, these programs include
For realizing machine readable instructions according to the method for the present invention.Thus, the present invention also covers storage for executing according to this hair
The recording medium of the program of bright method.
Description of the invention is given for the purpose of illustration and description, and is not exhaustively or will be of the invention
It is limited to disclosed form.Many modifications and variations are obvious for the ordinary skill in the art.It selects and retouches
It states embodiment and is to more preferably illustrate the principle of the present invention and practical application, and those skilled in the art is enable to manage
The solution present invention is to design various embodiments suitable for specific applications with various modifications.
Claims (18)
1. a kind of heavy route method characterized by comprising
Judge to whether there is in service path based on shared risk delineation of activities rule and belongs to the same shared risk service groups
A plurality of shared risk service path；
If it is, mark off the shared risk service groups in the multiple service path, and by shared risk business road
Diameter is divided in affiliated shared risk service groups；
Determine the service groups heavy-route path of the shared risk service groups, wherein be divided in the same shared risk service groups
In a plurality of shared risk service path share service groups heavy-route path.
2. the method as described in claim 1, which is characterized in that the service groups weight road of the determination shared risk service groups
Include: by path
The recovery for obtaining the shared risk service groups and being not belonging to other service paths of any shared risk service groups is excellent
First grade；
Based on the ranking results for restoring priority, the service groups heavy-route path of the shared risk service groups is successively determined
Or the business heavy-route path of other service paths.
3. method according to claim 2, which is characterized in that the recovery priority for obtaining the shared risk service groups
Include:
Obtain multiple recovery priority corresponding with a plurality of shared risk service path belonging to the shared risk service groups；
It determines that the highest in the multiple recovery priority restores priority, highest recovery priority is determined as described total
Enjoy the recovery priority of risk service groups.
4. method according to claim 2, which is characterized in that the service groups weight road of the determination shared risk service groups
Include: by path
Obtain multiple service bandwidths corresponding with a plurality of shared risk service path belonging to the shared risk service groups；
The sum of the multiple service bandwidth is determined as to the demand band in the service groups heavy-route path of the shared risk service groups
Width, so that the bandwidth in the service groups heavy-route path of the shared risk service groups is greater than or equal to the demand bandwidth.
5. method as claimed in claim 4, which is characterized in that the service groups weight road of the determination shared risk service groups
Include: by path
Determine the shared source node and shared destination node for belonging to a plurality of shared risk service path of the shared risk service groups；
Obtain the service groups heavy-route path between the shared source node and the shared destination node.
6. method as claimed in claim 5, which is characterized in that described obtain is located at the shared source node and the shared place
Service groups heavy-route path between node includes:
Obtain centre of a plurality of shared risk service path between the shared source node and the shared destination node
Node or link generate intermediate node set；
To in the intermediate node set intermediate node or link traverse, successively exclude intermediate node or link, and sentence
Break between the shared source node and the shared destination node and bandwidth is greater than or equal to the most short of the demand bandwidth
Path whether there is；
If it is, this shortest path is determined as service groups heavy-route path corresponding with this intermediate node or link and is deposited
Storage.
7. method as claimed in claim 6, which is characterized in that further include:
When the connection for determining the intermediate node or link is broken down, industry corresponding with this intermediate node or link is established
The connection of business group heavy-route path, and the business on a plurality of shared risk service path belonging to the shared risk service groups is fallen
It changes in the connection of service groups heavy-route path.
8. the method as described in claim 1 to 7 is any, which is characterized in that further include:
The shared risk delineation of activities rule includes: that source node is identical with destination node, it is identical to route identical and routing policy.
9. a kind of heavy-route device characterized by comprising
Service groups determining module, it is same with the presence or absence of belonging in service path for being judged based on shared risk delineation of activities rule
The a plurality of shared risk service path of one shared risk service groups；If it is, being marked off in the multiple service path
The shared risk service groups, and shared risk service path is divided in affiliated shared risk service groups；
Heavy-route determining module, for determining the service groups heavy-route path of the shared risk service groups, wherein be divided in same
A plurality of shared risk service path in one shared risk service groups shares service groups heavy-route path.
10. device as claimed in claim 9, which is characterized in that
The heavy-route determining module is also used to obtain the shared risk service groups and is not belonging to any shared risk business
The recovery priority of other service paths of group；Based on the ranking results for restoring priority, the shared wind is successively determined
The service groups heavy-route path of dangerous service groups or the business heavy-route path of other service paths.
11. device as claimed in claim 10, which is characterized in that
The heavy-route determining module, comprising:
Priority determining unit, it is opposite with a plurality of shared risk service path belonging to the shared risk service groups for obtaining
The multiple recovery priority answered；It determines that the highest in the multiple recovery priority restores priority, the highest is restored excellent
First grade is determined as the recovery priority of the shared risk service groups.
12. device as claimed in claim 10, which is characterized in that
The heavy-route determining module, comprising:
Bandwidth determination unit, it is corresponding with a plurality of shared risk service path belonging to the shared risk service groups for obtaining
Multiple service bandwidths；The sum of the multiple service bandwidth is determined as to the service groups heavy-route road of the shared risk service groups
The demand bandwidth of diameter, so that the bandwidth in the service groups heavy-route path of the shared risk service groups is greater than or equal to the demand
Bandwidth.
13. device as claimed in claim 12, which is characterized in that
The heavy-route determining module, comprising:
Path determining unit, for determining the shared source for belonging to a plurality of shared risk service path of the shared risk service groups
Node and shared destination node obtain the service groups heavy-route between the shared source node and the shared destination node
Path.
14. device as claimed in claim 13, which is characterized in that
The path determining unit is located at the shared source node and described for obtaining a plurality of shared risk service path
Intermediate node or link between shared destination node, generate intermediate node set；To the middle node in the intermediate node set
Point or link are traversed, and intermediate node or link are successively excluded, and judge to be located at the shared source node and the shared place
Between node and bandwidth whether there is more than or equal to the shortest path of the demand bandwidth；If it is, by this shortest path
Diameter is determined as service groups heavy-route path corresponding with this intermediate node or link and stores.
15. device as claimed in claim 14, which is characterized in that further include:
Service protection module, for establishing and this middle node when the connection for determining the intermediate node or link is broken down
Point or the connection of link corresponding service groups heavy-route path, and by a plurality of shared risk belonging to the shared risk service groups
Business on service path is switched in the connection of service groups heavy-route path.
16. the device as described in claim 9 to 15 is any, which is characterized in that
The shared risk delineation of activities rule includes: that source node is identical with destination node, it is identical to route identical and routing policy.
17. a kind of heavy-route device characterized by comprising
Memory；And
It is coupled to the processor of the memory, the processor is configured to the instruction based on storage in the memory,
Execute such as heavy route method described in any item of the claim 1 to 8.
18. a kind of computer readable storage medium, which is characterized in that the computer-readable recording medium storage has computer to refer to
It enables, such as heavy route method described in any item of the claim 1 to 8 is realized when described instruction is executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710748953.XA CN109428813B (en) | 2017-08-28 | 2017-08-28 | Rerouting method, rerouting device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710748953.XA CN109428813B (en) | 2017-08-28 | 2017-08-28 | Rerouting method, rerouting device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109428813A true CN109428813A (en) | 2019-03-05 |
| CN109428813B CN109428813B (en) | 2021-07-13 |
Family
ID=65502360
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710748953.XA Active CN109428813B (en) | 2017-08-28 | 2017-08-28 | Rerouting method, rerouting device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109428813B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112671640A (en) * | 2020-12-14 | 2021-04-16 | 烽火通信科技股份有限公司 | Route deployment method and system based on assembly line |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040125933A1 (en) * | 2002-12-31 | 2004-07-01 | Peng Jun | Managing and initiating conference calls |
| CN101005442A (en) * | 2006-01-20 | 2007-07-25 | 华为技术有限公司 | Re-roating method |
| US20070189193A1 (en) * | 2006-02-16 | 2007-08-16 | Stefano Previdi | Rerouting multicast traffic in response to detecting imminent network disruption |
| CN101127628A (en) * | 2006-08-14 | 2008-02-20 | 华为技术有限公司 | A method for managing and transmitting small granularity service |
| CN101184018A (en) * | 2007-12-18 | 2008-05-21 | 中兴通讯股份有限公司 | Automatic exchange optical network and traditional network interconnecting method |
| CN101502048A (en) * | 2007-02-07 | 2009-08-05 | 华为技术有限公司 | Hierarchical processing and propagation of partial faults in a packet network |
| CN102549980A (en) * | 2009-09-16 | 2012-07-04 | 瑞典爱立信有限公司 | Recovery of traffic in a connection-oriented network |
| CN103312613A (en) * | 2012-03-16 | 2013-09-18 | 中兴通讯股份有限公司 | Service message forwarding method and device |
-
2017
- 2017-08-28 CN CN201710748953.XA patent/CN109428813B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040125933A1 (en) * | 2002-12-31 | 2004-07-01 | Peng Jun | Managing and initiating conference calls |
| CN101005442A (en) * | 2006-01-20 | 2007-07-25 | 华为技术有限公司 | Re-roating method |
| US20070189193A1 (en) * | 2006-02-16 | 2007-08-16 | Stefano Previdi | Rerouting multicast traffic in response to detecting imminent network disruption |
| CN101127628A (en) * | 2006-08-14 | 2008-02-20 | 华为技术有限公司 | A method for managing and transmitting small granularity service |
| CN101502048A (en) * | 2007-02-07 | 2009-08-05 | 华为技术有限公司 | Hierarchical processing and propagation of partial faults in a packet network |
| CN101184018A (en) * | 2007-12-18 | 2008-05-21 | 中兴通讯股份有限公司 | Automatic exchange optical network and traditional network interconnecting method |
| CN102549980A (en) * | 2009-09-16 | 2012-07-04 | 瑞典爱立信有限公司 | Recovery of traffic in a connection-oriented network |
| CN103312613A (en) * | 2012-03-16 | 2013-09-18 | 中兴通讯股份有限公司 | Service message forwarding method and device |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112671640A (en) * | 2020-12-14 | 2021-04-16 | 烽火通信科技股份有限公司 | Route deployment method and system based on assembly line |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109428813B (en) | 2021-07-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6744727B2 (en) | Apparatus and method for spare capacity allocation | |
| US7324453B2 (en) | Constraint-based shortest path first method for dynamically switched optical transport networks | |
| EP1087576A2 (en) | Constraint-based route selection using biased cost | |
| US20140140216A1 (en) | Network system and routing method | |
| US7907596B2 (en) | Valley-free shortest path method | |
| JP5134006B2 (en) | Path management for enhanced protection | |
| CN106817306B (en) | Method and device for determining target route | |
| US10237202B2 (en) | Network control device, network control method, and recording medium for program | |
| CN103825762B (en) | A kind of Traffic grooming and differentiation importance degree guard method based on sub-clustering | |
| CN111800352B (en) | Service function chain deployment method and storage medium based on load balancing | |
| CN109412954A (en) | Route determining methods, device and storage medium based on unordered joint constraint | |
| CN105978811B (en) | A kind of route selecting method and device based on business transmission | |
| JP6084583B2 (en) | Flow path change calculation device and flow path change calculation system | |
| US10313232B2 (en) | Network control device, network control method, and recording medium for program | |
| CN109428813A (en) | Heavy route method, device and storage medium | |
| US20060036762A1 (en) | System and method for automatic path generation in a computer network | |
| US7593348B2 (en) | Traffic-independent allocation of working and restoration capacity in networks | |
| JP6389811B2 (en) | Physical resource allocation device, physical resource allocation method, and program | |
| CN110139173A (en) | A kind of network dividing area method reducing optical transfer network end-to-end time delay | |
| CN112653623B (en) | Relay protection service-oriented route distribution method and device | |
| JP4422114B2 (en) | Failure effect degree determination method, apparatus and program | |
| CN108259385A (en) | Simultaneously advertisement available bandwidth is distributed since switching fabric is degenerated | |
| CN102523156B (en) | Routing method based on hop count constraint | |
| US9351056B2 (en) | Planning of optical connections in a WDM optical network | |
| CN113179174B (en) | Safety engineering design for outlet flow change |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |