CN105262535A - Monitoring trace design method based on random next node in all optical network - Google Patents
Monitoring trace design method based on random next node in all optical network Download PDFInfo
- Publication number
- CN105262535A CN105262535A CN201510718599.7A CN201510718599A CN105262535A CN 105262535 A CN105262535 A CN 105262535A CN 201510718599 A CN201510718599 A CN 201510718599A CN 105262535 A CN105262535 A CN 105262535A
- Authority
- CN
- China
- Prior art keywords
- node
- mark
- monitoring
- optical network
- distinguish
- 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
Abstract
The present invention discloses a monitoring trace design method based on a random next node in an all optical network. The monitoring trace design method aims at monitoring and positioning for multi-link failures caused by node failure in the all optical network. Through adoption of the monitoring trace design method, legal monitoring traces can be generated in various all optical network topologies, and service quality required by users can be satisfied, thereby achieving monitoring and quick positioning for failures in a high-capacity all optical network; during actual algorithm operation, the monitoring trace design method gets rid of limiting of a network topology environment through a random algorithm, and simultaneously has the properties of simple logic and low algorithm complexity.
Description
Technical field
The invention belongs to malfunction monitoring and quick location technique field in all-optical network, more specifically say, relate to the monitoring mark method for designing based on random next node in a kind of all-optical network.
Background technology
Along with development and the popularization of WDM (Wavelength-DivisionMultiplexing) technology and Optic network technology, the data carrying capabilities in telecommunication network is explosive growth, and in network, data traffic there has also been and increases significantly.The development pole the earth of these technology improves data transmission efficiency, and the data service of the short time simultaneously also making network failure cause was lost efficacy and brought mass data to lose, and made all-optical network very responsive for the inefficacy of short time.Therefore, to introduce in all-optical network effectively and malfunction monitoring and location mechanism become particularly important fast.
Multilink fault location more complicated, so in previous achievement in research, most of achievement all thinks that multilink fault can not occur, and then only considers the situation of single link failure.In real network, the form of fault is varied.
Meanwhile, as simple monitoring ring and complicated monitoring loop technique are subject to the impact of network topology toroidal confinement all the time in the Monitoring and Positioning technology of existing physically based deformation layer; And monitor the concept that mark belongs to newer, achievement in research relevant is at present also fewer, therefore, still also has a lot of theories and technical problem to require study for monitoring mark technology.
Summary of the invention
The object of the invention is to overcome the deficiencies in the prior art, monitoring mark method for designing based on random next node strategy in a kind of all-optical network is provided, the constraint of network topology environment has been broken away from by random algorithm, legal monitoring mark can be generated in various all-optical network topology, there is the performance that logic is simple, computational complexity is low simultaneously.
For achieving the above object, based on the monitoring mark method for designing of random next node in a kind of all-optical network of the present invention, it is characterized in that, comprise the following steps:
(1), to the node to be monitored in all-optical network carry out initialization, obtain distinguishing node set AS0;
(2), Stochastic choice can not distinguish a node v in node set AS0 as jth (j=0,1,2 ..., J-1) and bar monitoring mark t
jstart node;
(3), using node v as datum mark, select a node in all-optical network topology to absorb according to jump algorithm under Weighted random and enter monitoring mark t
j, make monitoring mark t
jlength add 1, newly will be absorbed into monitoring mark t simultaneously
jnode as new datum mark V;
(4) monitoring mark t, is judged
jit is up to standard whether length accords with, if length is not up to standard, then with new datum mark V for benchmark repeated execution of steps (3), otherwise export this monitoring mark t
j, perform step (5);
(5), according to the monitoring mark t disposed
jupgrade alarm code Table A CT and can not node set AS0 be distinguished;
(6), judge can not distinguish whether node set AS0 is empty set after upgrading, if the AS0 after upgrading is empty set, then exports ACT and the monitoring cost MonitoringCost of this group monitoring mark and correspondence, and to terminate; If the AS0 after upgrading not is empty set, then makes j=j+1, then return step (2).
Further, in described step (3), under Weighted random, the concrete grammar of jump algorithm is:
(3.1), find all neighborss of datum mark v, form set A D;
(3.2) all nodes, in traversal set A D, by the nodes distinguished all in AD and monitoring mark t
jthe node revocation of process, forms new set A D ';
(3.3), judge whether AD ' set is empty, if set A D '=Ф, then performs step (3.4); If set A D ' ≠ Ф, then jump to step (3.5);
(3.4), nearest down hop is found according to dijkstra's algorithm
Utilize in dijkstra's algorithm Calculation Basis point v to all-optical network topology and monitor mark t
jwithout all distances can not distinguishing node, and according to distance value, by distance datum mark v nearest can not distinguishing, node is included in can not distinguish node set recently, and random from distinguishing node set that selecting one can not distinguish node recently, then using the datum mark v calculated by dijkstra's algorithm to this can not distinguish shortest path node the neighbors of datum mark v of process monitor mark t as adding
jdown hop, under Weighted random, jump algorithm terminates;
(3.5), from set A D ', random selecting one node, as down hop, and joins monitoring mark t
jin, under Weighted random, jump algorithm terminates.
Wherein, in described step (4), judge monitoring mark t
jwhether length accords with and reaches calibration method and be:
One length parameter Length is set, in actual deployment process, if monitoring mark t
jlength equal length parameter Length or monitoring mark t
jin comprise can not distinguish that interstitial content is can not distinguish interstitial content half in AS0 set, then monitor mark t
jlength is up to standard.
Further, in described step (5), upgrade alarm code Table A CT and can not distinguish that the method for node set AS0 is:
(5.1) alarm code Table A CT, is upgraded
In set of node to be monitored, mark t will be monitored
jintermediate code corresponding to the node of process increases by one 1, and the intermediate code corresponding to other nodes is increased by one 0, then is kept in new alarm code Table A CT by the intermediate code of all nodes and correspondence thereof;
(5.2), upgrade and can not distinguish node set AS0
Traversal can not distinguish all nodes in node set AS0, if some nodes have unique intermediate code, then mark this node for node can be distinguished, and this node is removed and can not distinguish node set AS0, after traversal completes, namely formed upgrade after can not distinguish node set AS0.
Goal of the invention of the present invention is achieved in that
Based on the monitoring mark method for designing of random next node strategy in a kind of all-optical network of the present invention, to lose efficacy the monitoring of the multilink fault associated therewith caused and location for all optical network road interior joint, utilize method set forth in the present invention, legal monitoring mark can be generated in various all-optical network topology, and the service quality of meeting consumers' demand, realize the malfunction monitoring in jumbo all-optical network, quick position.In the algorithm of reality runs, the present invention has broken away from the constraint of network topology environment by random algorithm, has the performance that logic is simple, computational complexity is low simultaneously.
Accompanying drawing explanation
Fig. 1 is the topology diagram of an all-optical network;
Fig. 2 is the monitoring mark method for designing flow chart based on random next node strategy in all-optical network of the present invention;
Fig. 3 is the flow chart of jumping under finding Weighted random.
Embodiment
Below in conjunction with accompanying drawing, the specific embodiment of the present invention is described, so that those skilled in the art understands the present invention better.Requiring particular attention is that, in the following description, when perhaps the detailed description of known function and design can desalinate main contents of the present invention, these are described in and will be left in the basket here.
Fig. 1 is the topology diagram of an all-optical network.
In the present embodiment, as shown in Figure 1, provide an all-optical network topology at random, it comprises 6 node 1-6 and 8 links to be monitored, and wherein, every bar link metric is all 1 mutually, and both link ends represents this link with nodal scheme, parameters Length=3.Topology according to Fig. 1, carries out the deployment of monitoring mark according to the method described in the present invention, thus completes failure monitor and the location of monitoring link.
Fig. 2 is the monitoring mark method for designing flow chart based on random next node strategy in all-optical network of the present invention;
In the present embodiment, as shown in Figure 2, based on the monitoring mark method for designing of random next node strategy in a kind of all-optical network of the present invention, comprise the following steps:
S1: carry out initialization to the node to be monitored in all-optical network, obtains distinguishing node set AS0;
In the present embodiment, to 6 node initializing to be monitored in the all-optical network topology shown in Fig. 1, obtain can not distinguishing node set AS0, AS0={1,2,3,4,5,6}.
S2: Stochastic choice can not distinguish a node v in node set AS0 as jth (j=0,1,2 ..., J-1) and bar monitoring mark t
jstart node, wherein, J is number of detectors;
In the present embodiment, Stochastic choice node 4 is as monitoring mark t
0start node.
S3: using node 4 as datum mark, selects a node in all-optical network topology to absorb according to jump algorithm under Weighted random and enters monitoring mark t
0, make monitoring mark t
0length add 1; To newly be absorbed into monitoring mark t simultaneously
0node as new datum mark V;
Wherein, as shown in Figure 3, under random weighting, the concrete steps of jump algorithm are as follows:
S3.1: all neighborss finding current place node, forms set A D;
In the present embodiment, for the node 4 in the all-optical network topology shown in Fig. 1, its neighbors is node 3, then set A D={3}.
S3.2: all nodes in traversal set A D, by the nodes distinguished all in AD and monitoring mark t
jthe node revocation of process, forms new set A D ';
In the present embodiment, node 3 can not be distinguished, and not by t
0process, therefore new set A D '={ 3}.
S3.3: judge whether AD ' set is empty, if set A D '=Ф, then performs step S3.4, if set A D ' ≠ Ф, then jumps to step S3.5;
S3.4: find nearest down hop according to dijkstra's algorithm
Utilize in dijkstra's algorithm Calculation Basis point 4 to all-optical network topology and monitor mark t
0without all distances can not distinguishing node, and according to distance value, by distance datum mark 4 nearest can not distinguishing, node is included in can not distinguish node set recently, and random from distinguishing node set that selecting one can not distinguish node recently, then using the datum mark 4 calculated by dijkstra's algorithm to this can not distinguish shortest path node the neighbors of datum mark 4 of process monitor mark t as adding
0down hop, under Weighted random, jump algorithm terminates;
S3.5: random selecting one node is as down hop from set A D ', and join monitoring mark t
0in, under Weighted random, jump algorithm terminates;
In the present embodiment, because AD '={ 3} ≠ Ф, therefore jumps to step S3.5, namely chooses node 3 as down hop from set A D ', and joins monitoring mark t
0in, under Weighted random, jump algorithm terminates.
Summarizing whole step S3 known, is that node 3 is absorbed into t in the present embodiment
0, and as new datum mark V, and t
0length adds 1 becomes 1.
S4: judge monitoring mark t
0whether length meets length requirement, if length is not up to standard, then with new datum mark V for benchmark repeats S3, otherwise export this monitoring mark t
0, perform step S5.
In the present embodiment, t
0length is 1, comprises and can not distinguish that interstitial content is 2; And Length=3, and | AS0|/2=3; Therefore t
0length is not up to standard, need repeat S3.
Using node 3 as datum mark, repeat according to the method for step S3, concrete implementation does not repeat them here, until work as t
0length is 2, comprises and can not distinguish that interstitial content is 3; And Length=3, and | during AS0|/2=3, t
0length is up to standard, performs S5, now obtains monitoring mark t
0=43,35.
S5: upgrade and can not distinguish set of node AS0 and alarm code Table A CT (AlarmingCodeTable)
S5.1: upgrade alarm code Table A CT
In set of node to be monitored, mark t will be monitored
0intermediate code corresponding to the node of process increases by one 1, and the intermediate code corresponding to other nodes is increased by one 0, then is kept in new alarm code Table A CT by the intermediate code of all nodes and correspondence thereof;
In the present embodiment, t
0through node 3,4,5, so node 3,4, the intermediate code corresponding to 5 increases by one 1, becomes 1; Node 1,2, the intermediate code of 6 increases by one 0, becomes 0.Therefore t
0whole node set is divided into 2 and is respectively that { 3,4,5}, { 1,2,6}, the intermediate code of their correspondence is 1,0.
S5.2: upgrade and can not distinguish set of node AS0
Traversal can not distinguish all nodes in node set AS0, if some nodes have unique intermediate code, wherein, intermediate code can not be 0, because 0 is illegal alarm code, then marks this node for node can be distinguished, and this node is removed and can not distinguish node set AS0, after traversal completes, obtain upgrade after can not distinguish node set AS0;
In the present embodiment, monitoring mark t is added
0after, node 3,4, the intermediate code of 5 is 1, node 1,2, and the intermediate code of 6 is 0, does not have node to have unique intermediate code, so upgrade after can not distinguish node set AS0={1,2,3,4,5,6}.
S6: judge can not distinguish whether node set AS0 is empty set after upgrading, if the AS0 after upgrading is empty set, then exports ACT and the monitoring cost of this group monitoring mark and correspondence, and to terminate; If the AS0 after upgrading not is empty set, then makes j=j+1, then return step S2.Wherein, the computing formula of monitoring cost is:
monitoring_cost＝γ*J+Σ|t
j|
Wherein, γ is the input parameter of monitor, which determines the proportion between monitor cost and bandwidth cost; J is number of detectors; Σ | t
j| represent and dispose all sums of the wavelength shared by monitoring mark;
In the present embodiment, AS0={1,2,3,4,5,6} are not empty set, therefore by j=0+1=1, return step S2, start according to the method described above to dispose a new monitoring mark t
1, until AS0 is empty set, then terminate.
Although be described the illustrative embodiment of the present invention above; so that those skilled in the art understand the present invention; but should be clear; the invention is not restricted to the scope of embodiment; to those skilled in the art; as long as various change to limit and in the spirit and scope of the present invention determined, these changes are apparent, and all innovation and creation utilizing the present invention to conceive are all at the row of protection in appended claim.
Claims (5)
1. in all-optical network based on a monitoring mark method for designing for random next node, it is characterized in that, comprise the following steps:
(1), to the node to be monitored in all-optical network carry out initialization, obtain distinguishing node set AS0;
(2), Stochastic choice can not distinguish a node v in node set AS0 as jth (j=0,1,2 ..., J-1) and bar monitoring mark t
jstart node;
(3), using node v as datum mark, select a node in all-optical network topology to absorb according to jump algorithm under Weighted random and enter monitoring mark t
j, make monitoring mark t
jlength add 1, newly will be absorbed into monitoring mark t simultaneously
jnode as new datum mark V;
(4) monitoring mark t, is judged
jit is up to standard whether length accords with, if length is not up to standard, then with new datum mark V for benchmark repeated execution of steps (3), otherwise export this monitoring mark t
j, perform step (5);
(5), according to the monitoring mark t disposed
jupgrade alarm code Table A CT and can not node set AS0 be distinguished;
(6), judge that the not cocoa after upgrading distinguishes whether node set AS0 is empty set, if the AS0 after upgrading is empty set, then exports ACT and the monitoring cost MonitoringCost of this group monitoring mark and correspondence, and terminate; If the AS0 after upgrading not is empty set, then makes j=j+1, then return step (2).
2. in a kind of all-optical network according to claim 1 based on the monitoring mark method for designing of random next node, it is characterized in that, in described step (3), under Weighted random, the concrete grammar of jump algorithm is:
(2.1), find all neighborss of datum mark v, form set A D;
(2.2) all nodes, in traversal set A D, by the nodes distinguished all in AD and monitoring mark t
jthe node revocation of process, forms new set A D ';
(2.3), judge whether AD ' set is empty, if set A D '=Ф, then performs step (2.4); If set A D ≠ Ф, then jump to step (2.5);
(2.4), nearest down hop is found according to dijkstra's algorithm
Utilize in dijkstra's algorithm Calculation Basis point v to all-optical network topology and monitor mark t
jwithout all distances can not distinguishing node, and according to distance value, by distance datum mark v nearest can not distinguishing, node is included in can not distinguish node set recently, and random from distinguishing node set that selecting one can not distinguish node recently, then using the datum mark v calculated by dijkstra's algorithm to this can not distinguish shortest path node the neighbors of datum mark v of process monitor mark t as adding
jdown hop, under Weighted random, jump algorithm terminates;
(2.5), from set A D ', random selecting one node, as down hop, and joins monitoring mark t
jin, under Weighted random, jump algorithm terminates.
3. in a kind of all-optical network according to claim 1 based on the monitoring mark method for designing of random next node, it is characterized in that, in described step (4), judge whether monitoring mark t length accords with and reach calibration method and be:
One length parameter Length is set, in actual deployment process, if monitoring mark t
jlength equal length parameter Length or monitoring mark t
jin comprise can not distinguish that interstitial content is can not distinguish interstitial content half in AS0 set, then monitor mark t
jlength is up to standard.
4. in a kind of all-optical network according to claim 1 based on the monitoring mark method for designing of random next node, it is characterized in that, in described step (5), upgrade alarm code Table A CT and can not distinguish that the method for node set AS0 is:
(4.1) alarm code Table A CT, is upgraded
In set of node to be monitored, mark t will be monitored
jintermediate code corresponding to the node of process increases by one 1, and the intermediate code corresponding to other nodes is increased by one 0, then is kept in new alarm code Table A CT by the intermediate code of all nodes and correspondence thereof;
(4.2), upgrade and can not distinguish node set AS0
Traversal can not distinguish all nodes in node set AS, if some nodes have unique intermediate code, then mark this node for node can be distinguished, and this node is removed and can not distinguish node set AS0, after traversal completes, obtain upgrade after can not distinguish node set AS0.
5. in a kind of all-optical network according to claim 1 based on the monitoring mark method for designing of random next node, it is characterized in that, in described step (6), monitoring cost monitoring_cost computing formula be:
monitoring_cost＝γ*J+Σ|t
j|
Wherein, γ is the input parameter of monitor, which determines the proportion between monitor cost and bandwidth cost; J is number of detectors; Σ | t
j| represent and dispose all sums of the wavelength shared by monitoring mark.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510718599.7A CN105262535B (en) | 2015-10-29 | 2015-10-29 | Monitoring mark method for designing based on random next node in a kind of all-optical network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510718599.7A CN105262535B (en) | 2015-10-29 | 2015-10-29 | Monitoring mark method for designing based on random next node in a kind of all-optical network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105262535A true CN105262535A (en) | 2016-01-20 |
| CN105262535B CN105262535B (en) | 2017-07-18 |
Family
ID=55102066
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510718599.7A Expired - Fee Related CN105262535B (en) | 2015-10-29 | 2015-10-29 | Monitoring mark method for designing based on random next node in a kind of all-optical network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105262535B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030172289A1 (en) * | 2000-06-30 | 2003-09-11 | Andrea Soppera | Packet data communications |
| CN101841442A (en) * | 2010-02-08 | 2010-09-22 | 电子科技大学 | Method for detecting network anomaly in name-address separated network |
-
2015
- 2015-10-29 CN CN201510718599.7A patent/CN105262535B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030172289A1 (en) * | 2000-06-30 | 2003-09-11 | Andrea Soppera | Packet data communications |
| CN101841442A (en) * | 2010-02-08 | 2010-09-22 | 电子科技大学 | Method for detecting network anomaly in name-address separated network |
Non-Patent Citations (3)
| Title |
|---|
| J.TAPOLCAI, ET AL.,: "On monitoring and failure localization in mesh all-optical networks", 《IEEE INFOCOM"09》 * |
| Y. M. ZHAO, ET AL.,: "A new heuristic for monitoring trail allocation in all-optical WDM networks", 《IEEE GLOBECOM"10》 * |
| 曹艳艳: "全光网络快速故障定位中的监测迹研究", 《中国优秀硕士学位论文全文数据库》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105262535B (en) | 2017-07-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8451744B2 (en) | Partitioning directed acyclic graph (DAG) topologies | |
| US9608900B2 (en) | Techniques for flooding optimization for link state protocols in a network topology | |
| CN107682211A (en) | A kind of network topology structure determination method, device and computer-readable recording medium | |
| CN106792912B (en) | A kind of improvement method for routing and device based on AODV | |
| CN104579775A (en) | Resource allocation method and device for electric power communication optical fibers and optical transmission devices | |
| JP2011077954A (en) | Route control method, route control system and route control program | |
| CN102355464B (en) | Construction method of survivable Overlay network | |
| CN112565940B (en) | Optical fiber path planning method and device for optical fiber network | |
| WO2010127527A1 (en) | Method and apparatus for implementing k-shortest paths algorithm in the case of existing multiple edges between adjacent nodes | |
| CN109905784A (en) | A kind of traffic reconfiguration method and apparatus of optical-fiber network Wavelength Assignment | |
| CN108259195A (en) | The determining method and system of the coverage of anomalous event | |
| CA2743466A1 (en) | Path calculation order deciding method, program and calculating apparatus | |
| CN103179035A (en) | Optical transmission network and method and device for selecting fixed routes thereof | |
| CN110290001A (en) | Single-stranded structure optimization method, device and the equipment of power telecom network | |
| JP6293487B2 (en) | Network design method and system | |
| CN105262535A (en) | Monitoring trace design method based on random next node in all optical network | |
| JP7322951B2 (en) | Routing control device, routing control method, program, and network system | |
| CN103428087B (en) | The longest path preset protection P using depth of round first traversal encloses generation method | |
| WO2017101981A1 (en) | A method for constructing srlg-disjoint paths under qos constraints | |
| CN103259590B (en) | A kind of light multicast static P circle segment protection method of jumping section based on 2 | |
| CN105491638A (en) | Routing method of intelligent anti-slide system | |
| GB2537085A (en) | Determining bandwidth requirements for network services | |
| CN104506427B (en) | More new control method and update control apparatus | |
| CN103763191B (en) | Intra-domain multipath generating method based on spanning tree | |
| CN103019862B (en) | A kind of symbolic excution methodology, Apparatus and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| 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: 20170718 Termination date: 20201029 |