JP5937038B2 - Topology diagram creation method and creation program - Google Patents

Description

  The present invention relates to a method and program for displaying configuration information of a virtual environment. In particular, the present invention relates to a method and a program for displaying information including a virtual server and a physical server whose configuration is dynamically changed.

  A large number of physical servers are operating in data centers owned by telecommunications carriers, ASP carriers, etc., and some physical servers run virtual servers. This structure changes day by day according to automatic control and customer demands due to failures and equipment loads. Specifically, physical servers are introduced, changed, or abolished, and virtual servers are created, deleted, migrated, and the like. In the operation center that operates the data center, in order to quickly refer to the configuration of the device when a failure occurs, it is necessary to always be able to grasp such configuration information. Therefore, software that displays topology diagrams is generally used. This software must dynamically grasp the physical server and virtual server that are dynamically changed, and the linking relationship between them, and update the displayed information accordingly.

  Various methods for displaying topology diagrams have been proposed. For example, the individual objects that make up the hierarchy of the center, physical server, and virtual server are displayed for each hierarchy, the two-tier display that displays the objects that follow from one object to the lower hierarchy, and the tree display of all the hierarchy It is a technique of doing.

  The greater the number of objects, the more difficult it is to construct a figure that grasps the entire area with good visibility. In the case of displaying the bus type or the like for each hierarchy, a technique of performing a hierarchy switching operation such as drilling down after selecting an object and displaying a lower hierarchy is generally used. When displaying two layers of one object and a lower-level object connected in a star shape or the like, there is a method of selecting an object and changing a display position so that surrounding objects do not overlap each other.

  Patent Document 1 proposes a method for inputting a region of interest and deformation conditions as a plant information display device, displaying only the region of interest as a deformation target region, and displaying the other regions separately from the non-deformation target region. . Patent Document 2 describes an algorithm for generating a tree structure for resource mapping of managed objects. Furthermore, Patent Document 3 presents an example in which data items related to a hierarchical database or a storage structure are displayed in a tree structure.

Japanese Patent No. 4749440 Japanese Patent Laid-Open No. 11-514111 Special table 2007-509414 gazette

  However, when displaying for each layer, only the layer can be seen at a glance, and is not suitable for overlooking the whole. Even in the case of two-level display, the display area is limited, especially in the case of a star type, when there are many child objects, it is difficult to avoid overlapping of objects and display them easily, and extra to avoid overlapping of objects Some operations were required.

  Further, since the method described in Patent Document 1 extracts only a part, it is not suitable for the purpose of displaying the whole image in an easy-to-view manner. Furthermore, although a tree structure is shown in Patent Document 2, a part of the structure is displayed as a tree structure to the last, and the structure of the entire system is not arranged so as to be easy to see. Further, in Patent Document 3, although a tree structure can be created, it is not assumed that the appearance of the entire tree structure to be generated is arranged.

  Accordingly, an object of the present invention is to promptly construct and display a tree structure that allows the viewer to easily grasp the entire configuration without performing extra operations even if frequent configuration changes occur.

