CN105262535B - Monitoring mark method for designing based on random next node in a kind of all-optical network - Google Patents

Monitoring mark method for designing based on random next node in a kind of all-optical network Download PDF

Info

Publication number
CN105262535B
CN105262535B CN201510718599.7A CN201510718599A CN105262535B CN 105262535 B CN105262535 B CN 105262535B CN 201510718599 A CN201510718599 A CN 201510718599A CN 105262535 B CN105262535 B CN 105262535B
Authority
CN
China
Prior art keywords
node
mark
monitoring
distinguishable
set
Prior art date
Application number
CN201510718599.7A
Other languages
Chinese (zh)
Other versions
CN105262535A (en
Inventor
任婧
邹欣钰
袁加宇
徐世中
赵阳明
陈欢
王阳
王雄
Original Assignee
电子科技大学
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 电子科技大学 filed Critical 电子科技大学
Priority to CN201510718599.7A priority Critical patent/CN105262535B/en
Publication of CN105262535A publication Critical patent/CN105262535A/en
Application granted granted Critical
Publication of CN105262535B publication Critical patent/CN105262535B/en

Links

Abstract

The invention discloses the monitoring mark method for designing based on random next node in a kind of all-optical network, for the monitoring and positioning of multilink fault associated therewith caused by the failure of all optical network road interior joint, utilize method set forth in the present invention, legal monitoring mark can be generated in various all-optical networks topology, and the service quality of user's request is met, realize the malfunction monitoring in the all-optical network of Large Copacity, quickly position;In actual algorithm operation, the present invention has broken away from the constraint of network topology environment by random algorithm, while having the performance that logic is simple, computational complexity is low.

Description

Monitoring mark method for designing based on random next node in a kind of all-optical network

Technical field

The invention belongs to malfunction monitoring in all-optical network and quick location technique field, more specifically, it is related to one kind Monitoring mark method for designing based on random next node in all-optical network.

Background technology

With WDM (Wavelength-Division Multiplexing) technologies and Optic network technology development and push away Extensively, the data carrying capabilities in telecommunication network are in explosive growth, and data traffic, which there has also been, in network significantly increases It is long.The development of these technologies greatly improves data transmission efficiency, while also causing the number of short time caused by network failure Mass data is brought to lose according to service failure so that all-optical network is very sensitive for the failure of short time.Therefore, in all optical network Effective and quick malfunction monitoring and location mechanism are introduced in network becomes particularly important.

Multilink fault positioning is more complicated, so in previous achievement in research, most of achievements all think multilink Failure will not occur, and then only consider the situation of single link failure.In real network, the form of failure is varied.

Meanwhile, in the existing monitoring location technology based on physical layer such as simple monitoring ring and complicated monitoring loop technique all the time Influenceed by network topology toroidal confinement;And the concept that mark belongs to newer is monitored, presently relevant achievement in research is also fewer, Therefore, many theoretical and technical problems still require study for monitoring mark technology.

The content of the invention

It is an object of the invention to overcome the deficiencies of the prior art and provide random next node is based in a kind of all-optical network The monitoring mark method for designing of strategy, the constraint of network topology environment has been broken away from by random algorithm, can have been opened up in various all-optical networks The legal monitoring mark of middle generation is flutterred, while having the performance that logic is simple, computational complexity is low.

For achieving the above object, the monitoring mark design side based on random next node in a kind of all-optical network of the invention Method, it is characterised in that comprise the following steps:

(1), the node to be monitored in all-optical network is initialized, not distinguishable node set AS0 is obtained;

(2) a node v in not distinguishable node set AS0, is randomly choosed as jth (j=0,1,2 ..., J-1) bar prison Survey mark tjStart node;

(3), using node v as datum mark, a section in all-optical network topology is selected according to jump algorithm under Weighted random Point is absorbed into monitoring mark tj, make monitoring mark tjLength add 1, while monitoring mark t new will be absorbed intojNode be used as new base V on schedule;

(4) monitoring mark t, is judgedjIt is up to standard whether length accords with, if length is not up to standard, is repeated on the basis of new datum mark V Step (3) is performed, this monitoring mark t is otherwise exportedj, perform step (5);

(5), according to the monitoring mark t of deploymentjUpdate alarm code Table A CT and not distinguishable node set AS0;

(6), judge whether the not distinguishable node set AS0 after updating is empty set, if the AS0 after updating is empty set, Group monitoring mark and corresponding ACT and monitoring cost Monitoring Cost are exported, and is terminated;If the AS0 after updating is not Empty set, then make j=j+1, returns again to step (2).

Further, in the step (3), the specific method of jump algorithm is under Weighted random:

(3.1) datum mark v all neighbors, are found, set AD is constituted;

(3.2), all nodes in traversal set AD, by distinguishable node all in AD and monitoring mark tjPass through Node revocation, form new set AD ';

(3.3) whether be empty, if set AD '=Ф if, judging AD ' set, performs step (3.4);If set AD ' ≠ Ф, then jump to step (3.5);

(3.4) nearest next-hop, is found according to dijkstra's algorithm

Using dijkstra's algorithm calculating benchmark point v mark t is monitored into all-optical network topologyjWithout it is all not distinguishable The distance of node, and the not distinguishable node nearest apart from datum mark v is included by not distinguishable node set recently according to distance value, and A not distinguishable node, then the datum mark that will be calculated by dijkstra's algorithm are selected from not distinguishable node set recently at random The neighbors for the datum mark v that v is passed through to the shortest path between the not distinguishable node is used as addition monitoring mark tjNext-hop, Jump algorithm terminates under Weighted random;

(3.5) node, is randomly selected from set AD ' as next-hop, and is added to monitoring mark tjIn, Weighted random Lower jump algorithm terminates.

Wherein, in the step (4), monitoring mark t is judgedjWhether length is accorded with up to calibration method:

One length parameter Length is set, during actual deployment, if monitoring mark tjLength be equal to length parameter Length or monitoring mark tjIn the not distinguishable interstitial content that includes gather for AS0 in not distinguishable interstitial content half, then supervise Survey mark tjLength is up to standard.

Further, in the step (5), alarm code Table A CT and not distinguishable node set AS0 method is updated For:

(5.1) alarm code Table A CT, is updated

In set of node to be monitored, mark t will be monitoredjIntermediate code corresponding to the node of process increases by one 1, and other are saved The corresponding intermediate code of point increases by one 0, then all nodes and its corresponding intermediate code are stored in new alarm code Table A CT;

(5.2) not distinguishable node set AS0, is updated

All nodes in the not distinguishable node set AS0 of traversal, if some node has unique intermediate code, are marked The node is distinguishable node, and the node is removed into not distinguishable node set AS0, after the completion of traversal, that is, is formed after updating Not distinguishable node set AS0.

What the goal of the invention of the present invention was realized in:

Monitoring mark method for designing based on random next node strategy in a kind of all-optical network of the present invention, for all optical network road The monitoring and positioning of multilink fault associated therewith caused by interior joint failure, can using method set forth in the present invention To generate legal monitoring mark in various all-optical networks topology, and the service quality of user's request is met, realized Malfunction monitoring, quick positioning in the all-optical network of Large Copacity.In actual algorithm operation, the present invention is put by random algorithm The constraint of network topology environment is taken off, while having the performance that logic is simple, computational complexity is low.

Brief description of the drawings

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 to find the flow chart jumped under Weighted random.

Embodiment

The embodiment to the present invention is described below in conjunction with the accompanying drawings, so as to those skilled in the art preferably Understand the present invention.Requiring particular attention is that, in the following description, when known function and design detailed description perhaps When can desalinate the main contents of the present invention, these descriptions will be ignored herein.

Fig. 1 is the topology diagram of an all-optical network.

In the present embodiment, as shown in figure 1, providing an all-optical network topology at random, it includes 6 node 1- to be monitored 6 and 8 links, wherein, each of the links weights are all mutually 1, and both link ends represent the link, arrange parameter with nodal scheme Length=3.Topology according to Fig. 1, is monitored the deployment of mark according to the method described in the present invention, so as to complete monitoring The failure monitor of link and positioning.

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 Fig. 2 monitoring based on random next node strategy in a kind of all-optical network of the invention Mark method for designing, comprises the following steps:

S1:Node to be monitored in all-optical network is initialized, not distinguishable node set AS0 is obtained;

In the present embodiment, to 6 node initializings to be monitored in the all-optical network topology shown in Fig. 1, obtaining can not Distinguish node set AS0, AS0={ 1,2,3,4,5,6 }.

S2:A node v in the not distinguishable node set AS0 of random selection is used as jth (j=0,1,2 ..., J-1) bar monitoring Mark tjStart node, wherein, J is number of detectors;

In the present embodiment, random selection node 4 is used as monitoring mark t0Start node.

S3:Using node 4 as datum mark, a node in all-optical network topology is selected according to jump algorithm under Weighted random It is absorbed into monitoring mark t0, make monitoring mark t0Length add 1;Simultaneously monitoring mark t is absorbed into by new0Node be used as new benchmark Point V;

Wherein, as shown in figure 3, jump algorithm is comprised the following steps that under random weighting:

S3.1:All neighbors for being currently located node are found, set AD is constituted;

In the present embodiment, for the node 4 in the all-optical network topology shown in Fig. 1, its neighbors is node 3, then collects Close AD={ 3 }.

S3.2:All nodes in set AD are traveled through, by distinguishable node all in AD and monitoring mark tjPass through Node revocation, form new set AD ';

In the present embodiment, node 3 is not distinguishable, and not by t0By, therefore new set AD '={ 3 }.

S3.3:Whether be empty, if set AD '=Ф if judging AD ' set, performs step S3.4, if set AD ' ≠ Ф, Then jump to step S3.5;

S3.4:Nearest next-hop is found according to dijkstra's algorithm

Using dijkstra's algorithm calculating benchmark point 4 mark t is monitored into all-optical network topology0Without it is all not distinguishable The distance of node, and the not distinguishable node nearest apart from datum mark 4 is included by not distinguishable node set recently according to distance value, and A not distinguishable node, then the datum mark that will be calculated by dijkstra's algorithm are selected from not distinguishable node set recently at random The neighbors of 4 datum marks 4 passed through to the shortest path between the not distinguishable node is used as addition monitoring mark t0Next-hop, Jump algorithm terminates under Weighted random;

S3.5:A node is randomly selected from set AD ' as next-hop, and is added to monitoring mark t0In, Weighted random Lower jump algorithm terminates;

In the present embodiment, due to AD '={ 3 } ≠ Ф, therefore step S3.5 is jumped to, i.e., section is chosen from set AD ' Point 3 is added to monitoring mark t as next-hop0In, jump algorithm terminates under Weighted random.

Summarize whole step S3 to understand, be that node 3 is absorbed into t in the present embodiment0, and as new datum mark V, and t0Length, which adds 1, turns into 1.

S4:Judge monitoring mark t0Whether length meets length requirement, if length is not up to standard, using new datum mark V as base Standard repeats S3, otherwise exports this monitoring mark t0, perform step S5.

In the present embodiment, t0Length is 1, is 2 comprising not distinguishable interstitial content;And Length=3, and | AS0 |/2= 3;Therefore t0Length is not up to standard, need to repeat S3.

Using node 3 as datum mark, repeated according to step S3 method, specific implementation procedure will not be repeated here, Until working as t0Length is 2, is 3 comprising not distinguishable interstitial content;And Length=3, and | AS0 | during/2=3, t0Length is up to standard, holds Row S5, now obtains monitoring mark t0=43,35.

S5:Update not distinguishable set of node AS0 and alarm code Table A CT (Alarming Code Table)

S5.1:Update alarm code Table A CT

In set of node to be monitored, mark t will be monitored0Intermediate code corresponding to the node of process increases by one 1, and other are saved The corresponding intermediate code of point increases by one 0, then all nodes and its corresponding intermediate code are stored in new alarm code Table A CT;

In the present embodiment, t0By node 3,4,5, so the intermediate code corresponding to node 3,4,5 increases by one 1, become For 1;The intermediate code of node 1,2,6 increases by one 0, is changed into 0.Therefore t0By whole node set be divided into 2 be respectively 3,4, 5 }, { 1,2,6 }, their corresponding intermediate codes are 1,0.

