CN102185706B - Method for generating IEEE1394 (Institute of Electrical and Electronics Engineers 1394) network topological graph - Google Patents

Abstract

The invention discloses a method for generating an IEEE1394 network topology map, comprising: obtaining the physical identification and port status information of each node in the network, judging the connection relationship of each node in turn according to the port status information of the nodes in the ascending order of the physical identification; obtaining each Static unique identification of nodes; according to the connection relationship and static unique identification of each node, generate and save the data structure of the connection relationship between nodes; generate a network topology diagram according to the data structure of the connection relationship between nodes. Since the network topology map can be automatically generated, the administrator can have an intuitive understanding of the network connection situation according to the topology map, so that it is convenient to grasp the connection status and relative position of each node in the network. In addition, because the topology map is automatically generated according to the connection relationship of nodes, when the connection status between nodes changes, the topology map can also be updated in real time, so that administrators can obtain the latest network distribution information in time.

Description

A Method for Generating IEEE1394 Network Topology Diagram

technical field

The invention relates to the technical field of network communication, in particular to a method for generating an IEEE1394 network topology diagram.

Background technique

By analyzing the network topology map, the administrator can understand the connection status and relative position of each node in the IEEE E1394 network. And when a node fails, the error location is realized through the display of the topology map, and then the network layout is adjusted.

However, in the prior art, there is no implementation scheme for automatically generating IEEE1394 network topology diagrams. If there is no network topology map, it is impossible to intuitively understand the connection status and error information of nodes in the network. It is necessary to obtain the required information by reading node information, which preempts the bandwidth resources of business information and affects network performance. If the administrator draws the topology map manually, it not only increases the labor cost, but also cannot ensure that the topology map is updated in real time according to the change of the network structure.

Contents of the invention

The purpose of the present invention is to provide a method for generating IEEE1394 network topology graph, so as to avoid network performance degradation.

The purpose of the present invention is achieved through the following technical solutions:

A method for generating an IEEE1394 network topology diagram, comprising:

Obtain the physical identification and port status information of each node in the IEEE1394 network, and judge the connection relationship of each node according to the port status information of the node in ascending order of the physical identification;

Obtain the static unique identifier of each node;

According to the connection relationship of each node and the static unique identifier of each node, generate and save the data structure of the connection relationship between nodes;

A network topology diagram is generated according to the data structure of the connection relationship among the nodes.

It can be seen from the above-mentioned technical solution provided by the present invention that the method for generating an IEEE1394 network topology diagram provided by the embodiment of the present invention can automatically generate a network topology diagram, so that the administrator can have an intuitive understanding of the network connection situation according to the topology diagram. Therefore, it is easy to grasp the connection status and relative position of each node in the network, and when a node fails, it can quickly and accurately locate the error. In addition, because the topology map is automatically generated according to the connection relationship of nodes, when the connection status between nodes changes, the topology map can also be updated in real time, so that administrators can obtain the latest network distribution information in time.

Description of drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following will briefly introduce the accompanying drawings that need to be used in the description of the embodiments. Obviously, the accompanying drawings in the following description are only some embodiments of the present invention. For Those of ordinary skill in the art can also obtain other drawings based on these drawings on the premise of not paying creative efforts.

Fig. 1 is the flow chart of the method provided by the embodiment of the present invention;

FIG. 2 is a flowchart of a method for determining node connection relationships provided by an embodiment of the present invention;

FIG. 3 is a schematic diagram of an initial topology provided by an application embodiment of the present invention;

FIG. 4 is a schematic topology diagram of an unconnected No. 4 node provided by an application embodiment of the present invention;

FIG. 5 is a schematic topology diagram of reconnecting to node No. 4 provided by an application embodiment of the present invention.

Detailed ways

The technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

Embodiments of the present invention will be further described in detail below in conjunction with the accompanying drawings.

An embodiment of the present invention generates a method for an IEEE1394 network topology map. The implementation of the method is as shown in Figure 1, and specifically includes the following operations:

S101. Obtain the physical identification and port status information of each node in the IEEE1394 network, and determine the connection relationship of each node in sequence according to the port status information of the node in ascending order of the physical identification;

Among them, the physical identification and port status information of the node can be obtained from the self-identification package of each node. The port status of the node includes: child port, parent port, unconnected port, and unrealized port. The port status information can be but not limited to Represented by a Boolean function value.

S102. Obtain the static unique identifier of each node;

Among them, the static unique identifier of the node is used to distinguish the node from other nodes. The static unique identifier of the node can be a GUID (Globally Unique Identifier, globally unique identifier), or other numbers that can identify the node or coding.

