Source: http://www.google.com/patents/US20040225697?dq=7,172,682
Timestamp: 2014-08-23 08:16:59
Document Index: 600988413

Matched Legal Cases: ['art 106', 'art 107', 'art 106', 'art 108', 'art 107', 'art 106', 'art 108']

Patent US20040225697 - Storage operation management program and method and a storage management ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign in<nobr>Advanced Patent Search</nobr>PatentsA managing computer (manager) manages replication of data areas inside a storage or among storages. A storage volume management module of the manager manages policy of the volume and its properties. When replication of a volume is set, a volume of a replication destination appropriate for a volume of...http://www.google.com/patents/US20040225697?utm_source=gb-gplus-sharePatent US20040225697 - Storage operation management program and method and a storage management computerAdvanced Patent SearchPublication numberUS20040225697 A1Publication typeApplicationApplication numberUS 10/650,851Publication dateNov 11, 2004Filing dateAug 29, 2003Priority dateMay 8, 2003Also published asEP1507206A2, EP1507206A3, US7191198, US7483928, US20070112897, US20080263111Publication number10650851, 650851, US 2004/0225697 A1, US 2004/225697 A1, US 20040225697 A1, US 20040225697A1, US 2004225697 A1, US 2004225697A1, US-A1-20040225697, US-A1-2004225697, US2004/0225697A1, US2004/225697A1, US20040225697 A1, US20040225697A1, US2004225697 A1, US2004225697A1InventorsMasayasu Asano, Kenichi Shimooka, Daisuke ShinoharaOriginal AssigneeMasayasu Asano, Kenichi Shimooka, Daisuke ShinoharaExport CitationBiBTeX, EndNote, RefManReferenced by (18), Classifications (17), Legal Events (2) External Links: USPTO, USPTO Assignment, EspacenetStorage operation management program and method and a storage management computerUS 20040225697 A1Abstract A managing computer (manager) manages replication of data areas inside a storage or among storages. A storage volume management module of the manager manages policy of the volume and its properties. When replication of a volume is set, a volume of a replication destination appropriate for a volume of a replication source is generated using the policy and the properties to form a replication pair. A route management module of the manager and its volume management module bring the policy and the properties of the volumes, and the policies and conditions of lines into conformity with one another. When any fault occurs in a line route used for data transfer during replication of the volume, a separate line route is utilized, and a fault countermeasure is taken for replication of the volumes in accordance with the policy and properties of the volumes. Images(9) Claims(17)
BRIEF DESCRIPTION OF THE DRAWINGS [0019]FIG. 1 is a block diagram showing a construction of a storage operation management system according to a first embodiment of the invention; [0020]FIG. 2 is an explanatory view useful for explaining a table group managed by a volume management module 105; [0021]FIG. 3 is a flowchart useful for explaining a processing operation for setting replication of volumes in accordance with policy of a volume of replication source and generating a pair of the volume of the replication source and a volume of the replication destination; [0022]FIG. 4 is a block diagram showing a construction of a storage operation management system according to a second embodiment of the invention; [0023]FIG. 5 is an explanatory view useful for explaining a table group managed by a route management module 401; [0024]FIG. 6 is a flowchart useful for explaining a processing operation for generating a replication in accordance with policy of a line for connecting volumes when a volume replication is generated between storages in the second embodiment of the invention; [0025]FIG. 7 is a flowchart useful for explaining a processing operation of fault shooting when any fault occurs in a route of replication during the volume replication operation between the storages; [0026]FIG. 8 is a flowchart useful for explaining a processing operation for generating a replication pair in another storage; and [0027]FIG. 9 is a block diagram showing a construction of a storage operation management system according to a third embodiment of the invention.
DETAILED DESCRIPTION OF THE EMBODIMENTS [0028] A construction of a storage operation management system and an operation management method according to preferred embodiments of the invention will be hereinafter explained in detail with reference to the accompanying drawings. [0029]FIG. 1 is a block diagram showing a construction of a storage operation management system according to a first embodiment of the invention. [0030] The storage operation management system according to the first embodiment of the invention includes a managing computer (manager) 100 and a plurality of storages 11 a to 11 n that are connected to one another through a data network 130 and through a network 140. The storage 11 a includes volumes (data areas, hereinafter called merely �volumes�) 113 a,113 b, . . . , 113 n as management areas for storing data that are managed in practice by a computer, a space area 114 that will be divided and set as volumes in future, data communication equipment 110 for transmitting and receiving data I/O of read/write data of the volumes, network communication equipment 111 for communicating with the managing computer 100, etc, and a controller 112 for practically controlling the storages. The data communication equipment 110 and the network communication equipment 111 may be constituted and arranged as one communication equipment by connecting them together through IP (Internet Protocol) connection in a connection form (such as Ethernet (trade mark)). [0031] The storage 11 b, too, includes volumes 123 a, 123 b, . . . , 123 n, a space area 124, data communication equipment 120, network communication equipment 121 and a controller 122 in the same way as the storage 11a. The other storages 11 b, . . . , 11 n have also the same construction as the storage 11 a. [0032] The data network 130 is a cable as a route of data communication of the storages and the computers. The network 140 is a route that can communicate with the managing computer 100, etc. These networks may be either mere buses or LAN. The data network 130 and the network 140 are the same with each other depending on the communication form and may be Ethernet (trademark), for example. [0033] The managing computer 100 includes a memory 101, a CPU 102, network communication equipment 103 and a storage device 104. The storage device 104 includes therein a volume management module 105 and a later-appearing volume management module table group 200 managed by the volume management module 105. [0034] The volume management module 105 achieves the processing in the embodiment of the invention. The volume management module 105 includes a volume generation part 106 for instructing generation of the volumes to the storages 11 a, 11 b, . . . , 11 n, a volume pair generation part 107 for generating a replication pair from among the volumes generated by the instruction of the volume generation part 106, and a volume pair selection part 108 for selecting the volume pair that can be replicated from policy of the volumes (for replication source, for replication destination, for both, etc) and their properties (performance, reliability, etc) and from policy of the storages (for financial systems, for various management businesses of companies, for database, etc) and their properties (performance, reliability, etc). The volume management module 105 is accomplished when software, not shown, stored in the storage device of the managing computer 100 is written into the memory 101 and is executed by the CPU 102. [0035] When the storage operation management system shown in FIG. 1 replicates the volumes between the storages, such as when a volume 113 a of the storage 11 a is a volume of the replication source and the volume 123 a of the storage 11 b is a volume of a replication destination, the controller 112 of the storage 11 a and the controller 122 of the storage 11 b cooperate with each other, transmit the content of the volume 113 a to the volume 123 a through the data network 130 and replicate the content. In this case, the respective computers using the volume 113 a and the volume 123 a and the controllers 112 and 122 may cooperate with one another and conduct replication. [0036]FIG. 2 explains the table group that the volume management module 105 manages. The volume management module table group 200 managed by the volume management module 105 includes a volume information table 210, a storage information table 220 and a pair information table 230. [0037] The volume information table 210 stores a volume ID 211 allocated to identify all the volumes of the storages managed by the managing computer 100, a storage ID 212 representing an identifier of the storage to which the volume belongs, a storage volume ID 213 representing the identifier of the volume managed inside each storage in the storage, a policy 214 representing the use policy of the volume such as for the replication source, for the replication destination, for both replication source and destination, for the replication source for remote copy, each being designated by the user and the application, a volume capacity 215, Read/Write 216 representing read/write frequency from and to the volume set by the policy of the user and the application (for financial system, for various management businesses of companies, for database, etc), performance 217 representing a read/write speed of the volume, reliability 218 representing reliability of the volume in terms of a numerical value, and pairing possible/impossible information 219 representing whether or not the volume can be set as the volume that can be paired as the replication source with volume of the replication destination. [0038] The storage ID 212 is an identifier of each storage 11 a, 11 b, . . . , 11 n. The storage volume ID 213 is an identifier of each volume 113 a,113, . . . , 113 n. Values of from 0 to 10 are entered as Read/Write information 216. In the case of the value 1, the policy is limited to only Read. As the value increases from 2, frequency of Write becomes higher. In the case of 10, the policy is limited to only Write. Values acquired by normalizing performance such as a read/write speed, etc between 1 and 10, that is, values of from 1 to 10, are entered to the performance information 217 representing performance of the volume. In the case of the value 1, access performance to the volume is the lowest and in the case of 10, access performance reaches maximum. Reliability information 218 representing reliability of the volume in terms of a numerical value is acquired by normalizing reliability between 1 and 10, that is, values from 1 to 10, are entered. The value 1 represents the highest degree of fault occurrence of the volume and the value 10 represents the lowest degree of fault occurrence. When setting is made in only the RAID level, for example, the managing computer 100 decides a rule such that the volume of RAID0 is 1, RAID1 is 10, RAID5 is 5, and so forth, and executes the management operation. In other words, Read/Write information 216, performance information 217 and reliability information 218 represent the properties of the corresponding volume. [0039] The storage information table 220 stores information representing each of the storage ID 221 as the identifier of the storage managed by the managing computer 100, a space capacity 222 representing the capacity of a space area the storage does not yet set and use as the volume, policy 223 to be given to the storage, maximum reliability 224 that can be achieved when the storage generates the volume by use of the space area and maximum performance 225 that can be achieved when the storage generates the volume by use of the space area. [0040] In the case of the storage 11 a, for example, the value of the space capacity 222 represents the capacity of the space area 114. When the storage ID 221 has the same value as the value of the storage ID 212 of the volume information table 210, it represents the same storage. [0041] The pair information table 230 represents information of replication of the volumes the managing computer 100 manages. This table includes information of each of a pair ID 231 for identifying pair information, a main volume ID 232 representing a volume ID of the volume of the replication source, a sub-volume ID 233 representing a volume ID of the volume of the replication destination and a replication type 234 representing a replication type. [0042] The value of the main volume ID 232 and the value of the sub-volume 233 represent the same volume when the values of the volume ID in the volume information table 210 are the same. A value �synchronous� or a value �asynchronous� is entered to the replication type 234. In the case of �synchronous�, replication to the volume of the replication destination is made when write occurs in the volume of the replication source. In the case of �asynchronous�, replication is made in a unit of a certain schedule (every predetermined time, data quantity per replication). The user or the application may set this replication type. Alternatively, the replication type may be set as a part of the processing of the volume management module that will be explained next. [0043]FIG. 3 is a flowchart useful for explaining a processing operation for setting replication of the volume in accordance with the policy of the volume of the replication source and then generating the pair of the volume of the replication source and the volume of the replication destination. Next, this flowchart will be explained. The volume management module 105 executes the processing that will be explained with reference to this flowchart. [0044] (1) First, the volume management module 105 acquires the pair generation request of the volume to be replicated with the ID of the volume of the replication source from the user and the application (Step 300). [0045] At this time, the volume management module 105 may start executing the processing of Step 300 after the volume of the replication source is generated but before it receives the ID of the volume. In other words, when receiving the replication generation request, the volume management module 105 may create the volume of the replication source and the volume of the replication destination during a series of processing and may execute a plurality of settings. Alternatively, the volume management module 105 may acquire a request that the replication is created by use of the volumes inside the storage or the volumes between the storages. [0046] (2) Next, information of the policy 223 of the storage is retrieved on the basis of the storage ID, and whether or not the storage having a volume capable of forming the pair with the volume of the replication source exists is judged. When the storage has the policy not capable of creating the volume as the replication source, the flow shifts to Step 308 and if not, to Step 302 (Step 301). [0047] When the request for setting replication of the volumes exists between the storages in Step 301 and when all the storages other than the storage to which the volume of the replication source belongs, that is, all the storages other than the storage to which the volume of the replication source registered to the storage information table 200, have registered their policy to the limited policy of �for main storage� that generates only the volume of the replication source to the policy 223 as typified by the storage of the storage ID3 in the storage information table in FIG. 2, the flow proceeds to Step 308 to notify that the storage capable of forming the volume of the replication destination does not exist. The flow may proceed to next Step 302 when the storage information table 220 does not manage the information of policy 223. [0048] (3) When the storage capable of forming the pair is found existing in the volume as a result of judgment in Step 301, whether or not that storage has the policy of forming the pair is judged. In other words, when the volumes having the policy not capable of becoming the volume of the replication destination other than the volumes belonging to the storage having the policy not capable of forming the volume of the replication destination are retrieved and when all the volumes so retrieved cannot become the volume of the replication destination, the flow proceeds to Step 305 and if not, the flow proceeds to Step 303 (Step 302). [0049] In Step 302, when the request for setting replication of the volume exists between the storages, for example, and when the volume of the replication destination cannot be designated in case all the policies of the volumes other than the storage to which the volume of the replication source belongs are �for replication source� as typified by the volume ID 1 in the volume information table 210, the volume of the replication source cannot be designated and the flow therefore proceeds to Step 305. If not, the flow proceeds to Step 303. When replication of the volume is set inside the storage, the volume of the replication destination cannot be designated if all the policies of the volumes of the storage to which the volume of the replication source belongs are �for main volume�. Therefore, the flow proceeds to Step 305 and to Step 303 when the policy is not �for main volume�. [0050] (4) When the storage is found having the policy of forming the pair in the judgment of Step 302, whether or not the volume capable of forming the pair exists is judged. In other words, the volumes that cannot be used at present as the replication destination other than the volumes that cannot form the volume of the replication destination are retrieved on the basis of information of pairing impossible/impossible 219. When the object volumes all have the information �impossible� in the pairing possible/impossible information 219 as represented by the volume ID2 of the volume information table, the existing volumes managed by the managing computer cannot accomplish the replication destination. Therefore, the flow proceeds to Step 305, and to Step 304 when they can (Step 303). [0051] (5) When the volume capable of forming the pair is found existing in the judgment of Step 303, whether or not the properties accessorial to the volume, that is, the values of capacity 215, Read/Write 216, performance 217 and reliability 218 of the volume information table 210 are coincident are checked. The flow proceeds to Step 307 when the coincident volume exists and to Step 305 when not. The term �coincidence� hereby used means in principle that the values are the same. Even when the volume having properties coincident with these properties does not exist, a volume having the property values approximate to these values may be used depending on the operation principle. As to the values of capacity 215, performance 217 and reliability 218 described above, the values of the replication destination may be the same or greater. For example, when the volume having a value 3 as the value of the volume ID 211 of the volume information table 210 is designated as the volume of the replication source during the processing of Steps 300 to 304, it becomes possible to set the volume having a value 6 of the volume ID 211 of the volume information table 210 to the volume of the replication destination. In other words, it is possible to set the volume having properties that are the same as or greater than the properties accessorial to the replication source to the volume of the replication destination (Step 304). [0052] (6) When a volume coincident with the properties accessorial to the volume described above is not found in the judgment of Step 304, it means that no corresponding volume as the volume of the replication destination exists among the existing volumes managed in the volume information table. Therefore, whether or not this corresponding volume can be generated from the space area of the storage is judged. In other words, whether or not the volume coincident with the properties of the volume of the replication source can be generated is checked from the storage information table 220 with the exception of the storages not having the space area, and whether or not the volume coincident with the volume of the replication source can be generated is checked from capacity 222, reliability 224 and maximum performance 225 inside the storage information table 220. When it can, the flow proceeds to Step 306 and when it cannot, the flow proceeds to Step 308. When the volume having the volume ID 211 value of 7 in the volume information table 210 is designated as the volume of the replication source, for example, other volumes cannot be set as the volume of the replication destination in case that the properties are judged as non-coincident and designation of the volume is judged as impossible in Step 304. Therefore, this processing judges whether or not a volume of the replication source can be generated afresh from the space area is judged. At this time, it is possible to know from the information of the storage information table 220 that the volume of the replication destination can be achieved from the storage of the storage ID4 (Step 305). [0053] (7) When the judgment result of Step 305 represents that the corresponding volume can be generated from the space area, the instruction is given to the controller of the storage to generate the volume of the replication destination coincident with the volume of the replication source, and the volume management table 210 and the storage information table 220 are updated. The controller of the storage generates the volume in accordance with the instruction described above. When the volume of the volume ID7 is the replication source as in the example taken in Step 305, the volume having the properties coincident with those of the volume of the volume ID7 is generated from the storage of the storage ID4, and that volume is registered to the volume information table (Step 306). [0054] (8) When the volume coincident with the volume of the replication source is found existing among the existing volumes after the processing of Step 306 or in the judgment of Step 304, the replication pair is generated for the storage of the replication source and the storage of the replication destination by use of the corresponding volume as the replication source, and the volume of the replication source and the volume of the replication destination set afresh are registered to the pair information table 230. The processing is then finished (Step 307). [0055] (9) When the storage capable of forming the pair is not found in the judgment of Step 301 or when the judgment result of Step 305 represents that the corresponding volume cannot be generate from the space area, the effect that the pair cannot be set with volumes of the replication destination indicated by the information 219 representing whether or not the volume can be set as the volume of the replication destination of the volume information table is indicated, and the processing is finished (Step 308). [0056] When the processing of Step 307 described above is the processing for the volume in which the value of Read/Write 216 of the properties of the volume is only Read, a subsequent replication operation does not exist once replication is made. Therefore, a report may be given to notify that setting of replication is released after replication is finished once. In the case of replication of the volume in which Read occupies the major proportion, replication does not occur so frequently. Therefore, this property may be notified to the user as the factor for making the asynchronous replication schedule. The change of the asynchronous schedule may be urged to the user depending on the policy of the volume and on the load of replication. [0057] Because the processing of Step 308 described above fails to provide the volume of the replication source, the report of the failure is made. In this case, a message may be outputted on the basis of the condition of the point of the occurrence of the failure. When Step 301 fails, for example, a message to the effect that �storage capable of generating volume of replication destination does not exist� may be additionally outputted. [0058] In the processing described above, the volume pair generation part 107 executes the processing of Steps 300 and 307, the volume generation part 106 executes the processing of Step 306 and the volume pair selection part 108 executes the processing of Steps 301 to 305 and 308. [0059] This embodiment executes the processing described above and can generate the replication by setting the volume of the replication destination in accordance with the policy of the volume of the replication source and its properties. [0060] When a request for generating a plurality of pairs exists in a series of processing described above, the processing explained with reference to FIG. 3 is executed either repeatedly or in parallel and setting of the pairs is executed so that all the designated pairs can be generated. When any error occurs during the generation process of the plurality of pairs and the processing of Step 308 is therefore executed, the pairs that have been set so far are omitted. [0061] The judgment steps from Steps 302 to 304 in the series of the process steps described above are the sequence for finding out the storage of the replication destination from the existing volumes that have already been generated. The process steps of Steps 305 and 306 are the sequence for generating afresh the volume of the replication destination. However, it is possible to change the process steps in such a fashion that the processing of Steps 305 and 306 is executed after Step 301, and then the processing proceeds to Step 302 when Step 305 has the condition in which volume cannot be generated and to Step 308 when Step 305 has the condition in which the volume cannot be selected. When the volume cannot be selected in the sequence of Steps 302 to 304 after Step 301, it is also possible to change the processing in such a fashion that the processing proceeds to Step 308 and is then finished. [0062] The processing described above may further be changed in such a fashion as to proceed to Step 305 after Step 301 and then to Step 308 when the volume cannot be generated, and to terminate the processing. Furthermore, the processing of Steps 302 to 304 and the processing of Steps 305 and 306 may be executed in parallel after Step 301, and the volume that can be set as the replication destination may be displayed on the screen of the managing computer for the submission to the user and to the application. [0063] When the volume of the replication source and the volume of the replication destination are generated as the replication pair in Step 307 in the processing described above, the connection distance between the storage to which the volume of the replication source belongs and the storage to which the volume of the replication destination belongs may be added as a condition in accordance with the policy of the volume of the replication source and its properties. For example, when the policy of the volume of the replication source is �volume for which most important data must be secured at the time of accident�, the volume having the greatest inter-storage distance is preferentially selected. Further, the site of the storage and its position of either one, or both, of the replication source and the replication destination may be used as a condition for generating the replication pair of the volumes of both replication source and destination. For example, when the policy of the volume of the replication source is �volume whose leak is inhibited by company rule or law�, the generation of the replication pair is permitted only in a specific country, a specific city, a specific company and a specific department. The policy of such a volume may be stored in and managed by the volume information table 210. [0064]FIG. 4 is a block diagram showing a construction of storage operation management system according to a second embodiment of the invention. When a plurality of connection methods for connecting storages exists in the volume replication operation between the storages, the second embodiment of the invention hereby explained executes replication in accordance with a condition of a route of a volume and its policy. [0065] In the construction of the first storage operation management system of the invention shown in FIG. 1, the second embodiment shown in FIG. 4 employs a construction in which a route management module 401 and a later-appearing route management module table group managed by the path management module are added to the managing computer 100 of the first embodiment, a cache 415, 425, 435 is further added to each of the plurality of storages 11 a, 11 b and 11 c, and switches A440 and B450 are disposed to mutually connect the storages 11 a, 11 b and 11 c, and data networks 460 to 464 are further added. Incidentally, though FIG. 4 shows only three storages 11 a, 11 b and 11 c, they are shown as the representatives of the storages 11 a, 11 b, . . . , 11 n shown in FIG. 1. The switches A440 and B450 and the data networks 461 and 463 for connecting these switches may use a public communication network. [0066] The route management module40l accomplishes the processing in the second embodiment of the invention. The processing is accomplished as software stored inside the storage device 104 of the managing computer 100 is read into the memory 101 and is executed by the CPU 102. The data route between the storages is accomplished through the switch A440, the switch B450 and the data networks 460 to 464. The data networks 460 to 464 are the cables in the same way as the network 130 shown in FIG. 1. The storage 11 a, for example, can be connected to the storage 11 b through the data network 460, the switch A440, the data network 461, the switch B450 and the data network 462. The storage 11 a can also be connected to the storage 11 b through another route extending from the data network 460, the switch A440, the data network 463, the switch B450 to the data network 462 as a different route. [0067]FIG. 5 is an explanatory view useful for explaining the table group that the route management module 401 manages. The route management module table group 500 managed by the route management module 401 includes a route information table 510 and a cache information table 520. [0068] The route information table 510 is a table for managing information of the route of the data network used for replicating the volume. This table 510 includes a route ID 511 as an identifier representing the replication route between the storages, an actual route 512 by cable information such as a cable name as the network for generating the route, a condition 513 representing the condition of the route 513, an associated storage 514 representing the storage connected to the route, an associated pair 515 for identifying a replication pair of the volumes using the route and a policy 516 representing the properties of the route. The managing computer 100 acquires the condition of the route from the switches A and B, the storages, etc, and manages this route information table 510. Incidentally, information of the security level of the route may be stored in and managed by the route information table 510, and the policy 516 may store a concrete maximum transfer speed, etc, of the route instead of the conditions �high speed� and �low speed�. [0069] In the explanation described above, the route 512 represents the route between the storages to which the replication pair is set or which have the possibility of setting. In the case of the example shown in the drawing, a route having the route ID 1 is represented as the route that connects the storage 11 a to the storage 11 b through the data network 460, the switch A440, the data network 461, the switch B450 and the data network 462. [0070] The condition 513 registers the condition as to whether or not each route operates normally. In this embodiment, the condition includes �normal� and �abnormal�, and the condition in which the line does not operate normally is registered as �abnormal�. When the load to the line becomes high and the line cannot satisfy the policy, the condition may also be changed to �abnormal�. In this case, it is preferred that the route information table manages the value of the network load at which the policy cannot be satisfied. [0071] When the values of the pair ID 231 of the pair information table 230 are the same, the value of the associated pair 515 presents the same volume replication pair. [0072] The cache information table 520 is a table for managing a cache use ratio prepared for speeding up replication, that is, information of use capacity/maximum capacity, for each storage and stores the storage ID 521 and information of the cache use ratio 522 of each storage. The caches in this instance correspond to the caches 415, 425 and 435. [0073]FIG. 6 is a flowchart useful for explaining the processing for generating the replication depending on the policy of the line for connecting the volumes when volume replication is made between the storages in the second embodiment of the invention. Next, this processing will be explained. The processing shown in this flowchart is the one that is contained in the volume management module 105 and in the route management module 401. [0074] (1) First of all, the volume management module 105 acquires the generation request of the volume pair to be replicated from the user and from the application together with the ID of the volume of the replication source (Step 600). [0075] At this time, the volume management module 105 may start processing Step 600 after the volume of the replication source is generated but before it receives the ID of the volume. In other words, when receiving the replication generation request, the volume management module 105 may generate the volume of the replication source and the volume of the replication destination in a series of processing and may set replication. Alternatively, the volume management module 105 may acquire the request that the replication is created by use of the volumes inside the storages or the volumes between the storages. [0076] (2) Next, the volume management module 105 retrieves information of the policy 223 of the volume of the replication source acquired in Step 600, and causes the route management module 401 to retrieve the policy of the line between the storage to which the volume of the replication source belongs and the volume that can be connected. Next, whether or not the line that can accomplish the policy of the volume of the replication source exists is judged. When the line having the policy capable of generating the volume of the replication destination exists, the flow proceeds to the processing of Step 602 and to Step 603 when such a line does not exist (Step 601). [0077] When the generation request of the volumes exists between the storages and the volume of the replication source has the policy �Connection is to be made through high-speed line in replication of volumes� in the processing of Step 601, for example, the storage ID to which the volume of the replication source belongs is entered into the associated storage 514 of the route information table 510 of the line retrieved, and the route having the line that can be used as the �high-speed� policy is retrieved. When the corresponding line exists, the processing proceeds to Step 602 and when the corresponding line does not exist, to the processing of Step 603. [0078] (3) When the corresponding line exists in the judgment of Step 601, the processing shifts to the processing of Step 301 and to the following Steps explained with reference to the flow of FIG. 3. In this case, the processing from Step 301 is executed for the associated storage acquired in Step 601 (Step 602). [0079] (4) When the corresponding line is not found in the judgment of Step 601, the volume of the replication destination cannot be provided, and the report is made to this effect. In this case, a message may be out-putted on the basis of the condition of the occurrence point of the error. For example, a message �Line capable of generating volume of replication destination does not exist� may be additionally outputted. [0080] When the processing described above is executed, the connectable line can be selected in accordance with the policy of the line and with the policy of the volume designated as the replication source. [0081]FIG. 7 is a flowchart useful for explaining the processing operation of fault shooting when any fault occurs in the replication route during the volume replication between the storages. Next, this operation will be explained. The route management module 401 executes this operation. However, the table of the table group 200 managed by the volume management module 105 is sometimes called out, and the volume management module 105 operates in this case. [0082] (1) It will be assumed that the fault occurs in a plurality of routes during the volume replication operation between the storages and this route fault is detected. For example, it will be assumed that setting of replication exists with the volume 113 a of the storage 11 a in FIG. 4 being the replication source and the volume 123 a of the storage 11 b being the replication destination. When the replication type 234 of the pair information table 230 is �synchronous� and the Write request is raised for the volume 114 a, or when the replication type 234 is �asynchronous� and the user or the application designates the start of replication, the controller of the storage start replication. When the controller of the storage or the switch A440 or B450 detects the fault of the route after the start of this replication, detection of the fault is notified to the managing computer 100 through the storage network communication equipment and the network, and the managing computer 100 receives the communication content (Step 700). [0083] The route fault includes the case where the fault is notified from the storage or the switch and the case where the managing computer 100 periodically asks the fault of the storage or the switch. When the condition of the route having the value 1 of the route ID 511 is �abnormal� as shown in the route information table 510, for example, the managing computer 100 receives the route fault in Step 700. [0084] (2) When the route fault is detected, whether or not another route should be searched for the volume 113 a of the replication source failing replication is judged depending on the policy 213 of the volume ID211 corresponding to the volume 113 a (Step 701). [0085] When the search of another route is judged as necessary, the flow proceeds to Step 702 and when not, to Step 706. When the volume is the one having high importance in the policy 213 of the volume, for example, replication must be made quickly and the flow may proceed at this time to Step 702. When the policy of the volume is not particularly important, the flow may proceed to Step 706. [0086] (3) When the judgment of Step 701 represents that another route must be searched, whether or not another route capable of reaching the same storage exists among the routes managed by the managing computer 100 is checked (Step 702). [0087] At this time, the managing computer 100 may give an instruction to search data capable of being actually connected through the switch or the storage. Alternatively, it is possible to register in advance the storage route and to utilize this information. In this case, it is only necessary to register the set of the storages for each route as another attribute to the route management table 510. When the route exists and is not registered to the route management table 510, the route ID 511, the route 512, the condition 513, the associated storage 514 and the service 516 are registered. When the route exists, the flow proceeds to Step 703 and when not, to Step 706. [0088] Incidentally, the policy 516 may be acquired from each switch, or the user or the application may set the policy 516. It will be assumed, for example, that the fault occurs in the route of the data network 461 in the route connecting the storage 11 a and the storage 11 b through the data network 460, the switch A440, the data network 461, the switch B450 and the data network 462 in the construction shown in FIG. 4, it is possible to set another route for connecting the storages 11 a and 11 b through the data network 460, the switch A440, the data network 463, the switch B450 and the data network 462. [0089] (4) When the route exists in Step 702, the policy of the volume of the replication destination and the policy of the route are compared on the basis of the policy of the network and whether or not the policies are coincident is judged. When they are coincident, the flow proceeds to Step 704 and when not, to Step 706 (Step 703). [0090] When the replication request of the volume of the replication destination is �high speed� and when the policy of the route is �low speed� in this case, for example, the requirement cannot be satisfied and the flow proceeds to Step 706. However, when there is the policy in which replication is more preferably continued even at the low line speed in accordance with the condition of fault, replication may be carried out by use of the low speed line. This request may be registered to the policy 213 of the volume information table, or the user or the application may give this request instruction as a part of the processing of Step 703. [0091] (5) When the policies are found coincident in the judgment of Step 703, setting of the normal route is requested for the switches and the storages, and the volumes mutually confirm that the replication processing is possible. When a plurality of routes exists, a judgment may be made to automatically select one route in accordance with the policy, or the user or the application may be allowed to judge by providing a plurality of results (Step 704). [0092] (6) Next, the managing computer gives the start instruction of replication to the storages by use of the route set in Step 704 (Step 705). [0093] (7) When the judgment result proves NO in the judgment of Steps 701, 702 and 703, whether or not the replication data should be permanently stored in the cache is judged in accordance with the policy of the volume. In other words, when the use ratio of the cache is high as in the storage of the storage ID3 of the cache information table, overall efficiency of the policy will drop when the replication data of the failed volume having low policy is permanently stored. Therefore, judgment is made that such a replicated data be omitted. When the judgment result represents that the replication data should be permanently stored, the flow proceeds to Step 708. When not, the flow proceeds to Step 707 (Step 706). [0094] (8) When the judgment result of Step 706 represents that the replication data should not be stored permanently in the cache, the managing computer 100 gives the instruction to the controller of the storage to omit the cache data of the volume to be omitted from the cache and to reduce the use ratio of the cache (Step 707). [0095] (9) When the judgment result represents that the replication data should be permanently stored in the cache after the processing of Step 707 or in Step 706, the route fault is reported and the processing is finished (Step 708). [0096] When a fault of replication occurs in the processing explained above, replication is sometimes made through a route different from the registered route. In this case, the processing capacity of the line of the route is sometimes affected depending on the other replication processing. Therefore, even when the policy of the route is �high speed�, the invention checks whether or not the policy can be kept if a processing of replication increases. When the policy can be kept, the invention can set so as to execute a replication processing in which the fault occurs as another route. [0097] As explained above, the second embodiment of the invention can judge whether or not replication should be made through another route when any fault occurs in a plurality of routes, or whether or not the content of the cache should be omitted depending on the policy of the volume, and can thus make efficient replication of the volumes. [0098]FIG. 8 is a flowchart useful for explaining the processing operation for generating the replication pair in another storage when another route cannot be secured or when replication cannot be conducted even when the replication data is permanently stored in the cache. Next, this processing will be explained. The processing shown in this flowchart is the one that is contained in the volume management module 105 and the route management module 401. The processing explained hereby generates separately the replication pair of the volumes in replication of the volumes for which fault recovery cannot be made. [0099] (1) In the pair after the fault occurs, whether or not fault recovery is impossible or a drastic delay occurs is judged. This judgment is made by setting a threshold value to the time from the occurrence of the volume fault to recovery of the fault of the route (Step 800). [0100] (2) Next, whether or not the replication may be generated by use of other storages is judged from the policy 214 of the volumes of the volume information table 210. When the judgment result represents that other storages are not utilized, such as when the policy inhibits replication to other storages, the processing is as such finished without doing anything at all (Step 801). [0101] (3) When the judgment result of Step 801 represents that setting of replication may well be set to other storages, the storages that can be registered as the volume replication route are searched, and whether or not such storages exist is judged (Step 802). [0102] When the policy relating to the distance is set in this judgment, judgment may be made to the effect that the policy is contradictory even when the route can be registered. The flow proceeds to Step 803 when the storages having the route exist. The processing is finished when the route does not exist. When the route is under the condition represented by the route information table 510 and the condition of the route 1 is �abnormal�, for example, the route 3 represents the route the condition of which is normal and which satisfies the policy. [0103] (4) When the judgment result in Step 802 represents that the storage capable of setting the route exists, the pair is generated. This pair generation processing is the one that executes the flow explained with reference to FIG. 3. The pair generation processing is executed in accordance with the instruction that the processing should be executed within the range of the storages obtained by the processing of Step 802 (Step 803). [0104] In the processing described above, the range management module 401 executes the processing of each Step 800, 801, 803 and the volume management module 105 executes the processing of Step 803. [0105] By executing the processing described above, this embodiment stops once the replication processing when the fault occurs but can change setting of the pairs registered at present depending on the policy of the volumes, and can continue replication itself irrelevantly to the restoration speed of the route fault. [0106] The processing of each embodiment of the invention described above can be constituted as a processing program. The processing program can be stored and provided in the form of storage media such as HD, DAT, FD, MO, DVD-ROM, CD-ROM, and so forth. [0107]FIG. 9 is a block diagram showing a construction of storage operation system according to a third embodiment of the invention. The third embodiment employs the construction in which the functions of the managing computer in the constructions of the first and second embodiments are disposed inside the storage. [0108] The third embodiment of the invention shown in FIG. 9 represents an example where a processing part for executing management is disposed inside the storage 11 a shown in FIG. 4, for example. The volume management module 105 and the route management module 401 existing in the storage device 104 of the managing computer 100 shown in FIG. 4 are disposed inside a storage device 900 of the storage 11 a. The volume management module 105 and the route management module 401 are accomplished as software stored in the storage device 900 of the storage 11 a is read and executed by the controller 112. A data synchronization module 901 is disposed so that mutual information is coincident while keeping data consistency with other storages. Data consistency is kept by use of the network communication equipment 111, etc. [0109] The third embodiment of the invention having the construction described above can eliminate the managing computer 100 utilized in the first and second embodiments. The third embodiment uses the data synchronization module 901 from a plurality of managing computers 100 when the managing computers 100 are provided to a large-scale storage operation management system. Therefore, when one managing computer cannot keep information, the third embodiment makes it possible to share the data of the plurality of managing computers. [0110] According to each embodiment of the invention described above, the volume pair management module 105 can generate a volume replication pair between or inside the storages in accordance with the policy of the volumes or properties, and can generate the volume replication pair on the basis of the policy of the volume. [0111] In the volume replication operation, the route management module 401 and the volume management module 105 can classify fault shooting in accordance with the policy of the volume and can make fault shooting of volume replication depending on the policy of the volume. [0112] As explained above, the invention can efficiently operate and manage replication of the data areas inside the same storage or between the storages in accordance with information of the data area of the storage. [0113] It should be further understood by those skilled in the art that although the foregoing description has been made on embodiments of the invention, the invention is not limited thereto and various changes and modifications may be made without departing from the spirit of the invention and the scope of the appended claims. Referenced byCiting PatentFiling datePublication dateApplicantTitleUS7035883Jul 1, 2004Apr 25, 2006Hitachi, Ltd.Storage control system and methodUS7162580Mar 30, 2004Jan 9, 2007Hitachi, Ltd.Remote copy control methodUS7191251Apr 13, 2004Mar 13, 2007Hitachi, Ltd.Storage control sub-system comprising virtual storage unitsUS7424586Dec 15, 2005Sep 9, 2008Hitachi, Ltd.Data processing method with restricted data arrangement, storage area management method, and data processing systemUS7430572Jan 10, 2006Sep 30, 2008Hitachi, Ltd.Storage control system and methodUS7512643 *Jul 18, 2006Mar 31, 2009Hitachi, Ltd.Computer system for managing backup of storage apparatus and backup method of the computer systemUS7617227Jan 18, 2007Nov 10, 2009Hitachi, Ltd.Storage control sub-system comprising virtual storage unitsUS7650529 *Jun 25, 2008Jan 19, 2010International Business Machines CorporationData replica selectorUS7702866Mar 31, 2006Apr 20, 2010International Business Machines CorporationUse of volume containers in replication and provisioning managementUS7801933Aug 20, 2008Sep 21, 2010Hitachi, Ltd.Storage control system and methodUS7831793Feb 26, 2007Nov 9, 2010Quantum CorporationData storage system including unique block pool manager and applications in tiered storageUS7908510 *Jan 14, 2008Mar 15, 2011Hitachi, Ltd.Storage system and method of designing disaster recovery constitutionUS8041682Aug 24, 2010Oct 18, 2011Hitachi, Ltd.Storage control system and methodUS8433686Jun 21, 2011Apr 30, 2013Hitachi, Ltd.Storage control system and methodUS8495315 *Sep 29, 2007Jul 23, 2013Symantec CorporationMethod and apparatus for supporting compound disposition for data imagesEP1826674A1Oct 3, 2005Aug 29, 2007Hitachi, Ltd.Remote copy system and remote copy methodEP2172842A1 *Apr 17, 2009Apr 7, 2010Hitachi Ltd.Management computer used to construct backup configuration of application dataEP2413241A2 *Apr 17, 2009Feb 1, 2012Hitachi Ltd.Management computer used to construct backup configuration of application data* Cited by examinerClassifications U.S. Classification1/1, 714/E11.078, 714/E11.103, 707/999.204International ClassificationG06F12/00, G06F11/20Cooperative ClassificationY10S707/99953, Y10S707/99952, Y10S707/99955, G06F11/2069, G06F11/2071, G06F11/2007, H04L45/00European ClassificationH04L45/00, G06F11/20S2M, G06F11/20S2P, G06F11/20C4Legal EventsDateCodeEventDescriptionAug 27, 2010FPAYFee paymentYear of fee payment: 4Oct 1, 2003ASAssignmentOwner name: HITACHI, LTD., JAPANFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ASANO, MASAYASU;SHIMOOKA, KENICHI;SHINOHARA, DAISUKE;REEL/FRAME:014540/0904Effective date: 20030808RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google