CN1145311C - Graphical representation method of topological structure of network notes - Google Patents
Graphical representation method of topological structure of network notes Download PDFInfo
- Publication number
- CN1145311C CN1145311C CNB011234814A CN01123481A CN1145311C CN 1145311 C CN1145311 C CN 1145311C CN B011234814 A CNB011234814 A CN B011234814A CN 01123481 A CN01123481 A CN 01123481A CN 1145311 C CN1145311 C CN 1145311C
- Authority
- CN
- China
- Prior art keywords
- node
- son
- father
- nodes
- child
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention discloses a graphical representation method of the topological structure of network notes. In the method, a root node is used as the center of a circle; at first, the son nodes of the root node are arranged on a circumference with a fixed radius to divide the entire circumference into a plurality of sectors; each of the son nodes occupies one of the sectors; each of the son nodes is arranged on the angular bisector of a corresponding sector angle; the size of the sector angle is calculated by weighted average, and a weighted value is the number of leaf nodes of a subtree using the corresponding son node as a root. Secondary son nodes are positioned by analogy to realize the graphical representation with annular distribution. The graphical representation obtained by the method of the present invention has the advantages of visual and clear result, uniform distribution and high running efficiency of a system.
Description
Technical field
The present invention relates to network management, relate in particular in the network management method for expressing network node topological structure.
Background technology
In network management system, by finding the operation of algorithm, can find the whole network node and internodal connected relation, note topology of networks, for being converted to graph direct ground, the topological structure that will be write down shows that the method for using mainly contains right-angle array, hierarchal arrangement and symmetric arrays etc. at present.The particularity that connects in network management system because between the network equipment, the display packings that adopt the node symmetric arrays more, through the demonstration that is evenly distributed of the topology diagram of symmetric arrays more, as ring-like symmetric arrays method, utilize the principle of graph theory, at first set up a sequence sets for all nodes, and all node elements in the sequence sets are calculated maximum step-length between them, determine that then all are communicated with ring-like greastest element as the ring-like sign of this connection in the sequence sets, at last maximum step-length of each element utilization and place are communicated with the ring-like recursive calculation of carrying out, thereby draw the positional value of each node, this method complexity is higher, and takies a large amount of memory headroom storage medians.
Summary of the invention
In order to overcome weak point of the prior art, a kind of graphical representation method of topological structure of network notes directly perceived, simple and easy to do and saving system resource of knowing is provided, the technical solution used in the present invention is: at first, in all nodes, find out the leaf node of subordinate's subtree and count the node of sum maximum as root node, with its position is the origin of coordinates, the sector angle of root node is decided to be 360 °, an optional angle is calculated horizontal stroke, the ordinate value of all the other all nodes again as the position angle of root node according to following formula:
x
son (n)＝x
father+R*cos(α
son (n))；
y
son (n)＝y
father+R*sin(α
son (n))；
Wherein, x
Father, y
FatherBe horizontal stroke, the ordinate of father node, x
Son (n), Y
Son (n)Be horizontal stroke, the ordinate of n child node of father node, R is the length of the line segment that connects father and son's node, α
Son (n)Be the position angle of n child node of father node, position angle α
Son (n)Calculate according to following formula:
α
son (n)＝α
father-β
father/2+β
son (n)/2 (n＝1)；
α
son (n)＝α
son (n-1)+(β
son (n-1)+β
son (n))/2 (n＞1)；
Wherein, α
FatherBe the position angle of father node, β
FatherBe the sector angle of father node, β
Son (n)Be the sector angle of n child node of father node, sector angle β
Son (n)Calculate according to following formula:
β
son (n)＝β
father*m
son(n)/m
father；
Wherein, m
Son (n)For the leaf node of n all subtrees of child node of father node is counted sum, m
FatherFor the leaf node of all subtrees of father node is counted sum, described n is a natural number; And: all child nodes are connected with line segment with corresponding father node.
The design philosophy of above technical scheme is, with the root node is the center of circle, earlier the child node of root node is arranged on the circumference of certain radii fixus, whole circumference is divided into several sectors, each child node occupies one of them, and each child node is placed on the angular bisector at respective sectors angle, the size weighted average calculation of sector angle, weights are for being the leaf node number of the subtree of root with corresponding child node.Then, be root with each child node again, with the root is the center of circle, in the sector angle under separately, still adopt same weighted average calculation, be that secondary child node divides corresponding separately sector angle, and they are placed on the angular bisector at respective sectors angle apart from the center of circle is on the position of radii fixus, the rest may be inferred, all is positioned until all nodes.Adopt such annular spread graphic technique, compared with prior art, not only realize easily, visual result is clear, be evenly distributed, and do not produce a large amount of medians, saves system resource, improves operational efficiency.
Description of drawings
Fig. 1 is a network topology structure figure who adopts the inventive method to represent;
Fig. 2 is a flow chart of determining node location among embodiment of the inventive method.
Embodiment
Shown in Figure 2 is an embodiment of the inventive method, flow process comprises five steps, execution in step A at first, root node location and initial value are set, promptly in all nodes, find out the leaf node of subordinate's subtree and count the node of sum maximum as root node, with its position is the origin of coordinates, and the sector angle of root node is decided to be 360 °, and an optional angle is as the position angle of root node.Execution in step B is to step e, till the horizontal stroke that calculates all the other all nodes, ordinate value then.The content of step B is to calculate the occupied sector angle of each child node of father node, sector angle β
Son (n)Calculate according to following formula:
β
son (n)＝β
father*m
son(n)/m
father；
Wherein, m
Son (n)For the leaf node of n all subtrees of child node of father node is counted sum, m
FatherFor the leaf node of all subtrees of father node is counted sum; The content of step C is to calculate the position angle of each child node, position angle α one by one
Son (n)Calculate according to following formula:
α
son (n)＝α
father-β
father/2+β
son (n)/2 (n＝1)；
α
son (n)＝α
son (n-1)+(β
son (n-1)+β
son (n))/2 (n＞1)；
Wherein, α
FatherBe the position angle of father node, β
FatherBe the sector angle of father node, β
Son (n)Sector angle for n child node of father node; The content of step D is to calculate the coordinate of each child node, and horizontal stroke, the ordinate value of node are respectively:
x
son (n)＝x
father+R*cos(α
son (n))；
y
son (n)＝y
father+R*sin(α
son (n))；
Wherein, x
Father, y
FatherBe horizontal stroke, the ordinate of father node, x
Son (n), Y
Son (n)Be horizontal stroke, the ordinate of n child node of father node, R is the length of the line segment that connects father and son's node, α
Son (n)Position angle for n child node of father node.The content of step e is to judge the root node that whether has secondary subtree in above-mentioned each child node, if, return step B, if not, finish computing.The coordinate that node has been arranged, and all child nodes are connected with line segment with corresponding father node, just forming complete topological diagram, said n is a natural number.
Further specify the inventive method with reference to flow process shown in Figure 2 with the calculation of concrete numerical value at example shown in Figure 1 below.
In the tree structure shown in Figure 1, have 12 leaf nodes, its root node has 3 subtrees, and the leaf node number is respectively 2,4,6, at first execution in step A, with the root node position is the origin of coordinates, the sector angle of root node is decided to be 360 °, with 150 ° of position angles, execution in step B then as root node, calculate three sector angle that child node is occupied of root node, be respectively promptly 60 °, 120 °, 180 ° of 4/12,360 ° of * of 2/12,360 ° of * of 360 ° of * 6/12.Continue step C, calculate their position angle one by one, be respectively promptly 0 °, 90 °, 240 ° of 150 °-360 °/2+60 °/2,0 °+(60 °+120 °)/2,90 °+(120 °+180 °)/2.The position angle that three nodes have been arranged is set a length value R who connects the line segment of father and son's node again, at the formula of step D substitution coordinates computed value, can obtain the position of these three nodes.Below again with above-mentioned second node, i.e. P (x among Fig. 1
0, y
0) be example, continue the calculation procedure of its child node of calculation, it has two child nodes, Dui Ying leaf node number is 3,1 respectively, by step B, calculates its occupied sector angle, be respectively promptly 90 °, 30 ° of 3/4,120 ° of * of 120 ° of * 1/4, continue step C, calculate their position angle one by one, be respectively:
α
1=α
0-β
0/ 2+ β
1/ 2, α
2=α
1+ (β
1+ β
2)/2, the substitution numerical computations obtains
α
1＝90°-120°/2+90°/2＝75°、α
2＝75°+(90°+30°)/2＝135°。
Above-mentioned position angle can be calculated the coordinate (x of node C by step D
1, y
1) with and the coordinate figure of the brotgher of node, wherein x
1=x
0+ R*cos (α
1);
y
1＝y
0+R*sin(α
1)。
The rest may be inferred, can calculate the coordinate figure of all nodes in publishing picture, and simultaneously all child nodes is connected with line segment with corresponding father node, just forms complete topological diagram.
In order to make topological diagram be shown in the rectangle drawing that length and width do not wait better, the magnification that also can set abscissa and ordinate is respectively R
X, R
Y, comply with following formula again according to the absolute position (X of the origin of coordinates in topology diagram
0, Y
0) and the node horizontal stroke that calculates by position angle, absolute position that ordinate value x, y calculate all the other each nodes (X, Y):
X＝X
0+x*R
X；
Y＝Y
0+y*R
Y。
For the network configuration that constitutes by some disconnected each other subtrees, can root node being set to the actual root node of each subtree is the virtual father node of child node, described with all child nodes with after corresponding father node is connected with line segment, this virtual father node is deleted with the line segment that is connected between its child node, can be obtained the diagram of this network configuration.
Claims (3)
1, a kind of graphical representation method of topological structure of network notes, it is characterized in that: at first, in all nodes, find out the leaf node of subordinate's subtree and count the node of sum maximum as root node, with its position is the origin of coordinates, the sector angle of root node is decided to be 360 °, an optional angle is calculated horizontal stroke, the ordinate value of all the other all nodes again as the position angle of root node according to following formula:
x
son (n)＝x
father+R*cos(α
son (n))；
y
son (n)＝y
father+R*sin(α
son (n))；
Wherein, x
Father, y
FatherBe horizontal stroke, the ordinate of father node, x
Son (n), Y
Son (n)Be horizontal stroke, the ordinate of n child node of father node, R is the length of the line segment that connects father and son's node, α
Son (n)Be the position angle of n child node of father node, position angle α
Son (n)Calculate according to following formula:
α
son (n)＝α
father-β
father/2+β
son (n)/2 (n＝1)；
α
son (n)＝α
son (n-1)+(β
son (n-1)+β
son (n))/2 (n＞1)；
Wherein, α
FatherBe the position angle of father node, β
FatherBe the sector angle of father node, β
Son (n)Be the sector angle of n child node of father node, sector angle β
Son (n)Calculate according to following formula:
β
son (n)＝β
father*m
son (n)/m
father；
Wherein, m
Son (n)For the leaf node of n all subtrees of child node of father node is counted sum, m
FatherFor the leaf node of all subtrees of father node is counted sum, described n is a natural number; And: all child nodes are connected with line segment with corresponding father node.
2, graphical representation method of topological structure of network notes as claimed in claim 1 is characterized in that: the magnification of setting abscissa and ordinate is respectively R
X, R
Y, comply with following formula again according to the absolute position (X of the origin of coordinates in topology diagram
0, Y
0) and the node horizontal stroke that calculates by position angle, absolute position that ordinate value x, y calculate all the other each nodes (X, Y):
X＝X
0+x*R
X；
Y＝Y
0+y*R
Y。
3, graphical representation method of topological structure of network notes as claimed in claim 1 or 2, it is characterized in that: for the network configuration that constitutes by some disconnected each other subtrees, it is the virtual father node of child node that described root node is set to the actual root node of each subtree, described with all child nodes with after corresponding father node is connected with line segment, this virtual father node is deleted with the line segment that is connected between its child node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB011234814A CN1145311C (en) | 2001-07-26 | 2001-07-26 | Graphical representation method of topological structure of network notes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB011234814A CN1145311C (en) | 2001-07-26 | 2001-07-26 | Graphical representation method of topological structure of network notes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1399443A CN1399443A (en) | 2003-02-26 |
| CN1145311C true CN1145311C (en) | 2004-04-07 |
Family
ID=4665087
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB011234814A Expired - Fee Related CN1145311C (en) | 2001-07-26 | 2001-07-26 | Graphical representation method of topological structure of network notes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1145311C (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1756188B (en) * | 2004-09-30 | 2011-03-23 | 北京航空航天大学 | Large-scale network topology graphics display method |
| CN101145966B (en) * | 2007-07-17 | 2010-06-23 | 中兴通讯股份有限公司 | A generation method for network element topology structure |
| EP2063584A1 (en) * | 2007-11-22 | 2009-05-27 | Thomson Licensing | Method for routing and load balancing in mesh networks |
| CN101848229B (en) * | 2009-03-24 | 2014-06-25 | 北京理工大学 | Method for solving minimum generated network problem in distributed network computing |
| CN106027322B (en) * | 2016-08-04 | 2019-11-12 | 吴文卿 | A kind of topological diagram end tree autoplacement method |
| CN108234205B (en) * | 2017-12-29 | 2021-11-12 | 中国电子科技网络信息安全有限公司 | Network topology structure and information presentation method thereof |
| CN110968298B (en) * | 2018-09-30 | 2023-03-10 | 上海羚驭信息技术有限公司 | Management system and method applied to instantiation requirements |
| CN110602854B (en) * | 2019-09-09 | 2021-04-02 | 杭州行至云起科技有限公司 | Topological structure recognition system and method for intelligent lighting system |
| CN112583620B (en) * | 2019-09-30 | 2023-05-23 | 北京国双科技有限公司 | Network topology map generation method, device, electronic equipment and storage medium |
| CN115630698B (en) * | 2022-12-08 | 2023-04-11 | 国家电网有限公司客户服务中心 | Knowledge graph visualization method and device based on force guide graph and electronic equipment |
-
2001
- 2001-07-26 CN CNB011234814A patent/CN1145311C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1399443A (en) | 2003-02-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1145311C (en) | Graphical representation method of topological structure of network notes | |
| CN1097246C (en) | Method of initializing and updating network model | |
| CN1276392C (en) | Reference based parametric dimensioning method and system | |
| CN108664999A (en) | A kind of training method and its device, computer server of disaggregated model | |
| CN102254312A (en) | Method for splicing geographical tile graphs | |
| WO2020206671A1 (en) | Attribute-based point cloud strip division method | |
| CN1818878A (en) | Information system data consistency detection | |
| CN1191352A (en) | Method and apparatus for adaptive nonlinear projective rendering | |
| CN101075249A (en) | Data warehouse system and its construction for geographical information system | |
| CN105139449A (en) | Three-dimensional model compression method based on three-dimensional mesh subdivision and coding | |
| KR20160140381A (en) | Compressor and Method for Variable-Rate Texture Compression | |
| CN101976468A (en) | Method and system for visualizing multiresolution dynamic landform | |
| CN112115226B (en) | Map rendering method and map rendering device | |
| CN104182913A (en) | Power grid mode picture forming and intelligent distributing method | |
| CN1132121C (en) | Image processor and data processing system using the same processor | |
| CN1866218A (en) | Source management method for software system | |
| CN107784001A (en) | Parallel spatial querying method based on CUDA | |
| CN205899536U (en) | Geographic information service system based on tile map | |
| CN115865099B (en) | Huffman coding-based multi-type data segment compression method and system | |
| CN116630160A (en) | Cell image super-resolution reconstruction method and system based on convolution network | |
| Stocco et al. | Integer dilation and contraction for quadtrees and octrees | |
| CN114281465A (en) | Data display and rapid processing method and system applied to power distribution room | |
| Maehara | Note on induced subgraphs of the unit distance graph E n | |
| CN109816184B (en) | Topology planning method and device for large wind farm | |
| CN114691797A (en) | Method for thinning surface data in electronic map |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| 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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20040407 Termination date: 20110726 |