System and method to guarantee overwrite of expired data in a virtual tape server
Claim Score by NHIP
Abstract
A system and method for guaranteeing overwrite of expired data in a media device, the data being organized according to logical units provided on media devices organized as physical volumes. The method comprises the steps of: maintaining information associated with a status of a physical volume, and updating a physical volume's status information based upon a combination of that volume's prior status and that volume's current status; specifying a time duration that expired logical unit data may remain on a physical volume; based upon the volume's updated status information, determining whether a selected volume has expired data longer than the specified time duration; and, overwriting contents of the volume having data that has expired longer than the specified time duration.

Term
Term ended
Projected expiry passed 6 January 2023, 3.7 years ago.
- Priority and filed
- Published
- Projected expiry
- Today
29 claims: 3 independent, 26 dependent
- 1Broadest claimClaim Score 53, average(NHIP)A method for guaranteeing overwrite of expired data in a media device, said data organized in logical units provided on media devices organized as physical volumes, said method comprising:a) maintaining status information associated with each physical volume, and updating a physical volume's status information based upon a combination of that volume's prior status and that volume's current status;b) specifying a time duration that expired logical unit data may remain on a physical volume;c) based upon said volume's updated status information, determining whether a selected volume has expired data longer than said specified time duration;and, d) overwriting contents of said volume having data that has been expired longer than said specified time duration.
- 15A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for guaranteeing overwrite of expired data in a media device, said data organized in logical units provided on media devices organized as physical volumes, said method steps comprising:a) maintaining status information associated with each physical volume, and updating a physical volume's status information based upon a combination of that volume's prior status and that volume's current status;b) specifying a time duration that expired logical unit data may remain on a physical volume;c) based upon said volume's updated status information, determining whether a selected volume has expired data longer than said specified time duration;and, d) overwriting contents of said volume having data that has been expired longer than said specified time duration.
- 29A virtual tape storage system comprising tape media devices for storing customer data organized according to one or more logical units provided on said tape media devices, said tape media devices further organized as physical volumes, said system comprising:a) a host system interface for receiving customer instructions that specify a time duration that expired logical unit data for that customer may remain on a physical volume;b) a control device for maintaining status information associated with each physical volume, and updating a physical volume's status information based upon a combination of that volume's prior status and that volume's current status;c) means for determining whether a selected physical volume includes expired data longer than said specified time duration;and, d) means for overwriting contents of said volume having data that has been expired longer than said specified time duration, wherein overwriting of expired data in a tape media device is guaranteed.
Independent claims3
45 paragraphs in 4 sections, as filed
BACKGROUND OF THE INVENTION
[0001] 1. Field of the Invention
[0002] This invention relates generally to automated data storage systems, and particularly, to novel improvements in virtual tape server subsystems for ensuring that expired data is overwritten within a time interval set by a user.
[0003] 2. Discussion of the Prior Art
[0004] A virtual tape system is a special storage device that manages data so that it appears to be stored entirely on tape cartridges when portions of it may actually be located in faster, hard disk storage. The programming for a virtual tape system is sometimes called a virtual tape server (VTS). Virtual tape can be used with a hierarchical storage management (HSM) system in which data is moved as it falls through various usage thresholds to slower but less costly forms of storage media. Virtual tape may also be used as part of a storage area network (SAN) where less-frequently used or archived data can be managed by a single virtual tape server for a number of networked computers.
[0005]FIG. 1 illustrates is a block diagram illustrating the physical hardware components comprising the VTS <b>100</b>. As shown in FIG. 1, the VTS is installed in several frames: one or more frames <b>102</b> comprising physical tape drives <b>136</b> such as the IBM Magstar 3590 to which data are recalled to and copied from a tape volume cache <b>135</b>; a VTS frame <b>125</b> comprising key components of the VTS subsystem including an intelligent (VTS) controller <b>126</b> and its associated storage management software <b>128</b>, and, RAID disk arrays <b>105</b> which make up the Tape Volume Cache (TVC); and, a Library Manager <b>140</b> comprising a virtual and stacked volume inventory and implementing functions for the management of the physical library e.g., tracking the physical position and status-of the tape cartridges. The VTS is connected to a host computing system such as a mainframe or IBM S/390 host <b>99</b> by up to sixteen Enterprise Systems Connection (ESCON) channels <b>115</b>. The VTS may also be attached to a SCSI host by up to eight SCSI busses. This VTS can be dedicated to a SCSI host only or shared with a S/390 host. The tape drives are attached to the VTS controller and the Library Manager only and are dedicated to the function of the VTS. They are not visible to, and therefore cannot be used by, any external host system.
[0006] The VTS frame <b>125</b> preferably includes a RISC-based processor <b>126</b>, which provides ESCON as well as SCSI attachments, tape drive emulation to the host system and attachment to the TVC disks <b>135</b>. The processor in the VTS may be based upon an RS/6000 processor. The storage management software, which manages the TVC contents and stacked volumes, controls the movement of data between a disk (i.e., the TVC) and the tape cartridges, e.g., an IBM Magstar 3590, and automatically fills the tapes.
[0007] The Tape Volume Cache (TVC) <b>135</b> of the VTS subsystem is the key element that enables the utilization of the tape technology. Buffering host-created volumes and later stacking them on a tape cartridge makes it possible for the cartridge capacity of the technology to be fully utilized. The TVC is a disk buffer where the host emulated tape volumes are written before they are copied to the physical tape cartridges. The host operating system sees tape drives, but actually, the space is represented by storage space in RAID fault-tolerant Serial Storage Architecture (SSA) disk subsystems. All host interaction is through the VTS virtual control unit <b>126</b> which handles the migration of data between the disk cache and the tape media in an optimal space and time fashion; the host never writes directly to the tape drives inside the VTS.
[0008] With this approach, in addition to fulfilling the objective of making full use of high-capacity tape cartridges, there are additional benefits such as: the emulated volumes are accessed at disk speeds and tape commands such as space, locate, rewind and unload are mapped into disk commands that are completed in tens of milliseconds rather than the tens of seconds required for traditional tape commands; and, multiple, different, emulated volumes can be accessed in parallel because they physically reside in the TVC, i.e., a single virtual volume cannot be shared by different jobs or systems at the same time.
[0009]FIG. 2 illustrates the relationship between several virtual and real image of components which are shown to host systems differently. When using a VTS, the host application writes tape data to virtual drives <b>150</b>. The volumes written by the host are physically stored in the tape volume cache (e.g., a RAID disk buffer) and are called Virtual Volumes <b>160</b>. The storage management software <b>128</b> in the VTS controller <b>126</b> copies these virtual volumes in the TVC to the physical cartridges <b>175</b> owned by the VTS subsystem. Once a virtual volume is copied or migrated from the TVC to tape, it is called a Logical Volume <b>180</b>. As virtual volumes <b>160</b> are copied from the TVC to a Magstar cartridge (tape), they are “stacked” on the cartridge end to end, taking up only the space written by the host application. This arrangement maximizes utilization of a cartridge's storage capacity. The storage management software manages the location of the logical volumes on the physical cartridges, and the user has no control over the location of the data. When a logical volume <b>182</b> is moved from a physical cartridge to the TVC <b>135</b>, the process is called recall and the volume becomes a virtual volume <b>162</b> again. The host cannot distinguish between physical and virtual volumes, or physical and virtual drives and treats them as if they were “real” cartridges and drives because the host's view of the hardware is virtual. That is, all host interaction with tape data in a VTS subsystem is through virtual volumes and virtual tape drives.
[0010] The relationship between virtual and logical volumes is readily understood from FIG. 2. That is, in the virtual tape server (VTS) subsystem, a customer tape volume is virtualized in the disk cache. Any access to the virtual volume is through the image stored in the TVC. The virtual tape volume is identified by a volume serial number referred to as a “volser” (generally, a six character name). After a virtual volume is created and/or modified (one or more records are written to the volume) and closed, it is copied onto the physical tape (logical) volume <b>180</b>. The image of the virtual volume <b>160</b> copied to a physical volume <b>180</b> when it was closed is a complete version of the virtual volume at the point in time it was closed. If a virtual volume <b>160</b> is subsequently opened and modified, when it is closed, that image of the virtual volume is also copied onto physical tape, however it does not overwrite the prior version of the volume since it may have a different size then the previous version. So at any point in time, there may be several versions of the same volume serial number that reside on one or more physical tape volumes.
[0011] While the Library Manager in the VTS maintains a database to track which version of a virtual volume is the most current and its location on the physical volumes managed by the VTS, it is the case that during normal VTS operations, only the most current version of a virtual volume is accessible by a host system. It is an expressed concern that the old versions of the virtual volume's data, although not directly accessible by the host system attached to the VTS, could be accessed by a tape drive, compatible with the physical tape volumes used by the VTS, that is directly attached to a host system. In addition, the data associated with the most current version of a virtual volume could have been expired by the customer, but it still will exist on the physical tape volume and could be accessed.
[0012] Conventional methods implement the concept of “expiring” data, which entails returning the virtual volume to a “scratch” status which is required as a result of modifying the data associated with a virtual volume in the VTS which creates a new image of the volume. This additionally requires that the old version(s) of the volume must be handled to guarantee that they cannot be recovered.
[0013] It would be highly desirable to provide a system and method that guarantees that old or expired versions of a virtual volume cannot be accessed, after a given period of time, through any reasonable means including reading the tape on a tape device directly attached to a host.
[0014] It would be highly desirable to provide a function executable in a virtual tape server that guarantees that virtual volume data that has been expired by the customer in the VTS cannot be recovered by any reasonable means after a certain time interval.
SUMMARY OF THE INVENTION
[0015] It is an object of the present invention to provide a system and method that guarantees that old or expired versions of a virtual volume cannot be accessed, after a given period of time, through any reasonable means including reading the tape on a tape device directly attached to a host.
[0016] It is another object of the present invention to provide a function executable in a virtual tape server that guarantees that virtual volume data that has been expired by the customer in the VTS cannot be recovered by any reasonable means after a certain time interval.
[0017] According to the invention, reasonable means includes taking a physical volume from a VTS and reading its data on a standalone tape device.
[0018] It is another object of the present invention to provide a function executable in a virtual tape server that guarantees that virtual volume data that has been expired by the customer in the VTS cannot be recovered by any reasonable means after a certain time interval specified by the customer.
[0019] In accordance with a preferred embodiment of the invention, there is provided a system and method for guaranteeing overwrite of expired data in a media device, the data being organized according to logical units provided on media devices organized as physical volumes. The method comprises the steps of: maintaining information associated with a status of a physical volume, and updating a physical volume's status information based upon a combination of that volume's prior status and that volume's current status; specifying a time duration that expired logical unit data may remain on a physical volume; based upon the volume's updated status information, determining whether a selected volume has expired data longer than the specified time duration; and, overwriting contents of the volume having data that has been expired longer than the specified time duration.
[0020] Advantageously, such a system and method of the invention is implemented in a VTS tape storage system interfaced with a host computer. According to one aspect of the invention, the host may be used to set the time duration. Preferably, the time duration is specified by the customer through a computer console associated with the library manager component.
BRIEF DESCRIPTION OF THE DRAWINGS
[0021] Further features, aspects and advantages of the apparatus and methods of the present invention will become better understood with regard to the following description, appended claims, and the accompanying drawings where:
[0022]FIG. 1 illustrates is a block diagram illustrating the physical hardware components comprising the VTS <b>100</b> according to the prior art.
[0023]FIG. 2 illustrates the relationship between several virtual and real image of components according to the prior art.
[0024]FIG. 3(<i>a</i>) illustrates a pool set-up table <b>20</b> comprising data for the VTS system indicating how the physical volumes may be organized, according to the invention.
[0025]FIG. 3(<i>b</i>) illustrates a physical volume table <b>40</b> implemented by the VTS system which lists each of the physical volumes <b>45</b> in the VTS system and includes one or more volume parameters assigned to each physical volume, according to the invention.
[0026]FIG. 4(<i>a</i>) depicts a first portion <b>200</b> of the novel function that periodically ascertains the status of all physical volumes managed by the VTS and updates the volume parameters for every physical volume.
[0027]FIG. 4(<i>b</i>) depicts a second portion <b>250</b> of the novel function that periodically determines which of the physical volumes managed by the VTS comprise data that has been expired for a time duration longer than the user-specified time.
[0028]FIG. 4(<i>c</i>) depicts a third portion <b>275</b> of the novel function that periodically determines whether there are any physical volumes managed by the VTS that includes data that needs to be overwritten.
[0029]FIG. 5 is a matrix <b>300</b> depicting the various possibilities of prior and current statuses for a physical volume.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0030] The requirement that the old version(s) of the VTS volume must be handled to guarantee that they cannot be recovered is met by overwriting a physical volume that contains invalidated virtual volume data within a time interval specified by the customer.
[0031] Thus, there is introduced a function, implemented by the VTS, and particularly, the storage management software component of the VTS, for enabling data associated with a virtual (logic) volume to be invalidated.
[0032] In the context of the invention, there is defined an aggregation or group of physical volumes in a VTS that comprise a “pool”, with each physical volume including one or more logical (virtual) volumes. Pooling concepts are well known in the industry with IBM's Tivoli Storage Manager being an exemplary system implementing such volume pool concepts. FIG. 3(<i>a</i>) illustrates a pool set-up table <b>20</b> comprising data for the VTS system indicating how the physical volumes may be organized. As shown in FIG. 3(<i>a</i>), each of the physical volumes managed by the VTS system is assigned to a pool, with the table <b>20</b> indicating 32 pools, for example. It is understood that each pool <b>25</b> of physical volumes is assigned a name and may have one or more parameters <b>30</b> associated therewith. For example, typical parameters associated with a pool include, but are not limited to: a media type (e.g., physical volumes having 10 Gbyte tape or 20 Gbyte tape); a rule(s) for managing volumes in a pool. One rule may involve the concept of “reclamation” whereby the VTS tracks what percentage of data associated in a particular physical volume is still valid. That is, over time, data space occupied by a logical volume needs to be reclaimed from a physical volume when it is no longer used or needed by the host, i.e., has expired. Thus, in the pooling table, a reclamation threshold parameter may be set to indicate what percentage of data on the volume is still active. Thus, if any volume(s) in the pool falls below that reclaim percent threshold, then a reclamation process will be performed to take the valid logical volume(s) off of the physical volume and put it on another physical volume—potentially combining multiple partially full physical volumes and filling up the other. The percentage at which a volume is reclaimed is another useful parameter defining the pool.
[0033] A change in the volumes state (e.g., a private to a “scratch” category) indicates when data is not useful anymore. For purposes of the invention, as shown in FIG. 3(<i>a</i>), an additional parameter, security_erasure_duration (SED) <b>35</b> is defined for a storage pool in the VTS that specifies the number of days expired virtual volume data can remain on a physical volume until it must be overwritten. Valid values for this parameter may include zero (0) days or anywhere from 7 to 90 days, for example. A value of 0 indicates that there is no erasure requirement for the pool. Thus, for a given pool, it is desired to assure that after a certain time interval, expired data on a physical volume is no longer accessible through any normal means, e.g., by overwriting. The SED parameter <b>35</b> is a user-defined parameter associated with a pool indicating that the user does not want any expired data on a physical volume that is older than a certain time interval, for example, thirty (30) days old.
[0034] As shown in FIG. 3(<i>b</i>), there is illustrated a Physical Volume table <b>40</b> implemented by the VTS system which lists each of the physical volumes <b>45</b> in the system and includes one or more volume parameters <b>45</b> assigned to each physical volume and utilized by the VTS system functions. Four parameters, in particular, relevant to the status tracking information maintained for each physical volume include: a Started_Filling_Date (SFD) parameter <b>55</b> that records the date and time value that the physical volume transitions from a “scratch” status to a “filling” status; a First_Invalidation_Date (FID) parameter <b>60</b> that records the date and time value when the the physical volume transitions from scratch, filling or 100% fall to not 100% full; an Expired_Duration_Limit (EDL) parameter <b>65</b> which holds the user-defined security_erasure_duration value <b>35</b> defined for the pool the physical volume was in when it last had data written on it; and, a Prior_Status parameter <b>70</b> which is assigned a value indicating whether the volume's prior status was scratch, filling, 100% full or not 100% full; and a pool parameter <b>75</b> indicating the pool for which the physical volume is assigned.
[0035] The algorithm for ensuring expired data overwrite for physical volumes performed by the VTS is now described with respect to FIGS. <b>4</b>(<i>a</i>)-<b>4</b>(<i>c</i>). The first portion of the algorithm, depicted in FIG. 4(<i>a</i>), is to implement a function <b>200</b> that periodically ascertains the status of all physical volumes managed by the VTS and updates the volume parameters for every physical volume (volume parameters <b>50</b> in FIG. 3(<i>b</i>)). For purposes of discussion, it is assumed that this function <b>200</b> is executed by the VTS on an hourly basis, however it is understood that it may be executed on any periodic basis, e.g., hourly, half-hourly, etc. or any other granularity as appropriate. As shown in FIG. 4(<i>a</i>), the first step <b>202</b> of the function is to select a first physical volume to be processed, e.g., for each pool. Then, at step <b>205</b>, there is performed the step of obtaining the pool number associated with the physical volume and, ascertaining the prior status of the volume, as determined at the time of the previous iteration of this portion of the algorithm, from the physical volume pool table, and, to dynamically ascertain that volume's current status as maintained by the VTS.
[0036]FIG. 5 depicts a status matrix <b>300</b> setting forth the types of prior and current statuses for a physical volume. The statuses maintained for a physical volume include: a scratch status (meaning no valid data on the volume), a filling status (meaning that physical volume is now being filling with valid data), a 100% full status (meaning that the physical volume is full of valid data), and, a less than 100% full status, i.e., <100% full (meaning that physical volume has a logical volume, for instance, that is no longer valid).
[0037] According to the preferred embodiment, the function implemented by the VTS for guaranteeing data overwrite according to user-defined times, is applicable when the host computer has expired or communicated to the VTS that the data associated with a logical volume is no longer valid. How data is invalidated is not critical to the invention, however, typically, the VTS will invalidate data associated with a logical volume in the following scenarios including, but not limited to: 1) when a host computer has assigned the virtual volume to a scratch category. The volume is subsequently selected for a scratch mount and data is written to the volume. The older version of the volume is now invalid; 2) when a host has assigned the virtual volume to a scratch category that has a fast-ready attribute set, the category has a non-zero delete expired data parameter value and that parameter value has been exceeded and the VTS has deleted the virtual volume. All versions of the volume are now invalid; and 3) when a host has modified the contents of the volume. This could include a complete re-write of the volume or additional data appended to it. The older version of the volume is now invalid.
[0038] As the customer may not want all of the data written to a VTS to be a candidate for this function, the function may be built on top of the volume pooling function of the VTS. Thus, a customer may control what data is applicable to the erasure requirement.
[0039] Returning to FIG. 4(<i>a</i>), key to the function is the updating of the various status tracking parameters for the physical volume which is indicated at step <b>210</b>. As shown in FIG. 4(<i>a</i>), at step <b>210</b>, the parameters to be updated include the SFD, FID and EDL described herein. According to the preferred embodiment, as shown in the status matrix <b>300</b> of FIG. 5, the updating of a volume's status is based upon the combination of that volume's prior status, as indicated by a row <b>302</b>-<b>308</b>, and that volume's current status as indicated by the columns <b>312</b>-<b>318</b>. As indicated at step <b>210</b>, based on the combination of prior versus current status, the SFD, FID and EDL parameters are updated. For instance, in view of FIG. 5, if a volume's prior status was scratch <b>302</b> and that volume is ascertained as filling with data <b>314</b> in a current iteration, then the following updates are performed as indicated in the matrix box <b>320</b>: the SFD volume parameter will be set equal to the current date/time (i.e., date/time of that current iteration), and a check is made as to whether the EDL value is set to zero (0) and, if so, the EDL parameter will be set to the pool's SED value. Returning to FIG. 4(<i>a</i>), at step <b>212</b>, after updating the volume parameters, that volume's prior status is set equal to the current status. Then, at step <b>215</b> a determination is made as to whether all physical volumes have been checked in this current iteration. If not, then at step <b>220</b>, the next volume to be checked is selected and the process returns to step <b>205</b>. Otherwise, at step <b>215</b>, the process idles until performing the next status check interval for the volumes in the next periodic interval, e.g., the next hour.
[0040] The next portion of the algorithm, depicted in FIG. 4(<i>b</i>), is to implement a function <b>250</b> that periodically determines which of the physical volumes managed by the VTS comprise data that has been expired for a time duration longer than the user-specified time. For purposes of discussion, it is assumed that this function <b>250</b> is executed by the VTS on a daily basis, however it is understood that it may be executed on any periodic basis, e.g., every 12 hours, etc. or any other granularity as appropriate. As shown in FIG. 4(<i>b</i>), the first step <b>252</b> of the function is to select a first physical volume to be processed, e.g., for each pool. Then, at step <b>255</b>, there is performed the step of determining whether the EDL parameter value is zero which indicates that this volume has no expired data or no expiration limit. If it is determined that the expired duration limit is zero (0), then the process proceeds to step <b>272</b> where a determination is made as to whether all physical volumes have been checked in this current iteration. If all physical volumes have not been checked, then at step <b>273</b>, the next volume to be checked is selected and the process returns to step <b>255</b>. Otherwise, at step <b>272</b>, the process idles until performing this function <b>250</b> for the volumes in the next periodic interval, e.g., the next day. Returning to step <b>255</b>, if it is determined that the EDL parameter value is not equal to zero, this indicates that this volume has an expiration limit set, then the process proceeds to step <b>258</b> to determine whether the FID parameter is equal to zero (0).
[0041] If the FID value is non-zero, then this means an invalidation cycle has occurred, i.e. this volume has invalid data. Then, at step <b>260</b>, a determination is made as to whether the duration for that invalid data has exceeded the user-defined threshold. Thus, at step <b>260</b>, a determination is made as to whether the current date/time value is equal to or greater then the FID value plus the EDL value. In one example scenario, an EDL parameter value would be set as part of the action taken when a volume's status changes from scratch to filling for example, as shown in the action taken in matrix box <b>320</b>, FIG. 5. If the current date/time value is equal to or greater then the FID value plus the EDL value, then residual expired data on the volume has not been overwritten by the time limit. The residual data on the volume must then be over written. Thus, as indicated at step <b>268</b>, that volume is added to a list of volumes to overwrite. Otherwise, at step <b>260</b>, if the current date/time value is not equal to or greater then the FID value plus the EDL value, then the process returns to step <b>272</b> to determine the next volume to be checked.
[0042] Returning to step <b>258</b>, FIG. 4(<i>b</i>), if it is determined that the FID parameter value is equal to zero (0), there still exists the possibility of expired data even though this has not yet been detected in the hourly processing (FIG. 4(<i>a</i>)). Thus, the process proceeds to step <b>262</b> to determine whether the volume's prior status is scratch or filling which is directed to the example case when data is starting to be written to a volume and that volume never gets filled, i.e., the probability exists that some data on that volume has been expired even though the trigger, to set the FID, is set only when the volume goes from 100% full to less than 100% full. If the volume never fills up with data, this trigger will never be set. Thus, if that volume's prior status does not equal scratch or filling, then this maybe a full volume (100% full) with no expired data, and the process proceeds to step <b>272</b> to determine the next volume to be checked. If, at step <b>262</b>, it is determined that the volume's prior status is scratch or filling, then it is not determinable whether data on that volume has expired. Thus, the process proceeds to step <b>265</b> to determine whether the current date/time value is equal to or greater then the SFD parameter value plus the EDL parameter value. If the current date/time value is equal to or greater then the SFD parameter value plus the EDL parameter value, then residual expired data could exist on that volume that has not been overwritten by the time limit and the volume is added to a list of volumes to overwrite at step <b>268</b>. As mentioned, this covers the case where a new or volume that has been subject to a Data Security Erase (DSE) begins filling but never gets to 100% full within the EDL time limit for the pool. Otherwise, at step <b>265</b>, if the current date/time value is not equal to or greater then the SFD parameter value plus the EDL parameter value, then the process returns to step <b>272</b> to determine the next volume to be checked.
[0043] The next portion of the algorithm, depicted in FIG. 4(<i>c</i>), is to implement a function <b>275</b> that periodically determines whether there are any physical volumes managed by the VTS that includes data that needs to be overwritten, i.e., data that has been expired for a time duration longer than the user-specified time. For purposes of discussion, it is assumed that this function <b>275</b> is executed by the VTS on an hourly basis, however it is understood that it may be executed on any periodic basis, e.g., every half-hour, etc. or any other granularity as appropriate. As shown in FIG. 4(<i>c</i>), at step <b>280</b>, a determination is made as to whether there are any volumes on the overwrite list, i.e., the list prepared at FIG. 4(<i>b</i>), step <b>268</b>. If there are no volumes on the overwrite list the process remains idle until the next start period. At such a time, as depicted at step <b>282</b>, a volume is selected from the list, and at step <b>285</b>, a determination is made as to whether the current status of that physical volume is equal to scratch status (no active data). If the current status is not equal to scratch status, then that volume includes valid data which is first reclaimed then returned to scratch status at step <b>288</b>. As understood to skilled artisans, reclamation includes transferring any valid logical volume data from a first physical volume to another physical volume prior to rendering that first physical volume to scratch status. If, at step <b>285</b>, the current status is equal to scratch status, then the process proceeds directly to step <b>290</b>. Whether the current volume's status is already scratch or is returned to scratch status after reclamation, a random data pattern may be written over the entire volume at step <b>290</b>.
[0044] Particularly, as depicted in FIG. 4(<i>c</i>) at step <b>290</b>, a physical drive managed by the VTS is acquired and the volume is mounted on the drive and a Data Security Erase (DSE) command is then issued to the drive. The DSE command will completely overwrite the physical volume with random data to ensure that the expired data is unrecoverable. As an alternative to random data, it should be understood that other types of data may be written during this step, e.g., fixed, nulls, etc. It should be further understood that alternative overwrite methods may be employed at this step. For example, in older systems, the physical tape may be magnetically degaussed. When the DSE command has successfully completed, i.e., after volume overwrite, the process proceeds to step <b>292</b> where that volume's SFD, FID and EDL values are reset to zero (0) value. At a final step <b>295</b>, the volume is removed from the overwrite list and the process returns to step <b>280</b> to check the overwrite list for the next volume.
[0045] While the invention has been particularly shown and described with respect to illustrative and preformed embodiments thereof, it will be understood by those skilled in the art that the foregoing and other changes in form and details may be made therein without departing from the spirit and scope of the invention which should be limited only by the scope of the appended claims. For example, event though it has been described that the status of all physical volumes and updating of the volume parameters occurs periodically, it is understood that these functions may be performed on an event driven basis.
Contents4
7 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US8661195B2 | Cited by | United States of America | Applicant |
| US2007186038A1 | Cited by | United States of America | Pre-grant |
| US2004044701A1 | Cited by | United States of America | Pre-grant |
| US9141303B2 | Cited by | United States of America | Search report |
| US8332599B2 | Cited by | United States of America | Applicant |
| US7487288B2 | Cited by | United States of America | Applicant |
| US2010174865A1 | Cited by | United States of America | Pre-grant |
| US2010274986A1 | Cited by | United States of America | Pre-grant |
| US10983696B1 | Cited by | United States of America | Search report |
| US8738588B2 | Cited by | United States of America | Search report |
| US2006120235A1 | Cited by | United States of America | Pre-grant |
| US2009119465A1 | Cited by | United States of America | Pre-grant |
| US7197518B2 | Cited by | United States of America | Search report |
| US2009049311A1 | Cited by | United States of America | Pre-grant |
| US9519433B2 | Cited by | United States of America | Applicant |
| US2007055716A1 | Cited by | United States of America | Pre-grant |
| US2006294336A1 | Cited by | United States of America | Pre-grant |
| US10417100B2 | Cited by | United States of America | Applicant |
| US2008263294A1 | Cited by | United States of America | Pre-grant |
| US8006050B2 | Cited by | United States of America | Search report |
| US9542109B2 | Cited by | United States of America | Applicant |
| US7743206B2 | Cited by | United States of America | Applicant |
| US2017139785A1 | Cited by | United States of America | Pre-grant |
| US7765369B1 | Cited by | United States of America | Applicant |
| US2005033755A1 | Cited by | United States of America | Pre-grant |
| US9933959B2 | Cited by | United States of America | Applicant |
| US2008243860A1 | Cited by | United States of America | Pre-grant |
| US2013185500A1 | Cited by | United States of America | Pre-grant |
| US8001340B2 | Cited by | United States of America | Search report |
| US8935469B2 | Cited by | United States of America | Search report |
| US9213496B2 | Cited by | United States of America | Applicant |
| US2008263293A1 | Cited by | United States of America | Pre-grant |
| US2006200357A1 | Cited by | United States of America | Pre-grant |
| US2011225357A1 | Cited by | United States of America | Pre-grant |
| US2008091744A1 | Cited by | United States of America | Pre-grant |
| US7152080B2 | Cited by | United States of America | Applicant |
| US9098717B2 | Cited by | United States of America | Search report |
| JP2008269611A | Cited by | Japan | Examiner |
| US9557928B2 | Cited by | United States of America | Applicant |
| US7562201B2 | Cited by | United States of America | Search report |
| US9588705B2 | Cited by | United States of America | Applicant |
| US10379988B2 | Cited by | United States of America | Applicant |
| WO2006062511A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US7103731B2 | Cited by | United States of America | Search report |
| US2009049310A1 | Cited by | United States of America | Pre-grant |
| US8301834B2 | Cited by | United States of America | Applicant |
| US2008263271A1 | Cited by | United States of America | Pre-grant |
| US2012179868A1 | Cited by | United States of America | Pre-grant |
| US9384777B2 | Cited by | United States of America | Applicant |
| US9886355B2 | Cited by | United States of America | Applicant |
| US2004044854A1 | Cited by | United States of America | Pre-grant |
| US2005076070A1 | Cited by | United States of America | Pre-grant |
| US9299385B2 | Cited by | United States of America | Applicant |
| US2008077758A1 | Cited by | United States of America | Pre-grant |
| US7596586B2 | Cited by | United States of America | Search report |
| US2011225356A1 | Cited by | United States of America | Pre-grant |
| US7739462B2 | Cited by | United States of America | Search report |
| US9104629B2 | Cited by | United States of America | Applicant |
| US2008263274A1 | Cited by | United States of America | Pre-grant |
| US2009172319A1 | Cited by | United States of America | Pre-grant |
| US2018060189A1 | Cited by | United States of America | Search report |
| US8930617B2 | Cited by | United States of America | Search report |
| US9858158B2 | Cited by | United States of America | Search report |
| US6289425B1 | Cites | United States of America | Pre-grant |
| US6405284B1 | Cites | United States of America | Pre-grant |
| US6513101B1 | Cites | United States of America | Pre-grant |
| US6658526B2 | Cites | United States of America | Pre-grant |
2 members in 1 office
Priority claims2
| Document | Office | Kind | Date |
|---|---|---|---|
| 12091102 | United States of America | A | |
| US20020120911 | – | – | – |
Members2
| Document | Office | Kind | |
|---|---|---|---|
| US2003196036A1 | United States of America | A1 | |
| US6983351B2 | United States of America | B2 |
44 transactions on the USPTO file
Allowed after 2 non-final rejections, 1 final rejection and 1 RCE.
- Non-final rejections
- 2
- Final rejections
- 1
- RCEs
- 1
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | |
|---|---|
| Recordation of Patent Grant Mailed | |
| Patent Issue Date Used in PTA CalculationAllowed | |
| Issue Notification MailedAllowed | |
| Receipt into Pubs | |
| Dispatch to FDC | |
| Application Is Considered Ready for Issue | |
| Correspondence Address Change | |
| Receipt into Pubs | |
| Printer Rush- No mailing | |
| Pubs Case Remand to TC | |
| Issue Fee Payment Verified | |
| Issue Fee Payment Received | |
| Workflow - File Sent to Contractor | |
| Mail Notice of AllowanceAllowed | |
| Notice of Allowance Data Verification CompletedAllowed | |
| Date Forwarded to Examiner | |
| Response after Non-Final Action | |
| Correspondence Address Change | |
| Mail Non-Final RejectionNon-final rejection | |
| Non-Final RejectionNon-final rejection | |
| IFW TSS Processing by Tech Center Complete | |
| Date Forwarded to Examiner | |
| Disposal for a RCE / CPA / R129 | |
| Request for Continued Examination (RCE) | |
| Mail Advisory Action (PTOL - 303) | |
| Advisory Action (PTOL-303) | |
| Date Forwarded to Examiner | |
| Response after Final Action | |
| Workflow incoming amendment IFW | |
| Mail Final Rejection (PTOL - 326)Final rejection | |
| Final RejectionFinal rejection | |
| Date Forwarded to Examiner | |
| Response after Non-Final Action | |
| Workflow incoming amendment IFW | |
| Mail Non-Final RejectionNon-final rejection | |
| Non-Final RejectionNon-final rejection | |
| Case Docketed to Examiner in GAU | |
| Case Docketed to Examiner in GAU | |
| Case Docketed to Examiner in GAU | |
| New or Additional Drawing Filed | |
| Application Dispatched from OIPE | |
| Application Is Now Complete | |
| IFW Scan & PACR Auto Security Review | |
| Initial Exam Team nn |
8 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Fee paymentFPAY | FPAY | |
| Fee paymentFPAY | FPAY | |
| Surcharge for late paymentSULP | SULP | |
| Maintenance fee reminder mailedREMI | REMI | |
| Fee paymentFPAY | FPAY | |
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF | |
| Fee payment procedurePAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP | |
| AssignmentAS | AS |
Numbers
- Publication, DOCDB
- 2003196036
- Publication, EPODOC
- US2003196036
- Application
- 10120911
- Application, DOCDB
- 12091102
- Application, EPODOC
- US20020120911
Titles
- English
- System and method to guarantee overwrite of expired data in a virtual tape server
Patent term adjustment
- A delay
- +270 daysthe office missed an examination deadline
- Net adjustment
- 270 days
Classification
- CPC, 5
- G06F3/0601
- G06F3/0665
- G06F3/0682
- G06F3/0644
- G06F3/0617
- IPC, 2
- G06F3 06
- G06F12 00
- USPC, 2
- 711111000
- 711159000