• Samsung Electronics Co., Ltd. / Samsung Electronics America, Inc. et al. v. Straight Path IP Group, Inc.Some claims unpatentable
  PTAB · Mar 4, 2016 · IPR2015-01006 · APJ Kalyan K Deshpande · IPR · Final written decision

  Claims 1, 2, 5, and 10 of the ’469 patent are unpatentable; the remaining challenged claims of the ’704, ’469, and ’121 patents were not shown unpatentable.

  RulingsFinal written decision

  • Claim Construction › Intrinsic evidence (Phillips canons) › Plain and ordinary meaning to a POSITATerm construed board ownDecided 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

  • BurdenNot 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

  Patent outcomesUS 6,131,121 mixed
  Claim construction§ 103 obviousnesscites Phillips
  Patents in suitUS 6,131,121
• Samsung Electronics Co., Ltd. / Samsung Electronics America, Inc. et al. v. Straight Path IP Group, Inc.Some claims unpatentable
  PTAB · Mar 4, 2016 · IPR2015-01011 · APJ Kalyan K Deshpande · IPR · Final written decision

  Claims 1, 2, 5, and 10 of the ’469 patent are unpatentable; the remaining challenged claims were not shown unpatentable because the cited art did not establish current network connection status.

  RulingsFinal written decision

  • Claim Construction › Intrinsic evidence (Phillips canons) › Plain and ordinary meaning to a POSITATerm construed board ownDecided for patent owner

    “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. 11 Petitioner argues that the relevant specifications do not include an embodiment that “‘guarantees’ or ‘ensures’ the availability of the second process at any given point in time” and the file histories of the challenged patents “expressly reject[] the notion that the claims contain any guarantee of perfect accuracy.” Addʼl Br. 6. In Straight Path, the Federal Circuit did not offer a view as to the sufficiency of the written description or enablement based on the claim construction provided by the Federal Circuit because “written-description and enablement challenges were not, and could not have been, part of the inter parties review.” Straight Path, 806 F.3d at 1363. We similarly do not offer any determination as to whether this claim construction is supported by the specifications of the ʼ704 patent, ʼ469 patent, and the ʼ121 patent. Petitioner and Patent Owner argue that the limitations “on-line status” and “is accessible” have the same meaning as “is connected to the computer network.” See 66 Pet. 24–30; 66 PO Resp. 32‒35; 67 Pet. 25–31; 67 PO Resp. 30‒34; 68 Pet. 24–29; 68 PO Resp. 36‒42. Similar to “is connected to a computer network,” the “on-line status” and “is accessible” of the second process are recited in the present tense, and, therefore must be determined at the time of the querying whether the second process “is accessible” or selecting of the process having an “on-line status.” Therefore, we construe “on-line status” and “is accessible” as having the same meaning as “is connected to the computer network.”” 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.” slip op. at 19

  • PTAB / AIA Trials › Joinder §315(c) / SAS all-or-nothingJoinder, grantedGranted

    “and AVAYA, Inc. (“AVAYA”) filed three Petitions and Motions to Join the IPR2014-01366, IPR2014-01367, and IPR2014-01368 proceedings. IPR2015-01011, Papers 2, 4; IPR2015-01007, Papers 3, 4; IPR2015-01006, Papers 2, 4. We granted these motions and joined Samsung, Cisco, and AVAYA (collectively, “Petitioner”) to these inter partes reviews. 66 Paper 26; 67 Paper 23; 68 Paper 25.” slip op. at 3

  Patent outcomesUS 6,108,704 mixed
  Claim construction§ 103 obviousnesscites Phillips
  Patents in suitUS 6,108,704
