CN100454848C - Network structure topology layout method and network management device - Google Patents
Network structure topology layout method and network management device Download PDFInfo
- Publication number
- CN100454848C CN100454848C CNB2007100797574A CN200710079757A CN100454848C CN 100454848 C CN100454848 C CN 100454848C CN B2007100797574 A CNB2007100797574 A CN B2007100797574A CN 200710079757 A CN200710079757 A CN 200710079757A CN 100454848 C CN100454848 C CN 100454848C
- Authority
- CN
- China
- Prior art keywords
- node
- coordinate
- arrangement
- gateway
- network
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention provides a network topology layout method and the network management device thereof. And the method comprises: obtaining connection relation between nodes, where the nodes include common nodes and gateway nodes; according to the connection relation, obtaining numbers of times of shortest path routing from common nodes to the nearest gateway nodes; calculating node coordinates and making the common nodes with the same number of times of shortest path routing compose an array, where the difference value between the numbers of times of shortest path routing between the adjacent arrays is equal to 1; displaying the common nodes and drawing the connection relation between the common nodes. And the invention has the advantages of simple algorithm, low cost, and clear layers of network topology and clear network topology.
Description
Technical field
The present invention relates to the transmission network management technology, the method and the Network Management Equipment of especially a kind of network configuration topological layout.
Background technology
Along with the high speed development of network, network management becomes and becomes increasingly complex, and the continuous development of the research and development adjoint network of the network management software also more and more is subject to people's attention.
The network configuration topology is to be used to show the transmission network network architecture and network construction form in the network management system and means commonly used, its management for transmission network provides patterned intuitively operation, thereby the management of network topology has become one of important management function of transmission network network management system.Existing transmission network management comprises: SDH (Synchronous Digital Hierarchy, SDH (Synchronous Digital Hierarchy)) webmaster, SONET (Synchronous Optical Network, Synchronous Optical Network) webmaster, WDM (WavelengthDivision Multiplexing, wavelength division multiplexing) comprehensive network management of webmaster, OTN (Optical Transport Network, optical transfer network) webmaster and multi-class device composition.
More and more huger along with the management scale of existing network, network layer is more and more abundanter, the equipment that causes needing in the graphical topology to show gets more and more, relation becomes increasingly complex between the equipment, make that finally the Topology Management difficulty in the network management system is increasing, it is also increasing that the webmaster user need carry out the intensity of topological layout work.Therefore, provide a kind of network configuration topological layout method that can adapt to the network fast development to become the problem that needs solve in the existing transmission network management technology.
At present, adopt following method to realize the function of network configuration topological layout usually.
Original coordinates when topological node created in record, acquiescence are to create in strict accordance with the structure of real network when creating described topological node.As: in an initial topology, at first create node 1, this moment node coordinate be (x1, y1), create node 2 again, node coordinate be (x2, y2), so when carrying out the node autoplacement still with (x1, y1) and (x2 is y2) as the coordinate of node 1 and node 2.
The research and development engineer carries out finding in the research process this technology to above-mentioned prior art, and there are the following problems: at first, the original coordinates that this method is too much when depending on the user and creating node, yet, this method has been ignored the randomness that the coordinate of user when creating topology chosen, therefore adopt this technology to carry out topological layout, topological structure is chaotic usually; Secondly, angle from the algorithm realization, in the implementation procedure of this topological layout's algorithm, system need write down too many original coordinates information, along with the expansion of number of network node, needs the information of memory to get more and more, and need write down link information between each network node simultaneously, in a network that has a n node, connect in twos between the node, the amount of information that then adopts said method to remember is:
(wherein n is the node number,
Be linking number).
From above-mentioned shortcoming as can be seen, under the many situations of network node, the amount of information that adopts the said method system that makes to remember is exponential increase along with increasing of linking number between interstitial content and the node.In this case, remembering these informational needs, to take the real-time expense of topological system big, causes hardware configuration is required high, takies too much underlying resource (as CPU and internal memory).
For topology is had levels more, also have following network configuration topological layout method in the prior art: a node on the optional topology is for reference to node, each node is used as a vector, as: at first choose node 1 and be reference node, connect (nondirectional), the connection of then node 1 being set up a horizontal direction at node 2 if exist between node 2 and the node 1; If node 3 also had with node 1 and was connected this moment, then node 1 and node 3 are set up reciprocal a connection; If newly add a node 4 this moment, this node still has with node 1 and is connected, and then needs to adjust the position of node 2 and node 3, and making the angle between node 1, node 2, the node 3 is 1/3rd of circumference.By that analogy, carry out quasi-circular and disperse layout.
The research and development engineer is carrying out in the research process above-mentioned second prior art, find that there is following shortcoming in this technology: at first, because each variation that adds new node or reduce node or connection relation between nodes, all need to adjust the coordinate of original node, algorithm complexity not only, and original layout impacted, along with increasing of connecting between node and the node, between the increase/minimizing of carrying out node and node, connect when changing, to cause having in the topology lot of data need recomputate/adjust, and then underlying resource (being the CPU and the memory source of the computer system) expense that needs to consume will be non-linear increase; In addition, the reference node of this technical scheme is chosen more random, carries out network as a result during topological layout at every turn, if the reference point of selecting is different, layout result will be different fully, from the angle of user and Topology Management, than indigestibility.
Summary of the invention
The embodiment of the invention will provide the method for the simple network configuration of a kind of algorithm topological layout, and corresponding, another embodiment of the present invention also aims to provide a kind of Network Management Equipment that adopts described method.
For solving the problems of the technologies described above, the embodiment of the method for a kind of network configuration of the present invention topological layout, implementation is as follows: obtain connection relation between nodes, described node comprises ordinary node and gateway node; Obtain the short transmission routing times of ordinary node according to described annexation to nearest gateway node process; In the reference coordinate system that presets, the computing node coordinate make the described identical ordinary node of short transmission routing times form an arrangement, and described short transmission routing times difference is 1 between adjacent arrangement; Show ordinary node, and draw the annexation between ordinary node.On the foregoing description basis, further calculate the coordinate of gateway node, make gateway node form an arrangement; And the arrangement that gateway node is constituted shows as first order, draws the annexation between ordinary node and gateway node.
Further, the arrangement that described node is constituted is shown as row or row.
In the network, the node that has annexation each other is father/child node each other, thereby further, in the same arrangement, arranges according to the ID size order with the child node that identical father node connects.
On the foregoing description implementation basis, further computing node coordinate makes that further euclidean distance between node pair equates in the same arrangement; Perhaps, the center point coordinate of arrangement of further adjusting short transmission routing times and be n is identical with the arrangement center point coordinate of short transmission routing times n-1, makes that respectively to arrange symmetry axis identical.
On the above-mentioned implementation basis, also comprise step: the annexation of obtaining newly-increased node and adjacent node; Obtain the short transmission routing times of described newly-increased node to nearest gateway node process; Calculate described newly-increased node coordinate, described newly-increased node is aligned to the align ends of corresponding short transmission routing times.Perhaps, this method also comprises: obtain the information of deletion of node, delete the annexation of coordinate and this node and the adjacent node of this node.
A kind of Network Management Equipment comprises: interface unit, be used to obtain connection relation between nodes, and described node comprises ordinary node and gateway node; First computing unit is used to obtain the short transmission routing times of ordinary node to nearest gateway node process; Second computing unit is used in the reference coordinate system that presets, and the coordinate of computing node make the described identical ordinary node of short transmission routing times form an arrangement, and described short transmission routing times difference is 1 between adjacent arrangement; Show output unit, be used to show ordinary node, and draw the annexation between ordinary node.
On above-mentioned Network Management Equipment architecture basics, described second computing unit also is used to calculate the gateway node coordinate, makes one arrangement of gateway node composition and this arrangement as first order.
In the network, the node that has annexation each other is father/child node each other, then on the said equipment architecture basics, described second computing unit further comprises the calculating of node coordinate: the computing node coordinate makes the child node that connects with identical father node in the same arrangement arrange according to the ID size order.
And second computing unit further comprises the calculating of node coordinate: the computing node coordinate makes that euclidean distance between node pair equates in the same arrangement.
And second computing unit also is used for adjusting and respectively arranges center point coordinate, makes that respectively to arrange symmetry axis identical.
The implementation method of above embodiment as can be seen, present embodiment is intended to utilize in the network configuration node to the objective circumstances of gateway node routing times, earlier with node division rank in the network, the node of same level (promptly identical through routing times to gateway node) is arranged, coordinates computed and output, make and not have between other node of nonadjacent level demonstrate to connect (as through the node of a route only with gateway node and node through twice route between have be connected), thereby in the expression of interface the clear network configuration that reflected intuitively; And, because the embodiment of the invention is carried out the demonstration of network topology on the basis of node hierarchy, thereby make and when calculating the next stage node coordinate, well utilized even higher level of node Coordinate Calculation result, this use recurrence is derived and is obtained the method for each node coordinate, algorithm computation efficient height compared to existing technology, especially when network size is big, adopting the embodiment of the invention to carry out topological layout, to consume the ratio of time and interstitial content linear, and this ratio is less, and then makes that carrying out network topology layout speed improves a lot compared to existing technology.Further, because among the described embodiment, id number size order according to node in the brother of node is arranged is arranged, thereby, under the situation of newly-increased node or deletion of node, can not exert an influence to original topological layout, can not change the coordinate or the internodal closure of original node, thereby the network topology that makes present embodiment obtain has stronger stability, compared with prior art, owing to when topology change, do not need existing network topology layout is recomputated, thereby reduced algorithm complex, reduced overhead.
The embodiment of the invention also provides a kind of Network Management Equipment that adopts described method, and is corresponding, because used algorithm is simple, thereby cost is lower; And, the network topology that this equipment the provided clear in structure that is methodically arranged.
Description of drawings
Fig. 1 is the inventive method embodiment flow chart;
Fig. 2 is the first embodiment of the invention schematic network structure;
Fig. 3 is the described first embodiment network topology layout schematic diagram;
Fig. 4 is the second embodiment of the invention schematic network structure;
Fig. 5 is first topological layout's schematic diagram of described second embodiment of the invention network;
Fig. 6 is second topological layout's schematic diagram of described second embodiment of the invention network;
Fig. 7 is the third embodiment of the invention schematic network structure;
Fig. 8 is first topological layout's schematic diagram of described third embodiment of the invention network;
Fig. 9 is second topological layout's schematic diagram of described third embodiment of the invention network;
Figure 10 is the 3rd topological layout's schematic diagram of described third embodiment of the invention network;
Figure 11 is the fourth embodiment of the invention schematic network structure;
Figure 12 is first topological layout's schematic diagram of described fourth embodiment of the invention network;
Figure 13 is the fifth embodiment of the invention schematic network structure;
Figure 14 is topological layout's schematic diagram of described fifth embodiment of the invention network;
Figure 15 is for increasing topological layout's schematic diagram of No. 29 node at basic the above the fifth embodiment of the invention network of described Figure 14 topological layout;
Figure 16 is for deleting topological layout's schematic diagram of the 13rd node at basic the above the fifth embodiment of the invention network of described Figure 14 topological layout;
Figure 17 is a kind of Network Management Equipment example structure schematic diagram of the present invention.
Embodiment
With reference to Fig. 1, specify an embodiment of network configuration of the present invention topological layout method, comprising:
Step 11: obtain connection relation between nodes, described node comprises ordinary node and gateway node; Usually, the information that connects between node exists by the form of data base table recording, by the recorded information in the database, can inquire internodal link information;
Step 12: obtain the short transmission routing times of ordinary node to nearest gateway node process according to described annexation; Wherein, gateway is meant a kind of equipment in the telecommunication technology, is used for connecting network, and the terminal in a net can be communicated with terminal or the computer in another net, at one arbitrarily in the network, has a network node or equipment at least;
Step 13: the computing node coordinate make the described identical ordinary node of short transmission routing times consist of an arrangement, and short transmission routing times difference is 1 between adjacent arrangement; Perhaps further, the coordinate of calculating gateway node makes gateway node form an arrangement;
Step 14: show ordinary node, and draw the annexation between ordinary node; Accordingly, when business demand, according to the gateway node coordinate that has calculated, the arrangement that gateway node is constituted shows as first order, and the annexation between drafting ordinary node and gateway node.In the network, the node that has annexation each other is father/child node each other, then on the foregoing description basis, in aligned identical, arranges according to the ID size order with the child node that identical father node connects.
Wherein, in the step 13, further the computing node coordinate makes that euclidean distance between node pair equates in the same arrangement, and further unified each arrange in internodal distance equate; Yet, adjust coordinate equates only to be a kind of implementation of the present invention between node, be intended to make the demonstration of topological layout more neat, the present invention does not get rid of in the same arrangement that distance does not wait between adjacent node, the skimble-scamble implementation of euclidean distance between node pair during perhaps each is arranged.
Under the prerequisite that euclidean distance between node pair equates, by experiment as can be known, the center point coordinate of arrangement of further adjusting routing times n is identical with the arrangement center point coordinate of routing times n-1, can make that respectively to arrange symmetry axis identical.It still is a kind of implementation of the present invention.
Wherein, described being arranged in unifies to be row or row when showing.Below show with the described row that is arranged as, and with recursive mode, the preferable realization means that specify in the foregoing description node coordinate in the calculated permutations and show.
Fig. 2 is fairly simple topological structure schematic diagram.This figure is depicted as the network topology that two nodes are formed, and has one in two nodes at least for gateway node, is connected with a pair of connection between the node.
At first set up a reference coordinate system that is used for autoplacement, X-axis is the axle at gateway node place, and with reference to the described method of embodiment above, promptly the computing node coordinate makes that euclidean distance between node pair equates in the same arrangement, the coordinate that then obtains gateway node all is ((n-1) * Δ X, 0), wherein Δ X is the horizontal range between the adjacent node, is fixed value, n is the sequence number (since 1, get 1,2, the natural number of 3.....n) of gateway node.Y-axis is the reference axis of non-gateway node (ordinary node), and the layout type of Y-axis node is progressively described in the back.According to the mode of setting up of above-mentioned coordinate system, the node coordinate result who calculates is with reference to Fig. 3, and promptly the coordinate of gateway node Node1 and Node2 is respectively (0,0), (Δ X, 0).
Same, if the described row that are arranged as show that then in the network topology structure layout shown in Fig. 2, the coordinate of gateway node Node1 and Node2 is respectively (0,0) and (0, Δ Y).Wherein, Δ Y is the vertical range between the adjacent node.
Further, be example with the topology of three nodes, still have at least one to be gateway node in three nodes, a pair of connection is arranged between any two, as shown in Figure 4 between the node.
Supposed situation 1: have only a gateway node Node1, then as shown in Figure 4, node Node2 directly is connected with Node1 with Node3, is defined as 1 grade of node in the present embodiment, thereby Node2 and Node3 foundation are become an arrangement (being arranged as row described in the present embodiment).With further reference to the method for embodiment above, be that the computing node coordinate makes that euclidean distance between node pair equates in the same arrangement, the center point coordinate of the arrangement of adjustment routing times n is identical with the arrangement center point coordinate of routing times n-1, make that respectively to arrange symmetry axis identical, then obtain topological layout as shown in Figure 5.With reference to Fig. 5 as can be known, the Node1 coordinate is (0,0), and the Node2 coordinate is (Δ X/2, Δ Y), and the Node3 coordinate is (Δ X/2, Δ Y).Be that Node2 and Node3 ordinate are Δ Y, constitute delegation and arrange, and the central shaft of Node2 and Node3 be at X=0.And demonstrate the annexation that exists between three nodes simultaneously.
Supposed situation 2:Node1 and Node2 are gateway node, and then as shown in Figure 4, Node3 directly is connected with gateway node, are 1 grade of node.Gateway node Node1 and Node2 foundation becoming delegation are arranged, still, obtain topological layout as shown in Figure 6 with reference to the method among the embodiment mentioned above.With reference to Fig. 6 as can be known, the Node1 coordinate is (0,0), and the Node2 coordinate is (Δ X, 0), and the Node3 coordinate is (Δ X/2, Δ Y).Be that gateway node Node1 and Node2 prolong X-axis and set up delegation and arrange, the abscissa of node Node3 is got the centre coordinate of gateway node Node1 and Node2.
Supposed situation 3:Node1, Node2 and Node3 are gateways, and then node is linear array in X-axis, and with reference to the method for embodiment mentioned above, the coordinate figure that should obtain three nodes is respectively (0,0), (Δ X, 0) and (2* Δ X, 0).
Further, be example with the topology of four nodes, still have at least one to be gateway node in four nodes, node all has connection between any two.Network topology below will divide 4 kinds of situations that the result of embodiment of the invention topological layout is described respectively as shown in Figure 7.
Supposed situation 1: have only a gateway Node1, Node1 is as 0 grade of node, Node2, Node3 directly link to each other with gateway node with Node4, promptly the short transmission routing times to nearest gateway node is 0, definition Node2, Node3 and Node4 are 1 grade of node, these three nodes with gateway node as the capable arrangement of symmetry axis.As shown in Figure 8, the coordinate of Node1, Node2, Node3 and Node4 is respectively: (0,0), (Δ X/2, Δ Y), (0, Δ Y) and (+Δ X/2, Δ Y).
Supposed situation 2:Node1 and Node2 are gateway, and this moment, Node1 and Node2 were the brother of node, and as 0 grade of node, the Y-axis coordinate of Node1, Node2 all is 0; Node3 directly links to each other with gateway node with Node4, and then Node3 and Node4 are 1 grade of node, and the center of its X-axis coordinate higher level node (Node1, Node2) distributes for the center symmetry.As shown in Figure 9, the coordinate of Node1, Node2, Node3 and Node4 is respectively: (0,0), (Δ X, 0), (0, Δ Y) and (Δ X, Δ Y).
Supposed situation 3:Node1, Node2, Node3 are gateway, and having only Node4 is non-gateway, and Node1, Node2, Node3 are the brother of node at this moment, and as 0 grade of node, the Y-axis coordinate of Node1, Node2, Node3 all is 0; Node4 directly links to each other with gateway node, and then Node4 is 1 grade of node, and Node4 is connected because of existing with its superior node, and X-axis coordinate higher level node distributes for the center symmetry.As shown in figure 10, the coordinate of Node1, Node2, Node3 and Node4 is respectively: (0,0), (Δ X, 0), (2 Δ X, 0) and (Δ X, Δ Y).
Supposed situation 4: under the situation of the limit, all nodes all are gateway, and then the coordinate of each node is respectively: (0,0), (Δ X, 0), (2 Δ X, 0) and (3 Δ X, 0).
Continuation is an example with the situation of four nodes, supposes still to have at least in four nodes one to be gateway node, and Node1, Node2, Node3 are connected with connection each other, does not connect between Node4 and the Node1 to link to each other, as shown in figure 11.
Supposed situation 1: have only a gateway Node1, Node1 is as 0 grade of node, and Node2, Node3 directly link to each other with gateway node, and then Node2, Node3 are 1 grade of node.At this moment, Node4 directly is not connected with gateway node Node1, but owing to be connected with 1 grade of node Node2, Node3 existence, promptly Node4 is the shortest in 1 route to nearest gateway Node1, and definition Node4 is 2 grades of nodes.As shown in figure 12, the coordinate of Node1, Node2, Node3 and Node 4 is respectively: (0,0), (Δ X/2, Δ Y), (+Δ X/2, Δ Y) and (0,2 Δ Y).
Supposed situation 2:Node1 and Node2 are gateway, and this moment, Node1 and Node2 were the brother of node, and as 0 grade of node, the Y-axis coordinate of Node1, Node2 all is 0; Node3 directly links to each other with gateway node with Node4, and then Node3, Node4 are 1 grade of node; The coordinate of Node1, Node2, Node3 and Node4 is respectively: (0,0), (Δ X, 0), (0, Δ Y) and (Δ X, Δ Y).
Supposed situation 3:Node1, Node2, Node3 are gateway, and then the coordinate of Node1, Node2, Node3 and Node4 is respectively: (0,0), (Δ X, 0), (2 Δ X, 0) and (1.5 Δ X, Δ Y).
Supposed situation 4: all nodes all are gateway, and then the coordinate of each node is respectively: (0,0), (Δ X, 0), (2 Δ X, 0) and (3 Δ X, 0).
Various situations mentioned above are analyzed, are summarized the algorithm that the inventive method embodiment is adopted:
In a network topology that contains N node, include g gateway node (0＜g＜N).The numbering of this g node is respectively G0, G1, G2.......Gg-1, and we are defined as 0 grade of node.Have L1 with the node that gateway node directly links to each other, we are defined as 1 grade of node and (are respectively L1
0, L1
1... L1
L1-1).Having L2 with 1 grade of node connected node number (not comprising the node that is connected with 0 grade of node), is 2 grades of nodes.By that analogy, 3 grades node L3,4 grades node L4 ... .. divides according to hierarchical relationship, and whole network topology is divided into into the n level, the interstitial content sum of all levels (comprising gateway node) is N.
After above-mentioned relation was determined, we drew the coordinate of every grade of each node on topology.Wherein, X is the spacing between the X-axis adjacent node, and Y is the Y-axis spacing between the adjacent layer node, it is the number of gateway node that g represents 0 grade of node, Ln represents the number (n＞=1) of n level node, the 0th node of Ln (0) expression n level, and Ln (0) .x represents the X coordinate of the 0th node of n level:
0 number of stages g: (0,0), (X, 0), (2X, 0) ... .. ((g-1) X, 0);
1 number of stages L1: the central point with 0 grade of node is that Y-axis is symmetrically distributed, and center point coordinate is
First coordinate to L1 1 grade of node is respectively:
The X coordinate that is last node is:
The Y coordinate is Y;
2 number of stages L2: the central point with 1 grade of node is that Y-axis is symmetrically distributed, and center point coordinate is
First coordinate to L1 1 grade of node is respectively:
The X coordinate that is last node is:
The Y coordinate is 2Y;
......................
Adopt the recursive algorithm in the mathematics, suppose n number of stages Ln: the central point with (n-1) level node is that Y-axis is symmetrically distributed, and central point X coordinate is:
Then first coordinate to Ln node is respectively:
The node coordinate computational methods that more than obtain in the embodiment of the invention being adopted, because it carries out the calculating of node coordinate and then shows on the basis of node hierarchy, thereby make and when calculating the next stage node coordinate, well utilized even higher level of node Coordinate Calculation result, this use recurrence is derived and is obtained the method for each node coordinate, algorithm computation efficient height compared to existing technology, especially when network size is big, the ratio that carries out topological layout's consumption time and interstitial content is linear, and this ratio is less, and then makes that carrying out network topology layout speed improves a lot compared to existing technology.
And with reference to the algorithm described in the embodiment above as can be known, when carrying out the calculating of node coordinate, internodal distance equates, and unified each symmetry axis of arranging, thereby makes and show that the topological layout that obtains is neat more, sense has levels.
Further, with reference to the algorithm described in the embodiment above as can be known, when carrying out the calculating of node coordinate, node object with the node ID of node in database as unique diacritics, node in the aligned identical carries out sequence arrangement according to the size of node ID, avoid in the network environment of reality on the one hand, owing to may there be the identical situation of the title node that causes confusion in network node, on the other hand, carry out the arrangement of node according to a definite sequence, make in arrangement an end that newly-increased node sequence can be arranged in this arrangement when increasing node, thereby avoid because the increase of node and produce influence to original topological layout in the network has strengthened the stability of topological layout; Same, under the situation of deletion of node, the inventive method embodiment still can guarantee the stability of existing topological layout.In a word, under the situation of newly-increased node and deletion of node, can not produce any influence, can not change the coordinate of original node or the direction of connection original layout, unless the request that the user initiates similar " layout again ", just layout can change.Among the present invention, also can adopt other ID that can distinguish node that can use other, this ID suggestion is used numerical value but not character string, yet the present invention also is not intended to limit the concrete form of described ID.
As shown in figure 13, managed 28 nodes in this network, wherein node 1,3,5 is a gateway node, and the topological relation of all the other 25 nodes as shown in the figure.
According to the implementation method of embodiment mentioned above, at first to the route of gateway node process all nodes are divided according to node:
0 grade of node is a gateway node 1,3,5;
1 grade of node is the node that directly links to each other with gateway node: 2,4,8,9,10,12,16,23;
2 grades of nodes are the node that directly links to each other with 1 grade of node: 11,15,25,13,19,24;
3 grades of nodes are the node that directly links to each other with 2 grades of nodes: 17,18,22,6,20,26;
4 grades of nodes are the node that directly links to each other with 3 grades of nodes: 7,27;
5 grades of nodes are the node that directly links to each other with 4 grades of nodes: 14,28;
6 grades of nodes are the node that directly links to each other with 5 grades of nodes: 21.
According to the recursive algorithm that is above provided, adopt under the prerequisite of row arrangement, the result of topological layout of network shown in Figure 13 is referring to Figure 14.
For the stability of further setting forth this algorithm (topological node coordinate stable) and terseness, below describe from increasing node and two aspects of deletion of node.
Figure 15 is the topological layout that obtains behind No. 29 nodes of increase.No. 29 node is connected with No. 1 node with No. 23 nodes, and according to the algorithm of describing herein, No. 29 nodes of increase are 1 grade of node.With reference to Figure 14 as can be known, Xin Zeng node can not impact to original layout.
With topological layout shown in Figure 14 is benchmark (not increasing node No. 29), deletes No. 13 node, exists between this node and No. 12, No. 6 and No. 20 nodes to be connected.With reference to Figure 16 as can be known, the same with newly-increased node, deletion of node 13 can not influence original topological layout (unless the user initiates the request of " layout again " again).
Above be arranged as the implementation that example provides an embodiment of the present invention with row, same, the mode that the present invention also can adopt row to arrange generates network topology layout, the difference of itself and embodiment mentioned above only is the transposing between node abscissa and the ordinate, this paper repeats no more, and the present invention is not intended to limit the form that groups of nodes becomes to arrange equally.
The present invention also provides the embodiment of Network Management Equipment, and with reference to Figure 17 as can be known, this Network Management Equipment comprises: interface unit 171, first computing unit 172, second computing unit 173, demonstration output unit 174, wherein:
Wherein, described second computing unit 173 also is used to calculate the coordinate of gateway node, makes one arrangement of gateway node composition and this arrangement as first order.
In network, the node that has annexation each other is father/child node each other, therefore, on the basis of above-mentioned gateway device embodiment, the calculating of 173 pairs of node coordinates of second computing unit further comprises: the computing node coordinate makes the child node that connects with identical father node in the same arrangement arrange according to the ID size order.
And further, the second computing unit computing node coordinate makes that euclidean distance between node pair equates in the same arrangement; Perhaps, on the basis that euclidean distance between node pair equates, center point coordinate is respectively arranged in also further adjustment, and feasible respectively to arrange symmetry axis identical.
More than the method and the Network Management Equipment of a kind of network configuration topological layout was described in detail to the embodiment of the invention provides, used specific case herein principle of the present invention and execution mode are set forth, the explanation of above embodiment just is used for helping to understand the present invention; Simultaneously, for one of ordinary skill in the art, according to thought of the present invention, the part that all can change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.
Claims (13)
1, the method for a kind of network configuration topological layout is characterized in that:
Obtain connection relation between nodes, described node comprises ordinary node and gateway node;
Obtain the short transmission routing times of ordinary node according to described annexation to nearest gateway node process;
In the reference coordinate system that presets, the computing node coordinate make the described identical ordinary node of short transmission routing times form an arrangement, and described short transmission routing times difference is 1 between adjacent arrangement;
Show ordinary node, and draw the annexation between ordinary node.
2, the method for network configuration as claimed in claim 1 topological layout is characterized in that described method further comprises:
Calculate the coordinate of gateway node, make gateway node form an arrangement; And,
The arrangement that gateway node is constituted shows as first order, draws the annexation between ordinary node and gateway node.
3, the method for network configuration as claimed in claim 1 or 2 topological layout is characterized in that: the arrangement that described node is constituted is shown as row or row.
4, the method for network configuration as claimed in claim 3 topological layout, the node that has annexation each other is father/child node each other, it is characterized in that:
In the same arrangement, arrange according to the ID size order with the child node that identical father node connects.
5, the method for network configuration as claimed in claim 1 topological layout is characterized in that:
The computing node coordinate makes that further euclidean distance between node pair equates in the same arrangement.
6, the method for network configuration as claimed in claim 5 topological layout is characterized in that:
The center point coordinate of arrangement of adjusting short transmission routing times and be n is identical with the arrangement center point coordinate of short transmission routing times n-1, makes that respectively to arrange symmetry axis identical.
7, network configuration as claimed in claim 3 topological layout method is characterized in that this method also comprises:
Obtain the annexation of newly-increased node and adjacent node;
Obtain the short transmission routing times of described newly-increased node to nearest gateway node process;
Calculate described newly-increased node coordinate, described newly-increased node is aligned to the align ends of corresponding short transmission routing times.
8, network configuration as claimed in claim 3 topological layout method is characterized in that this method also comprises:
Obtain the information of deletion of node, delete the annexation of coordinate and this node and the adjacent node of this node.
9, a kind of Network Management Equipment is characterized in that, comprising:
Interface unit is used to obtain connection relation between nodes, and described node comprises ordinary node and gateway node;
First computing unit is used to obtain the short transmission routing times of ordinary node to nearest gateway node process;
Second computing unit is used in the reference coordinate system that presets, and the coordinate of computing node make the described identical ordinary node of short transmission routing times form an arrangement, and described short transmission routing times difference is 1 between adjacent arrangement;
Show output unit, be used to show ordinary node, and draw the annexation between ordinary node.
10, Network Management Equipment as claimed in claim 9 is characterized in that:
Described second computing unit also is used to calculate the gateway node coordinate, makes one arrangement of gateway node composition and this arrangement as first order.
11, Network Management Equipment as claimed in claim 9, the node that has annexation each other is father/child node each other, it is characterized in that:
Second computing unit further comprises the calculating of node coordinate: the computing node coordinate makes the child node that connects with identical father node in the same arrangement arrange according to the ID size order.
12, Network Management Equipment as claimed in claim 9 is characterized in that:
Second computing unit further comprises the calculating of node coordinate: the computing node coordinate makes that euclidean distance between node pair equates in the same arrangement.
13, Network Management Equipment as claimed in claim 12 is characterized in that:
Second computing unit also is used for adjusting and respectively arranges center point coordinate, makes that respectively to arrange symmetry axis identical.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007100797574A CN100454848C (en) | 2007-03-07 | 2007-03-07 | Network structure topology layout method and network management device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007100797574A CN100454848C (en) | 2007-03-07 | 2007-03-07 | Network structure topology layout method and network management device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101035023A CN101035023A (en) | 2007-09-12 |
| CN100454848C true CN100454848C (en) | 2009-01-21 |
Family
ID=38731342
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2007100797574A Expired - Fee Related CN100454848C (en) | 2007-03-07 | 2007-03-07 | Network structure topology layout method and network management device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100454848C (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102739438A (en) * | 2011-04-08 | 2012-10-17 | 巴比禄股份有限公司 | Management apparatus and method |
Families Citing this family (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101217410B (en) * | 2008-01-07 | 2010-08-25 | 杭州华三通信技术有限公司 | A network topological structure exhibition method and device |
| CN101588263B (en) * | 2009-06-23 | 2013-04-24 | 广东电网公司电力通信中心 | Method for evaluating reliability of electric force communication network |
| US9148298B2 (en) * | 2011-02-03 | 2015-09-29 | Futurewei Technologies, Inc. | Asymmetric ring topology for reduced latency in on-chip ring networks |
| CN102291312A (en) * | 2011-09-05 | 2011-12-21 | 电子科技大学 | Routing selection method based on hierarchical IP (Internet Protocol) network coordinate system |
| CN103124279B (en) * | 2011-11-18 | 2015-12-02 | 浪潮(北京)电子信息产业有限公司 | The output intent of resource information and system |
| CN102546831A (en) * | 2012-02-28 | 2012-07-04 | 山东大学 | Dynamic display method for wireless sensor network topological diagram |
| CN103457768B (en) * | 2013-08-26 | 2017-12-01 | 上海斐讯数据通信技术有限公司 | A kind of local network management system and method |
| CN104426736B (en) * | 2013-08-29 | 2018-02-23 | 中国移动通信集团河南有限公司 | A kind of network topology layout method and apparatus |
| CN105743727B (en) * | 2014-12-10 | 2019-11-05 | 南京中兴新软件有限责任公司 | Detection processing method and device |
| CN108696380B (en) * | 2017-04-11 | 2021-05-25 | 深圳市江机实业有限公司 | Automatic node role display method for broadband carrier routing node topological graph |
| CN108964964A (en) | 2017-11-01 | 2018-12-07 | 新华三技术有限公司 | A kind of network topology display methods and device |
| CN108429640B (en) * | 2018-02-27 | 2021-03-30 | 北京天元创新科技有限公司 | Display method and device for nodes of network equipment |
| CN109739859B (en) * | 2018-12-29 | 2022-08-30 | 深圳证券信息有限公司 | Relation map drawing method, system and related device |
| CN110086665A (en) * | 2019-04-25 | 2019-08-02 | 北京计算机技术及应用研究所 | A kind of network topological diagram methods of exhibiting based on jTopo |
| CN112887112A (en) * | 2019-11-29 | 2021-06-01 | 中兴通讯股份有限公司 | Site coordinate planning method, device, equipment and storage medium |
| CN111028311A (en) * | 2019-12-16 | 2020-04-17 | 南京富士通南大软件技术有限公司 | Method for optimizing aspect ratio of topological graph of plane orthogonal network |
| CN111404795B (en) * | 2020-03-25 | 2023-04-11 | 山东工商学院 | Bus type topology network node layout method |
| CN111985181B (en) * | 2020-08-25 | 2023-09-22 | 北京灵汐科技有限公司 | Node layout method and device, computer equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001010072A2 (en) * | 1999-07-29 | 2001-02-08 | Mci Worldcom, Inc. | Method of and system for extending internet telephony over virtual private network direct access lines |
| CN1449158A (en) * | 2002-03-28 | 2003-10-15 | 华为技术有限公司 | Network topology information acquisition method |
| CN1592160A (en) * | 2003-09-02 | 2005-03-09 | 华为技术有限公司 | Method for obtaining path with protective body in intelligent optical network |
| US6980537B1 (en) * | 1999-11-12 | 2005-12-27 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for communication network cluster formation and transmission of node link status messages with reduced protocol overhead traffic |
| JP2006005753A (en) * | 2004-06-18 | 2006-01-05 | Nec Corp | Method, system, server and program for deriving communication topology |
| CN1756188A (en) * | 2004-09-30 | 2006-04-05 | 北京航空航天大学 | Large-scale network topology graphics display method |
| CN1780285A (en) * | 2004-11-28 | 2006-05-31 | 中兴通讯股份有限公司 | Hierarchical topological network geographic information displaying method |
| CN1901503A (en) * | 2005-07-22 | 2007-01-24 | 中兴通讯股份有限公司 | Method for obtaining intelligent light network restraining route |
-
2007
- 2007-03-07 CN CNB2007100797574A patent/CN100454848C/en not_active Expired - Fee Related
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001010072A2 (en) * | 1999-07-29 | 2001-02-08 | Mci Worldcom, Inc. | Method of and system for extending internet telephony over virtual private network direct access lines |
| US6980537B1 (en) * | 1999-11-12 | 2005-12-27 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for communication network cluster formation and transmission of node link status messages with reduced protocol overhead traffic |
| CN1449158A (en) * | 2002-03-28 | 2003-10-15 | 华为技术有限公司 | Network topology information acquisition method |
| CN1592160A (en) * | 2003-09-02 | 2005-03-09 | 华为技术有限公司 | Method for obtaining path with protective body in intelligent optical network |
| JP2006005753A (en) * | 2004-06-18 | 2006-01-05 | Nec Corp | Method, system, server and program for deriving communication topology |
| CN1756188A (en) * | 2004-09-30 | 2006-04-05 | 北京航空航天大学 | Large-scale network topology graphics display method |
| CN1780285A (en) * | 2004-11-28 | 2006-05-31 | 中兴通讯股份有限公司 | Hierarchical topological network geographic information displaying method |
| CN1901503A (en) * | 2005-07-22 | 2007-01-24 | 中兴通讯股份有限公司 | Method for obtaining intelligent light network restraining route |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102739438A (en) * | 2011-04-08 | 2012-10-17 | 巴比禄股份有限公司 | Management apparatus and method |
| CN102739438B (en) * | 2011-04-08 | 2015-07-22 | 巴法络股份有限公司 | Management apparatus and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101035023A (en) | 2007-09-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100454848C (en) | Network structure topology layout method and network management device | |
| CN102136946B (en) | Optical network topology graph drawing method and topological subsystem | |
| Guan et al. | Synchronization of complex dynamical networks with time-varying delays via impulsive distributed control | |
| Greenstein et al. | DIFS: A distributed index for features in sensor networks | |
| CN102638411B (en) | Optical interconnection network system of data center based on hyper-cubic cluster and communication method | |
| CN104391907B (en) | A kind of fast path method for searching of variable resolution degree | |
| Prisacari et al. | Bandwidth-optimal all-to-all exchanges in fat tree networks | |
| CN105471749B (en) | The exponent number flexibly extensive interconnection network topological structure of low diameter and method for routing | |
| Sun | Research on the construction of smart tourism system based on wireless sensor network | |
| CN103020267B (en) | Based on the complex network community structure method for digging of triangular cluster multi-label | |
| CN102780628B (en) | On-chip interconnection network routing method oriented to multi-core microprocessor | |
| CN104009907B (en) | " all to all " message exchanges in concurrent computational system | |
| Parsonage et al. | Generalized graph products for network design and analysis | |
| CN103916327A (en) | Method for balancing loads of HP2P networks | |
| CN105243237A (en) | Assembly technology structure tree and building method thereof | |
| CN104780101A (en) | FIB (Forward Information Base) table structure in named data networking forwarding plane and retrieval method thereof | |
| CN106685745A (en) | Network topology construction method and device | |
| CN114124384B (en) | QKD network virtualization method and quantum key cloud platform | |
| Delabays et al. | Multistability and anomalies in oscillator models of lossy power grids | |
| CN101355448B (en) | Method and apparatus for comparing upload | |
| CN108768864B (en) | Data center network topology system easy to expand and high in fault tolerance | |
| Klappenecker et al. | On the monomiality of nice error bases | |
| Gao et al. | U 2-Tree: A Universal Two-Layer Distributed Indexing Scheme for Cloud Storage System | |
| Adhikari et al. | Leafycube: A Novel Hypercube Derivative for Parallel Systems | |
| CN115242653A (en) | Hybrid data center network topology structure design method supporting VLC |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090121 Termination date: 20170307 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |