CN108696380B - Automatic node role display method for broadband carrier routing node topological graph - Google Patents
Automatic node role display method for broadband carrier routing node topological graph Download PDFInfo
- Publication number
- CN108696380B CN108696380B CN201710234948.7A CN201710234948A CN108696380B CN 108696380 B CN108696380 B CN 108696380B CN 201710234948 A CN201710234948 A CN 201710234948A CN 108696380 B CN108696380 B CN 108696380B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- topological graph
- maintenance
- failed
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/142—Network analysis or design using statistical or mathematical methods
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/22—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks comprising specially adapted graphical user interfaces [GUI]
Abstract
The invention discloses a method for automatically displaying the node roles of a broadband carrier routing node topological graph, which belongs to the technical field of topological graph node role display. The method comprises the following implementation processes: reading the topology information and storing the topology information in a database; counting the number of nodes of the same type to obtain the maximum level number; obtaining the width of each node and node block from the highest level node; acquiring coordinates of each node from the first layer; matching and displaying the color of the corresponding node according to the role information; acquiring Y-axis coordinates of the nodes according to the levels; acquiring X-axis coordinates of the nodes according to the width of the nodes; acquiring the size of a view window according to the hierarchy and the width of a root node; counting the number of the refreshing nodes; drawing a straight line or a right-angle line according to the coordinates; drawing a circle according to the coordinates; displaying the number according to the coordinate and the TEI; coloring according to the character type.
Description
Technical Field
The invention relates to the technical field of node role display of a topological graph, in particular to a node role automatic display method of a broadband carrier routing node topological graph.
Background
The colors displayed by the nodes in the current broadband carrier routing node topological graph are all displayed in the same color, so that the nodes with different roles are not easy to distinguish, and the nodes with different roles are not easy to maintain in a targeted manner.
Disclosure of Invention
The invention provides a method for automatically displaying the node roles of a broadband carrier routing node topological graph, which aims to solve the defects of node display in the existing broadband carrier routing node topological graph and can display the colors corresponding to the roles of the corresponding nodes on the corresponding nodes according to the roles of the nodes in the broadband carrier routing node topological graph, so that the nodes with the same roles display the same colors, and the nodes with different roles display different colors, thereby facilitating the targeted management and maintenance of the nodes.
The technical problem is solved by the following technical scheme:
the method for automatically displaying the node role of the broadband carrier routing node topological graph comprises the following steps:
step a, reading topology information and storing the topology information in a database;
step b, counting the number of nodes of the same type, and counting TEI and agent TEI;
step c, acquiring the maximum layer number;
d, obtaining the width of each node and node block from the highest level node;
step e, acquiring coordinates of each node from the first layer;
step e1, matching and displaying the corresponding node color according to the role information;
step e2, acquiring Y-axis coordinates of the nodes according to the hierarchy;
step e3, acquiring the X-axis coordinate of the node according to the width of the node;
step f, obtaining the size of a view window according to the hierarchy and the width of a root node;
step g, counting the number of the refreshing nodes;
step h, drawing;
h1, drawing a straight line or a right-angle line according to the coordinates;
h2, drawing a circle according to the coordinates;
h3, displaying the number according to the coordinate and the TEI;
h4, coloring according to the role type, wherein the colors are the same in the same role type and different in different role types;
step i, the topological graph can be enlarged or reduced when the mouse pulley slides up and down;
j, when the mouse moves to a certain node, the node information can be obtained, and when the mouse moves away from the certain node, the node information can be automatically cancelled;
therefore, automatic matching display of the role colors of the corresponding nodes is realized in the topological graph of the broadband carrier routing node, the nodes with the same roles have the same color, and the nodes with different roles have different colors.
The method can display the color corresponding to the role of the corresponding node on the corresponding node according to the role of the node in the broadband carrier routing node topological graph, so that the nodes with the same role display the same color, and the nodes with different roles display different colors, thereby being convenient for carrying out targeted management and maintenance on the nodes.
Preferably, in step i, the mouse wheel slides up and down to control the view width, the view height, the circle radius, the image top and bottom margins, the image left and right margins and the margin width of the right side of the image of the topological graph, and refresh the view width, the view height, the circle radius, the image top and bottom margins, the image left and right margins and the margin width of the right side of the image in real time.
Preferably, in step j, when the mouse moves to a certain node, the node information can be acquired, the coordinates of the mouse are acquired in real time, the node information is displayed on the interface when the mouse moves to the area where the certain node is located, and the node information automatically disappears from the interface when the mouse moves away from the area where the node is located; the node information comprises an MAC address, a TEI, an agent TEI, a role, a hierarchy and a meter reading success rate; wherein TEI represents a node identifier, proxy TEI is a parent node of TEI, and TEI is a child node of proxy TEI.
Preferably, in step a, the node types of the topology information include six types of CCO, UCCO, STA, USTA, PCO, and dropped; wherein, CCO represents the concentrator module that the existing station PCO or STA accesses the network, UCCO represents the concentrator module that no station PCO or STA accesses the network, STA represents the table module that the existing station accesses the network, USTA represents the table module STA that does not access the network, and PCO represents the relay module.
Preferably, when there are more than two nodes in the same hierarchy, a segment of line extending downward is displayed at the lower end of any one of the nodes of the sub-nodes in the same hierarchy, and the color of the segment of line is consistent with the color of the corresponding node.
Preferably, the layer in which the parent node is located is a parent layer, the layer in which the child node is located is a child layer, and when there are two or more nodes in both the parent layer and the child layer, if the parent node of the child layer node is abnormal, the node of the child layer is automatically connected to any other node in the parent layer.
Preferably, in step a, after the topology information is read and stored in the database, a priority maintenance selection module that requires priority maintenance for each node corresponding to the topology map is further stored in the database, and when both nodes in the topology map fail, it is determined that the node with the high priority is maintained first according to the priority of the two failed nodes in the priority maintenance selection module, and the node with the low priority is maintained later.
Preferably, the priority maintenance selection module includes a physical address of a maintainer currently located by a maintainer who is convenient to maintain a certain node, a node physical address of each node in the topological graph, a distance value from the physical address of the maintainer who is convenient to maintain a failed node to the physical address of any node in the topological graph, an average distance value obtained by dividing the sum of the distance values from the physical address of the maintainer who is convenient to maintain the failed node to the physical addresses of all nodes in the topological graph by the number of all nodes in the topological graph, the average failure times per month of each node in the topological graph, the convenient weight of maintenance personnel to the node to be maintained in the topological graph and the failure weight of each node in the topological graph are obtained by dividing the sum of the average failure times per month of each node in the topological graph by the number of all nodes in the topological graph;
the convenience weight is obtained by the numerical value of the time length from the physical address of the maintenance personnel to the physical address of the corresponding fault node in the topological graph;
the failure weight is obtained by adding the numerical value of the reciprocal of the level number of the layer where the corresponding node is located and the numerical value of the number of the sub-nodes contained in the corresponding node.
Preferably, the priority level of the fault node in the priority maintenance selection module is calculated by adopting the following algorithm:
let the two nodes in the topology graph that both fail be a failed node a and a failed node B,
the priority C1 of the failed node a is calculated using the following algorithm:
C1＝(D1÷E1)×F1+(G1÷H)×I1 (1)；
the priority C2 of the failed node B is calculated using the following algorithm:
C2＝(D2÷E2)×F2+(G2÷H)×I2 (2)；
wherein the content of the first and second substances,
h represents the integral monthly average failure times obtained after the sum of the monthly average failure times of each node in the topological graph is divided by the number of all the nodes in the topological graph,
d1 represents the distance value between the physical address of the maintenance person who facilitated the maintenance on the failed node a to the physical address of the failed node a,
e1 represents an average distance value obtained by dividing the sum of the distance values from the physical address of the maintenance person who facilitates maintenance on the failed node a to the physical addresses of all nodes in the topology map by the number of all nodes in the topology map,
f1 represents a convenient weight from a maintainer who facilitates maintenance of the failed node a to the node to be maintained in the topological graph, which is equal to the value of the length of time required for the maintainer who facilitates maintenance of the failed node a to reach the physical address of the failed node a;
g1 indicates the average number of failures per month of the failed node a,
i1 represents the failure weight of the failed node A in the topological graph, the failure weight is equal to the value of the reciprocal of the level number of the layer where the failed node A is located plus the value of the number of the child nodes contained in the failed node A,
d2 represents the distance value between the physical address of the maintenance person who facilitated the maintenance on the failed node B to the physical address of the failed node B,
e2 represents an average distance value obtained by dividing the sum of the distance values from the physical address of the maintenance person who facilitated the maintenance of the failed node B to the physical addresses of all the nodes in the topology map by the number of all the nodes in the topology map,
f2 represents a convenient weight from a maintainer who facilitates maintenance on the failed node B to the node to be maintained in the topology map, which is equal to the value of the length of time required for the maintainer to facilitate maintenance on the failed node B to travel from the maintainer's physical address to the physical address of the failed node B,
g2 indicates the self monthly mean failure number of the failed node B,
i2 represents the failure weight of the failed node B in the topology map, which is equal to the reciprocal value of the number of levels of the layer where the failed node B is located plus the number of child nodes contained in the failed node B,
if the C1 is greater than or equal to C2, the maintenance personnel preferentially maintain the failed node A,
if C1 is less than C2, then maintenance personnel will prioritize the maintenance of the failed node B.
The invention can achieve the following effects:
the invention can display the color corresponding to the role of the corresponding node on the corresponding node according to the role of the node in the broadband carrier routing node topological graph, so that the nodes with the same role display the same color, and the nodes with different roles display different colors, thereby being convenient for carrying out targeted management and maintenance on the nodes.
Drawings
Fig. 1 is a schematic diagram of a rectangular wire connection structure of a topological diagram according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of a linear connection structure of a topological diagram according to an embodiment of the present invention.
Detailed Description
The invention is further described with reference to the following figures and examples.
In an embodiment, a method for automatically displaying a node role of a broadband carrier routing node topology map is shown in fig. 1-2, and an implementation process of the method includes the following steps:
step a, reading topology information and storing the topology information in a database;
step b, counting the number of nodes of the same type, and counting TEI and agent TEI;
step c, acquiring the maximum layer number;
d, obtaining the width of each node and node block from the highest level node;
step e, acquiring coordinates of each node from the first layer;
step e1, matching and displaying the corresponding node color according to the role information;
step e2, acquiring Y-axis coordinates of the nodes according to the hierarchy;
step e3, acquiring the X-axis coordinate of the node according to the width of the node;
step f, obtaining the size of a view window according to the hierarchy and the width of a root node;
step g, counting the number of the refreshing nodes;
step h, drawing;
h1, drawing a straight line or a right-angle line according to the coordinates;
h2, drawing a circle according to the coordinates;
h3, displaying the number according to the coordinate and the TEI;
h4, coloring according to the role type, wherein the colors are the same in the same role type and different in different role types;
in fig. 1 and 2, a node with a node identifier of 1 has a first role, and when the node 1 is labeled, the color of the node 1 is labeled as a color M1.
The nodes with node identifiers of 8, 2, 64, 384, 296, 320, 520 and 840 have a second role, and when the 8 nodes of node 8, node 2, node 64, node 384, node 296, node 320, node 520 and node 840 are colored, the color of the 8 nodes is labeled as color M2.
The nodes with node identifiers 15, 208, 32, 56, 104, 152, 160, 264, 280, 416, 464, 544, 432, 528, 704, 920, 904, and 936 have a third role, and when 18 nodes of the nodes 15, 208, 32, 56, 104, 152, 160, 264, 280, 416, 464, 544, 432, 528, 704, 920, 904, and 936 are colored, the color of the 18 nodes is labeled as the color M3. And the colors of color M1, color M2, and color M3 are all different.
Step i, the topological graph can be enlarged or reduced when the mouse pulley slides up and down;
j, when the mouse moves to a certain node, the node information can be obtained, and when the mouse moves away from the certain node, the node information can be automatically cancelled;
therefore, automatic matching display of the role colors of the corresponding nodes is realized in the topological graph of the broadband carrier routing node, the nodes with the same roles have the same color, and the nodes with different roles have different colors.
In the step i, the mouse pulley slides up and down to control the view width, the view height, the circular radius, the image upper and lower edge distances, the image left and right edge distances and the size of the free width on the right side of the image of the topological graph, and the topological graph is refreshed in real time.
In step j, the mouse can obtain the node information when moving to a certain node, the coordinates of the mouse are obtained in real time, the node information is displayed on the interface when the mouse moves to the area where the certain node is located, and the node information automatically disappears from the interface when the mouse moves away from the area where the node is located; the node information comprises an MAC address, a TEI, an agent TEI, a role, a hierarchy and a meter reading success rate; wherein TEI represents a node identifier, proxy TEI is a parent node of TEI, and TEI is a child node of proxy TEI.
In step a, the node types of the topology information comprise six types of CCO, UCCO, STA, USTA, PCO and disconnection; wherein, CCO represents the concentrator module that the existing station PCO or STA accesses the network, UCCO represents the concentrator module that no station PCO or STA accesses the network, STA represents the table module that the existing station accesses the network, USTA represents the table module STA that does not access the network, and PCO represents the relay module.
When more than two nodes exist in the same level, a section of line extending downwards is displayed at the lower end of any one node of the sub-nodes in the same level, and the color of the section of line is consistent with that of the corresponding node.
And if the parent node of the child node is abnormal, the node of the child node is automatically connected to any other node of the parent layer.
In the step a, after the topology information is read and stored in the database, a priority maintenance selection module which needs priority maintenance for each node corresponding to the topology map is also stored in the database, when two nodes in the topology map have faults, the nodes with high priority level are determined to be maintained firstly according to the priority levels of the two fault nodes in the priority maintenance selection module, and the nodes with low priority level are maintained later.
The priority maintenance selection module comprises a physical address of a maintainer where the maintainer convenient to maintain a certain node is located, a node physical address of each node in the topological graph, a distance value from the physical address of the maintainer convenient to maintain a fault node to the physical address of any node in the topological graph, and an average distance value obtained by dividing the sum of the distance values from the physical address of the maintainer convenient to maintain the fault node to the physical addresses of all nodes in the topological graph by the number of all nodes in the topological graph, the average failure times per month of each node in the topological graph, the convenient weight of maintenance personnel to the node to be maintained in the topological graph and the failure weight of each node in the topological graph are obtained by dividing the sum of the average failure times per month of each node in the topological graph by the number of all nodes in the topological graph;
the convenience weight is obtained by the numerical value of the time length from the physical address of the maintenance personnel to the physical address of the corresponding fault node in the topological graph;
the failure weight is obtained by adding the numerical value of the reciprocal of the level number of the layer where the corresponding node is located and the numerical value of the number of the sub-nodes contained in the corresponding node.
The priority level of the fault node in the priority maintenance selection module is calculated by adopting the following algorithm:
let the two nodes in the topology graph that both fail be a failed node a and a failed node B,
the priority C1 of the failed node a is calculated using the following algorithm:
C1＝(D1÷E1)×F1+(G1÷H)×I1 (1)；
the priority C2 of the failed node B is calculated using the following algorithm:
C2＝(D2÷E2)×F2+(G2÷H)×I2 (2)；
wherein the content of the first and second substances,
h represents the integral monthly average failure times obtained after the sum of the monthly average failure times of each node in the topological graph is divided by the number of all the nodes in the topological graph,
d1 represents the distance value between the physical address of the maintenance person who facilitated the maintenance on the failed node a to the physical address of the failed node a,
e1 represents an average distance value obtained by dividing the sum of the distance values from the physical address of the maintenance person who facilitates maintenance on the failed node a to the physical addresses of all nodes in the topology map by the number of all nodes in the topology map,
f1 represents a convenient weight from a maintainer who facilitates maintenance on the failed node a to the node to be maintained in the topology map, which is equal to the value of the length of time required for the maintainer to facilitate maintenance on the failed node a to travel from the maintainer's physical address to the physical address of the failed node a,
g1 indicates the average number of failures per month of the failed node a,
i1 represents the failure weight of the failed node A in the topological graph, the failure weight is equal to the value of the reciprocal of the level number of the layer where the failed node A is located plus the value of the number of the child nodes contained in the failed node A,
d2 represents the distance value between the physical address of the maintenance person who facilitated the maintenance on the failed node B to the physical address of the failed node B,
e2 represents an average distance value obtained by dividing the sum of the distance values from the physical address of the maintenance person who facilitated the maintenance of the failed node B to the physical addresses of all the nodes in the topology map by the number of all the nodes in the topology map,
f2 represents a convenient weight from a maintainer who facilitates maintenance on the failed node B to the node to be maintained in the topology map, which is equal to the value of the length of time required for the maintainer to facilitate maintenance on the failed node B to travel from the maintainer's physical address to the physical address of the failed node B,
g2 indicates the self monthly mean failure number of the failed node B,
i2 represents the failure weight of the failed node B in the topological graph, wherein the failure weight is equal to the numerical value of the reciprocal of the number of the layers of the failed node B plus the numerical value of the number of the child nodes contained in the failed node B;
if the C1 is greater than or equal to C2, the maintenance personnel preferentially maintain the failed node A,
if C1 is less than C2, then maintenance personnel will prioritize the maintenance of the failed node B.
For example, let two nodes in the topology graph that both fail be the failed node 8 and the failed node 840,
if the average monthly integral failure number H is 5,
the distance D1 between the physical address of the maintenance person who facilitates maintenance on the faulty node 8 and the physical address of the faulty node 8 is 10,
the average distance value E1 obtained by dividing the sum of the distance values from the physical address of the maintenance person who conveniently maintains the failed node 8 to the physical addresses of all the nodes in the topology map by the number of all the nodes in the topology map is 20,
the convenience weight from the maintainer who facilitates maintenance of the failed node 8 to the node to be maintained in the topology map, which is equal to the value of the length of time required from the maintainer's physical address to the physical address of the failed node 8 by the maintainer who facilitates maintenance of the failed node 8, F1 being 30,
the average number of self-monthly failures G1 of the failed node 8 is 9,
the failure weight of the failure node 8 in the topological graph is equal to the value of the reciprocal of the level number of the layer where the failure node 8 is located and the value of the number of the child nodes contained in the failure node 8, I1 ═ 1 ÷ 3) +3 ═ 10/3,
the distance D2 between the physical address of the maintenance person who facilitates maintenance on the failed node 840 to the physical address of the failed node 840 is 2,
the average distance value E2 obtained by dividing the sum of the distance values from the physical address of the maintenance personnel who conveniently maintain the failed node 840 to the physical addresses of all the nodes in the topology map by the number of all the nodes in the topology map is 10,
a convenience weight from a maintainer who facilitates maintenance of the failed node 840 to a node to be maintained in the topology map, which is equal to the value of the length of time required from the maintainer's physical address to the physical address of the failed node 840 by the maintainer who facilitates maintenance of the failed node 840, F2-60,
the average number of self-monthly failures G2 of the failed node 840 is 7,
the fault weight of the fault node 840 in the topology map is equal to the value of the reciprocal of the level number of the layer where the fault node 840 is located plus the value I2 (1 ÷ 7) +2 (15/7) of the number of child nodes included in the fault node 840;
the priority C1 of the failed node 8 is calculated using the following algorithm:
C1＝(10÷20)×30+(9÷5)×10/3＝21
the priority C2 of the failed node B is calculated using the following algorithm:
C2＝(2÷10)×60+(7÷5)×15/7＝15
if C1 is greater than or equal to C2, the maintenance personnel preferentially maintain the failed node 8.
According to the method and the device, the color corresponding to the role of the corresponding node can be displayed on the corresponding node according to the role of the node in the broadband carrier routing node topological graph, the nodes with the same role can display the same color, and the nodes with different roles can display different colors, so that the nodes can be managed and maintained in a targeted manner.
TABLE 1 data in concentrator modules
The node information in the topology diagrams of fig. 1 and 2 is generated from the data in table 1.
The embodiments of the present invention have been described above with reference to the accompanying drawings, but the implementation is not limited to the above-described embodiments, and those skilled in the art can make various changes or modifications within the scope of the appended claims.
Claims (6)
1. The method for automatically displaying the node role of the broadband carrier routing node topological graph is characterized in that the implementation process of the method comprises the following steps:
(a) reading the topology information and storing the topology information in a database;
(b) counting the number of nodes of the same type, and counting TEI and proxy TEI;
(c) acquiring the maximum layer number;
(d) obtaining the width of each node and node block from the highest level node;
(e) acquiring coordinates of each node from the first layer;
(e1) matching and displaying the color of the corresponding node according to the role information;
(e2) acquiring Y-axis coordinates of the nodes according to the levels;
(e3) acquiring X-axis coordinates of the nodes according to the width of the nodes;
(f) acquiring the size of a view window according to the hierarchy and the width of a root node;
(g) counting the number of the refreshing nodes;
(h) drawing;
(h1) drawing a straight line or a right-angle line according to the coordinates;
(h2) drawing a circle according to the coordinates;
(h3) displaying the number according to the coordinate and the TEI;
(h4) coloring according to the role types, wherein the same role types have the same color, and different role types have different colors;
(i) the topological graph can be enlarged or reduced when the mouse pulley slides up and down;
(j) when the mouse moves to a certain node, the node information can be acquired, and when the mouse moves away from the certain node, the node information can be automatically cancelled;
therefore, automatic matching display of role colors of corresponding nodes is realized in a topological graph of the broadband carrier routing node, the nodes with the same roles have the same color, and the nodes with different roles have different colors;
in the step (a), after reading the topology information and storing the topology information in the database, a priority maintenance selection module which needs priority maintenance for each node corresponding to the topology map is also stored in the database, when two nodes in the topology map have faults, the nodes with high priority level are determined to be maintained firstly according to the priority level of the two fault nodes in the priority maintenance selection module, and the nodes with low priority level are maintained later;
the priority maintenance selection module comprises a physical address of a maintainer where the maintainer convenient to maintain a certain node is located, a node physical address of each node in the topological graph, a distance value from the physical address of the maintainer convenient to maintain a fault node to the physical address of any node in the topological graph, and an average distance value obtained by dividing the sum of the distance values from the physical address of the maintainer convenient to maintain the fault node to the physical addresses of all nodes in the topological graph by the number of all nodes in the topological graph, the average failure times per month of each node in the topological graph, the convenient weight of maintenance personnel to the node to be maintained in the topological graph and the failure weight of each node in the topological graph are obtained by dividing the sum of the average failure times per month of each node in the topological graph by the number of all nodes in the topological graph;
the convenience weight is obtained by the numerical value of the time length from the physical address of the maintenance personnel to the physical address of the corresponding fault node in the topological graph;
the fault weight is obtained by adding the numerical value of the reciprocal of the level number of the layer where the corresponding node is located and the numerical value of the number of the child nodes contained in the corresponding node;
the priority level of the fault node in the priority maintenance selection module is calculated by adopting the following algorithm:
let the two nodes in the topology graph that both fail be a failed node a and a failed node B,
the priority C1 of the failed node a is calculated using the following algorithm:
C1＝(D1÷E1)×F1+(G1÷H)×I1 (1)；
the priority C2 of the failed node B is calculated using the following algorithm:
C2＝(D2÷E2)×F2+(G2÷H)×I2 (2)；
wherein the content of the first and second substances,
h represents the integral monthly average failure times obtained after the sum of the monthly average failure times of each node in the topological graph is divided by the number of all the nodes in the topological graph,
d1 represents the distance value between the physical address of the maintenance person who facilitated the maintenance on the failed node a to the physical address of the failed node a,
e1 represents an average distance value obtained by dividing the sum of the distance values from the physical address of the maintenance person who facilitates maintenance on the failed node a to the physical addresses of all nodes in the topology map by the number of all nodes in the topology map,
f1 represents a convenient weight from a maintainer who facilitates maintenance on the failed node a to the node to be maintained in the topology map, which is equal to the value of the length of time required for the maintainer to facilitate maintenance on the failed node a to travel from the maintainer's physical address to the physical address of the failed node a,
g1 indicates the average number of failures per month of the failed node a,
i1 represents the failure weight of the failed node A in the topological graph, the failure weight is equal to the value of the reciprocal of the level number of the layer where the failed node A is located plus the value of the number of the child nodes contained in the failed node A,
d2 represents the distance value between the physical address of the maintenance person who facilitated the maintenance on the failed node B to the physical address of the failed node B,
e2 represents an average distance value obtained by dividing the sum of the distance values from the physical address of the maintenance person who facilitated the maintenance of the failed node B to the physical addresses of all the nodes in the topology map by the number of all the nodes in the topology map,
f2 represents a convenient weight from a maintainer who facilitates maintenance on the failed node B to the node to be maintained in the topology map, which is equal to the value of the length of time required for the maintainer to facilitate maintenance on the failed node B to travel from the maintainer's physical address to the physical address of the failed node B,
g2 indicates the self monthly mean failure number of the failed node B,
i2 represents the failure weight of the failed node B in the topological graph, wherein the failure weight is equal to the numerical value of the reciprocal of the number of the layers of the failed node B plus the numerical value of the number of the child nodes contained in the failed node B;
if the C1 is greater than or equal to C2, the maintenance personnel preferentially maintain the failed node A,
if C1 is less than C2, then maintenance personnel will prioritize the maintenance of the failed node B.
2. The method according to claim 1, wherein in step (i), the sliding up and down of the mouse pulley can control the view width, the view height, the circle radius, the image top and bottom margins, the image left and right margins and the image right margin of the topology map, and refresh them in real time.
3. The method according to claim 1, wherein in step (j), the mouse is moved to a node to obtain the node information and obtain the coordinates of the mouse in real time, and when the mouse is moved to an area where the node is located, the node information is displayed on the interface, and when the mouse is removed from the area where the node is located, the node information automatically disappears from the interface; the node information comprises an MAC address, a TEI, an agent TEI, a role, a hierarchy and a meter reading success rate; wherein TEI represents a node identifier, proxy TEI is a parent node of TEI, and TEI is a child node of proxy TEI.
4. The method for automatically displaying node roles in a topology map of a broadband carrier routing node according to claim 1, wherein in step (a), the node types of the topology information include six types of CCO, UCCO, STA, USTA, PCO, and drop; wherein, CCO represents the concentrator module that the existing station PCO or STA accesses the network, UCCO represents the concentrator module that no station PCO or STA accesses the network, STA represents the table module that the existing station accesses the network, USTA represents the table module STA that does not access the network, and PCO represents the relay module.
5. The method according to claim 1, wherein when there are more than two nodes in the same level, a segment of line extending downward is displayed at the lower end of any one of the nodes of the sub-nodes in the same level, and the color of the segment of line is consistent with the color of the corresponding node.
6. The method according to claim 1, wherein the layer in which the parent node is located is a parent layer, the layer in which the child node is located is a child layer, and when there are two or more nodes in both the parent layer and the child layer, if the parent node of the child layer is abnormal, the node of the child layer is automatically connected to any other node in the parent layer.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710234948.7A CN108696380B (en) | 2017-04-11 | 2017-04-11 | Automatic node role display method for broadband carrier routing node topological graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710234948.7A CN108696380B (en) | 2017-04-11 | 2017-04-11 | Automatic node role display method for broadband carrier routing node topological graph |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108696380A CN108696380A (en) | 2018-10-23 |
| CN108696380B true CN108696380B (en) | 2021-05-25 |
Family
ID=63843517
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710234948.7A Active CN108696380B (en) | 2017-04-11 | 2017-04-11 | Automatic node role display method for broadband carrier routing node topological graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108696380B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109450697A (en) * | 2018-11-30 | 2019-03-08 | 四川安迪科技实业有限公司 | The topological relation and link information methods of exhibiting of Satellite Networking |
| CN112115390A (en) * | 2019-06-20 | 2020-12-22 | 华为技术有限公司 | Method, device and equipment for displaying topology structure diagram and storage medium |
| CN110838944B (en) * | 2019-11-15 | 2022-07-05 | 浪潮云信息技术股份公司 | Method for realizing cloud center tenant dimension topological graph |
| CN113822963A (en) * | 2021-09-22 | 2021-12-21 | 济南浪潮数据技术有限公司 | Method, system, equipment and storage medium for drawing and displaying topological graph |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6151595A (en) * | 1998-04-17 | 2000-11-21 | Xerox Corporation | Methods for interactive visualization of spreading activation using time tubes and disk trees |
| CN1521987A (en) * | 2003-01-28 | 2004-08-18 | 华为技术有限公司 | Implement method for network management system operation |
| CN101035023A (en) * | 2007-03-07 | 2007-09-12 | 华为技术有限公司 | Network structure topology layout method and network management device |
| CN101582793A (en) * | 2009-06-05 | 2009-11-18 | 东软集团股份有限公司 | Method and device for graphical display of network topology |
| CN101702656A (en) * | 2009-11-11 | 2010-05-05 | 北京神州泰岳软件股份有限公司 | Discovery method of network topology based on MPLS-VPN |
| CN104735745A (en) * | 2015-04-02 | 2015-06-24 | 吉林大学 | Establishing method and device for virtual backbone network in isomerism self-organizing network |
| CN105187259A (en) * | 2015-10-10 | 2015-12-23 | 上海斐讯数据通信技术有限公司 | Route management system and method generating topological graph on the basis of GNS tool |
| CN106445931A (en) * | 2015-08-04 | 2017-02-22 | 阿里巴巴集团控股有限公司 | Database node association relationship display method and apparatus |
-
2017
- 2017-04-11 CN CN201710234948.7A patent/CN108696380B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6151595A (en) * | 1998-04-17 | 2000-11-21 | Xerox Corporation | Methods for interactive visualization of spreading activation using time tubes and disk trees |
| CN1521987A (en) * | 2003-01-28 | 2004-08-18 | 华为技术有限公司 | Implement method for network management system operation |
| CN101035023A (en) * | 2007-03-07 | 2007-09-12 | 华为技术有限公司 | Network structure topology layout method and network management device |
| CN101582793A (en) * | 2009-06-05 | 2009-11-18 | 东软集团股份有限公司 | Method and device for graphical display of network topology |
| CN101702656A (en) * | 2009-11-11 | 2010-05-05 | 北京神州泰岳软件股份有限公司 | Discovery method of network topology based on MPLS-VPN |
| CN104735745A (en) * | 2015-04-02 | 2015-06-24 | 吉林大学 | Establishing method and device for virtual backbone network in isomerism self-organizing network |
| CN106445931A (en) * | 2015-08-04 | 2017-02-22 | 阿里巴巴集团控股有限公司 | Database node association relationship display method and apparatus |
| CN105187259A (en) * | 2015-10-10 | 2015-12-23 | 上海斐讯数据通信技术有限公司 | Route management system and method generating topological graph on the basis of GNS tool |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108696380A (en) | 2018-10-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108696380B (en) | Automatic node role display method for broadband carrier routing node topological graph | |
| CN104616207B (en) | Power network topology visualization system and method | |
| CN101729353B (en) | Method, device and system of network topology layout | |
| CN104218673B (en) | Grid automation Intelligent partition method | |
| CN104462473B (en) | A kind of method that the inscribed line chart of CIM G forms plant stand is automatically generated based on CIM E electric network models | |
| CN110213107B (en) | Automatic layout method, device and equipment for network topological graph | |
| CN107169611A (en) | A kind of patterned way planning AGV travel regions and the method for monitoring its operation | |
| US20170163502A1 (en) | Classifier based graph rendering for visualization of a telecommunications network topology | |
| CN111241646B (en) | Layout method of power grid equipment and computer readable storage medium | |
| CN104123437B (en) | Transmission line of electricity bridging discrimination method and system based on chart database and spatial information | |
| CN107809339A (en) | Link display methods, link generation method and device | |
| CN112131216B (en) | Power transmission line self-adaptive database creation method and device based on object model | |
| CN111444205A (en) | Automatic checking and updating method for GIS single line graph model of distribution network automation main station | |
| CN104201779B (en) | A kind of online monitoring data based on SVG is automatically integrating monitoring method | |
| CN104182913A (en) | Power grid mode picture forming and intelligent distributing method | |
| CN111090792A (en) | Power distribution network single line diagram automatic mapping method based on weight tree | |
| CN109685684A (en) | A kind of low-voltage network topological structure method of calibration of knowledge based map | |
| CN102833110B (en) | Topologic data relation management method in network management software on a large volume of data | |
| CN113342907B (en) | Energy consumption information acquisition system distribution room topology portrait drawing method and system | |
| CN104166941B (en) | A kind of warning information method for visualizing and its system for electric network current diagram | |
| CN112070261A (en) | Method for automatically generating plant station internal wiring diagram based on CIME power grid model | |
| CN110137964A (en) | Power transmission network topological diagram automatic generation method applied to cloud SCADA | |
| CN106789194A (en) | The energy communication service automatic fault diagnosis localization method of multi-disciplinary collaboration | |
| CN111787433B (en) | Optical distribution network visual light path scheduling method and system | |
| CN111275788B (en) | Graph synthesis method based on commonality template graph and differential topological graph |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| 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 |