• Samsung Electronics Co., Ltd. / Samsung Electronics America, Inc. et al. v. Straight Path IP Group, Inc.Some claims unpatentable
  PTAB · Mar 4, 2016 · IPR2014-01366 · APJ Kalyan K Deshpande · IPR · Final written decision

  Claims 1, 2, 5, and 10 of the ’469 patent are unpatentable; the remaining challenged claims of the ’704, ’469, and ’121 patents were not shown unpatentable.

  RulingsFinal written decision

  • Claim Construction › Intrinsic evidence (Phillips canons) › Plain and ordinary meaning to a POSITATerm construed board ownDecided 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) › Motivation to combine / reasonable expectation of successMotivation foundUnpatentable

    “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

  • BurdenNot 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

  Patent outcomesUS 6,108,704 mixed
  Claim construction§ 103 obviousnesscites Phillips
  Patents in suitUS 6,108,704
• Samsung Electronics Co., Ltd. / Samsung Electronics America, Inc. et al. v. Straight Path IP Group, Inc.Some claims unpatentable
  PTAB · Mar 4, 2016 · IPR2014-01367 · 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 of the ’704, ’469, and ’121 patents were not shown unpatentable because the cited art did not establish …

  RulingsFinal written decision

  • Claim Construction › Intrinsic evidence (Phillips canons) › Plain and ordinary meaning to a POSITATerm construed board ownDecided 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

    “Patent Owner argues that these descriptions from Microsoft Manual 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

  • BurdenFwd mixedUnpatentable

    “7. Analysis - Claim 10 Claim 10, as written, depends from claim 8. 67 Ex. 1001, 43:1‒3. Claim 8 was cancelled during the Reexamination proceeding. 67 Ex. 1001, 67 (1:18). During Reexamination, claims 14 and 17 were amended to depend from independent claim 9. Id. at 67 (2:15‒26, 2:59‒60). Claim 10 was not amended and still depends from canceled claim 8. Accordingly, we determine claim 10 to be unpatentable because it depends from a cancelled claim. 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 28

  Patent outcomesUS 6,009,469 mixed
  Claim construction§ 103 obviousnesscites Phillips
  Patents in suitUS 6,009,469
• Samsung Electronics Co., Ltd. / Samsung Electronics America, Inc. et al. v. Straight Path IP Group, Inc.Some claims unpatentable
  PTAB · Mar 4, 2016 · IPR2015-01007 · 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 establish current network connection status.

  RulingsFinal written decision

  • BurdenFwd mixedMixed

    “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.” slip op. at 19

  • Claim Construction › Intrinsic evidence (Phillips canons) › Plain and ordinary meaning to a POSITATerm construed petitioner constructionDecided for petitioner

    “In Ancora Techs., the Federal Circuit explained that “[t]he ordinary meaning of the word ‘program’ in the computer context encompasses both operating systems and the applications that run on them (as well as other types of computer programs)” and “‘to a computer programmer’ a program is merely a ‘set of instructions’ for a computer.” Ancora Techs., Inc. v. Apple, Inc., 744 F.3d 732, 734 (Fed. Cir. 2014). Applying this guidance to the case before us, we agree with Petitioner and construe the term “process” to mean “a running instance of a computer program or application,” where a “computer program” is a set of instructions for a computer that encompasses both operating systems and the applications that run on them. We further note that the ʼ704, ʼ469, and ʼ121 patent specifications interchange the terms “process” and “processing unit.” For example, the specifications explain that a first “processing unit” is “established in the database [] as an active on-line party.” Ex. 1001, 5:29–34. The claims recite the term “process.” Accordingly, our construction is also consistent with the specifications, such that a “process” includes a “processing unit” that is running a program (operating system) or application.” slip op. at 14

  • Obviousness (§103) › Motivation to combine / reasonable expectation of successMotivation foundReasonable expectation foundUnpatentable

    “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

  • 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

  Patent outcomesUS 6,009,469 mixed
  Claim construction§ 103 obviousnesscites Phillips
  Patents in suitUS 6,009,469
