- PTAB · Mar 17, 2023 · IPR2022-01242 · APJ John R Kenny · IPR · Remand
On remand, the Board declined Fintiv denial and instituted review of claims 1–20 on all seven asserted obviousness grounds, finding a compelling challenge to claim 1 under Ground 1.
RulingsRemand decision- PTAB / AIA Trials › Discretionary denial › Fintiv (parallel litigation)Decided for petitioner
“denial, and Fintiv Factor 1 is neutral. Collectively, the first five Fintiv Factors favor discretionary denial.” slip op. at 60
- PTAB / AIA Trials › Institution threshold (reasonable likelihood / more likely than not)InstitutedInstituted
“that Petitioner will prevail in its challenge to claim 1 under Ground 1. Thus, Petitioner has set forth a compelling, meritorious challenge that plainly leads to the conclusion that at least one claim is unpatentable (based on the current record).” slip op. at 74
- Claim Construction › Intrinsic evidence (Phillips canons) › Plain and ordinary meaning to a POSITATerm construed board ownDecided for petitioner
“that RF carriers, CDMA codes, TDMA time slots or other information defining and describing the way data is being transmitted do not include underlying data that is transmitted. In isolation, the phrase “not including underlying data that is being transmitted” could be subject to different interpretations. It could simply mean that data being transmitted by itself is not a radio resource, but the RF carrier transmitting the data could be a radio resource. Patent Owner makes clear, however, that this interpretation is not the intent of its construction by arguing that, under its construction, Hettstedt’s RF carriers are not radio resources because they have data modulated on them. Prelim. Resp. 24–27. Similarly, Patent Owner argues that Wu’s carriers are not radio resources because they have payload data encapsulated in them. Id. at 34; see also id. at 35. Patent Owner, however, cites nothing from the Specification that indicates RF carriers, CDMA codes, or TDMA time slots cease to be radio resources merely because data is modulated or encapsulated on them. Prelim. Resp. 12–18. Further, we see no such teaching in the Specification.” slip op. at 12
- Obviousness (§103) › Motivation to combine / reasonable expectation of successMotivation foundReasonable expectation foundInstituted
“Wellington’s teachings to Hettstedt’s system to obviate the need for a human user to perform the load balancing (i.e., improve the system by making it automatic) as a threshold-based trigger avoids the need for the system to wait for user inputs. Ex. 1003 ¶ 130. Further, an ordinarily skilled artisan would naturally use a threshold for the trigger as taught by Wellington because a threshold is readily programmable and machine executable. Id. In addition, an ordinarily skilled artisan would have been motivated to implement Wellington’s teaching to improve the adaptability of Hettstedt’s system. Id. A benefit of a threshold-based trigger is that it allows a system to fine-tune the load balancing by adjusting the threshold. Id. Further, there is no need to reprogram significant software when using a threshold-based trigger. Id.” slip op. at 72
Claim construction§ 103 obviousnessDiscretionary denialcites KSRPatents in suitUS 11,026,232 - PTAB · Mar 4, 2016 · IPR2014-01368 · APJ Kalyan K Deshpande · IPR · Final written decision
Claims 1, 2, 5, and 10 of the ’469 patent were held unpatentable; the remaining challenged claims were not shown unpatentable because the cited art did not disclose the required current connection status.
RulingsFinal written decision- Claim Construction › Intrinsic evidence (Phillips canons) › Plain and ordinary meaning to a POSITAPlain and ordinary meaningDecided for patent owner
“In Straight Path, the Federal Circuit held that the claim language “is connected to the computer network” has a facially clear meaning, that “the query transmitted to the server seeks to determine whether the second unit is connected at that time, i.e., connected at the time that the query is sent.” Straight Path, 806 F.3d at 1360.11 The Federal Circuit held that the query asks “whether the device ‘is’ connected, not whether it was connected or whether it is still registered as being connected even if that registration information is no longer accurate.” Id. The Federal Circuit further explained that “[i]t is not a reasonable interpretation of the claim language . . . to say that it is satisfied by a query that asks only for registration information, regardless of its current accuracy.” Id. The Federal Circuit explained, “[w]hen claim language has as plain a meaning on an issue as the language does here, leaving no genuine uncertainties on interpretive questions relevant to the case, it is particularly difficult to conclude that the specification reasonably supports a different meaning. The specification plays a more limited role than in the common situation where claim terms are uncertain in meaning in relevant respects.” Id. at 1361. Accordingly, the Federal Circuit construed the limitation “is connected to the computer network” as “is connected to the computer network at the time the query is transmitted to the server.” Id. at 1363.” slip op. at 11
- Obviousness (§103) › Graham factors (scope of art, differences, level of skill)Not shown unpatentableNot shown unpatentable
“and NetBIOS fail to determine whether a computer or process is connected to the computer network. PO Resp. 35, 49–51. In view of our construction of this claim limitation, we agree with Patent Owner. Microsoft Manual discloses that once a computer is registered with the WINS server (which is a NetBIOS Name Server (NBNS)) as active and on-line, the WINS server maintains a database of names and addresses as active and on-line by (1) releasing names once a computer is shut down properly and (2) requiring a renewal time period in which a computer must reregister. Ex. 1012, 62– 63, 68–69. Microsoft Manual discloses that in response to User Datagram Protocol (UDP) name queries, “a mapping in the database does not ensure that the related device is currently running.” Id. at 68. Microsoft Manual further explains that a “local WINS database should periodically be cleared of released entries and old entries that were registered at another WINS server but did not get removed from this WINS database for some reason.” Id. at 150. In other words, Microsoft Manual discloses that the WINS database may include entries of computers that are not currently connected to the WINS network. Accordingly, a query to as to whether a second process “is connected to the computer network” in Microsoft Manual will not determine whether the second process is connected to the WINS network at the time that the query is transmitted to the server. As discussed above in our claim construction analysis above (see Section I.E.1), a query as to whether a process “is connected to a computer network” or has an “on-line” status asks “whether the device ‘is’ connected, not whether it was connected or whether it is still registered as being connected even if that registration information is no longer accurate. It is not a reasonable interpretation of the claim language . . . to say that it is satisfied by a query that asks only for registration information, regardless of its current accuracy.” Straight Path, 806 F.3d at 1360. Microsoft Manual discloses that the WINS server has information that a process “was” connected to the computer network, and that information may no longer be accurate. See Ex. 1012, 68, 150. As such, we determine that Microsoft Manual does not disclose the claimed “is connected to the computer network,” “on-line status,” or “is accessible,” as construed herein. Similarly, NetBIOS discloses a registration process for resources or nodes to receive a unique name by registering a name. Ex. 1014, 379. During a name query (discovery), a datagram is sent requesting the name and address of another resource. Id. at 396. The NBNS maintains a database of resource names through explicit name deletion, where the node specifies a deletion function and implicit name deletion, which occurs when a node ceases operation. Id. at 379. NetBIOS explains that implicit name deletion “is a frequent occurrence.” Id. Implicit name deletion is managed by assigning nodes a specified lifetime for registered names, where a name is silently released if a node fails to refresh the registered name before the lifetime expires. Id. NetBIOS further discloses a mechanism where the NBNS may correct the information stored after an incorrect response is provided to a requesting node. See id. at 409. However, similar to Microsoft Manual, NetBIOS discloses that the information stored by the NBNS may be incorrect, and, therefore, will not determine whether a second process is connected to the computer network at the time that the query is transmitted to the server. Therefore, NetBIOS also does not disclose the claimed “is connected to the computer network,” “on-line status,” or “is accessible.” Given that the combination of Microsoft Manual and NetBIOS fails to teach or suggest the claims as construed, we need not reach the remaining arguments presented by Petitioner and Patent Owner.” slip op. at 19
- Obviousness (§103) › Motivation to combine / reasonable expectation of successMotivation foundDecided for petitioner
“Petitioner contends that “WINS is an implementation of NetBIOS” and, therefore, Petitioner contends that “one having skill in the art would have known about and been motivated to combine Microsoft Manual with NetBIOS.” Id. at 34 (citing 67 Ex. 1004 ¶¶ 88–89). We are persuaded by Petitioner that the combination is reasonable because Microsoft Manual demonstrates that Microsoft TCP/IP has combined the elements of NetBIOS and Microsoft Manual in the same manner in which Petitioner proposes to combine NetBIOS and Microsoft Manual. See 67 Ex. 1012, 3, 11. Microsoft Manual discloses that Microsoft TCP/IP for Windows NT provides support for application interfaces, including NetBIOS for establishing logical names and sessions on the network. Id. at 11. Microsoft Manual describes that “[w]hen WINS servers are in place on the network, NetBIOS over TCP/IP resolves names on a client computer by communication with the WINS server.” 67 Pet. 34 (quoting 67 Ex. 1012, 62). We are persuaded that Microsoft TCP/IP for Windows NT utilizes NetBIOS features for name resolution, as disclosed by Microsoft Manual, and a person with ordinary skill in the art would have readily combined the disclosures of Microsoft Manual and Microsoft Manual.” slip op. at 25
- BurdenFwd mixedUnpatentable
“8. Conclusion We have reviewed the Petition and supporting evidence and find that Petitioner has shown by a preponderance of the evidence that claims 1, 2, and 5 of the ʼ469 patent are obvious over Microsoft Manual and NetBIOS, and claim 10 is unpatentable because it depends from a cancelled claim. Accordingly, we determine that Petitioner has demonstrated by a preponderance of the evidence that claims 1, 2, 5, and 10 of the ʼ469 patent are unpatentable.” slip op. at 29
Claim construction§ 103 obviousnesscites PhillipsPatents in suitUS 6,131,121
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.