CN103259590B - A kind of light multicast static P circle segment protection method of jumping section based on 2 - Google Patents
A kind of light multicast static P circle segment protection method of jumping section based on 2 Download PDFInfo
- Publication number
- CN103259590B CN103259590B CN201310201713.XA CN201310201713A CN103259590B CN 103259590 B CN103259590 B CN 103259590B CN 201310201713 A CN201310201713 A CN 201310201713A CN 103259590 B CN103259590 B CN 103259590B
- Authority
- CN
- China
- Prior art keywords
- node
- link
- protection
- jumping
- multicast
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a kind of light multicast static P circle segment protection method of jumping section based on 2, all nodes of static traffic and the method for link in request protection light Multicast switch network.Propose to minimize the integral linear programming model that wavelength resource is target, solve traditional static multicast service Node Protection and link protection can not take into account problem.The advantage of wavelength resource is saved according to the protection of P circle; propose 2 jumping section P and enclose guard method; the method is by finding 2 jumping sections of the link disjoint paths of optical multicast network; the best P calculating link disjoint paths set encloses disaggregation; realize the minimum demand assignment of wavelength resource; improve the utilance of optical-fiber network limited wavelength resource, ensure that the survivability of optical multicast network interior joint and link simultaneously.
Description
Technical field
The present invention relates to technical field of optical fiber communication, be specifically related to a kind of 2 P jumping section static traffic for solving optical network multicast interior joint link failure and enclose guard method.
Technical background
Along with the development of optical-fiber network technology, in optical-fiber network, the light multicast application of single-point transmission, multipoint reception gets more and more, consumption and the congested generation of optical network band width increase fast, along with the increase gradually of Optical Fiber Transmission capacity, once a certain node or link occurs fault may cause multiple destination node not receive data, have a large number of services to lose, improve the survivability of optical network multicast and become the major issue that optical-fiber network faces.Guarantee at present for optical-fiber network survivability mainly contains 2 kinds of measures, network protection and network recoveries.Protection refers to that when an error occurs, business can be carried by standby resources in advance for business reserves reserved resource.Recovery refers to not in advance for business reserves reserved resource, after fault occurs, more dynamically finds available resources in network and carries those business by fault effects.Comparatively speaking, resist technology has shorter service recovery time, but need expend more redundant resource; And recovery technology has good resource utilization, but failure recovery time is long, and can not provide complete reliably protecting.
Research in recent years shows, the protection of P circle employs less wavelength resource in the protection of static traffic, has the advantage that Traditional Environmental-protection protects, can also protect simultaneously, improve protection range to gap-bridging link.A kind of guarantee means of effectively surviving to the multicast network day by day increased with transmission capacity.In optical-fiber network, wavelength itself is very rare resource, uses more that multiple resource expense is larger, and P circle normally precalculates and pre-configured loop connecting in a network to minimize wavelength use amount for target.Enclose in protection at traditional P, Node Protection and link protection can not take into account often.In traditional segment protect, Node Protection and link protection can be taken into account, but traditional protection mode has very high wavelength resource consumption, wavelength resource is very rare resource in optical-fiber network.The present invention proposes a kind of protection realizing optical network multicast node failure and link failure based on the 2 static P circle guard methods of jumping section, the wavelength use amount simultaneously making P enclose reaches minimum.
Summary of the invention
Single for existing smooth Multicast Routing object of protection; that is: only for the present situation of node failure or link failure; the present invention devises a kind of static P circle segment protection method of jumping section based on 2; the method comprises: find all loops of non-directed graph with a kind of Depth Priority Algorithm of improvement, carries out the method that optimal solution asked by segmentation and design integral linear programming model from all loop set by heuritic approach to multicast service.Concrete technical scheme is as follows:
A kind of light multicast P circle segment protection method of jumping section based on 2, by abstract for the optical-fiber network figure G (V for representing with node set V, optical fiber link set E, E), search graph G (V, E) all rings in, delete the node and the limit that there are ring, until figure G (V, E) there is no loop in, calculate the multicast tree that multicast request connecting path is corresponding; From source node, carry out segmentation to every bar to the path of destination node, every 2 jump as one section; Multicast request path is divided into several and 2 jumps crossover route segment, jump to carry out protecting in units of crossover route segments by 2 and realize this and 2 jump the intermediate node of section and the survivability of 2 links.
Find all loops in figure G (V, E), specifically comprise: (1) reads in network topology G(V, E), being numbered node wherein, is 1,2 respectively ..., i ..., m; (2) depth-first search is carried out for node m, arrive a some W it is stacked; (3) travel through W all go out limit, another end points going out limit corresponding is respectively v1, v2 ..., vJ; (4) judge that W's goes out some vj corresponding to limit whether in stack, then turn in stack (5), otherwise turn to (6); (5) vj is in stack and vj equals m is then a ring from m to vj, and export this ring, if vj is not equal to m in stack, i=i+1 turns to (4); (6) depth-first search is continued, until do not have ring in figure.Described every 2 jumpings are specially as one section: for a paths from source node to destination node, every 2 jump path jumps section as one 2 and stores, continue to next node to the destination node section of looking for, until can not find 2 jumping sections, the link form of pressing of jumping less than 2 stores.
The present invention protects all node and links needing protection in network by the P circle protection that 2 jump section with minimum wavelength resource.Realize the protection of optical network multicast node failure and link failure, the wavelength use amount simultaneously making P enclose reaches minimum.
Accompanying drawing explanation
Fig. 1 calculates all loop algorithm flow charts;
Fig. 2 multicast service segmentation algorithm flow chart;
Fig. 3 multicast tree stepwise schematic views;
Figure 42 section of jumping P encloses protection schematic diagram.
Embodiment
A kind of depth-first search (Deep-First-Search of improvement of the present invention, DFS) algorithm finds the method for directed graph all loops, carries out the method that optimal solution asked by the method for segmentation and design integral linear programming model from all loop set by heuritic approach to multicast service.To the light multicast request arriving optical-fiber network input node, first according to wavelength available bandwidth resources and topological relation in optical-fiber network, the DFS algorithm improved is used to ask all loops to this network topology; Then carry out segmentation to from source node to the path of each destination node, link disjoint process is carried out in the path after segmentation; Finally try to achieve best P to each link disjoint section by integral linear programming model to enclose.
Below in conjunction with accompanying drawing, technical scheme of the present invention is described further.
The Depth Priority Algorithm improved and the difference of traditional Depth Priority Algorithm are: traditional algorithm will to all paths communicated with starting point and vertex search complete till, and improvement Depth Priority Algorithm proposed by the invention searches for from some summits, search and can form a ring and then export and return to the summit of last layer, all path vertices of its all paths and summit and just starting point will be searched for each summit.
Calculate all loops.First the node in network topology G (V, E) is numbered process, wherein G is the directed graph that network topology is abstracted into, and V is node set, and E is limit set.Then in order to the depth-first search that node 1 improves, illustrate when searching identical with this node and occurred that loop then exports this ring, the node simultaneously returning the search on upper strata continues search, until searched for, the loop now comprising node 1 is all found.All limits of finally deleting this node and being connected with node, continue this search, very to can not find loop in figure to next node 2.
Specifically can be into: by abstract for optical-fiber network for non-directed graph G (V, E), V represent node set in optical-fiber network, E represent node between optical fiber link set, the numeral 1,2,3 of the node in network ..., m label represents.Variable u=1 is set, corresponding u represents figure G interior joint 1, set up the network loop queue { u} that node ID represents, adopt Depth Priority Algorithm, search the downstream neighboring node w of node u, if there is node w, w ∈ [1 in figure G, m] and w ≠ u, just node w is added loop queue obtain u, w}, then the queue of traverse node loop joint all of w go out to flow link, if the next node v that certain link points to is not in loop queue and v ≠ u, just the queue of expansion loop obtains { u, w, v}, the rest may be inferred, enters next layer depth first search; If node v=u, then current loop queue represents that from node u to v be a loop, exports this loop, then recalls deletion of node w in superincumbent loop queue, returns to upper strata and finds other node again depth-first search adjacent with upstream node u.One takes turns after above-mentioned Depth Priority Algorithm completes, and all rings comprising a u all find, and empty loop queue, make node ID u add 1, repeat above-mentioned traceback depth first search process, find all loops comprising new node u, then empty queue.The rest may be inferred, until by u=m, till finding all loops of all nodes.
Accompanying drawing 1 is for asking all loop algorithm flow graphs of directed graph, and its Depth Priority Algorithm step improved is described below:
Step1 reads in network topology G(V, E), being numbered node wherein, is 1 respectively, 2 ... i ... m.
Step2 carries out depth-first search for node m, arrives a some W it is stacked.
Step3 travel through W all go out limit, another end points going out limit corresponding is respectively v1v2 ... vJ.
Step4 judges that W's goes out some vj corresponding to limit whether in stack, then turns to Step5, otherwise turn to Step6 in stack.
Step5vj is in stack and vj equals m is then a ring from m to vj, and export this ring, if vj is not equal to m in stack, i=i+1 turns to Step4.
Step6 continues depth-first search, if searched for, algorithm terminates, otherwise turns to Step3.
By heuritic approach, multicast service is carried out to the method for segmentation, solve the Node Protection in multicast service and link protection problem, wherein Ci is the set storing link disjoint section, and each element in Ci is mutual link disjoint.S be to multicast service segmentation after the set of all sections of storage, i is the counter of link disjoint section set.Multicast service is divided into several 2 jumping crossover route segments, in units of 2 jumping route segments, carries out protection just can realize this 2 the jumping intermediate node of section and survivability of 2 links.First multicast service is abstracted into multicast tree, then from source node, carries out segmentation to every bar to the path of destination node, every 2 jump calculation does one section.Finally link disjoint process is carried out to the section be divided into, because same P can be used to enclose the condition of carrying out protecting is 2 route segments is link disjoint.
In optical network multicast, segmentation is carried out to the tree be abstracted into by business; because a link or node failure mean the fault of all sections that comprise this link or node, so it be them is link disjoint that 2 route segments can use same P to enclose the condition of carrying out protecting.Jump section for one 2 and comprise 2 links and their intermediate node, jump section to each 2 and carry out protecting the node link protection that just can reach whole multicast service.This process is:
Step 1: in light multicast service transmission, sets up the minimum multicast tree of a link cost according to network topology and source to all destination node multicast request.In this multicast tree, every bar source node is in the path of destination node, except source and destination node, on path, 2 links of other intermediate node and association thereof are just called one 2 jumping section, to find out in multicast tree graph on every bar source to destination node path all like this 2 jump sections, and exist in a set; And be stored in the link that source node associates with object in another 1 hop link set.Section is jumped in more above-mentioned set 2, merges 2 jumping sections identical in set.Define a route segment set, store all 2 and jump section and 1 jumping section.
Step 2 a: variable i is set, i=1 is put in initialization, define the section that a set bunch Ci is separated from each other for obtaining route segment set link in step 1, initialization set bunch Ci, in the route segment set that step 1 obtains, Stochastic choice one path segments X, if this route segment and Ci gather in route segment link disjoint, then this route segment X is stored in set Ci, and deletes this route segment in route segment set; Continue another path segments of Stochastic choice in route segment set, as stated above with set Ci more whether link disjoint, if so, in Ci set, store this route segment and delete this route segment in route segment set; Otherwise, in route segment set, mark this route segment, to route segment unmarked in route segment set, continue more whether with route segment link disjoint in set Ci, until all route segments are labeled or for empty set, if route segment set is empty set, algorithm terminates in route segment set; If route segment set non-NULL, then variable i adds 1, and cancels the label symbol of path label section in route segment, repeats above-mentioned steps, is stored in the path that route segment link is separated in new set Ci; The rest may be inferred, until route segment set is empty.
Optimal solution is asked from all loop set.Using all loop set as solution set, contrast the set of each link disjoint section, respectively by integral linear programming model, optimal solution is tried to achieve to the set of each link disjoint section, reach P and enclose the wavelength used and minimize.
Accompanying drawing 2 is the algorithm flow graph by heuritic approach, multicast service being carried out to segmentation.
Step1 initialization, i=1, link disjoint section set Ci are empty, and route segment set is S.
Step2 Stochastic choice one path segments s making marks from S, and Ci contrasts, if all elements is all link disjoint in Ci, then turns to Step3; Otherwise turn to Step4.
Step3 upgrades Ci and S, Ci=Ci ∪ s, and S=S-s, turns to Step2.
Whether Step4S is empty, be empty set then i=i+1 turn to Step2; Otherwise algorithm terminates.
Accompanying drawing 3 is the multicast tree fragmentation example figure be abstracted into multicast service.
As shown in Figure 3, S is source node, node for the purpose of d, and other are intermediate node, jumps into row segmentation to every bar source node S to the path of destination node d by 2, and that jumps less than 2 presses single-link process.Can find out, to the such segmentation of multicast service, in units of section, as long as guarantee these section protected, so just can ensure except source node and destination node all nodes and link in interior network all protected.Accompanying drawing 4 is that 2 jumping section P enclose protection schematic diagram, and (a) figure is P circle protection schematic diagram, and black heavy line is P circle.B () figure is cross-over connection segment protect schematic diagram, dotted line is faulty section, and band arrow black heavy line is Protection path, and can find out, P circle can provide 2 Protection paths for gap-bridging link, switches the business on any Protection path and again transmit after breaking down.C () figure is the upper segment protect schematic diagram of circle, dotted line is faulty section, and band arrow black heavy line is Protection path, switches the business on Protection path and complete protection after breaking down.Can find out, P circle can provide 1 Protection path for circle epimere.
Claims (3)
1. the static P of light multicast jumping section based on 2 encloses a segment protection method, it is characterized in that, by abstract for optical-fiber network for using node set
v,optical fiber link set
ethe figure represented
g(
v,
e), set up the multicast tree of minimum cost route according to multicast request, at figure
g(
v,
e) in other limit ring that can form on search taboo multicast tree limit, delete node and the limit of all rings, then look for loop, until scheme
g(
v,
e) in there is no loop; From source node, carry out segmentation to bar every in the loop found to the path of destination node, every 2 jump as one section; Multicast tree protection is divided into several 2 jumping crossover route segments, jumps in units of crossover route segments by 2 and carry out protecting the survivability realizing this 2 intermediate node and 2 links of jumping section to protect; Finally jump crossover road to be divided into 2 and carry out link disjoint process, occur simultaneously and just form P circle;
Search graph
g(
v,
e) in all rings, delete and have node and the limit of ring, until figure
g(
v,
e) in there is no loop, specifically comprise: (1) reads in network topology G(V, E), being numbered node wherein, is 1 respectively, 2 ... i ... m; (2) depth-first search is carried out for node m, arrive a some W it is stacked; (3) travel through W all go out limit, another end points going out limit corresponding is respectively v1, v2 ... vJ; (4) judge that W's goes out some vj corresponding to limit whether in stack, then turn in stack (5), otherwise turn to (6); (5) vj is in stack and vj equals m is then a ring from m to vj, and export this ring, if vj is not equal to m in stack, i=i+1 turns to (4); (6) depth-first search is continued, until do not have ring in figure.
2. method according to claim 1, it is characterized in that, described every 2 jumpings are specially as one section: for a paths from source node to destination node, every 2 jump path jumps section as one 2 and stores, continue next node to the destination node section of looking for, until can not find 2 jumping sections, the link form of pressing of jumping less than 2 stores.
3. method according to claim 1, is characterized in that, depth-first search is searched for from some summits, searches and can form a ring and then export and return to the summit of last layer.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310201713.XA CN103259590B (en) | 2013-05-27 | 2013-05-27 | A kind of light multicast static P circle segment protection method of jumping section based on 2 |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310201713.XA CN103259590B (en) | 2013-05-27 | 2013-05-27 | A kind of light multicast static P circle segment protection method of jumping section based on 2 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103259590A CN103259590A (en) | 2013-08-21 |
| CN103259590B true CN103259590B (en) | 2015-12-09 |
Family
ID=48963320
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310201713.XA Active CN103259590B (en) | 2013-05-27 | 2013-05-27 | A kind of light multicast static P circle segment protection method of jumping section based on 2 |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103259590B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103490810B (en) * | 2013-10-14 | 2016-08-17 | 重庆邮电大学 | The light multicast dynamic P circle 2 jumping segment protection method that a kind of wavelength convert scope is limited |
| CN104734950B (en) * | 2013-12-20 | 2019-04-26 | 中兴通讯股份有限公司 | The method and device that a kind of pair of PTN network business is protected |
| CN104967477B (en) * | 2015-06-26 | 2018-03-13 | 南京邮电大学 | Optical-fiber network intelligence P circle guard methods based on multicast service |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101909223A (en) * | 2009-10-27 | 2010-12-08 | 北京邮电大学 | Resource-based WDM optical network path protective P-cycle optimized configuration method |
| US7852750B2 (en) * | 2007-09-04 | 2010-12-14 | Grover Wayne D | Self-fault isolation in transparent P-cycle networks |
| CN102044869A (en) * | 2009-10-13 | 2011-05-04 | 上海电机学院 | Special topology analysis method and device for distribution network |
-
2013
- 2013-05-27 CN CN201310201713.XA patent/CN103259590B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7852750B2 (en) * | 2007-09-04 | 2010-12-14 | Grover Wayne D | Self-fault isolation in transparent P-cycle networks |
| CN102044869A (en) * | 2009-10-13 | 2011-05-04 | 上海电机学院 | Special topology analysis method and device for distribution network |
| CN101909223A (en) * | 2009-10-27 | 2010-12-08 | 北京邮电大学 | Resource-based WDM optical network path protective P-cycle optimized configuration method |
Non-Patent Citations (3)
| Title |
|---|
| 一种新的广域网组播树生成算法;喻建平等;《深圳大学学报》;20010630;第18卷(第2期);10-18 * |
| 光网络P圈保护方法分析;王杨杨等;《数字通信》;20121231(第6期);12-14、46 * |
| 孙翔等.基于SRLG约束和资源共享的交迭段保护机制研究.《光子学报》.2009,第38卷(第6期),1386-1390. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103259590A (en) | 2013-08-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102124704B (en) | Across numeral and the link-diversity of optics pass-thru node and load balance | |
| CN104521191A (en) | Hierarchal label distribution and route installation in a loop-free routing topology using routing arcs at multiple hierarchal levels for ring topologies | |
| US10587472B2 (en) | Highly reliable path accommodation design apparatus and method | |
| CN104734950B (en) | The method and device that a kind of pair of PTN network business is protected | |
| CN102281193B (en) | Method and fiber channel (FC) equipment for realizing message forwarding in fiber channel network | |
| CN104521192A (en) | Techniques for flooding optimization for link state protocols in a network topology | |
| CN103765808A (en) | Utility communication method and system | |
| CN106549779A (en) | A kind of maximum non-intersect double route collocation method of multiple constraint energy communication service | |
| CN102594688B (en) | Method and system for network routing selection | |
| CN103259590B (en) | A kind of light multicast static P circle segment protection method of jumping section based on 2 | |
| CN102315967A (en) | Intermediate node protection method for multicast label switched path and device | |
| CN105978811B (en) | A kind of route selecting method and device based on business transmission | |
| CN101478705B (en) | Survivable service flow conducting method based on interlayer message routing | |
| CN102143410B (en) | Path computing method and unit in optical network | |
| CN103490933A (en) | Method for protecting and restoring service comprising inevitable nodes | |
| CN102026051B (en) | Layered virtual topology-based cross-granularity layer survivability method | |
| CN103490810B (en) | The light multicast dynamic P circle 2 jumping segment protection method that a kind of wavelength convert scope is limited | |
| CN102143076B (en) | Multi-protection stacking protection group realization method and device | |
| WO2012103852A2 (en) | Method and device for wavelength-division multiplexing network planning | |
| CN102325039A (en) | ASON (Automatically Switched Optical Network) optimization design method orienting to electric power control business | |
| CN104967477B (en) | Optical-fiber network intelligence P circle guard methods based on multicast service | |
| Mohandespour et al. | 1+ N protection in polynomial time: a heuristic approach | |
| CN100454907C (en) | Method and device for realizing elastic sectionalization ring guiding protective inverting | |
| CN103166861A (en) | Method of solving layering multicast maximum throughput of optical network | |
| US9007892B2 (en) | Apparatus and method to find partially disjoint routes for dual fiber-cuts |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220121 Address after: 401120 b1-16-1, No. 76 Xingguang Avenue, gaoxinyuan, North New Area, Yubei District, Chongqing Patentee after: CHONGQING INFORMATION TECHNOLOGY DESIGNING CO.,LTD. Address before: 400065 Chongqing Nan'an District huangjuezhen pass Chongwen Road No. 2 Patentee before: CHONGQING University OF POSTS AND TELECOMMUNICATIONS |
|
| TR01 | Transfer of patent right |