• Marvell Semiconductor, Inc. v. Intellectual Ventures I LLCSome claims unpatentable
  PTAB · Nov 30, 2015 · IPR2014-00548 · APJ James A Tartal · IPR · Final written decision

  Claims 1, 4–6, 10, and 13–20 are unpatentable as obvious; claims 2 and 11 were not shown unpatentable because the petition did not establish their variable-length header adjustment limitations.

  RulingsFinal written decision

  • Expert testimonyPetitioner expert creditedOther

    “Fischer teaches that the comparators in coherent demodulator 114 convert a “‘spread spectrum modulated’ analog signal into a digital signal,” as opposed to “other analog signals.” See PO Resp. 13. To the contrary, Fischer states that “[t]he communicators preferably transmit and receive messages over a wireless physical layer provided by a direct-sequence, spread spectrum (DSSS) radio data link.” Ex. 1004, 14:24–27. Fischer further explains that “[s]ince many of the signals in the coherent demodulator 114 are analog signals, the coherent demodulator 114 includes comparators to establish digital waveforms.” Ex. 1004, 16:58–60. As shown in Figure 5 of Fischer, the coherent demodulator 114 is followed by spread spectrum correlator and decoder 130, which “handles the demodulator 114 output to regenerate the unspread data.” Ex. 1004, 17:58– 60. Thus, we agree with Petitioner, as supported by Prof. Ding, that a person of ordinary skill in the art “would have understood Fischer to describe that the demodulator 114 converts the analog DSSS modulated messages received by antennas 100/102 to digital signals and outputs these digital DSSS modulated messages in I and Q format to spread spectrum correlator and decoder 130.” Reply 3–4; Ex. 1013 ¶ 5.” slip op. at 18

  • Skill levelOther

    “3. Claims 1, 10, and 17 Petitioner argues that each of independent claims 1, 10, and 17 is unpatentable as obvious over Fischer and Nakamura. Pet. 15–26. Notwithstanding the fact that claim 1 recites “means” for performing identified functions, whereas claims 10 and 17 do not recite “means” limitations, the three claims recite similar subject matter, and Petitioner advances the same reasoning in its analysis of all three claims. Id. Patent Owner’s Response also generally addresses claims 1, 10, and 17 collectively in a similar manner. PO Resp. 10–31. Although our analysis below primarily focuses on claim 1, our determinations with respect to claim 1 apply for the same reasons to the identified similar limitations of claims 10 and 17.” slip op. at 16

  • Obviousness (§103) › Graham factors (scope of art, differences, level of skill)UnpatentableNot shown unpatentableMixed

    “The Petition makes no mention of Nakamura in its discussion of the additional limitations of claims 2 and 11. Yet in reply, Petitioner argues that “[i]n view of Fischer’s variable length preambles, a [person of ordinary skill in the art] would have found it obvious to utilize Nakamura’s timer function and its repetitive duration function.” Reply 15. Petitioner may not rely on a new argument asserting that Nakamura teaches the additional limitations for claims 2 and 11 presented for the first time in its Reply. Moreover, Petitioner fails to address how either Fischer or Nakamura teaches means for adjusting means for timing when Fischer contains no timer, and when the timer of Nakamura is described as being based on a predetermined period of time. See Ex. 1005, 6:31–36 (“timer 34 permits the switch 14 to transfer from terminal A to terminal B after the lapse of predetermined time”); see also Ex. 2006, ¶¶ 83–84. Petitioner’s contention that “Nakamura’s timer is also flexible” is insufficiently supported by any reference to either Nakamura or the declaration of Prof. Ding. See Reply 16–17; see also Ex. 1013 (no discussion of claims 2 or 11). Petitioner has not demonstrated that the features of claims 2 or 11 are disclosed by the combination of Fischer and Nakamura. 5. Claims 4, 5, 6, 13, 14, 16, and 18–20 Petitioner has persuasively shown that each of the additional limitations of dependent claims 4, 5, 6, 13, 14, 16, and 18–20 are taught by the combination of Fischer and Nakamura. For example, claims 4, 14, and 19 all require a “single monolithic device.” Petitioner has shown that Fischer RF modem 96 is a single monolithic device, and that Fischer communicator 60 is a circuit contained on a single monolithic device that includes RF modem 60. See Pet. 27–28; Ex. 1003 ¶¶ 41–42. Petitioner has also shown that RF modem 96 includes coherent demodulator 114 that provides in-phase and quadrature data outputs that are responsive to an analog signal that has in-phase and quadrature components, corresponding to the requirements of an analog signal “in the form of in-phase and quadrature components” as recited in claims 5 and 16. See Pet. 28–29; Ex. 1003 ¶ 38. With respect to the limitations of claims 6, 16, and 20 requiring PN modulation and phase shift keyed modulation, Petitioner has shown that Fischer discloses RF modem 96 supports BPSK or QPSK, and that it would have been obvious to implement direct sequence spread modulation by using PN modulation. See Pet. 29; Ex. 1003 ¶¶ 34, 37. We are also persuaded that Fischer discloses the “antenna selection circuitry” as recited in claim 13 and the “serial data stream” as recited in claim 18. See Pet. 30–31; Ex. 1003 ¶ 40. Patent Owner does not substantively dispute Petitioner’s assertion that Fischer teaches each of these limitations.” slip op. at 25

  • Obviousness (§103) › Motivation to combine / reasonable expectation of successMotivation foundReasonable expectation foundDecided for petitioner

    “Patent Owner contends that “[i]f reliability alone is the concern,” then “the most reliable method is to use BPSK for the entire packet (as taught by Fischer).” PO Resp. 38. We are not, however, persuaded that “reliability alone is the concern.” Nakamura and Fischer clearly teach a benefit to using both BPSK and QPSK consisting of improved reliability for BPSK with enhanced speed from QPSK. Thus, we find Patent Owner’s contention that those of skill “would not look beyond the teachings of Fischer” unpersuasive. See id. Likewise, Patent Owner’s contention that Fischer already teaches improved reliability by using longer preambles has no bearing on whether one of ordinary skill in the art would have also looked to Nakamura for other means of improving reliability. See id. at 39. We find that Petitioner articulates sufficient reasoning with rational underpinnings. See In re Kahn, 441 F.3d 977, 988 (Fed. Cir. 2006) (cited with approval in KSR Int’l. Co. v. Teleflex, Inc., 550 U.S. 398, 418 (2007)).” slip op. at 28

  Patent outcomesUS 5,712,870 mixed
  § 103 obviousnesscites KSR
  Patents in suitUS 5,712,870