This invention
A root object,
One or more first objects subordinate to the root object;
For a group of objects that can be expressed in a tree structure consisting of three or more layers having at least a second object that is dependent on zero or a natural number of each of the first objects,
Obtaining attribute information including the ID of each object and dependency information grasped according to the hierarchy of those objects;
Among the above objects, if there is an object other than the object located in the farthest hierarchy that is the most distant from the root object and does not have an object subordinate to itself, one impersonation subordinate to it Executing the step of generating a disguised object that is an object and setting dependency information, including the impersonated object itself as a target;
All the objects including the impersonation object are grouped into groups for each hierarchy, and in each group, the display order is determined by first sorting in the order of the records of the nearest parent object on which each object is subordinate, and Executing a step of determining a display order of the plurality of objects in any order when there are a plurality of objects subordinate to the same parent object;
A step of determining a coordinate value in one coordinate direction of each object by multiplying a predetermined coordinate interval for each object including the disguised object located in the farthest hierarchy,
For objects including the disguised object located in a layer other than the farthest layer, an arithmetic average of coordinate values in the one coordinate direction of all objects subordinate to the object in order from the layer closest to the farthest layer Determining a coordinate value in the one coordinate direction of the object as a value corresponding to
And before or after any step after the procedure summarized in the group for each hierarchy above,
Determining a coordinate value in a depth direction arranged in a direction perpendicular to the one coordinate direction of each object with a predetermined interval in the hierarchical order;
This problem has been solved by a method of displaying the icons of the individual objects constituting the object group at the coordinates determined by executing.

  After acquiring the latest information on the objects by a program that causes the computer to execute the above steps, the coordinates of the optimal position for laying out the objects can be quickly assigned to each object. An easy tree-like topology diagram can be quickly constructed. However, there must be no objects that jump over the hierarchy.

  Specifically, if the object constituting the object group is a data center, a physical server subordinate to the data center, or a virtual server executed on and subordinate to the physical server, the configuration change of the server in the data center Corresponding to the above, it is possible to create a topology diagram that can easily grasp the entire configuration of the center. In execution, it is preferable to set up a configuration management server that grasps the attribute information and the dependency relationship information of the objects, and to acquire the information from the configuration management server.

  Furthermore, a topology diagram can be created in the same manner even when an object constituting the object group includes a plurality of data centers and an inter-data center network to which the data center is subordinate. Conversely, the topology diagram can be created in the same manner even if the OS or program executed on the virtual server is included as a child object of the virtual server.

  From the method and program according to the present invention, it is possible to create and display a topology diagram that can be grasped as an overall picture immediately after updating the situation in which an object dynamically changes in an environment having a tree structure, and its system environment Monitoring and grasping can be facilitated.

  When used by an infrastructure provider, the failure center of each device is mapped to the topology diagram obtained by executing the present invention in the operation center that monitors the system built on the virtual environment, thereby Can be identified quickly, and the time to failure recovery is expected to be shortened. In addition, since an operation for adjusting the display position is unnecessary and the entire tree structure can be listed, it is expected to reduce the operation load on the maintenance personnel.

  When used by a web service provider, the transition of the user's usage screen can be grasped graphically by displaying the screen structure of the service to be provided and the usage status of the corresponding user in real time using a tree diagram. It can be used to analyze visit characteristics such as former pages and exit pages. This is expected to improve the number of accesses and the purchase rate at online shopping sites.

