CN106973000A - Single-stranded cyclic construction algorithm in a kind of communication network - Google Patents
Single-stranded cyclic construction algorithm in a kind of communication network Download PDFInfo
- Publication number
- CN106973000A CN106973000A CN201710172490.7A CN201710172490A CN106973000A CN 106973000 A CN106973000 A CN 106973000A CN 201710172490 A CN201710172490 A CN 201710172490A CN 106973000 A CN106973000 A CN 106973000A
- Authority
- CN
- China
- Prior art keywords
- node
- cutpoint
- stranded
- nodes
- subtopology
- 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
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/44—Star or tree networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
- H04L12/437—Ring fault isolation or reconfiguration
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
This application discloses single-stranded cyclic construction algorithm in a kind of communication network, traversal calculating is carried out to the node in set of node V, all first nodes are filtered out in all nodes, and single-stranded cyclization is carried out to each first node and is calculated；Then, according to single-stranded cyclic result of calculation, the side to be set up when obtaining single-stranded cyclic.This application discloses single-stranded cyclic construction algorithm in a kind of communication network, single-stranded structure that can be in automatic identification and positioning and communicating network, and on this basis, single-stranded cyclic structural scheme is calculated, the single-stranded cyclization work for after provides guidance with advising.
Description
Technical field
The application is related to protection of single-stranded cyclic in the technical field of network communication links, more particularly to a kind of communication network
Construction algorithm.
Background technology
With the fast development of the communication technology, increasing business realizing network is handled, the reality of network transacting business
Now provided convenience for people, also improve the efficiency for handling things.But, the communication network of China exists in structure instantly
Substantial amounts of single-stranded structure, single-stranded structure has poor stability, in transport network traffic, often occurs that Network is interrupted
The problem of.
In order to improve the stability of communication network, ensure that every Network is smoothly run, occur in that on the market many
The method optimized to the single-stranded structure of chain-shaped network is planted, the method such as building reserve link or multiplex section.But, these
Method is both needed to carry out on the premise of single-stranded position in known communication network, and the single-stranded structural scheme for changing ring needs manually
Design.That is, in the prior art, when need to carry out a certain communication network it is single-stranded change ring work when, staff is first
According to the topological diagram of the communication network, all single-stranded structures are manually found；Then, it is each single-stranded for what is found, if
The each single-stranded respective single-stranded scheme for changing loop of meter.
In whole process, staff needs to do substantial amounts of repeated work, such as, it is necessary to artificial to logical when searching single-stranded
The topological diagram of communication network is repeatedly traveled through, and can complete all single-stranded positioning work, this result in it is single-stranded change ring work
Inefficiency；And when communication network is complex, often occur the phenomenon of certain single-stranded omission, so as to influence single-stranded to change ring
Work quality.
The content of the invention
This application provides single-stranded cyclic construction algorithm in a kind of communication network, ring is changed so that solution is single-stranded in the prior art
It can not be realized in work and single-stranded structure is automatically positioned, and there is provided the corresponding single-stranded ring structural scheme that changes on this basis
Problem.
This application provides single-stranded cyclic construction algorithm in a kind of communication network, this method includes：
It is G (V, E) by the topological representation of the communication network, wherein, set of node V is the set of all nodes in topology G,
While collection E be topology G in it is all while set, it is characterised in that
Traversal calculating is carried out to the node in the set of node V, all first nodes are filtered out in all nodes, its
In, at least one in the path that the first node sets out simply is enclosed and at least one is simple comprising leaf chain node
Path；
Single-stranded cyclization is carried out to each first node to calculate, the side to be set up when obtaining single-stranded cyclic, and will set up
Side increase in topological G (V, E) side collection E, wherein, it is described it is single-stranded cyclization calculate include：
Obtain the subtopology G of first nodei(Vi,Ei) and subtopology GiIn non-leaf chain set of node Vi-f；
According to the subtopology G of first nodei(Vi,Ei) and subtopology GiIn non-leaf chain set of node Vi-f, calculate son
Topological GiIn terminal note collection Vi-t；
Calculate and include terminal note collection Vi-tMinimum spanning tree T, the minimum spanning tree T side of Undirected graph be single
The side to be set up when chain is cyclic；
In the side collection E that the side of the minimum spanning tree T is increased to topological G (V, E).
Preferably, the node in the set of node V carries out traversal calculating, and all the are filtered out in all nodes
One node, is specifically included,
Traversal calculating is carried out to the node in the set of node V, all link points are filtered out in all nodes, and
The link filtered out point is put into link point set VcIn, wherein, the link point is to have at least from the path of the node
One node for simply enclosing；
To link point set VcIn each link point carry out traversal calculating, filter out first segment in all link points
Point, wherein, first node is the ring of at least one simple path comprising leaf chain node from the path of the node
Node.
Preferably, the node in the set of node V carries out traversal calculating, and link is filtered out in all nodes
Point, is specifically included,
A node not yet accessed is chosen from the set of node V；
Traversal calculating is carried out to the node；
The result calculated according to traversal, judges in the path the node with the presence or absence of simple circle；
If there is simple circle in the path the node, all nodes on simple circle are put into link point set
VcIn, and be to have accessed by other vertex ticks on the node and simple circle；
It is to have accessed by the vertex ticks if simple circle is not present in the path the node；
Judge to whether there is a node not yet accessed in the set of node V, if in the presence of the node not yet accessed, returning
The step of traversal is calculated is carried out to node.
Preferably, according to the subtopology G of first nodei(Vi,Ei) and subtopology GiIn non-leaf chain set of node Vi-f,
Calculate subtopology GiIn terminal note collection Vi-t, specifically include,
Calculate subtopology GiIn all nodes set ViWith subtopology GiIn all non-leaf chain set of node Vi-fBetween
Difference set, the difference set obtained by calculating is subtopology GiIn terminal note collection Vi-t。
Preferably, the algorithm also includes, single-stranded in positioning and communicating network, wherein, it is described it is single-stranded be from described first
Node sets out and includes the simple path of leaf chain node.
Preferably, the algorithm also includes,
All cutpoints are filtered out in the set of node V；
Cutpoint processing is carried out to each cutpoint, the corresponding standby side of each cutpoint is obtained；
By all cutpoints it is corresponding it is standby while add to it is described while collection E in.
Preferably, it is described to filter out all cutpoints in the set of node V, specifically include,
Cutpoint judgement is carried out to each node in the set of node V, the process that the cutpoint judges includes,
The side for removing a node in topological G (V, E) and being connected with the node；
Calculate and remove behind the node and connected side, the number of connected component in the topological G (V, E)；
Judge whether the number of connected component is more than 1；
If the number of connected component is more than 1, judge the node as cutpoint.
Preferably, it is described that cutpoint processing is carried out to each cutpoint, obtain the corresponding standby side of each cutpoint, tool
Body includes,
The side that cutpoint is deleted in the topological G (V, E) and is connected with the cutpoint, obtain at least two connected component；
Appoint and take two connected components, life is connected component G respectivelyp1With connected component Gp2；
Obtain adjacent segments point set Vp1With adjacent segments point set Vp2, the adjacent segments point set Vp1For connected component Gp1In cut with this
All nodes that point is directly connected to, the adjacent segments point set Vp2For connected component Gp2In all sections for being directly connected to the cutpoint
Point；
Calculate the adjacent segments point set Vp1With adjacent segments point set Vp2Two node v of middle Least-costp1With vp2, wherein, section
Point vp1With vp2Line be the corresponding standby side of the cutpoint.
Brief description of the drawings
In order to illustrate more clearly of the technical scheme of the application, letter will be made to the required accompanying drawing used in embodiment below
Singly introduce, it should be apparent that, for those of ordinary skills, without having to pay creative labor,
Other accompanying drawings can also be obtained according to these accompanying drawings.
Fig. 1 is the topological diagram of a simple communication network；
Fig. 2 is the flow chart of single-stranded cyclic construction algorithm one embodiment in the application communication network；
Fig. 3 is the flow chart of screening link point；
The flow chart that Fig. 4 calculates for single-stranded cyclization；
Fig. 5 is the topological diagram of communication network in application example；
Fig. 6 is to include terminal note collection VA-tUndirected simple graph；
Fig. 7 is the topological diagram of the communication network formed behind the side for setting up minimum spanning tree.
Embodiment
, can automatic identification and positioning and communicating net this application discloses single-stranded cyclic construction algorithm in a kind of communication network
Single-stranded structure in network, and on this basis, single-stranded cyclic structural scheme is calculated, the single-stranded cyclization work for after, which is provided, to be referred to
Lead and advise.
The stability of communication network has direct relation with the structure of the communication network, wherein single-stranded or cutpoint presence is
Influence the factor of the communication network stability.Generally, it is G (V, E) by the topological representation of communication network, wherein, node
Collect the set that V is all nodes in topology G, while collection E for it is all in topology G while set.
Fig. 1 is the topological diagram of a simple communication network, it can be seen from topological diagram shown in Fig. 1, the section of the simple communication network
Point set V={ A, B, C, D, E, F, G }, the side collection E={ e of the simple communication network1,e2,e3,e4,e5,e6,e7}.It will pass through below
Exemplified by the simple communication network that Fig. 1 is given, the single-stranded influence caused with cutpoint to communication network stability is illustrated respectively.
In the communication network shown in Fig. 1, a simple circle is included in the path of the simple communication network
Ae1Be2Ce3De4A (simple circle refers to the circle for not repeating summit in addition to the start and the end points only).Node on simple circle is link
Point, the point set being made up of all link points is link point set Vc, the link point set V of this simple communication networkc={ A, B, C, D }.
By communication service during node A reaches node C, then in the presence of two transmission paths A-D-C and A-B-C, therefore, even if wherein
Certain paths breaks down, then also there are another paths can use.Therefore, simply enclose in transport network traffic have compared with
Good reliability.
Remaining path of the simple communication network is that (simple path refers to not weigh outside beginning and end simple path
The path of compound summit), also referred to as single-stranded, such as path Ce6Ee7F is single-stranded.Node on single-stranded is chain node, by all chain links
The point set of point composition is chain set of node Vl.Chain set of node Vl={ E, F, G }.Wherein, chain node includes leaf chain node (node degree
Number for 1 node) with non-leaf chain node, in this example, chain node F and G is leaf chain node, and chain node E is n omicronn-leaf subchain
Node.It is single-stranded that there is poor reliability in transport network traffic, when single-stranded path fails, then necessarily cause the road
The Network transmitted on footpath is interrupted.For example, by communication service during node C reaches node F, only existing a biography
Defeated path C-E-F, when the single-stranded path fails, then Network will be unable to transmission.
In the communication network shown in Fig. 1, in addition to the single-stranded path including being unfavorable for communication network reliability, also exist
Cutpoint (if removed behind a node and all sides associated with the node, the connection of the communication network in a communication network
Branch's number increase, then the node is called a cutpoint of the communication network).In actual applications, when cutpoint breaks down, then
Network still can not normal transmission.In the communication network shown in Fig. 1, node A, C, E are cutpoint.Such as node C, when
When cutpoint C breaks down, then interrupted by cutpoint C network switch.
Fig. 2 is the flow chart of single-stranded cyclic construction algorithm one embodiment in the application communication network, as shown in Fig. 2
Single-stranded cyclic construction algorithm is specifically included in communication network：
Step 100, traversal calculating is carried out to the node in set of node V, all first nodes is filtered out in all nodes,
Wherein, the simpied method that at least one in the path that first node sets out simply is enclosed and at least one includes leaf chain node
Footpath.
In the application, traversal calculating is carried out to the node in set of node V, all first segments are filtered out in all nodes
Point, is specifically included,
Step 110, traversal calculating is carried out to the node in set of node V, all links is filtered out in all nodes
Point, and the link filtered out point is put into link point set VcIn, wherein, link point is to have at least from the path of the node
One node for simply enclosing.
Fig. 3 is screens the flow chart of link point, as shown in figure 3, traversal calculating is carried out to the node in set of node V, in institute
The process of link point is filtered out in some nodes, is specifically included：
Step 111, a node not yet accessed is chosen from set of node V；
Step 112, traversal calculating is carried out to the node；
Step 113, the result calculated according to traversal, judges in the path the node with the presence or absence of simple circle；
Step 114, if there is simple circle in the path the node, all nodes on the simple circle are put
Enter link point set VcIn, and be to have accessed by other vertex ticks on the node and simple circle；
Step 115, it is to have accessed by the vertex ticks if simple circle is not present in the path the node；
Step 116, with the presence or absence of the node not yet accessed in decision node collection V, if in the presence of the node not yet accessed, returning
Step 112 is back to, traversal calculating is carried out to node；If being not present, terminate.
Step 120, to link point set VcIn each link point carry out traversal calculating, filtered out in all link points
First node, wherein, first node is the simpied method that at least one includes leaf chain node from the path of the node
The link point in footpath.
Understand all single-stranded positions in the communication network for the ease of staff, the application also handle includes, step
200, according to the traversal result of calculation of previous step, to positioning single-stranded in communication network, wherein, single-stranded is to be pointed out from first segment
Hair and the simple path for including leaf chain node.Certainly, checked for the ease of staff, can be by the list in communication network
Chain is exported.
Step 300, single-stranded cyclization is carried out to each first node to calculate, the side to be set up when obtaining single-stranded cyclic,
And increase to the side set up in topological G (V, E) side collection E.The flow chart that Fig. 4 calculates for single-stranded cyclization, as shown in figure 4, single
Chain cyclization, which is calculated, to be specifically included：
Step 301, the subtopology G of first node is obtainedi(Vi,Ei) and subtopology GiIn non-leaf chain set of node
Vi-f。
Step 302, according to the subtopology G of first nodei(Vi,Ei) and subtopology GiIn non-leaf chain set of node
Vi-f, calculate subtopology GiIn terminal note collection Vi-t。
In the present embodiment, subtopology G is calculatediIn all nodes set ViWith subtopology GiIn all non-leaf chain nodes
Collect Vi-fBetween difference set, difference set obtained by calculating is subtopology GiIn terminal note collection Vi-t。
Step 303, calculate and include terminal note collection Vi-tUndirected graph minimum spanning tree T, minimum spanning tree T side
For it is single-stranded cyclic when the side to be set up.
The minimum spanning tree for calculating the Undirected graph of a certain point set is a kind of calculating that those skilled in the art commonly use, because
This, explanation will not be deployed in the application to this calculating process.In this calculating process, it should illustrate a bit, calculating most your pupil
, it is necessary to calculate first node and place terminal note collection V during Cheng Shui-tSpacing between each interior terminal note, if terminal note
For chain node, then the distance between first node and the chain node are calculated using the method for two euclidean distance between node pair of existing calculating is
Can；But, if terminal note is link point, in the application, the distance of first node and the link point is set to infinity.
Step 304, minimum spanning tree T side is increased in topological G (V, E) side collection E.
In order to further ensure that the stability of communication network, the present embodiment also includes locating cutpoint in communication network
Reason, its detailed process is as follows：
Step 400, all cutpoints are filtered out in set of node V.
In the present embodiment, cutpoint judgement is carried out to each node in set of node V, wherein, the detailed process that cutpoint judges
Including the side for removing a node in topological G (V, E) and being connected with the node；Calculate and remove behind the node and connected side, open up
Flutter the number of connected component in G (V, E)；Judge whether the number of connected component is more than 1, if the number of connected component is more than 1,
Judge the node as cutpoint.
Step 500, cutpoint processing is carried out to each cutpoint, obtains the corresponding standby side of each cutpoint, specifically include,
The side that cutpoint is deleted in the topological G (V, E) and is connected with the cutpoint, obtain at least two connected component；
Appoint and take two connected components, life is connected component G respectivelyp1With connected component Gp2；
Obtain direct-link node collection Vp1With direct-link node collection Vp2, direct-link node collection Vp1For connected component Gp1In it is straight with the cutpoint
All nodes connect in succession, direct-link node collection Vp2For connected component Gp2In all nodes for being directly connected to the cutpoint；
Calculate direct-link node collection Vp1With direct-link node collection Vp2Two node v of middle Least-costp1With vp2, wherein, node
vp1With vp2Line be the corresponding standby side of the cutpoint.
Step 600, by all cutpoints it is corresponding it is standby while add to while collection E in.
The application process of single-stranded cyclic construction algorithm in the application communication network will be illustrated by an application example below,
Fig. 5 is the topological diagram of communication network in application example, and the topology of the communication network is denoted as G (V, E), the topological set of node V=
{ A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q }, constructs single-stranded cyclic process in the communication network specific as follows.
Step 100, traversal calculating is carried out to each node in communication network, filters out all first nodes.
First node, which possesses, to be characterised by：At least one simple circle and at least from the path of first node
There is a simple path for including leaf chain node.That is, it is necessary to while it is just the to have the nodes of following two features concurrently
One node：First, the node is necessary for link；Second, at least one includes leaf chain from the path of the node
The simple path of node.
, can be by once traveling through calculating, while completing the verification process of two features in actual moving process；Also may be used
So that by traveling through calculating twice, the verification process of two features is carried out respectively.Two kinds of calculating process have no effect on first node
The selection result, belongs to the protection domain of the application.In the present embodiment, screening will be illustrated exemplified by traveling through calculating process twice
The process of all first nodes.
Step 110, traversal calculating is carried out to the node in set of node V, all links is filtered out in all nodes
Point, and the link filtered out point is put into link point set VcIn.
For example, selection node B, each node of whole communication network is traveled through by starting point of node B, a simple circle is obtained
B-A-D-C-B；Node A, B, C and D are put into link point set VcIn；Meanwhile, by node B and other nodes A, C on simple circle
Mark to access with D.Similarly, it is also a link point to obtain node F, and node F is put into link point set VcIn, and by node
F is designated as having accessed.
Node A, B, C, D and F mark to access, and select the point not accessed to carry out traversal calculating from communication network.
For example, selection node E, each node of whole communication network is traveled through by starting point of node E, a simple circle is not obtained, then is sentenced
Node E is determined for chain node, and by node E labeled as having accessed.Similarly, node E, G, H, I, J, K, L, M, N, O, P, Q are chain
Node.
When all nodes are marked as having accessed in the communication network, all link points in screening communication network are completed
Work, and remove all nodes access mark.
Step 120, to link point set VcIn each link point carry out traversal calculating, filtered out in all link points
First node.
According to step 110, link point set V can obtainc={ A, B, C, D, F }, to link point set VcIn each link point
Traversal calculating is carried out, whether judge it is first node.
Link point A is taken, each node of whole communication network is traveled through by starting point of node A, obtains a plurality of from link point A going out
The simple path for including leaf chain node of hair, is followed successively by A-M, A-I-J, A-I-K-L and A-I-N-O-P-Q.Therefore, judge
Link point A is first node, and by link point A labeled as having accessed.
Similarly, C-E is included from the link point C simple path for including leaf chain node；From link point F's
Including the simple path of leaf chain node includes F-G-H.Therefore, judge that link point C and link point D is first node, and
Link point C, link point D are respectively labeled as having accessed.
Link point B is taken, each node of whole communication network is traveled through by starting point of node B, one is not obtained from link point B
That sets out includes the simple path of leaf chain node.Therefore, link point B is judged not for first node, and link point B is marked
To have accessed.Similarly, link point D is not also first node, and by link point D labeled as having accessed.
When to link point set VcIn all link points when being accessed, complete all first nodes in screening communication network
Work.
Step 200, it is single-stranded in positioning and communicating network.
In the step 120, acquisition from first node and include the simple path of leaf chain node, these letters
Single path is single-stranded in the communication network.
It is single-stranded including A-M, A-I-J, A-I-K-L, A-I-N-O-P-Q, C-E and F-G-H in this example.Below will be this
It is a little it is single-stranded this into loop, to increase the stability of the communication network.
Step 300, single-stranded cyclization is carried out to each first node to calculate, the side to be set up when obtaining single-stranded cyclic,
And increase to the side set up in topological G (V, E) side collection E.
It will illustrate below by taking first node A as an example by the single-stranded process for making loop into comprising node A.
Step 301, first node A subtopology G is obtainedA(VA,EA), wherein, subtopology GASet of node VA=A, B, D,
I, J, K, L, M, N, O, P, Q }, EA={ AB, AD, AI, AM, IJ, IK, IN, KL, NO, OP, PQ }.Meanwhile, obtain subtopology GAIn
Non-leaf chain set of node VA-f={ I, K, N, O, P }.
Step 302, subtopology G is calculatedASet of node VA={ A, B, D, I, J, K, L, M, N, O, P, Q } and non-leaf chain link
Point set VA-fDifference set between={ I, K, N, O, P }, the difference set is subtopology GATerminal note collection VA-t.In this example, subtopology GA
Terminal note collection VA-t={ A, B, D, M, J, L, Q }.
Step 303, calculate and include terminal note collection VA-tThe minimum spanning tree of={ A, B, D, M, J, L, Q } Undirected graph
T.It should be noted that the minimum spanning tree for calculating Undirected graph belongs to the rudimentary knowledge of those skilled in the art, therefore, its is specific
Calculating process will not be described in great detail.Fig. 6 is to include terminal note collection VA-tUndirected simple graph, it should be noted that due to VA-tIt is undirected complete
Full figure is complex, therefore, is provided V in this exampleA-tUndirected graph simplify after undirected simple graph, and this not shadow
Ring understanding of the people in the art to the technical program.
First node A and terminal note collection V are identified in Fig. 6A-tDistance between other interior nodes, first node A and chain node
M, J, L and Q distance are followed successively by 5,12,13 and 25, and first node A and link point B distances are+∞, first node A and link point
D distances are+∞.
Minimum spanning tree T obtained by calculating while for it is single-stranded cyclic when to be set up while.
Step 304, minimum spanning tree T side is increased in topological G (V, E) side collection E.
Fig. 7 is the topological diagram of the communication network formed behind the side for setting up minimum spanning tree, as shown in fig. 7, disregarding most your pupil
The side overlapped into tree T and topology G (V, E), increase in fact G (V, E) in collection E while include A-J, B-M, B-D, J-L and
L-Q.These while set up and original while A-M, A-I-J, A-I-K-L and A-I-N-O-P-Q in single-chain state is converted into ring
Line state, so as to improve the reliability of communication network transmission Network.
Similarly, single-stranded cyclization is carried out to first node C to calculate, in G (V, E) E-F when setting up in collection E, side E-F increasing
If the original side C-E in single-chain state is converted into loop circuit state.
Similarly, single-stranded cyclization is carried out to first node F to calculate, in G (V, E) D-H when setting up in collection E, side D-H increasing
If the original side F-G-H in single-chain state is converted into loop circuit state.
When all first nodes, which complete single-stranded cyclization, to be calculated, then complete to the single-stranded cyclization in the communication network
Work.Now, single-stranded structure is not present in the communication network, therefore, each Network can be carried out by least two paths
Transmission, significantly reduces the possibility that Network is interrupted.
At least two transmission services of each Network are ensure that in above-mentioned step, still, in actual applications,
If the network equipment (cutpoint is shown as in topology) on two paths crosspoints breaks down, Network still can not be just
Often transmission.In order to avoid the generation of this phenomenon, the application further optimizes from the angle for reducing cutpoint in network structure
Single-stranded structure.
Step 400, filtered out in set of node V in all cutpoints, this example, set of node V=A, B, C, D, E, F, G,
H, I, J, K, L, M, N, O, P, Q } in filter out all cutpoints.
For example, node A is taken, side A-B, A-D, A-M, the A- for removing a node A in topological G (V, E) and being connected with node A
I and A-J.Now, the connected component of topological G (V, E) has original one to increase to two, therefore, and predicate node A is cutpoint.
Node B is taken, side B-M, B-A, B-D and the B-C for removing a node B in topological G (V, E) and being connected with node B.
Now, the quantity of the connected component of topological G (V, E) is still original 1, is not increased, therefore, predicate node B is not
Cutpoint.Similarly, node C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q are not cutpoint.
Step 500, cutpoint processing is carried out to cutpoint A, obtains the corresponding standby sides of cutpoint A.
Behind the middle sides deleted cutpoint A and be connected with cutpoint A of topological G (V, E), the connected component of two is obtained, by its point
Ming not be connected component Gp1With connected component Gp2.Connected component Gp1Include node I, J, K, L, M, N, O, P, Q, connected component
Gp2Include node C, D, E, F, G, H.
Obtain connected component Gp1In the node adjacent with cutpoint A, the node of acquisition is put into adjacent segments point set Vp1, this reality
Apply middle adjacent segments point set Vp1={ I, J, N }.Obtain connected component Gp2In the node adjacent with cutpoint A, the node of acquisition is put into
Adjacent segments point set Vp2, adjacent segments point set V in this implementationp2={ B, D, M }.
Calculate adjacent segments point set Vp1={ I, J, N } and adjacent segments point set Vp2Generation in={ B, D, M } between any two node
Valency, chooses two node v of Least-costp1With vp2, then the corresponding standby sides of cutpoint A are node vp1With vp2Line.For example,
Least-cost between node I and node B, then the line B-I between node I and node B be used as the corresponding standby sides of cutpoint A.
This is no longer unnecessary herein it should be noted that the cost calculated between 2 nodes belongs to the rudimentary knowledge of those skilled in the art.
Here, illustrating another solution node vp1With vp2Method, first, calculate adjacent segments point set Vp1In={ I, J, N }
The cost of node and cutpoint A, selects the adjacent node of Least-cost, such as the Least-cost between cutpoint A and node I is then saved
Point vp1For node I.Then, adjacent segments point set V is calculatedp2The cost of={ B, D, M } interior joint and node I, selection Least-cost
Least-cost between neighbors, such as node I and node B, then node vp2For node B.
Step 600, by all cutpoints it is corresponding it is standby while add to while collection E in, i.e., by previous step obtain it is standby
Side B-I is added into topological G (V, E) side collection E.Side B-I's sets up, and adds the reliable of the communication network transmission communication service
Property.For example, by communication service by during node M is sent to node I, under normal circumstances, can be via path M-A-I, if section
Point A breaks down, then can be transmitted by path M-B-I, so as to reduce the generation that disruption occurs for communication service.
Invention described above embodiment is not intended to limit the scope of the present invention..
Claims (8)
1. single-stranded cyclic construction algorithm in a kind of communication network, is G (V, E) by the topological representation of the communication network, wherein,
Set of node V is the set of all nodes in topology G, while collection E for it is all in topology G while set, it is characterised in that
Traversal calculating is carried out to the node in the set of node V, all first nodes are filtered out in all nodes, wherein, institute
State the simply circle of at least one in the path that first node sets out and at least one simple path for including leaf chain node；
Carry out single-stranded cyclization to each first node to calculate, the side to be set up when obtaining single-stranded cyclic, and by the side set up
In the side collection E for increasing to topological G (V, E), wherein, the single-stranded cyclization, which is calculated, to be included：
Obtain the subtopology G of first nodei(Vi,Ei) and subtopology GiIn non-leaf chain set of node Vi-f；
According to the subtopology G of first nodei(Vi,Ei) and subtopology GiIn non-leaf chain set of node Vi-f, calculate subtopology Gi
In terminal note collection Vi-t；
Calculate and include terminal note collection Vi-tUndirected graph minimum spanning tree T, the minimum spanning tree T side for it is single-stranded into
The side to be set up during ring；
In the side collection E that the side of the minimum spanning tree T is increased to topological G (V, E).
2. algorithm according to claim 1, it is characterised in that the node in the set of node V carries out traversal meter
Calculate, all first nodes filtered out in all nodes, are specifically included,
Traversal calculating is carried out to the node in the set of node V, all link points are filtered out in all nodes, and will sieve
The link point selected is put into link point set VcIn, wherein, the link point is to have at least one from the path of the node
The node simply enclosed；
To link point set VcIn each link point carry out traversal calculating, filter out first node in all link points, its
In, first node is the link point of at least one simple path comprising leaf chain node from the path of the node.
3. algorithm according to claim 2, it is characterised in that the node in the set of node V carries out traversal meter
Calculate, link point filtered out in all nodes, is specifically included,
A node not yet accessed is chosen from the set of node V；
Traversal calculating is carried out to the node；
The result calculated according to traversal, judges in the path the node with the presence or absence of simple circle；
If there is simple circle in the path the node, all nodes on simple circle are put into link point set VcIn,
And be to have accessed by other vertex ticks on the node and simple circle；
It is to have accessed by the vertex ticks if simple circle is not present in the path the node；
Judge to whether there is a node not yet accessed in the set of node V, if in the presence of the node not yet accessed, being back to pair
Node carries out the step of traversal is calculated.
4. algorithm according to claim 1, it is characterised in that according to the subtopology G of first nodei(Vi,Ei) and son open up
Flutter GiIn non-leaf chain set of node Vi-f, calculate subtopology GiIn terminal note collection Vi-t, specifically include,
Calculate subtopology GiIn all nodes set ViWith subtopology GiIn all non-leaf chain set of node Vi-fBetween difference set,
Difference set obtained by calculating is subtopology GiIn terminal note collection Vi-t。
5. the algorithm according to claim 1, it is characterised in that the algorithm also includes, single-stranded in positioning and communicating network,
Wherein, it is described single-stranded from the first node and to include the simple path of leaf chain node.
6. the algorithm according to claim 1, it is characterised in that the algorithm also includes,
All cutpoints are filtered out in the set of node V；
Cutpoint processing is carried out to each cutpoint, the corresponding standby side of each cutpoint is obtained；
By all cutpoints it is corresponding it is standby while add to it is described while collection E in.
7. the algorithm according to claim 6, it is characterised in that described that all cutpoints, tool are filtered out in the set of node V
Body includes,
Cutpoint judgement is carried out to each node in the set of node V, the process that the cutpoint judges includes,
The side for removing a node in topological G (V, E) and being connected with the node；
Calculate and remove behind the node and connected side, the number of connected component in the topological G (V, E)；
Judge whether the number of connected component is more than 1；
If the number of connected component is more than 1, judge the node as cutpoint.
8. the algorithm according to claim 6, it is characterised in that described to carry out cutpoint processing to each cutpoint, is obtained
Each the corresponding standby side of the cutpoint, is specifically included,
The side that cutpoint is deleted in the topological G (V, E) and is connected with the cutpoint, obtain at least two connected component；
Appoint and take two connected components, life is connected component G respectivelyp1With connected component Gp2；
Obtain adjacent segments point set Vp1With adjacent segments point set Vp2, the adjacent segments point set Vp1For connected component Gp1In it is straight with the cutpoint
All nodes connect in succession, the adjacent segments point set Vp2For connected component Gp2In all nodes for being directly connected to the cutpoint；
Calculate the adjacent segments point set Vp1With adjacent segments point set Vp2Two node v of middle Least-costp1With vp2, wherein, node vp1
With vp2Line be the corresponding standby side of the cutpoint.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710172490.7A CN106973000B (en) | 2017-03-22 | 2017-03-22 | Single-chain ring formation construction algorithm in communication network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710172490.7A CN106973000B (en) | 2017-03-22 | 2017-03-22 | Single-chain ring formation construction algorithm in communication network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106973000A true CN106973000A (en) | 2017-07-21 |
| CN106973000B CN106973000B (en) | 2020-02-21 |
Family
ID=59328650
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710172490.7A Active CN106973000B (en) | 2017-03-22 | 2017-03-22 | Single-chain ring formation construction algorithm in communication network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106973000B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109936484A (en) * | 2017-12-15 | 2019-06-25 | ***通信集团浙江有限公司 | A kind of method and device identifying network structure risk |
| CN111464338A (en) * | 2020-03-16 | 2020-07-28 | 哈尔滨安天科技集团股份有限公司 | Step-by-step layout method and system for complex network topology |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060107043A1 (en) * | 2004-11-12 | 2006-05-18 | Samsung Electronics Co., Ltd. | Method for managing user key for broadcast encryption |
| CN101453666A (en) * | 2007-12-07 | 2009-06-10 | 华为技术有限公司 | Main and standby link protection method, loop system and apparatus for passive optical network |
| CN101841450A (en) * | 2010-04-08 | 2010-09-22 | 深圳市金宏威实业发展有限公司 | Method and topological structure for realizing stable communication by forming multiple ring topologies into intersecting ring |
| WO2012120528A1 (en) * | 2011-03-07 | 2012-09-13 | Tejas Networks Ltd | Ethernet chain protection switching |
| CN103906164A (en) * | 2014-04-23 | 2014-07-02 | 上海海事大学 | Maritime search and rescue wireless sensor network topology structure and topology control method thereof |
| CN105262661A (en) * | 2015-08-28 | 2016-01-20 | 吴伟 | Network system and method for solving ring formation of access layer of IPRAN packet transport network through wireless mode |
-
2017
- 2017-03-22 CN CN201710172490.7A patent/CN106973000B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060107043A1 (en) * | 2004-11-12 | 2006-05-18 | Samsung Electronics Co., Ltd. | Method for managing user key for broadcast encryption |
| CN101453666A (en) * | 2007-12-07 | 2009-06-10 | 华为技术有限公司 | Main and standby link protection method, loop system and apparatus for passive optical network |
| CN101841450A (en) * | 2010-04-08 | 2010-09-22 | 深圳市金宏威实业发展有限公司 | Method and topological structure for realizing stable communication by forming multiple ring topologies into intersecting ring |
| WO2012120528A1 (en) * | 2011-03-07 | 2012-09-13 | Tejas Networks Ltd | Ethernet chain protection switching |
| CN103906164A (en) * | 2014-04-23 | 2014-07-02 | 上海海事大学 | Maritime search and rescue wireless sensor network topology structure and topology control method thereof |
| CN105262661A (en) * | 2015-08-28 | 2016-01-20 | 吴伟 | Network system and method for solving ring formation of access layer of IPRAN packet transport network through wireless mode |
Non-Patent Citations (2)
| Title |
|---|
| YUJUN ZHANG, HANWEN ZHANG: "A Mobile Agent Fault-Tolerant Method Based on the Ring", 《IEEE》 * |
| 袁勇: "基于闭环运动链图谱库的可分离结构", 《中国知网》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109936484A (en) * | 2017-12-15 | 2019-06-25 | ***通信集团浙江有限公司 | A kind of method and device identifying network structure risk |
| CN109936484B (en) * | 2017-12-15 | 2020-10-13 | ***通信集团浙江有限公司 | Method and device for identifying network structure risk |
| CN111464338A (en) * | 2020-03-16 | 2020-07-28 | 哈尔滨安天科技集团股份有限公司 | Step-by-step layout method and system for complex network topology |
| CN111464338B (en) * | 2020-03-16 | 2022-10-18 | 安天科技集团股份有限公司 | Step-by-step layout method and system for complex network topology |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106973000B (en) | 2020-02-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104067566B (en) | Shortest path bridging is improved in multizone network | |
| CN105453491B (en) | Long-range LFA is extended quickly to re-route | |
| CN105141524B (en) | A kind of topological diagram optimal path algorithm of Problem with Some Constrained Conditions | |
| CN109818858B (en) | Method, device and system for realizing automatic splicing of inter-domain topological relation | |
| CN106170952A (en) | For disposing the method and system of maximum redundancy tree in a data network | |
| WO2013159451A1 (en) | Method and apparatus for acquiring cross-domain end-to-end route, and child path computation entity | |
| CN107517157A (en) | A kind of determining method of path, device and system | |
| CN104396197A (en) | Selecting between equal cost shortest paths in a 802.1aq network using split tiebreakers | |
| CN105591937A (en) | Network topology information acquisition method and device | |
| CN107659426A (en) | Distribute the method and network side equipment of physical resource | |
| CN106973000A (en) | Single-stranded cyclic construction algorithm in a kind of communication network | |
| CN106464447B (en) | Error code information transmitting methods and the network equipment and communication system | |
| CN106105114A (en) | The more preferable replacement paths belonging to IS IS prefix more | |
| CN110932906A (en) | Data center network topology structure discovery method based on SNMP technology and topology structure discovery system thereof | |
| CN106452862A (en) | Method and device for determining loop network | |
| CN106685745A (en) | Network topology construction method and device | |
| JP4320433B2 (en) | Overlay link calculation device, calculation method thereof, and program | |
| CN106302158B (en) | The method and device of transmission path is selected in a kind of network topology | |
| CN108093496A (en) | A kind of uniformity network-building method based on ISA100.11a standards | |
| US6588953B2 (en) | Routing in a communication network | |
| CN110912816A (en) | Link rerouting method, device and storage medium | |
| RU2477567C2 (en) | Method for searching tcm path, method for creating tcm path, system for managing path search and system for managing path creation | |
| CN1788455A (en) | Automatically protecting inverting method | |
| US11575440B2 (en) | Computing viable paths through an optical network | |
| US20120176940A1 (en) | Course searching method and node device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 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 |