• Marvell Semiconductor, Inc. v. Intellectual Ventures I LLCSome claims unpatentable
  PTAB · Nov 30, 2015 · IPR2014-00553 · APJ Patrick M Boucher · IPR · Final written decision

  Claims 1–3, 5–10, 13, 18, and 23 are unpatentable under § 103; claims 4, 11–12, 14–17, and 19–22 were not shown unpatentable.

  RulingsFinal written decision

  • Novelty / Anticipation (§102) › Priority / effective filing date / continuation supportReference is prior artPrinted publication establishedDecided for petitioner

    “A reference is established to be a “printed publication” “upon a satisfactory showing that such document has been disseminated or otherwise made available to the extent that persons interested and ordinarily skilled in the subject matter or art, exercising reasonable diligence, can locate it.” In” slip op. at 8

  • Obviousness (§103) › Motivation to combine / reasonable expectation of successMotivation foundReasonable expectation foundUnpatentable

    “the art “would have appreciated the benefit of including multi-carrier modulation in the Wu system” because “Wu itself references the 802.11a standard as a multi-carrier OFDM scheme that is able to achieve data rates that are faster than the 802.11b transmission rates used in the Wu system.” Id. at 48 (citing Ex. 1120 ¶¶ 43–47, 65–68; Ex. 1108, 411). Petitioner contends that [w]ith this motivation in mind a [person of ordinary skill in the art] would have recognized that adding the multi-carrier 802.11a modulation scheme to the modulation schemes already available in the Wu system would have been a simple addition, if a technique was available for using a channel estimate obtained from data modulated according to a single carrier modulation scheme for acquisition of data modulated according to a multi-carrier modulation scheme[,] and supports that contention with testimony by Dr. Almeroth. Id. at 48 (citing Ex. 1120 ¶¶ 43–47, 65–68). Petitioner identifies such a technique as disclosed by Böhnke. Id. at 49. Böhnke “relates to the mapping of data and pilot symbols in an OFDM-system.” Ex. 1113, col. 1, ll. 4–5. Figure 2 of Böhnke is reproduced below. Figure 2 illustrates a sequence that includes a first OFDM modulated signal S1, a midamble MA that can be OFDM modulated or single-carrier modulated, and a second OFDM symbol S2. Id. at col. 4, ll. 36–41. The midamble can be used for the transmission of pilot symbols, which “are necessary for a channel estimation such as to effect coherent detection of e.g. OFDM-modulated signals,” and such pilot symbols can be created by a single carrier modulation with a known training sequence. Id. col. 1, ll. 7–9, col. 5, ll. 45–49, col. 5, ll. 61–63. Böhnke, thus, uses the channel estimation obtained from the single-carrier training sequence to detect multi-carrier OFDM symbols by matching bandwidth and performing synchronization. Id. at col. 2, ll. 43–45, col. 2, ll. 61–62. Petitioner reasons that the Böhnke channel-estimation techniques “provide a way to combine a high-rate, multicarrier OFDM data transmission scheme with a single carrier training sequence” and that [w]ith this background, a [person of ordinary skill in the art] investigating options for including the multi-carrier 802.11a standard in the Wu system would have appreciated that Bohnke’s channel estimation techniques could be applied to Wu’s single-carrier 802.11b preamble and used for acquisition of data modulated according to multi-carrier 802.11a.” slip op. at 12

  • BurdenMixed

    “We agree with Patent Owner that Petitioner’s analysis of claim 22, which recites separate single-carrier and multi-carrier receivers, as well as a switch coupled to such receivers, is deficient. Petitioner’s assertion that claim 22 is unpatentable for “reasons similar to those explained in regards to claims 1-3 and 5” insufficiently addresses these limitations, which do not appear in claims 1–3 or 5. Pet. 58.” slip op. at 23

  Patent outcomesUS 6,754,195 mixed
  § 102 anticipation§ 103 obviousness
  Patents in suitUS 6,754,195