S5.2:Update not distinguishable set of node AS0

All nodes in the not distinguishable node set AS0 of traversal, if some node has unique intermediate code, wherein, Intermediate code can not be 0, because 0 is illegal alarm code, then it is distinguishable node to mark the node, and the node is removed into not distinguishable section Point set AS0, after the completion of traversal, the not distinguishable node set AS0 after being updated;

In the present embodiment, addition monitoring mark t0Afterwards, node 3,4,5 intermediate code is 1, and the intermediate code of node 1,2,6 is 0, no node possesses unique intermediate code, so the not distinguishable node set AS0={ 1,2,3,4,5,6 } after updating.

S6:Judge whether the not distinguishable node set AS0 after updating is empty set, it is defeated if the AS0 after updating is empty set Go out group monitoring mark and corresponding ACT and monitoring cost, and terminate;If the AS0 after updating not is empty set, j=j+1 is made, Return again to step S2.Wherein, the computing formula of monitoring cost is:

Monitoring_cost=γ * J+ Σ | tj|

Wherein, γ is the input parameter of monitor, and it determines the proportion between monitor cost and bandwidth cost;J is Number of detectors;Σ|tj| represent the wavelength sum shared by all monitoring marks of deployment;

In the present embodiment, AS0={ 1,2,3,4,5,6 } is not empty set, therefore by j=0+1=1, return to step S2, according to The above method starts the new monitoring mark t of deployment1, until AS0 is empty set, then terminate.

