CN1756188A - Large-scale network topology graphics display method - Google Patents
Large-scale network topology graphics display method Download PDFInfo
- Publication number
- CN1756188A CN1756188A CN 200410081133 CN200410081133A CN1756188A CN 1756188 A CN1756188 A CN 1756188A CN 200410081133 CN200410081133 CN 200410081133 CN 200410081133 A CN200410081133 A CN 200410081133A CN 1756188 A CN1756188 A CN 1756188A
- Authority
- CN
- China
- Prior art keywords
- node
- angle
- delta
- neighbors
- deletion
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a method for graphically displaying the network topology, which utilizes the new topological distribution algorism to distribute the node and linkage via the absolute position or the relative position, to clearly and reasonably display the topological structure of large scale network. Said method comprises: fixing the root node; distributing the fixed root node; fixing the level value of present node; calculating the basic deviation angle of node to attain the number of nearby nodes and all nearby nodes of present node; according these parameters, calculating the coordinate of said node; transmitting the information with the node coordinate to the topology display program; the topology display program receives the information, refreshes the stored relative information of said object and refreshes the topological graphs. The inventive method can mark every value of property of global topology, search the node or chain circuit to supply the check and management of property data, supply the interactive interface of topology information, and support the edit of network unit and its property for better management of network.
Description
Technical field
The present invention relates to network measure and management system, be specifically related to the method that large-scale network topology graphics shows.
Background technology
The basis that the graphical demonstration of topology Network Based and administrative skill are network management.It reads the stratification information of network topology from database or file, layering shows the topological structure of Operation Network and the existence information of network element; Can be divided into different network views to topological diagram as required, and in each view, search and edit the network object of appointment.The topology Display Technique can be used for the status of equipment of monitoring network after performance and alarm data in conjunction with network.The manager can obtain the relevant information of current device from figure, the change situation and the equipment running status of awareness network equipment disposition, thus comprehensively, dynamically grasp the operation conditions of network.
Belong to based on the catenet of advanced networks and measure and management demonstration system category, the topology of large scale network shows the working foundation that should be considered network management system.Want a large-scale complex network is managed, the network manager must at first be known the topological condition of network node and equipment, and can operate and manage these equipment.
For this reason, the present invention is towards IPv4 network and IPv6 backbone network commonly used, on the basis of network display algorithm commonly used at present, some topological layout's algorithms that are suitable for have more been designed, making node and link both can be by the absolute position layout, also can come layout with relativeness according to the connection situation between them, more clear and rational ground shows the topological structure of large scale network.Realized algorithm simultaneously, made the layout of logical data have physical characteristic based on the geographical position layout.For the ease of the checking and the management of performance data, this invention has designed one and has overlapped the strategy of being distinguished attribute by color, and it both can identify the various property values of overall situation topology, also can search certain satisfactory node or link according to property value.Interactive interface with topology information is provided in addition, supports editor, to carry out network management better to network element and attribute thereof.This invention is based on the pattern of client/server, as shown in Figure 1.
Summary of the invention
To achieve these goals, the invention provides the method that a kind of large-scale network topology graphics shows,, provide by absolute position and two kinds of layout type of relative position based on the pattern of client/server, annexation according between node and the link from top to bottom distributes step by step.Can directly in the map of an expansion, be placed on network node on the corresponding coordinate position.The method that a kind of network topology graphics provided by the invention shows, it is as follows that the method comprising the steps of:
Determining of root node, the node that the adjacent node number is maximum is set to root node, and the coordinate figure of this root node be set to (x, y), the level property value that they are set is 1, the coordinate of screen mid point is (x
0, y
0);
Determined root node is carried out layout: calculate the coordinate of each node according to following formula (1),
angle＝(index×2×π)/count
length＝count×size
+most_neighbors_count/2
+neighbors_count
width＝length×cos(angle)
height＝length×sin(angle)
x＝x
0+width y＝y
0+height
Determine the level value of present node, the level value of establishing root node is 1, and its child node value is 2, increases step by step.
The basic deviation angle (base_angle) of computing node;
Obtain the neighbors number num_neighbors of present node and all neighbors neighbor chained lists, and according to the coordinate of these these nodes of calculation of parameter.
Send the message that comprises node coordinate information to topological display routine;
Topology is after display routine receives message, and all that upgrade its storage are the relevant information of object therewith, refreshes topological diagram simultaneously.
The method that wherein said network topology graphics shows, the basic deviation angle (base_angle) of wherein said computing node is to calculate according to following formula (2): delta_X=x-x
0Delta_Y=y-y
0
base_angle：
If delta_x=0 and delta_y=0, then base_angle=1.5 * π;
If delta_x=0, then base_angle=0;
If delta_y=0 and delta_x＞0, then base_angle=0.5 * π;
If delta_y=0 and delta_x＜=0, then base_angle=1.5 * π;
If delta_x, delta_y be discontented four kinds of situations, the then base_angle=atan (delta_x/delta_y) of being enough to;
Wherein delta_x, delta_y are horizontal and vertical side-play amount.
The method that wherein said network topology graphics shows, the coordinate of wherein said this node of calculating comprises the steps:
By the deviation angle angle of following formula (3) calculating present node:
If index is an even number, then:
angle＝base_angle+(angle_scope×(index/2)/num_neighbors)
If index is an odd number, then:
angle＝base_angle-(angle_scope×((index+1)/2)/num_neighbors)
Wherein, angle_scope is the regional extent of deviation angle.
By the length l ength of following formula (4) calculating present node,
length＝size×2
+current_num_neighbors×2
+num_neighbors
By the coordinate figure of following formula (5) calculating present node,
x＝x
0+length×sin(angle)
y＝y
0+length×cos(angle)
Described network topology graphics display packing is based on Client, it is characterized in that, after a user makes amendment to certain object wherein, sends modification message with Socket, and other client is done corresponding modification after receiving information.
Described network topology graphics display packing also comprises the step of adding network element, it is characterized in that, when adding network element, if be added to as if actual physical equipment, outside adding in the then current topological view, also in other all topological views, add; If be added to as if a logical device, then only in current topological view, add this object.
Described network topology graphics display packing, also comprise the step of deleting network element, it is characterized in that, the operation of deletion network element can be selected, when the deletion object is pounced in the view many Zhang Tuos and existed, and be the port of router/switch or the network interface card of main frame, then delete the level record of this object in current topological view after, also to delete its level record in other topological view; If the object of other type is only deleted the level record of this object in current topological view; After this deletion object only exists, and then deletes the level record of this object in current topological view, also to delete relative all information in current topological view.When deletion to as if when router, switch or main frame, in deletion their this after one's death, also to delete their all lower floor's ports (or network interface card) simultaneously.The rule of deletion and method and deletion object itself are similar.
The method that the present invention also provides a kind of network topology graphics to show, it is as follows that the method comprising the steps of:
Obtain the node latitude and longitude information, and set up chained list with this;
Obtain neighbors number num_neighbors and all neighbors neighbors of present node;
According to following formula (6) calculate one by one each node on the map coordinate (X, Y),
x＝(longitude-top_lon)×width/(bot_lon+top_lon)
y＝(top_lat-latitude)×height/(top_lat+bot_lat)
Send the message that comprises node coordinate information to topological display routine;
Topology is after display routine receives message, and all that upgrade its storage are the relevant information of object therewith, refreshes topological diagram simultaneously.
Described network topology graphics display packing is based on Client, it is characterized in that, after a user makes amendment to certain object wherein, sends modification message with Socket, and other client is done corresponding modification after receiving information.
Described network topology graphics display packing also comprises the step of adding network element, it is characterized in that, when adding network element, if be added to as if actual physical equipment, outside adding in the then current topological view, also in other all topological views, add; If be added to as if a logical device, then only in current topological view, add this object.
Described network topology graphics display packing, also comprise the step of deleting network element, it is characterized in that, the operation of deletion network element can be selected, when the deletion object is pounced in the view many Zhang Tuos and existed, and be the port of router/switch or the network interface card of main frame, then delete the level record of this object in current topological view after, also to delete its level record in other topological view; If the object of other type is only deleted the level record of this object in current topological view; After this deletion object only exists, and then deletes the level record of this object in current topological view, also to delete relative all information in current topological view.When deletion to as if when router, switch or main frame, in deletion their this after one's death, also to delete their all lower floor's ports (or network interface card) simultaneously.The rule of deletion and method and deletion object itself are similar.
Description of drawings
Fig. 1 is the customer end/server mode structure chart;
Fig. 2 is the list structure schematic diagram;
Figure 3 shows that layout flow chart successively;
Figure 4 shows that the present node process chart;
Fig. 5 (a) and (b) be depicted as the algorithm effect schematic diagram;
Figure 6 shows that the device layout algorithm flow chart;
Figure 7 shows that network equipment layout design sketch;
Figure 8 shows that " star " type layout design sketch;
Figure 9 shows that the flow chart of specified node map location;
Figure 10 shows that the geographical frontier explanation;
Figure 11 shows that the link display effect figure of different bandwidth;
Figure 12 shows that the network object hierarchy chart;
Figure 13 chained list hierarchical relationship figure;
Figure 14 shows that equipment layering flow chart;
Figure 15 shows that the painted sequence chart of object;
Figure 16 shows that network element searches flow chart;
Figure 17 shows that topology renewal sequence chart;
Figure 18 shows that the screen-refresh flow chart;
Figure 19 shows that and preserve the formatted file sequence chart;
Figure 20 shows that the synchronous flow chart of multi-client;
Shown in Figure 21 for adding strategic process figure;
Shown in Figure 22 is the deletion strategy flow chart;
Figure 23 is the result one according to display packing of the present invention;
Figure 24 is the result two according to display packing of the present invention;
Figure 25 is the result three according to display packing of the present invention;
Figure 26 is the result four according to display packing of the present invention;
Figure 27 is the result five according to display packing of the present invention.
Embodiment
According to the type and the quantity of topological data, the invention provides by absolute position and two kinds of layout type of relative position.
The absolute position layout has two kinds:
According to the geographical position of node, promptly longitude and latitude are determined the position of node on map.
If the topological data that the Topology Discovery program is found is autonomous territory (AS) node with latitude and longitude information, then first-selected geographic layout.
According to node with respect to the X at interface, the position that Y-axis is determined node.The node location of this placement algorithm changes with the variation of interface size.
When loading topological diagram for the first time, because initial data does not exist (X, Y) coordinate information relevant with the interface, therefore directly do not select above-mentioned second kind of algorithm for use, but, be converted to their two-dimensional coordinates with respect to interface initial point (0,0) the geography information of network object and correlation.
The relative position layout refers to according to the annexation between node and the link comes layout.Network element in the same topological layer is reciprocity on physical type, and they are from top to bottom to distribute step by step with the shape that is similar to tree on topological diagram.In order to describe two dimensional topology and procedure for displaying better, can be the upper and lower relation that connects with the definition of layer network element.Owing to there is loop and multi-link, annexation actual between network element is " figure ", rather than " tree ".For convenience of explanation, still use " root node ", " father node ", " child node " to wait the connection of describing with layer network element.Involved in the present invention to node and link all exist with the form of chained list.Usually chained list is expressed as the sequence node that is connected with arrow intuitively, as Fig. 2:
The chain phenotype data structure of using in the algorithm has:
struct?node
{
string?instance；
string?id；
string?name；
string?father_instance；
int X；
int Y；
}；
With nodal information of this structure storage.The instance territory is the unique identification of this node in network; The id territory is used for storing device type (the 1100 expression routers of this equipment; 1200 expression switches etc.); The name territory is used for representing nodename; Father_instance has indicated the identification number (higher level equipment as certain network interface card is certain main frame) of this node higher level equipment; X, Y are respectively the coordinate position after this node layout.
struct?link
{
string?instance；
string?source1；
string?source2；
string?name；
string?father_instance；
int bandwidth；
}；
With link information of this structure storage.The instance territory is that this is linked at the unique identification in the network; The identification number of source1 territory storage link one end node, the identification number of source2 territory storage link other end node; The name territory is used for representing contact names; Father_instance has indicated the identification number (the higher level's object as certain link is certain subnet) of this link higher level object; The bandwidth territory is used for representing link bandwidth.
For the node data that does not have hierarchical relationship is determined hierarchical relationship, and on this basis, from root node, successively outside layout.All nodes all leave in the object chained list of a DList by name.Detailed process is as follows:
1. determining of root node: owing to do not have hierarchical relationship between the field of each tables of data, so the maximum node of adjacent node number is set to root node, and the level property value that they are set is 1;
2. the layout of root node: having determined after the root node, traveled through all root nodes, is the root node layout by formula 1.Wherein, angle is the deviation angle of root node; Length is the size of root node; Count is the number of root node; Most_neighbors_count is maximum neighbors number; Neighbors_count is the adjacent node number of current root node; Index is the sequence number of root node; Width and height are respectively horizontal and vertical side-play amounts; (x
0, y
0) be the coordinate of screen mid point; At last the coordinate figure of current root node be set to (x, y).Formula 1 is as follows:
angle＝(index×2×π)/count
length＝count×size
+most_neighbors_count/2
+neighbors_count
width＝length×cos(angle)
height＝length×sin(angle)
x＝x
0+width，y＝y
0+height
3. the root node after layout being finished adds linked list head to, prepares all non-root nodes layout successively.
4. judge whether chained list is empty. if algorithm finishes, otherwise forwarded for the 5th step to.
5. the first node that chained list is set is the node when pre-treatment, and it is removed from chained list.
6. obtain the level value of present node.
7. use the basic deviation angle base_angle of formula 2 computing nodes.Wherein, delta_x, delta_y are horizontal and vertical side-play amount.Formula 2 is as follows: delta_X=x-x
0, delta_Y=y-y
0
base_angle：
If delta_x=0 and delta_y=0, then base_angle=1.5 * π;
If delta_x=0, then base_angle=0;
If delta_y=0 and delta_x＞0, then base_angle=0.5 * π;
If delta_y=0 and delta_x＜=0, then base_angle=1.5 * π;
If delta_x, delta_y are discontented with the four kinds of situations that are enough to,
Base_angle=atan (delta_x/delta_y) then;
8. obtain neighbors number num_neighbors and all neighbors neighbors chained lists of present node, establishing present node is first neighbors.
9. judge whether that all neighborss all dispose.If forwarded for the 4th step to, otherwise forwarded for the 10th step to.
10. processing present node.
11. next neighbors is set to present node, forwards for the 9th step to.
The flow chart of whole algorithm is as shown in Figure 3:
The process of handling present node (last figure dash area) in the algorithm steps 10 is as follows:
1. calculate the deviation angle angle of present nodes with formula 3, wherein, angle_scope is the regional extent of deviation angle, as 180 °, 360 ° etc.Formula 3 is as follows:
If index is an even number, then:
angle＝base_angle+(angle_scope×(index/2)/num_neighbors)；
If index is an odd number, then:
angle＝base_angle-(angle_scope×((index+1)/2)/num_neighbors)；
2. calculate the length l ength of present node with formula 4.Formula 4 is as follows:
length＝size×2
+current_num_neighbors×2
+num_neighbors
3. formula 5 calculates the coordinate figure of present node.Formula 5 is as follows:
x＝x
0+length×sin(angle)
y＝y
0+length×cos(angle)
4. present node is added to the DList linked list head.
The flow process of handling present node is as shown in Figure 4:
From formula as can be seen, node is from the number decision by node size, child node number and the brotgher of node thereof of the distance of father node.These three factors are big more, and node is just far away more from the distance of father node.Fig. 5 is this algorithm effects schematic diagram.
This algorithm is the hierarchical relationship between the specified node automatically, and the placement algorithm according to class tree type is a node layout then, is optimum selection for the node that only has hierarchical relationship.Simultaneously, this algorithm also supports to have cancellated topological diagram.It can be provided with the node level according to internodal main annexation, the initial foundation of the node with more heterogeneous neighbors as topological layout, layout is successively carried out.
This algorithm can show the device type of network element according to self with different appliance icon, as router, switch etc.At this moment, on the basis of original layout, can handle node size as constant, algorithm is reduced to:
1. the maximum node of adjacent node number is set at root node, and first child node of establishing it is " present node ".
2. calculate the deviation angle angle of each child node, the geometric meaning of angle is this node with respect to being the radian of the reference axis of initial point with " father node ".The coordinate of " if present node " be (x, y), its " child node " has n, angle=π/(n+1) * i then, r is a radius.Then i (coordinate of individual child node of 1＜=i＜=n) be (x+r * cos (angle), y+r * sin (angle), promptly evenly distributed on second circumference that with " present node " is the center of circle.
3. judge whether present node has child node.If first child node of establishing it is a present node, and forwarded for the 2nd step to, otherwise forwarded for the 4th step to.
4. judge whether to exist the not brotgher of node of layout.If it is present node that the next not brotgher of node of layout is set, and forwarded for the 2nd step to, otherwise forwarded for the 5th step to.
5. judge all nodes whether all layout finish.If forwarded for the 6th step to, otherwise the upper layer node that present node is set is new present node, and forwarded for the 4th step to.
6. the coordinate to all nodes carries out suitably translation, guarantees that its x, y value are all greater than 0.The flow chart of algorithm is as shown in Figure 6:
This moment, algorithm adopted the strategy of " depth-first ", used Recursive Implementation.Each the node of layout all stamped corresponding mark, to avoid the repetition layout.Local display result as shown in Figure 7.
Can also use the topological structure of " star " type structure display device." child node " of its " Centroid " is evenly distributed on the whole circumference that is the center of circle with " Centroid ".If the coordinate of " Centroid " is that (x y), has n " child node ", and then (1＜=i＜=n) coordinate of individual " child node " is (x+r * cos (a), y+r * sin (a) for its i.Wherein, the geometric meaning of parameter a be this node with respect to being the radian of the reference axis of initial point with " Centroid ", its computing formula is:
A=2 * π/n * (i-1); (r is a radius)
Other " child node " is then evenly distributed on the semi-circumference that is the center of circle with its " father node ".If " father node " is A, " father node " of A is B.Because the axis of this semicircle is on the extended line of A and B line, so must increase the angle that a parameter s is used for identifying this line and forward abscissa during coordinates computed.If the coordinate of " father node " A is that (x y), has n " child node ", and r is a radius, and then (coordinate of individual " child node " of 1＜=i＜=n) is (x+r * cos (s-pi/2+b), y+r * sin (s-pi/2+b) for its i.Wherein, the geometric meaning of parameter b is this node with respect to being the radian of the reference axis of initial point with " father node ".The computing formula of b and s is:
b＝π/(n+1)×i；
s＝Sa-π/2+Ba；
The initial value of s is a, and Sa, Ba are respectively s value and the b values of " father node " A, by the recurrence transmission." star " type arrangement results as shown in Figure 8, data and Fig. 7 that it adopts are identical.
When existence in the image data had the AS numeric field data of geography information (as longitude and latitude), the present invention can directly be placed on node on the corresponding coordinate position in the map of an expansion.Its process is:
1. pointed DList linked list head.
2. judge whether chained list is empty.If algorithm finishes; Otherwise forwarded for the 3rd step to.
Chain heading node as present node, and it is shifted out from chained list.
4. obtain neighbors number num_neighbors and all neighbors neighbors of present node.
5. pointed neighbors linked list head.
6. judge whether next node exists.If establishing this next node is present node, and forwarded for the 7th step to; Otherwise forwarded for the 2nd step to.
Calculate (X, the Y) coordinate, and jumped to for the 6th step of present node on the maps with formula 6.In formula 6, longitude and latitude are respectively the longitude and the latitude of present node; Width and height are the width and the height of current interface; The longitude in bot_lon, the top_lon definition map upper left corner and the lower right corner; The latitude in bot_lat, the top_lat definition map upper left corner and the lower right corner.Formula 6 is as follows:
x＝(longitude-top_lon)×width/(bot_lon+top_lon)
y＝(top_lat-latitude)×height/(top_lat+bot_lat)
The algorithm flow in specified node geographical position is as shown in Figure 9:
The geographical frontier explanation as shown in figure 10
This algorithm can be accurate on node of any one certain existence in the world for network management.But realize the layout of this algorithm, just must extract the information in geographical position.Whether this depends on the geography information that the geographic position data storehouse provided comprehensive and accurate.Link with bandwidth can be represented with the lines of different in width.The common network bandwidth has 1M, 2M, 10M, 100M, 155M, 1000M etc.The computing formula of link width width is:
width＝base_width×lg(bandwidth)
Wherein, base_width is the reference bandwidth of link, and bandwidth is a link bandwidth.Like this, bandwidth differs 10 times link, and width differs 2 times, and this helps the clear and directly perceived of topological diagram.
Except that line thickness, can also show the link of different bandwidth with different colors.Figure 11 has shown the link of distinguishing different bandwidth with different line thickness and color.
Placement algorithm more for a long time, phenomenons such as overlapping may occur at node.For the topology information of display network better, must be improved and be replenished it, make topological diagram clear and rational more.
There is relationship between superior and subordinate in logic in the network equipment.Such as, the subobject of monitored network has the connection between router, subnet, router and the subnet etc.One all in the network of device object compositions are the tree of root with monitored network, as shown in figure 12.
This strategy is mainly realized by the father_instance territory of node and linked object.The hierarchical relationship in object chained list father_instance territory is as shown in figure 13:
In the time will showing the lower floor object of present node, traversal node chained list and link chained list find all current node layers, then layout and showing.Its detailed process is:
1. get chain heading node.
2. judge whether the chained list tail.If to all object layouts and demonstration when anterior layer, algorithm finishes; Otherwise forwarded for the 3rd step to.
3. get the value in this node father_instance territory.
Whether the value of judging father_instance is identical with present node.If, illustrate that this node is the lower level node of present node, forwarded for the 5th step to; Otherwise forwarded for the 6th step to.
4. this node is added in anterior layer object chained list.
5. get next node, forwarded for the 2nd step to.
The flow chart of this algorithm is as shown in figure 14:
Under many situations, logical ne also has clear and definite relationship between superior and subordinate unlike the network equipment, in order to remedy " root " node layout algorithm in the more overlapping in disorder defective of node, the present invention proposes the strategy of colo(u)r breakup, and effect is very obvious.
This strategy travels through object chained list DList, obtains the level value of node from each network object, then these is worth as an attributes object, and gives the object of different levels painted by color.Its concrete steps are:
1. selection set of properties is as color attribute.
2. be provided with and want painted zone.
3. painted parameter is set, as color, level etc.
4. be the node-coloring of each level.
5. repaint and show each node layer after painted.
Painted sequence of algorithms is as shown in figure 15:
The search strategy of network element
This strategy at first is provided with searches formula, carries out then and shows qualified object.Three kinds of display modes are as follows:
Highlight the object of eligible requirement
Only show qualified object
Hide qualified object
Condition is defined as: value=/≠/＜/＞/≤/ 〉=input_value.Wherein, value is certain property value of node or link, and input_value is an input value.
The main algorithm step that object is searched drafting is as follows, and wherein match is qualified object number:
1. the condition of edit selection is also determined display mode.
2. determine the attribute management object, as color attribute.
3. the pointed linked list head, establish match=0.
4. judge whether to arrive the chained list end.If, redrawing topological diagram, algorithm finishes; Otherwise forwarded for the 5th step to.
5. the next node of getting in the chained list is a present node.
6. get the property value of present node.
7. judge whether this attribute satisfies the condition of input.If forwarded for the 8th step to; Otherwise directly forwarded for the 10th step to.
8. increase progressively match (match=match+1).
9. be this object that satisfies condition painted (yellow), forwarded for the 4th step to.
10. be this object that does not satisfy condition painted (grey), forwarded for the 4th step to.
This algorithm flow is as shown in figure 16:
The topology update strategy
After topological diagram or bottom topological data change, topological display system will be carried out communication with the Topology Discovery program, and finish topology and upgrade, and reload up-to-date topological data simultaneously.Algorithm steps is:
Select upgating object.
Select more new model.Pattern is respectively:
Upgrade whole nodes;
Only upgrade the node of selecting;
Upgrade the part of nodes in a certain zone;
With Socket server communication and return results value.Server returns 1 expression and operates successfully; It is wrong that 0 expression transmits data;-1 expression connection failure.
The sequence chart that topology is upgraded is as shown in figure 17:
Communicating by letter with Socket alternately between system realizes that communicating pair is received and dispatched and morphological analysis by the communication format of agreement, obtains the data message that needs.
The text formatting that the upper strata sends interpolation information is:
The IP address # of # object identity $ object type $ IP addresses of nodes $ to be confirmed father of node object to be confirmed
A possible transmission data format is as follows:
#1013001$1300$192.168.4.81$192.168.4.1#。
The text formatting of receiving feedback information is:
# object identity $ state #
A possible transmission data format is as follows:
#1013001$0#
Refresh strategy
Algorithm all is kept at all network objects in the dList chained list.The display properties (size, position, color etc.) of each layout or change node all can be changed dList, and is repainted topological diagram, clear screen.The algorithm that refreshes strategy is:
1. adjustment viewing area.
2. judge whether to be geographic layout.If forwarded for the 3rd step to; Otherwise forwarded for the 4th step to.
3. picture map.
4. judge whether successively to show.If, calling display packing drawing successively, algorithm finishes; Otherwise forwarded for the 5th step to.
5. the pointer of replacement DList chained list points to linked list head.
6. judge whether to be the chained list end.If algorithm finishes; Otherwise forwarded for the 7th step to.
7. get the next node of chained list.
8. call the node method for drafting and draw node, and forwarded for the 6th step to.
This algorithm flow is as shown in figure 18:
The odf file is the data message file that Otter software (a kind of instrument of CAIDA exploitation) provides.Otter software can generate topological diagram according to the topology information in the .odf file.The topological diagram information of client also can be converted to the file of corresponding odf form by the data among the dList and preserve.The concrete steps of preserving are:
1. the user sends and holds instruction.
2. specify the topological diagram that to preserve and preserve filename.
3. topological diagram is preserved by input/output interface.
The sequence chart of preservation process as shown in figure 19.
The concrete form of odf file is as follows:
[t?number]
The sum of defined node
Must write on the file beginning
[T?number]
The sum of definition link
Must write on the file beginning
[n?node_index?x?y?name/N?node_index?lat?long?name/？node_index?name]
Unique identifier of node_index node
X coordinate on the x interface
Y coordinate on the y interface
Latitude value on the lat map
Longitude on the long map
The name of name node
[1?linkidx?n_idx1?n_idx2/L?linkidx?n_idx1?n_idx2]
The sign of 1 one-way linkage
The sign of L bi-directional chaining
Unique identifier of linkidx link
Unique identifier of n_idx1 one end node
Unique identifier of n_idx2 other end node
Each client synchronously
The method that topology of the present invention shows is based on Client.This means that having a plurality of users at one time uses this program in different clients.After a user makes amendment to certain object wherein, send modification message with Socket, other client also must be done corresponding modification after receiving information, to guarantee the consistency of data.Concrete steps are:
1, certain client is sent Socket message after revising;
2, each client is received message, and resolves its specifying information;
3, the IP address according to message source judges whether to be this client itself.If, then abandoning this message, algorithm finishes; Otherwise forwarded for the 4th step to;
4, judge whether this network object that is modified is present in the topological diagram of current demonstration.If forwarded for the 5th step to; Otherwise directly forwarded for the 6th step to;
5,, repaint current topological diagram according to amended object;
6, all are modified the relevant information of object with this in the renewal DList chained list.
Its algorithm flow is as shown in the figure:
Network element adds and deletion
Network element adds the two kinds of situations that are divided into: if be added to as if actual physical equipment (router, switch and their port etc.), then in current topological view, add finish after, also in other all topological views, add.For example, under certain router of front view, adding a new port, then in other all view,, all must add this new port in its lower floor as long as there is this router; If be added to as if logical device (object logic of subnet, the network segment and other manager definition), then only in current topological view, add this object.
When adding actual physical equipment, this strategy is with the IP address list of all devices in the traverses network, and this is divided into two kinds of situations again: do not exist in the IP tabulation if newly add the IP address that is equipped with, think that then this equipment is a brand-new equipment.When adding, be necessary for it and distribute the unique identification number of the whole network, obtain all configurations and performance information, again it is added in the file or tables of data of depositing topological hierarchical information; In the IP tabulation, exist if newly add the IP address that is equipped with, think that then it is an already present equipment.Find its record in other topological view, thereby obtain the unique identification number of its whole network, it is added in the current topological view again, the value of its father_instance is set to the identification number when front view higher level object.
The rule and the process of adding network element in current topological view are as follows:
1. what judge current interpolation still is logical device (object logic of subnet, the network segment and other manager definition) to liking actual physical equipment (router, switch, main frame and their port etc.).If actual physical equipment then forwarded for the 2nd step to; Otherwise directly forwarded for the 3rd step to.
2. judge whether this interpolation equipment is new equipment, and method is: travel through whole topological views, judge whether the IP address of the current equipment that is added exists in other topological diagram.If exist, then this equipment is a known device.Obtain the identification number of this object, directly forwarded for the 5th step to; Otherwise this equipment is a new equipment, forwards for the 3rd step to.
3. distribute the identification number that the whole network is unique for this object.
4. obtain attribute, performance and other all relevant informations of this new object.If logical device forwarded for the 5th step to; Otherwise forwarded for the 6th step to.
5. the topological hierarchical information of this object is write in the file or tables of data of current topological view, that is: the value of this object father_instance is set to the identification number when anterior layer higher level object.Algorithm finishes.
6. the topological hierarchical information of this object is write in the file or tables of data of all topological views, that is: in the file of whole memory topology hierarchical informations or tables of data for this object increases a level record, wherein the value of father_instance is set to work as the identification number of anterior layer higher level object.Algorithm finishes.
Add tactful flow process as shown in the figure:
The deletion of network element also is divided into two kinds of situations: non-thorough deletion and thoroughly deletion, this can be selected by the manager.
For non-thorough deletion, can be divided into two kinds of situations: a kind of situation is that this deletion object is pounced in the view many Zhang Tuos and existed.Only delete the level record of this object in current topological view this moment; Another kind of situation is that this deletion object only exists in current topological view.At this moment, behind the level record of this object of deletion in current topological view, also to delete its all relevant informations such as configuration, performance.
For thorough deletion, then after the deletion hierarchical information of this object in current topological view, the hierarchical information that also will delete this object in other all topological views.Delete all relevant informations such as configuration, performance of this object at last.
If the deletion to as if router, switch or main frame, then the deletion these objects itself after, also to delete their port (or network interface card).The method of deletion and process and deletion object itself are similar.
The rule and the process of deletion network object are as follows in current topological view:
1. judge whether deleted object is router, switch or main frame.If forwarded for the 2nd step to; Otherwise forwarded for the 3rd step to.
2. the port of deleted object or network interface card are added in the deletion tabulation.
3. delete the hierarchical information of object in current topological view.
4. select whether thoroughly deletion.If then forwarded for the 6th step to; Otherwise forwarded for the 5th step to.
5. judge whether this equipment exists in other topological view.If algorithm finishes; Otherwise forwarded for the 7th step to.
6. delete the hierarchical information of object in other all topological views.
7. delete all relevant information such as object configuration, performance, algorithm finishes.
The flow process of deletion strategy is as shown in Figure 5:
Claims (10)
1. the method that shows of a network topology graphics, it is as follows that the method comprising the steps of:
Determining of root node, the node that the adjacent node number is maximum is set to root node, and the coordinate figure of this root node be set to (x, y), the level property value that they are set is 1, the coordinate of screen mid point is (x
0, y
0);
Determined root node is carried out layout: calculate the coordinate of each node according to following formula (1),
angle＝(index×2×π)/count
length＝count×size
+most_neighbors_count/2
+neighbors_count
width＝length×cos(angle)
height＝length×sin(angle)
x＝x
0+width y＝y
0+height
Determine the level value of present node;
The basic deviation angle (base_angle) of computing node;
Obtain the neighbors number num_neighbors of present node and all neighbors neighbors chained lists, and according to the coordinate of these these nodes of calculation of parameter.
Send the message that comprises node coordinate information to topological display routine;
Topology is after display routine receives message, and all that upgrade its storage are the relevant information of object therewith, refreshes topological diagram simultaneously.
2. the method that network topology graphics as claimed in claim 1 shows, the basic deviation angle (base_angle) of wherein said computing node is to calculate according to following formula (2): delta_X=x-x
0Delta_Y=y-y
0
base_angle：
If delta_x=0 and delta_y=0, then base_angle=1.5 * π;
If delta_x=0, then base_angle=0;
If delta_y=0 and delta_x＞0, then base_angle=0.5 * π;
If delta_y=0 and delta_x＜=0, then base_angle=1.5 * π;
If delta_x, delta_y be discontented four kinds of situations, the then base_angle=atan (delta_x/delta_y) of being enough to;
Wherein delta_x, delta_y are horizontal and vertical side-play amount.
3. the method that network topology graphics as claimed in claim 1 shows, the coordinate of wherein said this node of calculating comprises the steps:
By the deviation angle angle of following formula (3) calculating present node:
If index is an even number, then:
angle＝base_angle+(angle_scope×(index/2)/num_neighbors)
If index is an odd number, then:
angle＝base_angle-(angle_scope×((index+1)/2)/num_neighbors)
Wherein, angle_scope is the regional extent of deviation angle.
By the length l ength of following formula (4) calculating present node,
length＝size×2
+current_num_neighbors×2
+num_neighbors
By the coordinate figure of following formula (5) calculating present node,
x＝x
0+length×sin(angle)
y＝y
0+length×cos(angle)
4. network topology graphics display packing as claimed in claim 1 is based on Client, it is characterized in that, after a user makes amendment to certain object wherein, send modification message with Socket, other client is done corresponding modification after receiving information.
5. network topology graphics display packing as claimed in claim 1 also comprises the step of adding network element, it is characterized in that, when adding network element, if be added to as if actual physical equipment, outside adding in the then current topological view, also in other all topological views, add; If be added to as if a logical device, then only in current topological view, add this object.
6. network topology graphics display packing as claimed in claim 1, also comprise the step of deleting network element, it is characterized in that, the operation of deletion network element can be selected, when the deletion object is pounced in the view many Zhang Tuos and existed, and be the port of router/switch or the network interface card of main frame, then delete the level record of this object in current topological view after, also to delete its level record in other topological view; If the object of other type is only deleted the level record of this object in current topological view; After this deletion object only exists, and then deletes the level record of this object in current topological view, also to delete relative all information in current topological view; When deletion to as if when router, switch or main frame, in deletion their this after one's death, also to delete their all lower floor's ports (or network interface card) simultaneously; The rule of deletion and method and deletion object itself are similar.
7. the method that shows of a network topology graphics, it is as follows that the method comprising the steps of:
Obtain the node latitude and longitude information, and set up chained list with this;
Obtain neighbors number num_neighbors and all neighbors neighbors chained lists of present node;
According to following formula (6) calculate one by one each node on the map coordinate (X, Y),
x＝(longitude-top_lon)×width/(bot_lon+top_lon)
y＝(top_lat-latitude)×height/(top_lat+bot_lat)
Send the message that comprises node coordinate information to topological display routine;
Topology is after display routine receives message, and all that upgrade its storage are the relevant information of object therewith, refreshes topological diagram simultaneously.
8. network topology graphics display packing as claimed in claim 7 is based on Client, it is characterized in that, after a user makes amendment to certain object wherein, send modification message with Socket, other client is done corresponding modification after receiving information.
9. network topology graphics display packing as claimed in claim 7 also comprises the step of adding network element, it is characterized in that, when adding network element, if be added to as if actual physical equipment, outside adding in the then current topological view, also in other all topological views, add; If be added to as if a logical device, then only in current topological view, add this object.
10. network topology graphics display packing as claimed in claim 7, also comprise the step of deleting network element, it is characterized in that, the operation of deletion network element can be selected, when the deletion object is pounced in the view many Zhang Tuos and existed, and be the port of router/switch or the network interface card of main frame, then delete the level record of this object in current topological view after, also to delete its level record in other topological view; If the object of other type is only deleted the level record of this object in current topological view; After this deletion object only exists, and then deletes the level record of this object in current topological view, also to delete relative all information in current topological view; When deletion to as if when router, switch or main frame, in deletion their this after one's death, also to delete their all lower floor's ports (or network interface card) simultaneously; The rule of deletion and method and deletion object itself are similar.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200410081133 CN1756188B (en) | 2004-09-30 | 2004-09-30 | Large-scale network topology graphics display method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200410081133 CN1756188B (en) | 2004-09-30 | 2004-09-30 | Large-scale network topology graphics display method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1756188A true CN1756188A (en) | 2006-04-05 |
| CN1756188B CN1756188B (en) | 2011-03-23 |
Family
ID=36689154
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200410081133 Expired - Fee Related CN1756188B (en) | 2004-09-30 | 2004-09-30 | Large-scale network topology graphics display method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1756188B (en) |
Cited By (39)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100433936C (en) * | 2006-09-08 | 2008-11-12 | 华为技术有限公司 | Method and system for acquiring topological information of radio network |
| CN100454848C (en) * | 2007-03-07 | 2009-01-21 | 华为技术有限公司 | Network structure topology layout method and network management device |
| CN100499504C (en) * | 2006-12-04 | 2009-06-10 | 中国科学院计算技术研究所 | A method to realize visualization of wireless sensor network |
| CN101145966B (en) * | 2007-07-17 | 2010-06-23 | 中兴通讯股份有限公司 | A generation method for network element topology structure |
| CN101217410B (en) * | 2008-01-07 | 2010-08-25 | 杭州华三通信技术有限公司 | A network topological structure exhibition method and device |
| CN101317476B (en) * | 2006-04-25 | 2011-05-04 | 华为技术有限公司 | Topological structure scanning method and scanning system |
| CN102088370A (en) * | 2011-01-18 | 2011-06-08 | 杭州华三通信技术有限公司 | Method and device for realizing network topology for mobile terminals |
| CN101404541B (en) * | 2008-10-27 | 2011-09-21 | 中兴通讯股份有限公司 | Method for associating multiple service objects through network management topological link layers |
| CN102281154A (en) * | 2011-07-12 | 2011-12-14 | 广东宜通世纪科技股份有限公司 | Display method and system of network topology graphing |
| CN102542074A (en) * | 2012-02-17 | 2012-07-04 | 清华大学 | Demonstration and search tool of topological relationship of elements |
| CN102546831A (en) * | 2012-02-28 | 2012-07-04 | 山东大学 | Dynamic display method for wireless sensor network topological diagram |
| CN102566849A (en) * | 2010-12-10 | 2012-07-11 | 金蝶软件（中国）有限公司 | Method and device for acquiring tree-form data drawing output positions and ERP (enterprise resource planning) system |
| CN102567430A (en) * | 2010-12-31 | 2012-07-11 | 中国移动通信集团湖北有限公司 | Method and device for graphical display of metadata relationship |
| CN102035667B (en) * | 2009-09-27 | 2012-08-29 | 华为技术有限公司 | Method, device and system for evaluating network reliability |
| CN102694685A (en) * | 2012-05-30 | 2012-09-26 | 华为技术有限公司 | Method and device for monitoring network |
| CN102739438A (en) * | 2011-04-08 | 2012-10-17 | 巴比禄股份有限公司 | Management apparatus and method |
| CN102790714A (en) * | 2011-05-19 | 2012-11-21 | 中兴通讯股份有限公司 | Method and device for configuring service route network element coordinates |
| CN103051609A (en) * | 2012-12-07 | 2013-04-17 | 东软集团股份有限公司 | Gateway equipment and network access controlled visualized interaction method executed by same |
| CN103514310A (en) * | 2012-06-26 | 2014-01-15 | 上海宝信软件股份有限公司 | Visualized editing and displaying method for IT infrastructure topology |
| CN103684879A (en) * | 2013-12-30 | 2014-03-26 | 华为技术有限公司 | Display processing method and device |
| CN103986594A (en) * | 2013-02-07 | 2014-08-13 | 中国电信股份有限公司 | Method and device for generating network topological diagram |
| WO2016074433A1 (en) * | 2014-11-12 | 2016-05-19 | 中兴通讯股份有限公司 | Data transmission management method, device and storage medium |
| CN105933148A (en) * | 2016-04-15 | 2016-09-07 | 烽火通信科技股份有限公司 | SDN GIS network topology model implementation method |
| CN106656546A (en) * | 2016-08-23 | 2017-05-10 | 成都科来软件有限公司 | Network topology generating method and apparatus |
| CN106909661A (en) * | 2017-02-27 | 2017-06-30 | 郑州云海信息技术有限公司 | A kind of topological drawing generating method and device |
| CN107276833A (en) * | 2017-08-03 | 2017-10-20 | 郑州云海信息技术有限公司 | A kind of node information management method and device |
| CN107749803A (en) * | 2017-10-16 | 2018-03-02 | 浙江宇视科技有限公司 | A kind of network topology layout method and device |
| CN108076472A (en) * | 2016-11-14 | 2018-05-25 | 联芯科技有限公司 | The reselecting method of star topology ad hoc network and its control centre's node |
| CN108989105A (en) * | 2018-07-16 | 2018-12-11 | 阿里巴巴集团控股有限公司 | Propagation path drawing generating method, device and server |
| CN109889396A (en) * | 2019-03-22 | 2019-06-14 | 哈尔滨工业大学 | A kind of Autonomous Domain grade internet topology visualization method |
| CN110086665A (en) * | 2019-04-25 | 2019-08-02 | 北京计算机技术及应用研究所 | A kind of network topological diagram methods of exhibiting based on jTopo |
| CN110365584A (en) * | 2019-08-06 | 2019-10-22 | 北京润科通用技术有限公司 | A kind of network management and device |
| CN110868319A (en) * | 2019-11-08 | 2020-03-06 | 北京浪潮数据技术有限公司 | Network topology drawing method, device, equipment and readable storage medium |
| CN111107131A (en) * | 2019-11-05 | 2020-05-05 | 远景智能国际私人投资有限公司 | Management method and device of Internet of things equipment, server and storage medium |
| CN111309675A (en) * | 2020-01-20 | 2020-06-19 | 北京无限光场科技有限公司 | Associated information display method and device, electronic equipment and storage medium |
| CN111580912A (en) * | 2020-05-09 | 2020-08-25 | 北京飞讯数码科技有限公司 | Display method and storage medium for multi-level structure resource group |
| CN112737853A (en) * | 2020-12-30 | 2021-04-30 | 北京安博通科技股份有限公司 | Network topology drawing method, equipment and storage medium |
| CN113711146A (en) * | 2019-04-17 | 2021-11-26 | 阿自倍尔株式会社 | Management system |
| CN115941495A (en) * | 2022-09-30 | 2023-04-07 | 天翼安全科技有限公司 | Network topology construction method and device, electronic equipment and storage medium |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI575990B (en) * | 2014-03-25 | 2017-03-21 | 國立臺灣大學 | Method and system for binding devices using network topologies |
| CN106557323B (en) * | 2016-11-09 | 2019-12-03 | 北京锐安科技有限公司 | A kind of network visual layout method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1145311C (en) * | 2001-07-26 | 2004-04-07 | 华为技术有限公司 | Graphical representation method of topological structure of network notes |
-
2004
- 2004-09-30 CN CN 200410081133 patent/CN1756188B/en not_active Expired - Fee Related
Cited By (55)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101317476B (en) * | 2006-04-25 | 2011-05-04 | 华为技术有限公司 | Topological structure scanning method and scanning system |
| CN100433936C (en) * | 2006-09-08 | 2008-11-12 | 华为技术有限公司 | Method and system for acquiring topological information of radio network |
| CN100499504C (en) * | 2006-12-04 | 2009-06-10 | 中国科学院计算技术研究所 | A method to realize visualization of wireless sensor network |
| CN100454848C (en) * | 2007-03-07 | 2009-01-21 | 华为技术有限公司 | Network structure topology layout method and network management device |
| CN101145966B (en) * | 2007-07-17 | 2010-06-23 | 中兴通讯股份有限公司 | A generation method for network element topology structure |
| CN101217410B (en) * | 2008-01-07 | 2010-08-25 | 杭州华三通信技术有限公司 | A network topological structure exhibition method and device |
| CN101404541B (en) * | 2008-10-27 | 2011-09-21 | 中兴通讯股份有限公司 | Method for associating multiple service objects through network management topological link layers |
| CN102035667B (en) * | 2009-09-27 | 2012-08-29 | 华为技术有限公司 | Method, device and system for evaluating network reliability |
| CN102566849B (en) * | 2010-12-10 | 2014-01-08 | 金蝶软件（中国）有限公司 | Method and device for acquiring tree-form data drawing output positions and ERP (enterprise resource planning) system |
| CN102566849A (en) * | 2010-12-10 | 2012-07-11 | 金蝶软件（中国）有限公司 | Method and device for acquiring tree-form data drawing output positions and ERP (enterprise resource planning) system |
| CN102567430A (en) * | 2010-12-31 | 2012-07-11 | 中国移动通信集团湖北有限公司 | Method and device for graphical display of metadata relationship |
| CN102567430B (en) * | 2010-12-31 | 2014-10-01 | 中国移动通信集团湖北有限公司 | Method and device for graphical display of metadata relationship |
| CN102088370A (en) * | 2011-01-18 | 2011-06-08 | 杭州华三通信技术有限公司 | Method and device for realizing network topology for mobile terminals |
| CN102739438B (en) * | 2011-04-08 | 2015-07-22 | 巴法络股份有限公司 | Management apparatus and method |
| CN102739438A (en) * | 2011-04-08 | 2012-10-17 | 巴比禄股份有限公司 | Management apparatus and method |
| CN102790714B (en) * | 2011-05-19 | 2015-08-12 | 中兴通讯股份有限公司 | A kind of collocation method of business route network element coordinate and device |
| CN102790714A (en) * | 2011-05-19 | 2012-11-21 | 中兴通讯股份有限公司 | Method and device for configuring service route network element coordinates |
| CN102281154B (en) * | 2011-07-12 | 2013-12-11 | 广东宜通世纪科技股份有限公司 | Display method and system of network topology graphing |
| CN102281154A (en) * | 2011-07-12 | 2011-12-14 | 广东宜通世纪科技股份有限公司 | Display method and system of network topology graphing |
| CN102542074A (en) * | 2012-02-17 | 2012-07-04 | 清华大学 | Demonstration and search tool of topological relationship of elements |
| CN102542074B (en) * | 2012-02-17 | 2013-10-30 | 清华大学 | Demonstration and search tool of topological relationship of elements |
| CN102546831A (en) * | 2012-02-28 | 2012-07-04 | 山东大学 | Dynamic display method for wireless sensor network topological diagram |
| CN102694685A (en) * | 2012-05-30 | 2012-09-26 | 华为技术有限公司 | Method and device for monitoring network |
| CN103514310A (en) * | 2012-06-26 | 2014-01-15 | 上海宝信软件股份有限公司 | Visualized editing and displaying method for IT infrastructure topology |
| CN103051609B (en) * | 2012-12-07 | 2015-11-18 | 东软集团股份有限公司 | The virtual interactive interface method of gateway device and the NS software by its execution |
| CN103051609A (en) * | 2012-12-07 | 2013-04-17 | 东软集团股份有限公司 | Gateway equipment and network access controlled visualized interaction method executed by same |
| CN103986594A (en) * | 2013-02-07 | 2014-08-13 | 中国电信股份有限公司 | Method and device for generating network topological diagram |
| CN103986594B (en) * | 2013-02-07 | 2017-09-26 | 中国电信股份有限公司 | The method and apparatus for generating network topological diagram |
| CN103684879A (en) * | 2013-12-30 | 2014-03-26 | 华为技术有限公司 | Display processing method and device |
| CN103684879B (en) * | 2013-12-30 | 2017-03-08 | 华为技术有限公司 | Show the method and apparatus for processing |
| WO2016074433A1 (en) * | 2014-11-12 | 2016-05-19 | 中兴通讯股份有限公司 | Data transmission management method, device and storage medium |
| WO2017177645A1 (en) * | 2016-04-15 | 2017-10-19 | 烽火通信科技股份有限公司 | Sdn-based gis network topology model implementation method |
| CN105933148A (en) * | 2016-04-15 | 2016-09-07 | 烽火通信科技股份有限公司 | SDN GIS network topology model implementation method |
| CN105933148B (en) * | 2016-04-15 | 2019-04-02 | 烽火通信科技股份有限公司 | A kind of SDNization GIS network topology model implementation method |
| CN106656546A (en) * | 2016-08-23 | 2017-05-10 | 成都科来软件有限公司 | Network topology generating method and apparatus |
| CN106656546B (en) * | 2016-08-23 | 2019-12-27 | 成都科来软件有限公司 | Method and device for generating network topology |
| CN108076472A (en) * | 2016-11-14 | 2018-05-25 | 联芯科技有限公司 | The reselecting method of star topology ad hoc network and its control centre's node |
| CN106909661A (en) * | 2017-02-27 | 2017-06-30 | 郑州云海信息技术有限公司 | A kind of topological drawing generating method and device |
| CN107276833A (en) * | 2017-08-03 | 2017-10-20 | 郑州云海信息技术有限公司 | A kind of node information management method and device |
| CN107749803A (en) * | 2017-10-16 | 2018-03-02 | 浙江宇视科技有限公司 | A kind of network topology layout method and device |
| CN108989105A (en) * | 2018-07-16 | 2018-12-11 | 阿里巴巴集团控股有限公司 | Propagation path drawing generating method, device and server |
| CN108989105B (en) * | 2018-07-16 | 2021-09-07 | 创新先进技术有限公司 | Propagation path diagram generation method and device and server |
| CN109889396A (en) * | 2019-03-22 | 2019-06-14 | 哈尔滨工业大学 | A kind of Autonomous Domain grade internet topology visualization method |
| CN109889396B (en) * | 2019-03-22 | 2021-09-03 | 哈尔滨工业大学 | Autonomous domain level internet topology visualization method |
| CN113711146A (en) * | 2019-04-17 | 2021-11-26 | 阿自倍尔株式会社 | Management system |
| CN110086665A (en) * | 2019-04-25 | 2019-08-02 | 北京计算机技术及应用研究所 | A kind of network topological diagram methods of exhibiting based on jTopo |
| CN110365584A (en) * | 2019-08-06 | 2019-10-22 | 北京润科通用技术有限公司 | A kind of network management and device |
| CN110365584B (en) * | 2019-08-06 | 2022-03-01 | 北京润科通用技术有限公司 | Network management method and device |
| CN111107131A (en) * | 2019-11-05 | 2020-05-05 | 远景智能国际私人投资有限公司 | Management method and device of Internet of things equipment, server and storage medium |
| CN110868319A (en) * | 2019-11-08 | 2020-03-06 | 北京浪潮数据技术有限公司 | Network topology drawing method, device, equipment and readable storage medium |
| CN111309675A (en) * | 2020-01-20 | 2020-06-19 | 北京无限光场科技有限公司 | Associated information display method and device, electronic equipment and storage medium |
| CN111309675B (en) * | 2020-01-20 | 2023-09-26 | 北京有竹居网络技术有限公司 | Associated information display method and device, electronic equipment and storage medium |
| CN111580912A (en) * | 2020-05-09 | 2020-08-25 | 北京飞讯数码科技有限公司 | Display method and storage medium for multi-level structure resource group |
| CN112737853A (en) * | 2020-12-30 | 2021-04-30 | 北京安博通科技股份有限公司 | Network topology drawing method, equipment and storage medium |
| CN115941495A (en) * | 2022-09-30 | 2023-04-07 | 天翼安全科技有限公司 | Network topology construction method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1756188B (en) | 2011-03-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1756188A (en) | Large-scale network topology graphics display method | |
| CN1509022A (en) | Layer network node and network constituted throuth said nodes, the node and layer network thereof | |
| CN1756189A (en) | IP network topology discovering method based on SNMP | |
| CN1268122C (en) | Display system, network answering display device, terminal apparatus and controlling program | |
| CN1794729A (en) | Data arrangement management method, data arrangement management system, data arrangement management device, and data arrangement management program | |
| CN1150723C (en) | Method for establishing route information in ATM communication network | |
| CN100336352C (en) | Content releasing system, descripting data releasing apparatus and content releasing method | |
| CN1317756A (en) | Administration of user's outline data | |
| CN1172239C (en) | Method of executing mobile objects and recording medium storing mobile objects | |
| CN1870532A (en) | Signalling tracking method and system | |
| CN1805349A (en) | Sensor network system and data retrieval method and program for sensing data | |
| CN1134181C (en) | Mobile communication system and method | |
| CN1318163A (en) | System and method for selectively defining access to application features | |
| CN1389990A (en) | Communication system management server, wireless server and mobile management server | |
| CN1276575A (en) | Database access system | |
| CN1450765A (en) | Servo load balance system, apparatus and content management apparatus | |
| CN1846419A (en) | Self-managed mediated information flow | |
| CN1703700A (en) | Method and apparatus for enabling associated portlets of a web portal to collaborate for synchronized content display | |
| CN101057464A (en) | Data distribution system, and data distribution method | |
| CN1783075A (en) | Method, apparatus, processor arrangement for displaying network data | |
| CN1534937A (en) | Virtual path arrangement device and its method and computer product | |
| CN1112637C (en) | Information acquisition proxy system and information transfer managing system | |
| CN101069437A (en) | Search system of communications device | |
| CN1975769A (en) | Presence managing method and apparatus | |
| CN1111795C (en) | Information distribution system using network |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110323 Termination date: 20160930 |