• Hart Communication Foundation v. Sipco, LLCSome claims unpatentable
  PTAB · Nov 13, 2015 · IPR2014-00751 · APJ Patrick M Boucher · IPR · Final written decision

  Claims 2–4 are unpatentable under § 103; claims 1 and 9–13 were not shown unpatentable because the art did not establish the claimed wireless retransmission.

  RulingsFinal written decision

  • Expert testimonyPetitioner expert discountedPatent owner expert creditedDecided for patent owner

    “distances.” Id. ¶¶ 7, 6. Although we credit those opinions of Mr. Gannon, we find more compelling the bases for Dr. Almeroth’s opinion that one of skill in the art would be disinclined to use wireless communication at multiple levels of Enterprise Server CM’s tree hierarchy.” slip op. at 19

  • Obviousness (§103) › Motivation to combine / reasonable expectation of successNot shown unpatentableMotivation not foundNot shown unpatentable

    “articulated clearly in the Petition, and it is, nevertheless, unpersuasive in light of Dr. Almeroth’s testimony. Nor are we persuaded by Petitioner’s general argument that various of the references disclose wireless communications that a person of skill in the art would have found obvious to implement in the tree hierarchy disclosed by Enterprise Server CM. See id. at 2–4. That argument is insufficiently supported by evidence that responds to the several issues raised by Dr. Almeroth. See In re Pearson, 494 F.2d 1399, 1405 (CCPA 1974) (unsupported attorney argument in a brief cannot take the place of evidence).” slip op. at 18

  Patent outcomesUS 7,468,661 mixed
  § 103 obviousness
  Patents in suitUS 7,468,661

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.