S103. According to the connection relationship of each node and the static unique identifier of each node, generate a data structure of the connection relationship between nodes;

Wherein, the data structure of the connection relationship between nodes is used to describe the connection relationship between the parent node and the child node (ie, port correspondence). The data structure of the connection relationship can be saved in the form of parent-child nodes. Correspondingly, the saved data structure of the connection relationship includes: the static unique identifier of the node, and the static unique identifier of the node pointed to by each port of the node.

S104. Generate a network topology diagram according to the data structure of the connection relationship between the nodes.

The above processing process can be executed by the bus manager, and the bus manager refers to the device installed with the above processing function software, which can be a certain node in the network or a dedicated control device in the network.

The method provided by the embodiment of the present invention can automatically deduce the connection relationship between each node in the network, and then automatically generate a network topology diagram according to the connection relationship, so that the administrator can have an intuitive understanding of the network connection situation according to the topology diagram, thereby It can easily grasp the connection status and relative position of each node in the network, and quickly and accurately locate the error when a node fails. In addition, because the topology map is automatically generated according to the connection relationship of nodes, when the connection status between nodes changes, the topology map can also be updated in real time, so that administrators can obtain the latest network distribution information in time.

The specific implementation of step S101 in the above processing process is shown in Figure 2, including the following operations:

S201. Obtain the physical identifier and port status information of the node with the smallest physical identifier, and use the node with the smallest physical identifier as the current node to execute S202;

Optionally, after obtaining the physical identifier and port status information of the current node, the physical identifier and port status information of the current node are also cached.

S202. According to the port status information of the current node, determine whether the current node has a sub-port, if there is no sub-port, execute S203; if there is a sub-port, execute S204;

According to the distribution rules of physical identifiers in the IEEE1394 network, the node with the smallest physical identifier is a leaf node, and the leaf node has no sub-ports.

S203. Save the physical identifier of the current node in the pre-designated matching data area, and obtain the physical identifier and port status information of the next node in ascending order of the physical identifier, and return the next node to S202 as the current node;

Optionally, while saving the physical identifier of the current node, the port status information of the current node can also be saved;

Specifically, the physical identifier of the current node may be saved in the form of a stack in the matching data area, that is, the current node may be pushed into the stack.

S204. Read a node (called a matching node) with the largest current physical identifier in the matching data area from the nodes saved in the matching data area, and execute S205;

Wherein, if only the physical identification of the node is stored in the matching data area, then the port state information of the matching node can be obtained according to the physical identification, which can be obtained from the cache, or can be obtained by reading the self-identification packet of the matching node from the bus. If the node is saved in the form of a stack, a node is pushed from the stack.

S205. Obtain the connection relationship between the current node and the matching node in S204, and execute S206;

Among them, according to the principle of topology generation in the IEEE1394 network, the subport with the largest number among the unmatched subports of the current node is connected to the parent port of the matching node. Therefore, the above-mentioned connection relationship between the current node and the matching node in S204 specifically refers to: the current The connection relationship between the unmatched and highest-numbered child port in the node and the parent port of the matched node.

S206, judging whether the current node still has unmatched sub-ports (unmatched refers to no determined connection relationship), if there is, return to execute S204, otherwise, execute S207;

S207. Determine whether the current node has a parent port. If so, execute S208. If not, it indicates that the node is the root node. The process ends, and the connection relationship of each node is obtained;

S208. Store the physical identifier of the current node in the pre-specified matching data area, and acquire the physical identifier and port status information of the next node in ascending order of physical identifiers, and return the next node to S202 as the current node.

Through the process shown in FIG. 2 , the connection relationship between the nodes under the current bus configuration can be known.

For the specific implementation of step S102 in the above process, the description is as follows:

In the embodiment of the present invention, the static unique identifier of the node can be obtained, but not limited to, in the following two ways.

One way is to read the static unique identifier of the node from the ROM (Read-Only Memory, read-only memory) of the node in the process of drawing the topology map each time.