Although illustrative embodiment of the invention is described above, in order to the technology of the art Personnel understand the present invention, it should be apparent that the invention is not restricted to the scope of embodiment, to the common skill of the art For art personnel, as long as various change is in the spirit and scope of the present invention that appended claim is limited and is determined, these Change is it will be apparent that all utilize the innovation and creation of present inventive concept in the row of protection.

Claims (4)

1. the monitoring mark method for designing based on random next node in a kind of all-optical network, it is characterised in that comprise the following steps:
(1), the node to be monitored in all-optical network is initialized, not distinguishable node set AS0 is obtained;
(2) a node v in not distinguishable node set AS0, is randomly choosed as jth (j=0,1,2 ..., J-1) bar monitoring mark tj Start node;
(3), using node v as datum mark, a node in all-optical network topology is selected to inhale according to jump algorithm under Weighted random Take in into monitoring mark tj, make monitoring mark tjLength add 1, while monitoring mark t new will be absorbed intojNode be used as new datum mark V;
Wherein, using node v as datum mark, a node in all-optical network topology is selected to inhale according to jump algorithm under Weighted random Take in into monitoring mark tjSpecific method be:
(3.1) datum mark v all neighbors, are found, set AD is constituted;
(3.2), all nodes in traversal set AD, by distinguishable node all in AD and monitoring mark tjThe section passed through Point is rejected, and forms new set AD ';
(3.3) whether be empty, if set AD '=Ф if, judging AD ' set, performs step (3.4);If set AD ' ≠ Ф, Jump to step (3.5);
(3.4) nearest next-hop, is found according to dijkstra's algorithm
Using dijkstra's algorithm calculating benchmark point v mark t is monitored into all-optical network topologyjWithout all not distinguishable nodes Distance, and the not distinguishable node nearest apart from datum mark v is included by not distinguishable node set, and at random recently according to distance value Select a not distinguishable node from not distinguishable node set recently, then by the datum mark v calculated by dijkstra's algorithm to The neighbors for the datum mark v that shortest path between the not distinguishable node is passed through is used as addition monitoring mark tjNext-hop, plus Lower jump algorithm terminates power at random;
(3.5) node, is randomly selected from set AD ' as next-hop, and is added to monitoring mark tjIn, jumped under Weighted random Algorithm terminates;
(4) monitoring mark t, is judgedjWhether length is up to standard, if length is not up to standard, and step is repeated on the basis of new datum mark V Suddenly (3), this monitoring mark t is otherwise exportedj, perform step (5);
(5), according to the monitoring mark t of deploymentjUpdate alarm code Table A CT and not distinguishable node set AS0;
(6), judge whether the not distinguishable node set AS0 after updating is empty set, if the AS0 after updating is empty set, is exported This monitors mark and corresponding ACT and monitoring cost Monitoring Cost, and terminates;If the AS0 after updating not is sky Collection, then make j=j+1, return again to step (2).
2. the monitoring mark method for designing based on random next node in a kind of all-optical network according to claim 1, it is special Levy and be, in the step (4), judge monitoring mark tjLength whether be up to calibration method:
One length parameter Length is set, during actual deployment, if monitoring mark tjLength be equal to length parameter Length Or monitoring mark tjIn the not distinguishable interstitial content that includes gather for AS0 in not distinguishable interstitial content half, then monitor mark tjIt is long Degree is up to standard.
3. the monitoring mark method for designing based on random next node in a kind of all-optical network according to claim 1, it is special Levy and be, in the step (5), the method for updating alarm code Table A CT and not distinguishable node set AS0 is:
(4.1) alarm code Table A CT, is updated
In set of node to be monitored, mark t will be monitoredjIntermediate code corresponding to the node of process increases by one 1, by other node institutes Corresponding intermediate code increases by one 0, then all nodes and its corresponding intermediate code are stored in new alarm code Table A CT;
(4.2) not distinguishable node set AS0, is updated
All nodes in the not distinguishable node set AS0 of traversal, if some node has unique intermediate code, mark the section Point is distinguishable node, and the node is removed into not distinguishable node set AS0, not distinguishable after being updated after the completion of traversal Node set AS0.
4. the monitoring mark method for designing based on random next node in a kind of all-optical network according to claim 1, it is special Levy and be, in the step (6), monitoring cost monitoring_cost computing formula is:
Monitoring_cost=γ * J+ ∑s | tj|
Monitoring_cost=γ * J+ ∑s | tj |
Wherein, γ is the input parameter of monitor, and it determines the proportion between monitor cost and bandwidth cost;J is detection Device number;∑|tj| represent the wavelength sum shared by all monitoring marks of deployment.
CN201510718599.7A 2015-10-29 2015-10-29 Monitoring mark method for designing based on random next node in a kind of all-optical network CN105262535B (en)

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 CN105262535A (en) 2016-01-20
CN105262535B true CN105262535B (en) 2017-07-18