Configuration example diagram of a data center network which is a target example of an embodiment implementing the present invention Functional block diagram of a topology information display device used in an embodiment of the present invention FIG. 1 is an initial state example diagram of an object information table for attribute information in the embodiment of FIG. FIG. 1 is a diagram illustrating an example of a relationship information table for dependency information in the embodiment of FIG. Example of coordinate rule master in the embodiment of FIG. Flowchart example when the present invention is implemented in the embodiment of FIG. Example diagram when a dependency is added to the object information table of FIG. FIG. 3 is a diagram showing an example of a hierarchically separated work table generated from the object information table of FIG. Flowchart example of camouflaged object generation processing executed in the embodiment of the present invention Example figure of a camouflaged addition work table generated from the object information table of FIG. Flowchart example of numbering processing (processing B) executed in the embodiment of the present invention (A) FIG. 8 shows an example of a layer-separated work table at the stage of provisional X coordinate assignment, and (b) shows an example of a camouflaged additional work table reflecting (a). Flowchart example of coordinate calculation (process C) executed in the embodiment of the present invention (A) Example diagram of coordinate determination work table after coordinate determination based on FIG. 12 (b), (b) Example diagram of object information table reflecting coordinates after determination (A) Example of topology diagram when drawing with provisional coordinates for embodiment of FIG. 1, (b) Example of topology diagram when drawing after adjustment of X coordinate

  The present invention will be described in detail below. The invention includes three or more layers having at least one root object, one or more first objects subordinate to the root object, and second objects having zero or natural number subordinate to each of the first objects. This is a method for creating and displaying a topology diagram for an object group that can be expressed by a tree structure consisting of multiple layers.

  The target object needs to be an object that does not have a dependency relationship that jumps over a hierarchy that crosses children and connects to grandchildren. The object may be physical or conceptual.

  Here, the inter-data center network 11 is a root object, a data center 12 that is a first object that is a child object subordinate thereto, a physical server 13 that is a second object that is a grandchild object subordinate thereto, and a grandchild object subordinate thereto. An embodiment for an object group including the virtual server 14 will be described. A block diagram of a system according to this embodiment is shown in FIG. The virtual server 14 is executed on the physical server 13, and a plurality of virtual servers 14 may be executed on one physical server 13. However, there may be a physical server 13 that does not have the virtual server 14. A plurality of physical servers 13 gather to construct the data center 12. A plurality of data centers 12 gather to construct the inter-data center network 11.

  The target of the method according to the present invention is not limited to the case where the network between data centers is a root object, but in the embodiment in which the data center is a root object, the first object is a physical server, and the second object is a virtual server. It is feasible.

  In carrying out the present invention, it is first necessary to acquire attribute information including IDs of the respective objects and dependency relationship information grasped for each object hierarchy. For this reason, when used in the inter-data center network 11, the physical server 13, the virtual server 14, the data center 12, and the inter-data center network 11 constituting the above include at least identification information that can be used as an ID. It is desirable to provide a configuration management server 21 that acquires attribute information and dependency relationship information including their connection in the latest state as much as possible. Specifically, a packet for inquiry is periodically sent to each object, and it is possible to instruct each object to respond with information on the object subordinate to itself. The object that has received this information returns the attribute information of the objects subordinate to itself and the subordinate relation information thereof to the configuration management server 21 after obtaining the attribute information.

  In carrying out the present invention, it is preferable to use the topology information display device 20 having a function capable of executing the process of the invention in accordance with an instruction from the maintenance person terminal 22. Specifically, it may be a server having a function for that purpose. When the topology information display device 20 acquires the attribute information and the dependency relationship information from the configuration management server 21, the topology diagram to be created can be as close to the latest as possible. Further, it is not necessary to apply a load of accessing all objects and checking information every time drawing is performed. The topology diagram generated by the topology information display device 20 is transmitted to the maintenance person terminal 22 and displayed. This display may be based on an individual command from the maintenance person terminal 22, or information constantly displayed on the maintenance person terminal 22 may be updated in accordance with the update of the drawing on the topology information display device 20. .

  A functional block diagram of the topology information display device 20 is shown in FIG. A general computer can be used as the hardware. That is, the storage unit 31 records the attribute information and the dependency relationship information, and specifically includes a magnetic disk such as a hard disk, a nonvolatile memory such as an SSD, or a volatile memory. The control unit 32 is a general arithmetic device such as a CPU, reads table information including the attribute information and the dependency relationship information, and executes a program including steps relating to the contents of functions 51 to 54 described later. Operates and writes. The communication unit 33 is a physical network interface, exchanges data and commands with the control unit 32, and communicates with the configuration management server 21 and the maintenance person terminal 22 through the network.

  The storage unit 31 includes an object information table 41 that is a database including the attribute information and a relationship information table 42 that is a database including the dependency information. These are a table of initial values of attribute information and dependency relationship information acquired from the configuration management server 21. Thereafter, the object information table 41 is sorted and filled in with the execution of functions to be described later.

  An example of the object information table 41 is shown in FIG. At the initial point, only limited information acquired from the configuration management server 21 is included, and blanks occupy a large number. The attribute information includes at least an ID and may include a name that can be easily distinguished. The screen code in the figure is a code for making it possible to determine which of the plurality of display devices displays when the maintenance device 22 has a plurality of display devices. The branch number in the figure is a code for identifying which object group belongs when there are a plurality of object groups expressed in a tree shape to be grasped. In the following description, as an example, an embodiment in which there is one display device, “screen code” is fixed to 1, one object group expressed in a tree shape, and “branch number” is fixed to 1 is described. I will give you a description.

  In the figure, the hierarchy in which the root object is located is 1, the hierarchy in which the first object that is a child object subordinate to it is 2, and the grandchild of the root object that is subordinate to the first object. The hierarchy in which the second object, which is an object, is located is 3, and the hierarchy in which the third object, which is a descendant object of the root object, is subordinate to the second object, is 4. That is, it is a value indicating how far each object is located at the subordinate position from the root object.

  The parent ID in the figure is an ID of an object on which the object is directly subordinate and whose hierarchical value is one smaller than the object, and is blank at the initial time point. It is set after reading the information in the relationship information table 42. The number of children in the figure is a value indicating the number of objects that are directly subordinate to the object and whose hierarchical value is one larger than the object, and is blank at the initial time point. Similarly, it is set after reading the information of the relation information table 42.

  The Y coordinate and X coordinate in the figure are the coordinates of the display position of an icon indicating each object when the topology diagram is displayed. The present invention operates directly for the purpose of obtaining these coordinates in a suitable and simple manner. The display order in the figure is the order in which the objects are counted from one end among the objects located in the same hierarchy when sorted in the middle, and the records are sorted on the table. Appears as the display order. The same number of layers in the figure is the number of objects existing in the same layer.

  In this example, the direction in which the depth of the hierarchy is increased is described as the Y coordinate direction, and the development of each object is described as the X coordinate direction. However, the present invention can be implemented even if this orthogonal coordinate system is reversed in X and Y directions. .

  Next, an example of the relationship information table 42 is shown in FIG. As the dependency relationship information, all relationships displayed as lines when the tree is displayed are recorded with each object as a connection source and an object in a parent relationship to which the object depends as a connection destination. That is, in the data centers 12a (dc01) and 12b (dc02), an object having a subordinate parent relationship is the inter-data center network 11 (nw01). In both the physical servers 13a (pm01) and 13b (pm02), the data center 12a (dc01) is an object having a subordinate parent relationship.

  Separately from these, the Y-coordinate of the object in each layer when displaying on the display device is defined as the coordinate rule master 43. An example of the coordinate rule master 43 is shown in FIG. That is, it is defined at which height of which screen the objects following the root object, such as children, grandchildren, great-grandchildren ... are arranged. Whether the tree diagram extends downward from the root object or the tree diagram extending in the opposite direction is determined by the Y coordinate. The values of the Y coordinates between the layers may be defined so as to be equally spaced, but may not be equally spaced as long as a certain amount of space is provided. The Y coordinate may be defined as a different value for each screen code and for each branch number. Thereby, a plurality of branches of object groups having different configurations can be arranged vertically or on different screens.

  Of these, the object information table 41 is changed mainly by the above function. Hereinafter, an example of a topology diagram generation flow will be described with reference to the flowchart of FIG. First (S100), the topology information display device 20 acquires the name and type as the attribute information of each object from the configuration management server 21, stores them in the object information table 41 (S101), and then the configuration management server. 21. Information about the connection, which is the dependency relationship information between the objects, is acquired from 21 and the name and type between both ends of the connection are stored in the relationship information table 42 (S102), and the configuration information collecting function 51 is executed. At this stage, the contents of each table are as shown in FIGS. A blank field remains in the object information table 41.

  Next (S103), for each record in the object information table 41, the relationship between the object and the object at the nearest upper hierarchy is obtained by searching the relation information table 42, and the object is placed in the nearest upper hierarchy of the object. The ID of a certain object (indicated as “parent ID” in FIG. 3) and the number of objects in the latest lower hierarchy that have a child relationship directly subordinate to the object are added to the object information table 41 for each hierarchy. The object number totaling / child object number totaling function 52 is executed. The state of the object information table 41 at this time is shown in FIG. In the inter-data center network 11 that is the root object, the item “parent ID” remains blank.

  Next (S104), a rule information list 44, which is a table obtained by extracting records corresponding to “screen code and branch number” in the object information table 41 from the coordinate rule master 43 (FIG. 5), is created. The target rule extraction function 54 is executed. In other words, this is a step of extracting data used in the object information table 41 handled in this work from general-purpose regulations, and has the effect of speeding up the processing performed in the Y coordinate calculation described later. When there is a single screen and tree, this extraction step itself does not need to be performed, so this S104 can be omitted. In this case, in the next S105, the “coordinate rule master” is directly referred to instead of the “rule information list”.