Another way is, after determining the connection relationship of each sub-port of the node, judge whether there is locally saved data structure history information of the connection relationship between nodes, and if so, compare the connection relationship obtained this time with the connection relationship saved The connection relationship in the data structure of the node is compared to obtain the static unique identifier of the node; if not, the static unique identifier is obtained from the ROM of the node. In an IEEE1394 network, when a node is powered on or off, or a node is added to or removed from the bus, the network needs to be reset and reconfigured. When a reset occurs, each node returns to its initial state, and the current topology information is cleared. In the method provided by the embodiment of the present invention, after the initial bus configuration, the GUID of each node is obtained by reading the ROM of each node. If the number or code is used as the static unique identifier of the node, after reading the GUID of the node, a unique code or number can be assigned to the node. After the bus is reset, the bus manager can obtain the identification information of the corresponding node through the historical information of the data structure of the connection relationship saved locally. If after the bus is reset, a new node joins the bus, the bus manager reads the GUID from the ROM of the new node, and can also encode or number the node. It can be seen that after the bus is reset, since the saved static unique identifier of the node can be obtained locally, the ROM of each node does not need to be frequently read, thus reducing the bus bandwidth occupation.

For the specific implementation of step S104 in the above process, the description is as follows:

The bus manager draws the topology diagram according to the obtained data structure of the connection relationship between the nodes, which can be specifically realized through the existing drawing technology. By way of example and not limitation:

One way to generate a topology map is:

After the bus configuration is completed, obtain the number N of nodes in the network according to the node registration information powered on at the physical layer;

The graphics representing N nodes are evenly displayed on the display screen. Among them, the pre-generated graphics used to represent the nodes can be called, or the graphics of the nodes can be drawn on the display screen. The N nodes can be evenly distributed in a rectangular shape, or can be Uniform distribution of circles or other geometric figures;

For example, in the upper left corner of the display screen, the nodes are evenly distributed in the ascending or descending order of the physical IDs of the nodes clockwise; or, in the lower right corner of the display screen, the nodes are evenly distributed in the ascending or descending order of the physical IDs of the nodes distribute the nodes. Its specific implementation method can be realized through existing algorithms.

After the topological structure between the nodes is known through the above process, the pre-generated line segment representing the connection relationship is called to display the connection relationship between the nodes; and the port number, node identification information and node physical information are marked on the corresponding node graph. logo.

If the graphics of N nodes are evenly distributed in rectangles on the display screen, the specific implementation methods can be but not limited to:

Let the number of nodes be N, the length of each node graph be a, and the height be h;

Then, when N is an even number and the physical identity of the node i≤N/2, the abscissa of NODEi is X _node i=2(i+1)a/(N+1), and the ordinate is Y _nodei =2h/6 ;The physical identifier of the node i>N/2, the abscissa of NODEi X _nodei =2(i+1)a/(N+1), the ordinate is Y _nodei =5h/6;

When N is an odd number, when the physical identity of the node i≤N+1/2, the abscissa of NODEi X _nodei =2(i+1)a/(N+2), and the ordinate is Y _nodei =2h/6; When the physical identity of the node i>N+1/2, the abscissa of NODEi is X _nodei =2(i+1)a/(N+2), and the ordinate is Y _nodei =5h/6.

Wherein, the coordinate origin is located at the upper left corner of the display screen, and the specific position can be set according to the actual situation.

In order to facilitate the user to call the information of each node and view the status of each node, the method provided by the embodiment of the present invention also includes the following operations:

The correspondence between the static unique identifiers of the nodes, the physical identifiers, and the port status information is obtained respectively, and the correspondence is stored in the form of a data structure of the nodes.

Wherein, the physical identifier and port status information in the node data structure can be obtained in the above step S201, but the static unique identifier in the node data structure can be obtained in the above step S102, but not limited to.

In this way, the user can view the status and port information of each node by calling the saved node data structure. The number of times to read self-identification packets from the bus is reduced, thereby reducing the occupation of bus bandwidth. In addition, since before and after the bus reset, the static unique identifier of the node remains unchanged, but the physical identifier and port status information of the node may change. Therefore, after the bus is reset, the user can easily view the changes in the connection relationship of each node, such as physical identification and port status information, before and after the bus reset.

The method provided by the embodiment of the present invention will be described in detail below in combination with specific application scenarios.

In an IEEE1394 LAN, there are 6 computers (nodes) connected to the bus. Each computer has three ports. After the bus configuration is completed, the method provided by the embodiment of the present invention can be used to draw the network topology diagram. Among them, the static unique identifiers of the six nodes are represented by numbers, which are No. 1 to No. 6 respectively, and the No. 5 node is the bus manager. Then the specific implementation of this application embodiment includes the following operations:

S301. The bus manager acquires the number N (6) of nodes in the network by acquiring the registration information reported by each node;

S302. The display screen of the bus manager displays 6 nodes. As an example and not limitation, the six nodes are evenly distributed in the display screen in a rectangular arrangement of two rows and three columns;

Wherein, the bus manager can draw nodes in the display screen in real time, and can also display each node in the display screen by invoking graphics representing nodes.

