CN102185706A - Method for generating IEEE1394 (Institute of Electrical and Electronics Engineers 1394) network topological graph - Google Patents
Method for generating IEEE1394 (Institute of Electrical and Electronics Engineers 1394) network topological graph Download PDFInfo
- Publication number
- CN102185706A CN102185706A CN2011100926976A CN201110092697A CN102185706A CN 102185706 A CN102185706 A CN 102185706A CN 2011100926976 A CN2011100926976 A CN 2011100926976A CN 201110092697 A CN201110092697 A CN 201110092697A CN 102185706 A CN102185706 A CN 102185706A
- Authority
- CN
- China
- Prior art keywords
- node
- annexation
- physical label
- nodes
- unique identification
- 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
Abstract
The invention discloses a method for generating an IEEE1394 (Institute of Electrical and Electronics Engineers 1394) network topological graph, which comprises the steps of obtaining a physical identifier and port state information of each node in a network and judging the connection relation of the nodes on the basis of the port state information of the nodes in sequence according to an ascending sequence of the physical identifiers; obtaining an unique static identifier of each node; generating and saving a data structure of the connection relation among the nodes according to the connection relation and the unique static identifiers of the nodes; and generating a network topological graph according to the data structure of the connection relation among the nodes. Because the network topological graph can be automatically generated, an administrator can have an intuitive aware of the network connection situation according to the topological graph so that the connection state and the relative positions of the nodes in the network can be conveniently mastered. In addition, because the topological graph is automatically generated according to the connection relation of the nodes, the topological graph can be also updated in real time while the connection state among the nodes is changed so that the administrator can obtain the latest network distribution information in time.
Description
Technical field
The present invention relates to network communications technology field, relate in particular to a kind of IEEE1394 network topology map generalization method.
Background technology
By the phase-split network topological diagram, the keeper can understand the connection status and the relative position of each node in the IEE E1394 network.And when having node to break down,, and then network topology adjusted by the Display Realization location of mistake of topological diagram.
But in the prior art, also there is not to generate automatically the implementation of IEEE1394 network topological diagram.If there is not network topological diagram, then the intuitively connection status and the error message of node in the awareness network need be obtained required information by reading nodal information, seized the bandwidth resources of business information like this, influences network performance.If by the administrator hand drawing topological graph, not only increased human cost, and can't guarantee to change the real-time update topological diagram according to network configuration.
Summary of the invention
The purpose of this invention is to provide a kind of IEEE1394 network topology map generalization method, thereby avoid network performance to descend.
The objective of the invention is to be achieved through the following technical solutions:
A kind of IEEE1394 network topology map generalization method comprises:
Obtain each node physical label and port status information in the IEEE1394 network, and, judge the annexation of each node successively according to the port status information of node according to the ascending order of physical label;
Obtain the static unique identification of each node;
According to the annexation of described each node and the static unique identification of described each node, generate the data structure and the preservation of connection relation between nodes;
Data structure according to described connection relation between nodes generates network topological diagram.
As seen from the above technical solution provided by the invention, a kind of IEEE1394 network topology map generalization method that the embodiment of the invention provides, because can the automatic generating network topological diagram, make the keeper to network connection situation understanding intuitively to be arranged according to topological diagram, thereby can conveniently grasp the connection status and the relative position of each node in the network, and when node breaks down, quick and precisely locate mistake.In addition, owing to generate topological diagram automatically according to the annexation of node, when the connection status between the node changes, also can the real-time update topological diagram, make the keeper can in time obtain the latest network distributed intelligence.
Description of drawings
In order to be illustrated more clearly in the technical scheme of the embodiment of the invention, the accompanying drawing of required use is done to introduce simply in will describing embodiment below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite of not paying creative work, can also obtain other accompanying drawings according to these accompanying drawings.
The method flow diagram that Fig. 1 provides for the embodiment of the invention;
The method flow diagram of definite node annexation that Fig. 2 provides for the embodiment of the invention;
The initial topology schematic diagram that Fig. 3 provides for Application Example of the present invention;
The topological schematic diagram that does not connect No. four nodes that Fig. 4 provides for Application Example of the present invention;
The topological schematic diagram that inserts No. four nodes again that Fig. 5 provides for Application Example of the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the invention, the technical scheme in the embodiment of the invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on embodiments of the invention, those of ordinary skills belong to protection scope of the present invention not making the every other embodiment that is obtained under the creative work prerequisite.
Below in conjunction with accompanying drawing the embodiment of the invention is described in further detail.
A kind of IEEE1394 network topology of embodiment of the invention map generalization method, this method implementation specifically comprises following operation as shown in Figure 1:
S101, the physical label that obtains each node in the IEEE1394 network and port status information, and, judge the annexation of each node successively according to the port status information of node according to the ascending order of physical label;
Wherein, the physical label of node and port status information can be obtained from the tagging bag of each node, the port status of node comprises: subport, father's port, do not have the port that connects, the port that not have realization, port status information can but be not limited only to use the Boolean function value representation.
S102, obtain the static unique identification of each node;
Wherein, the static unique identification of the node of node is used for this node and other nodes are made a distinction, the static unique identification of node can be GUID (Globally Unique Identifier, global unique identification symbol), also can be numbering or coding that other can identification nodes.
S103, according to the annexation of described each node and the static unique identification of described each node, generate the data structure of connection relation between nodes;
Wherein, the data structure of connection relation between nodes is used for describing the annexation (being the port corresponding relation) between father node and the child node.The data structure of this annexation can be preserved according to the form of father-child node, and is corresponding, comprises in the data structure of the annexation of preservation: the static unique identification of the node that the static unique identification of node, each port of this node point to.
S104, generate network topological diagram according to the data structure of described connection relation between nodes.
Above-mentioned processing procedure can be carried out by bus manager, and bus manager is meant the equipment that above-mentioned processing capacity software is installed, and both can be certain node in the network, also can be control appliance special-purpose in the network.
The method that the embodiment of the invention provides, owing to can derive the annexation between each node in the network automatically, and then according to annexation automatic generating network topological diagram, make the keeper to network connection situation understanding intuitively to be arranged according to topological diagram, thereby can conveniently grasp the connection status and the relative position of each node in the network, and when node breaks down, quick and precisely locate mistake.In addition, owing to generate topological diagram automatically according to the annexation of node, when the connection status between the node changes, also can the real-time update topological diagram, make the keeper can in time obtain the latest network distributed intelligence.
The specific implementation of step S101 in the above-mentioned processing procedure comprises following operation as shown in Figure 2:
S201, the physical label that obtains the physical label minimum node and port status information are carried out S202 with the node of this physical label minimum as present node;
Optionally, after physical label that obtains present node and port status information, go back the physical label and the port status information of buffer memory present node.
S202, according to the port status information of present node, judge whether present node has subport, if there is not subport, carry out S203; If subport is arranged, carry out S204;
According to the allocation rule of physical label in the IEEE1394 network as can be known, the node of physical label minimum is a leaf node, and leaf node does not have subport.
S203, in preassigned matched data district, preserve the physical label of present node, and obtain the physical label and the port status information of next node, this next node is returned S202 as present node according to the physical label ascending order;
Optionally, in the physical label of preserving present node, the port status information that can also preserve present node;
Wherein, specifically can preserve the physical label of present node in the matched data district with the form of stack, it is stacked to be about to present node.
S204, from the node that above-mentioned matched data district preserves, read the node (being called matched node) of current physical label maximum in the matched data district, carry out S205;
Wherein, if only preserve the physical label of node in the matched data district, then and then according to physical label obtain the port status information of matched node, can obtain from buffer memory, the tagging bag that also can read matched node from bus obtains.If the form with stack is preserved node, then from stack, extrude a node.
S205, obtain the annexation of matched node among present node and the S204, carry out S206;
Wherein, according to topological generating principle in the IEEE1394 network as can be known, the subport of not mating numbering maximum in the subport of present node is connected with father's port of matched node, therefore, the annexation of matched node specifically is meant among above-mentioned present node and the S204: the annexation between father's port of the maximum subport of coupling and numbering and this matched node not in the present node.
S206, judge that whether present node also has the subport of coupling (coupling does not refer to determine annexation),, return and carry out S204 if having, otherwise, S207 carried out;
S207, judge whether present node has father's port, if having, then carry out S208, if do not have, show that then this node is a root node, flow process finishes, and finishes the annexation of obtaining each node;
S208, in above-mentioned preassigned matched data district, preserve the physical label of present node, and obtain the physical label and the port status information of next node, this next node is returned S202 as present node according to the physical label ascending order.
By processing procedure shown in Figure 2, can know the annexation between each node under the current bus configuration.
Specific implementation at the step S102 in the above-mentioned processing procedure is described as follows:
In the embodiment of the invention, can but be not limited only to obtain the static unique identification of node by following dual mode.
A kind of mode is in the process of each drawing topological graph, all reads the static unique identification of node from the ROM (Read-Only Memory, read-only memory) of node.
Another kind of mode is, after the annexation of having determined each subport of node, judge the local data structure the historical information whether connection relation between nodes of preservation is arranged, if have, then the annexation in the data structure of the annexation of annexation that this is obtained and preservation relatively obtains the static unique identification of node; If no, then from the ROM of node, obtain static unique identification.In the IEEE1394 network, when powering up, cut off the power supply for certain node, perhaps when bus added or shifts out a node, network need reset and reconfigure.When taking place to reset, each node returns initial condition, and current topology information is eliminated.The method that the embodiment of the invention provides after carrying out bus configuration for the first time, is obtained the GUID of each node by the ROM that reads each node.If the numbering of employing or coding as the static unique identification of node, after reading the GUID of node, can distribute unique encoding or numbering for this node.Behind bus reset, the data structure historical information of the annexation that bus manager can be preserved by this locality is obtained the identification information of respective nodes.If behind the bus reset, there is new node to add bus, then bus manager reads GUID from new node R OM, can also encode or numbers for this node.As seen, behind bus reset,, do not need frequently to read the ROM of each node, therefore reduced taking bus bandwidth owing to can obtain the static unique identification of the node of preservation in this locality.
Specific implementation at step S104 in the above-mentioned processing procedure is described as follows:
Bus manager specifically can realize by existing drawing technique according to the data structure drawing topological graph of the connection relation between nodes that obtains.For example and without limitation:
A kind of mode that generates topological diagram is:
After bus configuration was finished, the node log-on message that powers on according to physical layer obtained the node number N in the network;
Evenly demonstrate the figure of representing N node in the display frame, wherein, can call the figure that is used for representing node that generates in advance, also can in display frame, draw the figure of node, N node can rectangular even distribution, also can be rounded or other geometric figure evenly distribute;
For example, the upper left corner in display frame is according to clockwise, and with the ascending order or the descending of node physical label, each node evenly distributes; Perhaps, the lower right corner in display frame is according to counterclockwise, and with the ascending order or the descending of node physical label, each node evenly distributes.Its specific implementation can realize by existing algorithm.
After knowing internodal topological structure by above-mentioned processing procedure, call the line segment of the expression annexation that generates in advance, show internodal annexation; And on the node corresponding figure sign outbound port number, the identification information of node and the physical label of node.
If in display frame, distribute with rectangular uniform, draw the figure of N node, its specific implementation can but be not limited only to be:
If the node number is N, the length of each node figure is a, the high h of being;
So, when N is even number, during the physical label of node i≤N/2, the abscissa X of NODEi
NodeI=2 (i+1) a/ (N+1), ordinate are Y
Nodei=2h/6; Physical label i＞the N/2 of node, the abscissa X of NODEi
Nodei=2 (i+1) a/ (N+1), ordinate are Y
Nodei=5h/6;
When N is odd number, during the physical label of node i≤N+1/2, the abscissa X of NODEi
Nodei=2 (i+1) a/ (N+2), ordinate are Y
Nodei=2h/6; As the physical label i＞N+1/2 of node, the abscissa X of NODEi
Nodei=2 (i+1) a/ (N+2), ordinate are Y
Nodei=5h/6.
Wherein, the origin of coordinates is positioned at the upper left corner of display frame, and particular location can be set according to actual conditions.
Call the information of each node for the ease of the user, conveniently check the state of each node, the method that the embodiment of the invention provides also comprises following operation:
Obtain the static unique identification of described each node and the corresponding relation between physical label and the port status information respectively, and described corresponding relation is preserved with the form of the data structure of node.
Wherein, physical label in the data structure of node and port status information can but be not limited only in above-mentioned steps S201, obtain, the static unique identification in the data structure of node can but be not limited only in above-mentioned steps S102, obtain.
Like this, the data structure of the node that the user just can be by calling preservation is checked the state and the port information of each node.Reduced the number of times that from bus, reads the tagging bag, thereby reduced taking bus bandwidth.In addition, because before and after bus reset, the static unique identification of node is constant, but the physical label of node and port status information may change, because the data structure of node has embodied the static unique identification of node and the corresponding relation of physical label and port status information, therefore, behind bus reset, the user can conveniently check the variation of each node annexations such as physical label, port status information before and after bus reset.
Below in conjunction with concrete application scenarios, the method that the embodiment of the invention is provided is described in detail.
In an IEEE1394 local area network (LAN), there are 6 computers (node) to be connected to bus.Each computer has three ports.After bus configuration was finished, the method that can use the embodiment of the invention provides was drawn network topological diagram.Wherein, the static unique identification of 6 nodes is represented with numbering, be respectively No. one～No. six, and No. five nodes is bus manager.Then should comprise following operation with the specific implementation of embodiment:
S301, bus manager obtain the node number N (6) in the network by obtaining the log-on message that each node reports;
Show 6 nodes in S302, the bus manager display frame, for example and without limitation, these six nodes are with rectangular being evenly distributed in the display frame of arrangement mode of two row, three row;
Wherein, bus manager can be in display frame the real-time rendering node, also can in display frame, show each node by the figure that calls the expression node.
S303, bus manager are obtained the physical label and the port status information of physical label minimum node, and the node of this physical label minimum is carried out S304 as present node;
S304, bus manager judge according to the port status information of present node whether present node has subport, if there is not subport, carry out S305; If subport is arranged, carry out S306;
S305, bus manager in preassigned matched data district with the stacked preservation of the physical label of present node, and obtain the physical label and the port status information of next node according to the physical label ascending order, this next node is returned S304 as present node;
S306, bus manager extrude a node (being called matched node) from above-mentioned stack, carry out S307;
S307, bus manager are obtained maximum numbering subport in the subport that present node do not mate, and determine the annexation between father's port of this maximum numbering subport and above-mentioned matched node, execution S308;
S308, bus manager judge whether present node also has the not subport of coupling, if having, return and carry out S306, otherwise, carry out S309;
S309, bus manager judge whether present node has father's port, if having, then carry out S310, if do not have, show that then this node is a root node, carry out S311;
S310, bus manager are pressed into present node in above-mentioned stack, and obtain the physical label and the port status information of next node according to the physical label ascending order, and this next node is returned S304 as present node;
S311, bus manager are judged the local data structure the historical information whether connection relation between nodes of preservation is arranged, if, carry out S312, otherwise, S313 carried out;
S312, bus manager compare the annexation in the annexation data structure of the annexation of each node and preservation, obtain the static unique identification of each node, carry out S314;
Wherein, by the annexation of this generation and the annexation of preservation are compared in the static unique identification process of obtaining node, can begin successively each node to be judged from root node according to the descending of physical label.Then the identification information of root node need read from ROM.And then whether the subport of judging node5 (root node) all has connection before and after bus reset, if, then the static unique identification of the node that this subport is pointed in the annexation data structure of Bao Cuning promptly is that (its foundation is in the IEEE1394 network to the static unique identification of node that this subport is pointed in this annexation of determining, the situation of generation bus reset normally node powers up, cuts off the power supply, has node to add or withdraws from, therefore, if the physical connection relation of bus reset certain node of front and back and atomic node is constant); Determine the static unique identification of each node successively by this mode according to the descending of physical label, if, then obtain by reading ROM information by judging the identification information that to determine certain node.
S313, bus manager read static unique identification from the ROM of node, carry out S314;
S314, bus manager are according to the physical label of the above-mentioned node that obtains, the port status information of node and the static unique identification of node, the data structure that generates and preserve each node, carry out S315, comprise the numbering of node, the physical label of node and the port status information of node in this data structure, for example and without limitation, the form of this data structure is as shown in table 1
Table 1
| The numbering of node | The physical label of node | The state of |
The state of port one | The state of |
Accordingly, the data structure of each node is respectively:
| No. two | ?Node0 | 01 | 01 | 10 |
| No. four | ?Node1 | 01 | 01 | 10 |
| No. one | ?Node2 | 01 | 10 | 01 |
| No. three | ?Node3 | 01 | 11 | 10 |
| No. six | ?Node4 | 10 | 11 | 01 |
| No. five | ?Node5 | 11 | 11 | 11 |
Wherein, port status 11 these ports of expression are subport, and port status 10 these ports of expression are father's port, and port status 01 this port of expression does not connect.
S315, bus manager be according to the annexation and the identification information of above-mentioned each node, generates the data structure of connection relation between nodes and preserve, and carries out S316, and the data structure of connection relation between nodes is as shown in table 2:
Table 2
| The numbering of node | The node that |
The node that port one points to | The node that |
| No. two | No. five |
| No. four | No. five | ||
| No. one | No. three | ||
| No. three | No. one | No. six | |
| No. six | No. five | No. three | |
| No. five | No. two | No. four | No. six |
The topological structure that S316, bus manager show according to table 2, drawing topological graph in display frame, this topological diagram is as shown in Figure 4.
When No. four nodes being disconnected and being connected of network, the IEEE1394 bus reconfigures.After bus reset is finished, can be according to above-mentioned flow process drawing topological graph once more, its topological diagram as shown in Figure 4, the data structure of each node is as shown in table 3 accordingly:
Table 3
| No. two | ?Node0 | 01 | 01 | 10 |
| No. one | ?Node2 | 01 | 10 | 01 |
| No. three | ?Node3 | 01 | 11 | 10 |
| No. six | ?Node4 | 10 | 11 | 01 |
| No. five | ?Node5 | 11 | 01 | 11 |
The data structure of annexation is as shown in table 4 between node corresponding:
Table 4
| The numbering of node | The node that |
The node that port one points to | The node that |
| No. two | No. five |
| No. one | No. three | ||
| No. three | No. one | No. six | |
| No. six | No. five | No. three | |
| No. five | No. two | No. six |
After No. four nodes were inserted bus once more, the IEEE1394 bus reconfigured.After bus reset is finished, can be according to above-mentioned flow process drawing topological graph once more, its topological diagram as shown in Figure 5, the data structure of each node is as shown in table 5 accordingly:
Table 5
| No. one | ?Node0 | 01 | 10 | 01 |
| No. two | ?Node1 | 01 | 01 | 10 |
| No. four | ?Node2 | 01 | 01 | 10 |
| No. five | ?Node3 | 11 | 11 | 10 |
| No. six | ?Node4 | 11 | 10 | 01 |
| No. three | ?Node5 | 01 | 11 | 11 |
The data structure of annexation is as shown in table 6 between node corresponding:
Table 6
| The numbering of node | The node that |
The node that port one points to | The node that |
| No. one | No. three | ||
| No. two | No. five |
| No. four | No. five | ||
| No. No. five | No. two | No. four | No. six |
| No. six | No. five | No. three | |
| No. three | No. one | No. six |
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection range of claims.
Claims (8)
1. an IEEE1394 network topology map generalization method is characterized in that, comprising:
Obtain each node physical label and port status information in the IEEE1394 network, and, judge the annexation of each node successively according to the port status information of node according to the ascending order of physical label;
Obtain the static unique identification of each node;
According to the annexation of described each node and the static unique identification of described each node, generate the data structure and the preservation of connection relation between nodes;
Data structure according to described connection relation between nodes generates network topological diagram.
2. method according to claim 1, it is characterized in that, describedly obtain each node physical label and port status information in the IEEE1394 network, and, judge successively that according to the port status information of node the annexation of each node comprises according to the ascending order of physical label:
Step 1, the physical label that obtains the physical label minimum node and port status information, with described physical label minimum node as present node execution in step 2;
Step 2, according to the port status information of present node, judge whether described present node has subport, if there is not subport, execution in step 3; If subport is arranged, execution in step 4;
Step 3, in preassigned matched data district, preserve the physical label of present node, and obtain the physical label and the port status information of next node, described next node is returned execution in step 2 as present node according to the physical label ascending order;
Step 4, from the node that described matched data district preserves, read a matched node, execution in step 5;
Step 5, obtain the annexation of described present node and described matched node, execution in step 6;
Step 6, judge that whether present node also has the not subport of coupling,, return execution in step 4 if having, otherwise, execution in step 7;
Step 7, judge whether described present node has father's port, if having, then execution in step 8, if do not have, then finish the annexation of obtaining each node;
Step 8, in described matched data district, preserve the physical label of present node, and obtain the physical label and the port status information of next node, described next node is returned execution in step 2 as present node according to the physical label ascending order.
3. method according to claim 2 is characterized in that, preserves the physical label of node in described Data Matching district with the form of stack.
4. method according to claim 2 is characterized in that, the described static unique identification that obtains each node comprises:
After finishing the annexation of obtaining each node, judge the historical information of the data structure of the local connection relation between nodes whether preservation arranged, if have, then the annexation in the data structure of the connection relation between nodes of the annexation of the node that this is obtained and preservation relatively obtains the static unique identification of described each node; If no, then from the read only memory ROM of described node, obtain the static unique identification of node.
5. method according to claim 4 is characterized in that, if local historical information of preserving the data structure of connection relation between nodes, the then described static unique identification that obtains each node further comprises:
From the read-only memory of the node of physical label maximum, obtain the static unique identification of the node of described physical label maximum;
Descending according to physical label, judge each subport of having determined static uniquely identified node successively, in the annexation that this obtains and in historical annexation, whether all be connected with father's port, if, then obtain the static unique identification of the static unique identification of the node that subport is pointed in the historical annexation as the node of the sensing of subport described in this annexation of obtaining, if in the annexation that this obtains, be connected with father's port but in historical annexation, do not connect father's port, then obtain static unique identification the read-only memory of the node that points to from described subport.
6. according to any described method of claim 1～4, it is characterized in that the data structure of described connection relation between nodes comprises the static unique identification of node and the static unique identification of the node that each port of described node points to.
7. according to any described method of claim 2～4, it is characterized in that this method also comprises:
Obtain the static unique identification of described each node and the corresponding relation between physical label and the port status information respectively, and described corresponding relation is preserved with the form of the data structure of node.
8. according to any described method of claim 1～4, it is characterized in that described data structure according to described connection relation between nodes generates network topological diagram and comprises:
Obtain node number in the IEEE1394 network;
By counterclockwise or clockwise direction, physical label ascending order or descending with node evenly show each node in display frame;
According to the data structure of described connection relation between nodes, in display frame, show the annexation between each node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110092697 CN102185706B (en) | 2011-04-13 | 2011-04-13 | Method for generating IEEE1394 (Institute of Electrical and Electronics Engineers 1394) network topological graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110092697 CN102185706B (en) | 2011-04-13 | 2011-04-13 | Method for generating IEEE1394 (Institute of Electrical and Electronics Engineers 1394) network topological graph |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102185706A true CN102185706A (en) | 2011-09-14 |
| CN102185706B CN102185706B (en) | 2013-10-16 |
Family
ID=44571779
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110092697 Expired - Fee Related CN102185706B (en) | 2011-04-13 | 2011-04-13 | Method for generating IEEE1394 (Institute of Electrical and Electronics Engineers 1394) network topological graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102185706B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102929684A (en) * | 2012-09-08 | 2013-02-13 | 佳都新太科技股份有限公司 | Implementation method for topology drawing of virtual machines |
| CN103036692A (en) * | 2011-09-29 | 2013-04-10 | 中国移动通信集团江苏有限公司 | Method and device for generating network topologies aimed at IT supporting networks |
| CN103176993A (en) * | 2011-12-21 | 2013-06-26 | 北京神州绿盟信息安全科技股份有限公司 | Content presentation device and content presentation method |
| CN104158747A (en) * | 2013-05-14 | 2014-11-19 | 中兴通讯股份有限公司 | Network topology discovery method and system |
| CN104935482A (en) * | 2015-06-26 | 2015-09-23 | 曙光信息产业(北京)有限公司 | Distributed monitoring system and method |
| CN108965139A (en) * | 2018-08-14 | 2018-12-07 | 烽火通信科技股份有限公司 | A kind of topological vectorgraph charting method and system of routing device |
| CN110784362A (en) * | 2019-11-04 | 2020-02-11 | 中国南方电网有限责任公司超高压输电公司昆明局 | Structure and method for accurately managing control protection system bus in direct current converter station |
| CN114205281A (en) * | 2021-11-30 | 2022-03-18 | 科大国创云网科技有限公司 | Metadata-driven end-to-end network topology dynamic generation system and method |
| CN114615066A (en) * | 2022-03-17 | 2022-06-10 | 浙江网商银行股份有限公司 | Target path determination method and device |
| WO2022135057A1 (en) * | 2020-12-23 | 2022-06-30 | 深圳市道通科技股份有限公司 | Vehicle bus topological graph generation method and apparatus, and computing device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1747404A (en) * | 2005-10-14 | 2006-03-15 | 杭州华为三康技术有限公司 | Network topological graph updation and management |
| US20090187968A1 (en) * | 2003-07-29 | 2009-07-23 | Enterasys Networks, Inc. | System and method for dynamic network policy management |
| CN102006193A (en) * | 2010-11-29 | 2011-04-06 | 深圳市新格林耐特通信技术有限公司 | Automatic layout method for network topology in SNMP (simple network management protocol) network management system |
-
2011
- 2011-04-13 CN CN 201110092697 patent/CN102185706B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090187968A1 (en) * | 2003-07-29 | 2009-07-23 | Enterasys Networks, Inc. | System and method for dynamic network policy management |
| CN1747404A (en) * | 2005-10-14 | 2006-03-15 | 杭州华为三康技术有限公司 | Network topological graph updation and management |
| CN102006193A (en) * | 2010-11-29 | 2011-04-06 | 深圳市新格林耐特通信技术有限公司 | Automatic layout method for network topology in SNMP (simple network management protocol) network management system |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103036692A (en) * | 2011-09-29 | 2013-04-10 | 中国移动通信集团江苏有限公司 | Method and device for generating network topologies aimed at IT supporting networks |
| CN103036692B (en) * | 2011-09-29 | 2016-12-07 | 中国移动通信集团江苏有限公司 | The method and device of network topology is generated for IT supporting network |
| CN103176993B (en) * | 2011-12-21 | 2016-08-24 | 北京神州绿盟信息安全科技股份有限公司 | A kind of content presenting device and method |
| CN103176993A (en) * | 2011-12-21 | 2013-06-26 | 北京神州绿盟信息安全科技股份有限公司 | Content presentation device and content presentation method |
| CN102929684A (en) * | 2012-09-08 | 2013-02-13 | 佳都新太科技股份有限公司 | Implementation method for topology drawing of virtual machines |
| US9769054B2 (en) | 2013-05-14 | 2017-09-19 | Zte Corporation | Network topology discovery method and system |
| WO2014183519A1 (en) * | 2013-05-14 | 2014-11-20 | 中兴通讯股份有限公司 | Network topology discovery method and system |
| CN104158747A (en) * | 2013-05-14 | 2014-11-19 | 中兴通讯股份有限公司 | Network topology discovery method and system |
| CN104158747B (en) * | 2013-05-14 | 2019-09-24 | 中兴通讯股份有限公司 | Method for discovering network topology and system |
| CN104935482A (en) * | 2015-06-26 | 2015-09-23 | 曙光信息产业(北京)有限公司 | Distributed monitoring system and method |
| CN104935482B (en) * | 2015-06-26 | 2018-08-24 | 曙光信息产业(北京)有限公司 | Distributed monitoring system and method |
| CN108965139A (en) * | 2018-08-14 | 2018-12-07 | 烽火通信科技股份有限公司 | A kind of topological vectorgraph charting method and system of routing device |
| CN110784362A (en) * | 2019-11-04 | 2020-02-11 | 中国南方电网有限责任公司超高压输电公司昆明局 | Structure and method for accurately managing control protection system bus in direct current converter station |
| CN110784362B (en) * | 2019-11-04 | 2021-06-22 | 中国南方电网有限责任公司超高压输电公司昆明局 | Method for precisely managing control protection system bus in direct current converter station |
| WO2022135057A1 (en) * | 2020-12-23 | 2022-06-30 | 深圳市道通科技股份有限公司 | Vehicle bus topological graph generation method and apparatus, and computing device |
| CN114205281A (en) * | 2021-11-30 | 2022-03-18 | 科大国创云网科技有限公司 | Metadata-driven end-to-end network topology dynamic generation system and method |
| CN114205281B (en) * | 2021-11-30 | 2023-08-08 | 科大国创云网科技有限公司 | Metadata-driven end-to-end network topology dynamic generation system and method |
| CN114615066A (en) * | 2022-03-17 | 2022-06-10 | 浙江网商银行股份有限公司 | Target path determination method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102185706B (en) | 2013-10-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102185706B (en) | Method for generating IEEE1394 (Institute of Electrical and Electronics Engineers 1394) network topological graph | |
| CN107104824B (en) | Network topology determination method and device | |
| CN103825954A (en) | OpenFlow control method and corresponding insert, platform and network thereof | |
| CN107317707B (en) | SDN network topology management method based on point coverage set | |
| CN104243265A (en) | Gateway control method, device and system based on virtual machine migration | |
| CN101404596A (en) | Multi-topological environmental test method, system and equipment | |
| CN104301251A (en) | QoS processing method, system and device | |
| CN106031116A (en) | Method, apparatus and system for associating NS with VNF | |
| CN103259725A (en) | Messaging method and network equipment | |
| CN112532408B (en) | Method, device and storage medium for extracting fault propagation condition | |
| CN114202027A (en) | Execution configuration information generation method, model training method and device | |
| CN103095579B (en) | TRILL network interconnected method, Apparatus and system | |
| EP3253030B1 (en) | Method and device for reporting openflow switch capability | |
| CN109672618A (en) | Redundant interface processing method, device, server and storage medium | |
| CN101534218B (en) | A management method, device and system for open application architecture | |
| CN110851186B (en) | Network equipment restarting method and device, electronic equipment and readable storage medium | |
| EP3240251A1 (en) | Line card determination, determination processing method and device, and line card determination system | |
| CN105281960A (en) | Method for managing flow entry in software defined network | |
| CN105450432A (en) | Method for positioning port connection error and associated equipment | |
| CN105338127A (en) | Media access control MAC address table updating method, switch and system | |
| CN111447091A (en) | Network loop detection method, device, equipment and storage medium | |
| CA2881329C (en) | Method and device for grouping contacts in social network | |
| WO2016173196A1 (en) | Method and apparatus for learning address mapping relationship | |
| EP4095685A1 (en) | State machine processing method and apparatus, state processing method and apparatus, electronic device, and storage medium | |
| CN110086722A (en) | A kind of routed path determines method and device, routing device |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20131016 Termination date: 20140413 |