Next (S105 to S110), the display position calculation function 53 for obtaining the display position of each object is executed.
First (S105), for each record in the object information table 41, the coordinate rule master or the rule information list extracted from the record is extracted from the coordinate rule master 43 or the coordinate rule master 43 or The Y coordinate recorded in the rule information list 44 is applied. In this way, the object information table 41 in which the Y coordinate is filled is extracted for each layer, and a layer-separated work table 46 which is a work table group as shown in FIG. 8 is obtained. A camouflaged object generation process (process A) is performed for each hierarchy in the ascending order of the hierarchy from the root object to the hierarchical separation type work table 46.

  By this disguise object generation process (Process A), disguise objects for adjusting the intervals when displaying individual objects are displayed on the table for objects that are not the farthest layer and have no child objects. Generate. An example of the procedure will be described with reference to FIG. First, in the separated table of the hierarchy separation type work table 46, objects “the number of child objects is 0 and not the farthest hierarchy” are extracted in order from the hierarchy closest to the root object (S202). ). Note that the root object itself cannot be the target of this process, and is a process for an object that is deeper than the first object (hierarchical number in the table is 2 or higher). If no such object is found, the process ends as it is (S202 → No → S206 → S207).

  When an object satisfying the above condition is found, a disguised object subordinate to the object is generated using the ID and name of the object that does not have the child object (S203). For example, using each of the ID and the name of the object, an ID and a name to which “Z_” for identifying that the object is a camouflaged object are set at the beginning of the character string. Note that the setting method is not limited to this, and any setting method can be used as long as it can be easily identified as a camouflaged object. The level of the disguised object is obtained by adding 1 to the level of the object, and the Y coordinate according to the description of the coordinate rule master 43 or the rule information list 44 corresponding to the set level is set. To do. The object generated in this way is added as a new record to the working layer separation type work table 46 (S204). The table group to which the user belongs is inserted into a hierarchy corresponding to the hierarchy of the newly generated camouflaged object itself. After that, as much as the impersonated object is generated, 1 is added to the number of child objects (“number of children” in the figure) for the record of the object, that is, the parent object of the generated impersonated object (S205). That is, since the original was 0, it is set to 1.

  This camouflaged object generation process is performed in order from the hierarchy close to the root object. However, it is not executed in the farthest layer. This disguise object generation process is a process for virtually aligning the tips of the branches of the tree and arranging them in order of the coordinate position, so that the other branches and leaves are in the farthest hierarchy that has no further child objects. This is because it is meaningless to generate a camouflaged object before that, and the process breaks down as the child object grows indefinitely.

  After that, the contents of the layer-separated work table 46 in which the record is corrected by generating a camouflaged object is registered in the camouflaged addition work table 45, which is a new table reflected in the object information table 41 (S206). .

  This camouflaged object generation process (S106) is sequentially processed for all the records in the hierarchy (S107), and when the hierarchy is over, the process moves to the next hierarchy and generates an impersonation object for an object having no child object. Repeat the process. This is repeated up to the layer immediately preceding the farthest layer (S108). That is, the processing is continued until the hierarchy set in the generated disguised object is the farthest hierarchy.

  However, the camouflaged object generation process is recursively performed on the camouflaged object itself. If there is an object in another form, and there is an object that has no child objects among the first objects in the group of objects having four or more layers, the impersonation object that becomes the second object is generated, and the impersonation Since a target object also has no child objects and is not the farthest hierarchy, it causes a fake object that is subordinate to the fake object to be generated.

  FIG. 10 shows a state at the time of adding a camouflaged addition work table 45, which is a new table in which the above-mentioned camouflaged object is added to the object information table 41. In the figure, the virtual server's camouflaged object indicated by “Z_Z_...” Indicates that it is a camouflaged object generated depending on the camouflaged object.

  After the generation of the camouflaged object, the numbering process (process B) is executed (S109). This is a process of aligning the order so that the lines connecting the objects forming the tree, including the generated disguised object, do not intersect. The individual objects are arranged in order of positions (here, the X-axis position) for each hierarchy, but the parent object is at the right end, but the child object is at the opposite end, it does not hold as a tree. For this reason, it is necessary to arrange the hierarchical order of the child objects so as to follow the order in the hierarchy of the parent object.

  The numbering process (S109) will be described with reference to FIG. First (S301), the forgery addition work table 45 is sorted in ascending order of hierarchy, that is, sorted in order from the root object hierarchy to the farthest hierarchy (however, in the above figure, the order is from the beginning). In the hierarchy, the objects are first sorted in the order of the parent object records, and then the objects having the same parent object record are sorted in alphabetical order of the IDs of the objects. For this reason, if the above-described method of assigning “Z_” for discriminating a camouflaged object is distinguished, it becomes easier to arrange the last in alphabetical order, and it is easy to collect branches with a series of camouflaged objects. Further, in the case of a first object subordinate to only one root object, it is simply sorted in the order of the assigned IDs of the respective first objects.

  The sorting criteria when there are a plurality of child objects subordinate to the same parent object after sorting in the record order of the parent object is not limited to the ID order as described above. They may be arranged in order or other criteria, or may be arranged in random order without any criteria, and a tree can be generated in any order.

  By the above processing, the individual objects are first sorted in the display order of the parent object records, so that the lines forming the tree do not cross each other.

  After that, position adjustment in the axial direction (in the example, adjustment of the X axis) is performed in order to make the tree easier to see. For this purpose, first, a temporary position (here, the X axis) is determined for each object (S303). Specifically, the display order in the items is determined in the sorted order of the hierarchical separation type work table 46. This display order is a number indicating the number of each layer from the one end, and is the order of each layer. At the same time, the final display order number for each layer is determined as the number of objects in the same layer (the item “the number of the same layer” in the figure). Note that the number here is not the number of actual objects, but the number that should be considered in the display including disguised objects. In addition, a temporary display position in the X-axis direction is assigned by multiplying a predetermined X coordinate interval in this display order. The predetermined X coordinate interval needs to be a value that allows all objects in the hierarchy having the maximum number of objects, that is, the farthest hierarchy, to be arranged in the X axis direction at the interval.

  FIG. 12A shows the state of the layer-separated work table 46 in an example in which 30 is assigned as the X coordinate interval at this stage. FIG. 12B shows a state in which the display order, the number of the same hierarchy, and the value of the temporary number of the X coordinate are reflected in the camouflaged addition work table 45 (S304). When provisional X coordinates are assigned to all layers and all records (S305, S306), the numbering process (process B) is completed (S307).

  However, the present invention can be implemented even if this provisional X coordinate assignment is performed only in the farthest layer. In the subsequent coordinate calculation (Process C), the X coordinate to be determined is calculated in order from the farthest layer. At that time, for an object in a layer other than the farthest layer, the X coordinate of the object is determined. This is because the provisional X coordinate of the object is not particularly used.

  Finally, coordinate calculation (process C) for determining the coordinate position of each object is executed using the display order and temporary coordinates defined above (S110). The procedure will be described with reference to FIG. First (S401), information is acquired from the camouflaged addition work table 45, and a table is obtained in which the records are arranged in descending order with respect to the hierarchy, and the display order in the hierarchy remains unchanged (in the above example, ascending order) (S402). Sorting may be applied again to the camouflaged additional work table 45, or it may be extracted as a new table. Here, a new table is handled as the coordinate determination work table 47. As a result, a table with the root object as the last in the farthest hierarchy is obtained.

  First, since the farthest layer is used as a reference, the X coordinate of the object in the farthest layer is left as it is (S403 → S407). At this time, the X coordinate of the camouflaged object remains unchanged. Suitable tree diagram that is not drawn at the stage of displaying the topology diagram on the maintenance person's terminal, but it is easy to grasp the whole picture by adjusting the position of the object of the hierarchy closer to the root on the assumption that a disguised object exists Will be obtained.

  Next, for the objects of the hierarchy closer to the root than the farthest hierarchy (lower hierarchy in the coordinate determination work table 47 arranged in descending order of hierarchy), all X coordinates of child objects subordinate to each object are acquired ( S404 to S405). That is, if there is one child object subordinate to the object, the X coordinate of the child object is acquired, and if the object has a plurality of child objects, the X coordinates of all the child objects are acquired. If there is one child object, the X coordinate of the object is the same as the X coordinate of the child object. In this case, the portion of the tree has no inclination extending in the Y-axis direction. When there are a plurality of child objects, the X coordinate of the object is an arithmetic average value of the X coordinates of the child objects (S406). That is, it is located directly under the center of those child objects. The arithmetic average value may be obtained by adding all X coordinates of a plurality of child objects and dividing the result by the number, or by adding the left end coordinate and the right end coordinate of those child objects and dividing by two. May be. As the calculation process, the latter is easier to process at high speed. Such calculation proceeds in hierarchical order (S407 → S408). When the X coordinate of the second object is determined, the X coordinate of the first object is determined using the X coordinate, and when the X coordinate of the first object is determined, the X coordinate of the root object is determined using the X coordinate. .

  FIG. 14A shows the state of the coordinate determination work table 47 when the X coordinate is determined. The X coordinate of the physical server A (13a, pm01) is 45, which is an arithmetic average of the X coordinates 30 and 60 of the two virtual servers subordinate thereto. On the other hand, the physical server B having only the virtual server which is a camouflaged object inherits the X coordinate of the camouflaged object as it is and becomes 90. In addition, the data center having neither a physical server nor a virtual server inherits the X coordinate of the disguise object that is the grandchild object as it is and becomes 120.

  The X coordinate and Y coordinate in the coordinate determination work table 47 thus obtained are reflected in the corresponding ID record in the object information table 41 (S409). However, the value for the disguised object need not be reflected. This is because it is assumed for the calculation to make the layout suitable, and is not actually what the viewer should see. An example of the reflected object information table 41 is shown in FIG.

  Using the values of the object information table 41 obtained in this way, each object is displayed on the designated X coordinate and Y coordinate by an icon having a size that fits in the interval, and the parent object of each object is displayed. A suitable tree can be obtained by drawing a straight line between them. The image data may be sent to the maintenance person terminal 22 after this drawing is performed by the topology information display device 20, or the completed object information table 41 is sent to the maintenance person terminal 22, and the maintenance person terminal 22 executes the drawing program. The drawing may be executed (S410). Thus, the calculation process is completed (S411), and the drawing method according to the present invention is completed (S111).

  FIG. 15A shows an example of the topology diagram for the above-mentioned X coordinate at the temporary stage, and FIG. 15B shows an example of the topology diagram after final determination. Actually, the camouflaged object is not drawn, but the position is virtually included. Due to the presence of the disguised object, the branching of the tree is suitably adjusted, and the relationship between objects that are not direct is clear.

