Veritas Technologies LLC v. Veeam Software Corporation

835 F.3d 1406, 120 U.S.P.Q. 2d (BNA) 1046, 2016 U.S. App. LEXIS 15978, 2016 WL 4525278
CourtCourt of Appeals for the Federal Circuit
DecidedAugust 30, 2016
Docket2015-1894
StatusPublished
Cited by14 cases

This text of 835 F.3d 1406 (Veritas Technologies LLC v. Veeam Software Corporation) is published on Counsel Stack Legal Research, covering Court of Appeals for the Federal Circuit primary law. Counsel Stack provides free access to over 12 million legal documents including statutes, case law, regulations, and constitutions.

Bluebook
Veritas Technologies LLC v. Veeam Software Corporation, 835 F.3d 1406, 120 U.S.P.Q. 2d (BNA) 1046, 2016 U.S. App. LEXIS 15978, 2016 WL 4525278 (Fed. Cir. 2016).

Opinion

TARANTO, Circuit Judge.

At issue here is U.S. Patent No. 7,024,-527, a computer patent owned by Veritas Technologies LLC. The patent describes and claims systems and methods through which, while certain processes for restoring computer data are in progress, particular data sought by an active application may be given priority for restoration and *1408 made immediately accessible to the application. In October 2013, Veeam Software Corp. filed a petition asking the Patent Trial and Appeal Board to institute an inter partes review of claims 1, 6, 8, 20, and 24 of the ’527 patent, which Veeam asserted were unpatentable over prior art. The Board instituted the review in April 2014. After institution, the patent owner (Symantec Corp. at that time, but we will refer throughout to Veritas) filed a conditional motion to amend, seeking to add new claims 26 and 27 if the Board ultimately concluded that the challenged existing claims are unpatentable.

In its April 2015 final decision, the Board resolved the parties’ claim-construction dispute at the heart of the proceeding. The Board concluded, contrary to Veritas’s contention, that the claims were not limited to file-level background restoration processes, but could reasonably be read as also covering block-level restoration processes: the background restorer could proceed with restoration without identifying files, just by restoring blocks of data, which often will end up restoring whole files. Based on that construction, the Board rejected all of the challenged claims for obviousness, under 35 U.S.C. § 103. Veeam Software Corp. v. Symantec Corp., No. IPR2014-90, 2015 WL 1906723, at *6-7, *8-14 (PTAB Apr. 23, 2015). The Board also denied Veritas’s motion to amend, though without making an evidentiary determination of patentability of the proposed claims 26 and 27. It concluded only that Veritas (and its expert declarant) had failed to address something the Board said must be addressed, namely, whether each newly added feature in each proposed claim, as distinct from the claimed combination of features, was independently known in the prior art. Id. at *14-15.

We affirm the Board’s construction as the broadest reasonable interpretation of the claims and therefore uphold its obviousness determination. We vacate the Board’s denial of Veritas’s motion to amend because the Board was arbitrary and capricious in its sole ground for denying the motion. We remand for the Board to consider the patentability of the proposed claims, which, Veritas asserts, have the narrower claim scope (limited to file-level background restoration) that Veritas unsuccessfully urged for the original claims.

BACKGROUND

In a brief “technology background” discussion that the parties accept, the Board described a distinction at the center of the dispute here. “A data storage device (e.g., a hard disk) is divided into small storage containers called blocks.” Veeam at *2. “A file is essentially a named collection of blocks, those blocks containing all of the data of the file,” with “[a] file system keep[ing] track of which blocks have been allocated to which files.” Id. A program may access data in two ways of relevance here. In one, “file-level access,” a program “requests a file,” in which case “the file system” — “acting as a translator between the logical file name and the physical collection of blocks” — “looks up which blocks hold the data of the file and sends the requestor the data in those blocks.” Id. In the other, “block-level access,” a program that “already knows which block has the data it needs” may “ask for the data in that block, without consulting the file system.” Id.

The ’527 patent, entitled “Data Restore Mechanism,” in describing the prior art, refers to both block-level-access and file-level-access methods for backing up and restoring data. ’527 patent, col. 1, lines 41-51. The patent identifies a problem with existing systems:

*1409 Typically, during restores, an application will have to wait for a file to be fully restored before accessing the file. Since a restore operation may restore files in any order, an application may have to wait a considerable amount of time for a particular file to be fully restored. Large databases may include hundreds of gigabytes or even terabytes of data; restores of these databases may take hours or even days before the data reaches a stable state. In many cases, applications may have to wait until all of the data is restored before they can access any of the data.

Id., col. 1, line 66, through col. 2, line 8; see id., col. 3, lines 57-60. The patent then identifies the goal of the invention:

Therefore, it is desirable to provide a restore mechanism that has reduced impact on production applications. It is also desirable to restore data needed from disk-based disaster recovery backups in a near instantaneous manner from the production application’s perspective. It is also desirable to allow [the] application to be active and accessing data being restored while the restore is in progress transparent to the applications.

Id., col. 2, lines 9-16; see id., col. 3, lines 55-57.

The specification describes a system and method “for performing restores from backups while applications are active and accessing the data being restored,” i.e., for allowing an active application to request that specific data be restored first and to access that restored data while the background restore is still running. Id., col. 2, lines 20-22; id., Abstract. According to the summary of the invention, “a map correlating destination locations on primary storage to source locations on .backup storage for a set of files to be restored may be generated,” and “[a] restore of the set of files from the backup storage to the primary storage may be started.” Id., col. 2, lines 34-38. That background restore is performed by “a restore application.” Id., col. 6, lines 47-49; id., fig. 2. While the background restore is underway, an actively running application may request “one or more blocks of data of a file in the set of files,” and “[t]he map may be accessed to determine if the blocks have been restored.” Id., col. 2, lines 38-41. If not, the restore application is told to restore the needed block immediately, id., col. 2, lines 40-43; id., col. 8, lines 61-64, and once restored, the “blocks of data are accessible by the application while the restore is in progress,” id., col. 2, lines 43-45.

Claim 20 is illustrative. It reads as follows:

20. A computer-accessible medium comprising program instructions, wherein the program instructions are configured to implement:

a restore application starting a restore of a set of files from a backup storage to a primary storage;
during said restore:

Free access — add to your briefcase to read the full text and ask questions with AI

Related

Cite This Page — Counsel Stack

Bluebook (online)
835 F.3d 1406, 120 U.S.P.Q. 2d (BNA) 1046, 2016 U.S. App. LEXIS 15978, 2016 WL 4525278, Counsel Stack Legal Research, https://law.counselstack.com/opinion/veritas-technologies-llc-v-veeam-software-corporation-cafc-2016.