- Amazon.Com, Inc. / Blizzard Entertainment, Inc. v. Ac Technologies S.A.No claims unpatentablePTAB · Mar 6, 2017 · IPR2015-01801 · APJ Peter P Chen · IPR · Final written decision
Claims 30, 31, 33, and 40–46 were not shown unpatentable because Rabinovich required prior client access before replication, and Carter did not cure that limitation.
RulingsFinal written decision- Skill levelSkill level petitioner adoptedPetitioner expert creditedDecided for petitioner
“C. Level of Ordinary Skill in the Art Petitioner’s declarant, Dr. Ratner, testifies that a person of ordinary skill in the art at the time of the alleged invention “would have had an undergraduate degree in Computer Science or a related field, such as Electrical Engineering, and two to three years of experience working in the field, or an equivalent level of experience.” Ex. 1005 ¶ 17; Pet. 14. Patent Owner does not challenge this definition or present its own. Accordingly, we credit the testimony of Dr. Ratner regarding the level of ordinary skill in the art, and find that a person of ordinary skill in the art would have had an undergraduate degree in Computer Science or a related field, such as Electrical Engineering, and two to three years of experience working in the field, or an equivalent level of experience. This level of ordinary skill is reflected not only by the information presented by the parties, but also by the prior art of record. Okajima v. Bourdeau, 261 F.3d 1350, 1355 (Fed. Cir. 2001) (the prior art itself can reflect the appropriate level of ordinary skill in the art).” slip op. at 9
- Novelty / Anticipation (§102) › Prior-art status of a reference › Printed publication / public accessibilityPrinted publication establishedDecided for petitioner
“We agree with and adopt Petitioner’s reasoning and determine Rabinovich to be a printed publication. We credit the unrebutted testimony of Dr. Rabinovich regarding the consistency of his professional practice in 1998 for republication of his AT&T technical memoranda on a webpage that he managed on AT&T’s publicly accessible website. Furthermore, we find the December 1998 IEEE article corroborates the public availability of Rabinovich on that website, and would have been a roadmap, for one of ordinary skill in the art of data management and optimized access to data, to be guided to Rabinovich. See Reply 21–22. As Petitioner points out, Patent Owner’s own declarant states that Rabinovich and the December 1988 IEEE article “are ‘similar[]’ in that they both address ‘problems in network connectivity caused by multiple clients accessing servers.’ (Ex. 2006 at 12).” Id. at 20. Additionally, the passage in the December 1998 IEEE article that cites to Rabinovich refers to an algorithm in Rabinovich for optimizing access to data in order to increase performance. Id. at 21. Accordingly, we find that footnote 16 of the IEEE article, which contains the URL to Rabinovich, would have guided one of ordinary skill directly to Rabinovich. We are, therefore, persuaded, that Rabinovich is a printed publication under 35 U.S.C. § 102.” slip op. at 12
- Novelty / Anticipation (§102) › Anticipation standard (single reference, every element)Not shown unpatentableNot shown unpatentable
“whether to replicate data object xs. Rabinovich defines cnt(s,xs) as the “total access count for xs,” which is equal to cnt(xs). Ex. 1006, 11. According to Dr. Ratner, “[t]he metric cnt(s,xs) measures the total number of times in that window that replica xs has been served to a client computer.” Ex. 1005 ¶ 253. As Patent Owner points out, Rabinovich teaches replicating/migrating object xs only if the ratio of cnt(s,xs) over aff(xs) is greater than m, and the ratio can be greater than m only if cnt(s,xs) is greater than zero. PO Resp. 19; Ex. 1006, 12, Fig. 4. In view of this, we agree with Patent Owner that if cnt(s,xs) has a value of zero, meaning that object x has not been served to any client computer, then the ratio of cnt(s,xs) to aff(xs) will be zero, i.e., less than m, and Rabinovich will not carry out its replication or migration step. This means that Rabinovich will not replicate or migrate object xs until xs has been accessed by a client computer at least once, such that the access count for xs is greater than zero. In this regard, we agree with Patent Owner that object xs is not “sen[t], from the at least one data storage device to the another data storage device . . . independent of an access of the at least one client computer” because Rabinovich teaches explicitly that object xs is not sent unless there has been at least one access from the client computer.” slip op. at 18
- Obviousness (§103) › Graham factors (scope of art, differences, level of skill)Not shown unpatentableNot shown unpatentable
“30, for use with a computer game (claim 45) and with an interactive computer game accessed by at least two users (claim 46). Ex. 1001, 30:47– 54. In connection with its obviousness contentions, Petitioner makes no separate arguments why Rabinovich teaches or suggests shifting redundantly stored data based upon data transmission parameters between the servers independent of an access of the client. Pet. 45–47; Reply 17–18. Because claims 45 and 46 depend from claim 30, we find that Petitioner has failed to demonstrate by a preponderance of the evidence that Rabinovich teaches or suggests the limitations in these two dependent claims for the same reasons discussed above with respect to claim 30.” slip op. at 21
Patent outcomesUS RE40,521 not shown unpatentable§ 102 anticipation§ 103 obviousnesscites KSR · Graham
Holdings, summaries, rulings, issues, outcomes, winners and claim constructions shown for a decision were generated by a large language model reading the opinion. They are a guide to the decision, not the decision. Confirm every one against the court's own text before relying on it. Outcomes read from the patent owner’s side. Party names are extracted from the decision and are missing on about 900 short Director denials and scans, which carry the trial number instead.