11 Inter-data center network 12, 12a, 12b Data center 13, 13a, 13b Physical server 14, 14a, 14b Virtual server 20 Topology information display device 21 Configuration management server 22 Maintenance person terminal 31 Storage unit 32 Control unit 33 Communication unit 41 Object Information table 42 Relational information table 43 Coordinate rule master 44 Rule information list 45 Disguise addition work table 46 Hierarchical separation type work table 47 Coordinate determination work table 51 Configuration information collection function 52 Hierarchical object number totaling / child object number totaling function 53 Display position Calculation function 54 Target rule extraction function

Claims (4)

A root object,
One or more first objects subordinate to the root object;
For a group of objects that can be expressed in a tree structure consisting of three or more layers having at least a second object that is dependent on zero or a natural number of each of the first objects,
Obtaining attribute information including the ID of each object and dependency information grasped according to the hierarchy of those objects;
Among the above objects, if there is an object other than the object located in the farthest hierarchy that is the most distant from the root object and does not have an object subordinate to itself, one impersonation subordinate to it Executing the step of generating a disguised object that is an object and setting dependency information, including the impersonated object itself as a target;
All objects including the above-mentioned camouflaged objects are grouped into groups for each hierarchy, and in each group, if there is a nearest higher-order object on which each object is subordinate, the display order is determined by sorting in the display order of the nearest higher-order object. And, if there are a plurality of objects subordinate to the same nearest higher-order object, executing a step of determining the display order of the plurality of objects in any order,
A step of determining a coordinate value in one coordinate direction of each object by multiplying a predetermined coordinate interval for each object including the disguised object located in the farthest hierarchy,
For objects including the disguised object located in a layer other than the farthest layer, an arithmetic average of coordinate values in the one coordinate direction of all objects subordinate to the object in order from the layer closest to the farthest layer Determining a coordinate value in the one coordinate direction of the object as a value corresponding to
as well as,
Before and after any of the steps after the procedure grouped in the group for each hierarchy, the coordinate values in the depth direction arranged in the direction perpendicular to the one coordinate direction of each object are predetermined in the hierarchy order. The step of determining with an interval of,
A method for creating a topology diagram, in which icons of individual objects constituting the object group are displayed at coordinates determined by executing. As an object constituting the object group,
The topology diagram creation method according to claim 1, comprising: a data center, a physical server constituting the data center subordinate to the data center, and a virtual server executed on the physical server and subordinated thereto. As an object constituting the object group,
The method for creating a topology diagram according to claim 2, comprising an inter-data center network composed of a plurality of the data centers, to which the data centers are subordinate. On the computer,
A root object,
One or more first objects subordinate to the root object;
For a group of objects that can be expressed in a tree structure consisting of three or more layers having at least a second object that is dependent on zero or a natural number of each of the first objects,
Obtaining attribute information including the ID of each object and dependency information grasped according to the hierarchy of those objects;
Among the above objects, if there is an object other than the object located in the farthest hierarchy that is the most distant from the root object and does not have an object subordinate to itself, one impersonation subordinate to it Executing the step of generating a disguised object that is an object and setting dependency information, including the impersonated object itself as a target;
All objects including the above-mentioned camouflaged objects are grouped into groups for each hierarchy, and in each group, if there is a nearest higher-order object on which each object is subordinate, the display order is determined by sorting in the display order of the nearest higher-order object. And, if there are a plurality of objects subordinate to the same nearest higher-order object, executing a step of determining the display order of the plurality of objects in any order,
A step of determining a coordinate value in one coordinate direction of each object by multiplying a predetermined coordinate interval for each object including the disguised object located in the farthest hierarchy,
For objects including the disguised object located in a layer other than the farthest layer, an arithmetic average of coordinate values in the one coordinate direction of all objects subordinate to the object in order from the layer closest to the farthest layer Determining a coordinate value in the one coordinate direction of the object as a value corresponding to
as well as,
Before and after any of the steps after the procedure grouped in the group for each hierarchy, the coordinate values in the depth direction arranged in the direction perpendicular to the one coordinate direction of each object are predetermined in the hierarchy order. The step of determining with an interval of,
A topology diagram creation program that displays the icons of the individual objects constituting the object group at the coordinates determined by executing.

Images