Family

ID=55102066

Family Applications (1)

Application Number Title Priority Date Filing Date
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

Country Status (1)

Country Link
CN (1) CN105262535B (en)

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2410522C (en) * 2000-06-30 2010-01-26 Andrea Soppera Packet data communications
CN101841442B (en) * 2010-02-08 2011-11-16 电子科技大学 Method for detecting network anomaly in name-address separated network

Also Published As

Publication number Publication date
CN105262535A (en) 2016-01-20

Similar Documents

Publication Publication Date Title
Hu Diverse routing in optical mesh networks
Krishnaswamy et al. Design of logical topologies: A linear formulation for wavelength-routed optical networks with no wavelength changers
Shen et al. Extending the p-cycle concept to path segment protection for span and node failure recovery
Skorin-Kapov et al. A new approach to optical networks security: Attack-aware routing and wavelength assignment
EP1943784B1 (en) Method for configuring an optical network
Dunn et al. Comparison of k-shortest paths and maximum flow routing for network facility restoration
Zhang et al. On scheduling all-to-all personalized connection and cost-effective designs in WDM rings
US20020138645A1 (en) Protecting route design method in a communication network
Zhang et al. Availability-aware provisioning strategies for differentiated protection services in wavelength-convertible WDM mesh networks
Yu et al. Path availability in ad hoc network
CA2360963A1 (en) Topological design of survivable mesh-based transport networks
Chiu et al. Network design and architectures for highly dynamic next-generation IP-over-optical long distance networks
Kodian et al. Failure-independent path-protecting p-cycles: Efficient and simple fully preconnected optical-path protection
KR20070064326A (en) Method and systems for copying data components between nodes of a network
Arci et al. Availability models for protection techniques in WDM networks
US9780909B2 (en) Network topology optimization with feasible optical paths
US20050237950A1 (en) System, method and apparatus for dynamic path protection in networks
Sack et al. Hamiltonian p-cycles for fiber-level protection in semi-homogeneous homogeneous and optical networks
US20040032831A1 (en) Simplest shortest path first for provisioning optical circuits in dense mesh network configurations
Yetginer et al. Regenerator placement and traffic engineering with restoration in GMPLS networks
US20030018812A1 (en) Method and apparatus for provisioning working paths in shared protection mesh network
Ringwald et al. Deployment of sensor networks: Problems and passive inspection
US8913481B2 (en) Method and system for efficient provisioning of multiple services for multiple failure restoration in multi-layer mesh networks
US9338086B2 (en) Hierarchal label distribution and route installation in a loop-free routing topology using routing arcs at multiple hierarchal levels for ring topologies
WO2005001620A3 (en) Optical network topology databases and optical network operations

Legal Events

Date Code Title Description
PB01 Publication
C06 Publication
SE01 Entry into force of request for substantive examination
C10 Entry into substantive examination
GR01 Patent grant
GR01 Patent grant