S303. The bus manager acquires the physical identifier and port status information of the node with the smallest physical identifier, and uses the node with the smallest physical identifier as the current node to execute S304;

S304, the bus manager judges whether the current node has a subport according to the port status information of the current node, if there is no subport, execute S305; if there is a subport, execute S306;

S305. The bus manager stores the physical identification of the current node in the pre-designated matching data area, and obtains the physical identification and port status information of the next node in ascending order according to the physical identification, and returns the next node as the current node to S304 ;

S306, the bus manager pushes out a node (called a matching node) from the stack, and executes S307;

S307. The bus manager obtains the subport with the highest number among the unmatched subports of the current node, determines the connection relationship between the subport with the highest number and the parent port of the matching node, and executes S308;

S308, the bus manager judges whether the current node has unmatched sub-ports, if so, returns to execute S306, otherwise, executes S309;

S309, the bus manager judges whether the current node has a parent port, if yes, executes S310, if not, then indicates that the node is a root node, executes S311;

S310. The bus manager pushes the current node into the stack, and obtains the physical identifier and port status information of the next node in ascending order according to the physical identifier, and returns the next node as the current node to S304;

S311. The bus manager judges whether there is historical data structure information of the connection relationship between nodes saved locally, if yes, execute S312, otherwise, execute S313;

S312. The bus manager compares the connection relationship of each node with the connection relationship in the saved connection relationship data structure, obtains the static unique identifier of each node, and executes S314;

Wherein, in the process of obtaining the static unique identifier of the node by comparing the connection relationship generated this time with the saved connection relationship, each node can be judged in descending order of the physical identifier starting from the root node. Then the identification information of the root node needs to be read from the ROM. Then judge whether the subport of node5 (root node) is connected before and after the bus reset, if yes, the static unique identifier of the node pointed to by the subport in the saved connection relationship data structure is the connection relationship determined this time. The node pointed to by this sub-port is statically uniquely identified (the basis is that in IEEE1394 networks, when a bus reset occurs, the node is usually powered on, powered off, or a node joins or exits. Therefore, if a node before and after the bus reset is connected to The physical connection relationship of the atomic nodes remains unchanged); according to the descending order of the physical identification, the static unique identification of each node is determined in this way, if the identification information of a certain node cannot be determined through judgment, it is obtained by reading the ROM information.

S313. The bus manager reads the static unique identifier from the ROM of the node, and executes S314;

S314, the bus manager generates and saves the data structure of each node according to the physical identification of the node obtained above, the port status information of the node and the static unique identification of the node, and executes S315. The port status information of the identifier and the node is used as an example without limitation, and the format of the data structure is shown in Table 1

Table 1

The number of the node The physical identity of the node Status of port 0 Status of port 1 Status of port 2

Correspondingly, the data structures of each node are:

No. 2 Node0 01 01 10 number four Node1 01 01 10 No. 1 Node2 01 10 01 number three Node3 01 11 10 Number six Node4 10 11 01 Number five Node5 11 11 11

Wherein, the port status 11 indicates that the port is a sub-port, the port status 10 indicates that the port is a parent port, and the port status 01 indicates that the port is not connected.

S315, the bus manager generates and saves the data structure of the connection relationship between nodes according to the connection relationship and identification information of the above-mentioned various nodes, executes S316, and the data structure of the connection relationship between nodes is as shown in Table 2:

Table 2

The number of the node The node pointed to by port 0 The node pointed to by port 1 Node pointed to by port 2 No. 2 Number five number four Number five number one number three number three number one number six Number six Number five number three Number five No. 2 number four Number six

S316. The bus manager draws a topology diagram on the display screen according to the topology structure shown in Table 2, as shown in FIG. 4 .

When the fourth node is disconnected from the network, the IEEE1394 bus is reconfigured. After the bus reset is completed, the topology diagram can be drawn again according to the above process. The topology diagram is shown in Figure 4, and the data structure of each corresponding node is shown in Table 3:

table 3

No. 2 Node0 01 01 10 No. 1 Node2 01 10 01 number three Node3 01 11 10 Number six Node4 10 11 01 Number five Node5 11 01 11

The data structure of the connection relationship between the corresponding nodes is shown in Table 4:

Table 4

The number of the node The node pointed to by port 0 The node pointed to by port 1 Node pointed to by port 2 No. 2 Number five number one number three number three number one number six Number six Number five number three Number five No. 2 Number six

When the fourth node is connected to the bus again, the IEEE1394 bus is reconfigured. After the bus reset is completed, the topology diagram can be drawn again according to the above process. The topology diagram is shown in Figure 5, and the data structure of each corresponding node is shown in Table 5:

table 5

No. 1 Node0 01 10 01 No. 2 Node1 01 01 10 number four Node2 01 01 10 Number five Node3 11 11 10 Number six Node4 11 10 01 number three Node5 01 11 11

The data structure of the corresponding connection relationship between nodes is shown in Table 6:

Table 6

The number of the node The node pointed to by port 0 The node pointed to by port 1 Node pointed to by port 2 number one number three No. 2 Number five number four Number five Number five No. 2 number four Number six Number six Number five number three number three number one number six

The above is only a preferred embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any person skilled in the art can easily conceive of changes or modifications within the technical scope disclosed in the present invention. Replacement should be covered within the protection scope of the present invention. Therefore, the protection scope of the present invention should be determined by the protection scope of the claims.

Claims (7)

1. a generation method of IEEE1394 network topology diagram, is characterized in that, comprises: Obtain the physical identification and port status information of each node in the IEEE1394 network, and judge the connection relationship of each node in turn according to the port status information of the nodes in the ascending order of the physical identification; the specific steps are: Step 1. Obtain the physical identification of the node with the smallest physical identification and port state information, and perform step 2 using the node with the smallest physical identifier as the current node; step 2, according to the port state information of the current node, judge whether the current node has a sub-port, if there is no sub-port, perform step 3; if If there is a sub-port, execute step 4; step 3, save the physical identifier of the current node in the pre-designated matching data area, and obtain the physical identifier and port status information of the next node in ascending order of the physical identifier, and use the next node as The current node returns to execute step 2; step 4, read a matching node from the nodes saved in the matching data area, and execute step 5; step 5, obtain the connection relationship between the current node and the matching node, and execute step 6 ; Step 6, judging whether the current node has unmatched subports, if so, return to step 4, otherwise, go to step 7; step 7, judging whether the current node has a parent port, if so, go to step 8 , if not, then complete the acquisition of the connection relationship of each node; Step 8, save the physical identification of the current node in the matching data area, and obtain the physical identification and port status information of the next node in ascending order according to the physical identification, and convert the The next node returns to step 2 as the current node; Obtain the static unique identifier of each node; According to the connection relationship of each node and the static unique identifier of each node, generate and save the data structure of the connection relationship between nodes; A network topology diagram is generated according to the data structure of the connection relationship among the nodes. 2. The method according to claim 1, wherein the physical identifier of the node is saved in the form of a stack in the data matching area. 3. The method according to claim 1, wherein said obtaining the static unique identification of each node comprises: After obtaining the connection relationship of each node, judge whether there is historical information of the data structure of the connection relationship between nodes saved locally. If so, the connection relationship of the nodes obtained this time and the data structure of the connection relationship between nodes Comparing the connection relationship in the node, obtaining the static unique identifier of each node; if not, obtaining the static unique identifier of the node from the read-only memory ROM of the node. 4. method according to claim 3, is characterized in that, if locally preserves the historical information of the data structure of connection relation between nodes, then the static unique identification of described obtaining each node further comprises: Obtain the static unique identifier of the node with the largest physical identifier from the read-only memory of the node with the largest physical identifier; According to the descending order of the physical identification, each sub-port of the node with the static unique identification is determined in turn, whether there is a parent port connected in the connection relationship obtained this time and in the historical connection relationship, if yes, obtain the historical connection relationship The static unique identifier of the node pointed to by the subport is used as the static unique identifier of the node pointed to by the subport in the connection relationship obtained this time. If there is a parent port connected in the connection relationship obtained this time but not connected in the historical connection relationship If the parent port is a parent port, the static unique identifier is obtained from the read-only memory of the node pointed to by the child port. 5. The method according to any one of claims 1-3, wherein the data structure of the connection relationship between nodes includes a static unique identifier of a node and a static unique identifier of a node pointed to by each port of the node. 6. The method according to any one of claims 1 to 3, characterized in that the method further comprises: Obtain the corresponding relationship between the static unique identifier of each node and the physical identifier and port state information respectively, and save the corresponding relationship in the form of a data structure of the node. 7. The method according to any one of claims 1 to 3, wherein the generating a network topology diagram according to the data structure of the connection relationship between the nodes comprises: Obtain the number of nodes in the IEEE1394 network; In the display screen, each node is evenly displayed in the ascending or descending order of the physical identification of the node in the counterclockwise or clockwise direction; According to the data structure of the connection relationship between the nodes, the connection relationship between each node is displayed on the display screen.

Images