`Case 1:15—cv—OO228—RGA Document 12-1 Filed 05/04/15 Page 1 of 4 Page|D #: 951
`
`
`
`EXHIBIT 1
`
`EXHIBIT 1
`
`
`
`Case 1:15-cv-00228-RGA Document 12-1 Filed 05/04/15 Page 2 of 4 PageID #: 952
`
`EXHIBIT 1
`
`ASSERTED INDEPENDENT METHOD CLAIMS
`
`Emphasis is added below to call out at least some of the required actors identified in each
`independent method claim that Defendant is accused of indirectly infringing.
`
`U.S. Pat. No. 6,732,147
`
`1. A method of disconnecting a first computer from a second
`computer, the first computer and the second computer being
`connected to a broadcast channel, said broadcast channel forming
`an m-regular graph where m is at least 3, the method comprising:
`
`when the first computer decides to disconnect from the second
`computer, the first computer sends a disconnect message to the
`second computer, said disconnect message including a list of
`neighbors of the first computer; and
`
`when the second computer receives the disconnect message from
`the first computer, the second computer broadcasts a connection
`port search message on the broadcast channel to find a third
`computer to which it can connect in order to maintain an m-
`regular graph, said third computer being one of the neighbors on
`said list of neighbors.
`
`6. A method for healing a disconnection of a first computer from
`a second computer, the computers being connected to a
`broadcast channel, said broadcast channel being an m-regular
`graph where m is at least 3, the method comprising:
`
`attempting to send a message from the first computer to the
`second computer; and
`
`when the attempt to send the message is unsuccessful, broadcasting
`from the first computer a connection port search message
`indicating that the first computer needs a connection; and
`
`having a third computer not already connected to said first
`computer respond to said connection port search message in a
`manner as to maintain an m-regular graph.
`
`
`
`Case 1:15-cv-00228-RGA Document 12-1 Filed 05/04/15 Page 3 of 4 PageID #: 953
`
`U.S. Pat. No. 6,910,069
`
`1. A computer-based, non-routing table based, non-switch based
`method for adding a participant to a network of participants,
`each participant being connected to three or more other
`participants, the method comprising:
`
`identifying a pair of participants of the network that are
`connected wherein a seeking participant contacts a fully
`connected portal computer, which in turn sends an edge
`to a number of randomly
`selected
`connection
`request
`neighboring participants to which the seeking participant is to
`connect;
`
`disconnecting the participants of the identified pair from each
`other; and
`
`the
`connecting each participant of
`participants to the seeking participant.
`
`identified pair of
`
`14. A computer-based, non-switch based method for adding nodes
`to a graph that is m-regular and m-connected to maintain the graph
`as m-regular, where m is four or greater, the method comprising:
`
`identifying p pairs of nodes of the graph that are connected, where
`p is one half of m, wherein a seeking node contacts a fully
`connected portal node, which in turn sends an edge connection
`request to a number of randomly selected neighboring nodes to
`which the seeking node is to connect;
`
`disconnecting the nodes of each identified pair from each other;
`and
`
`connecting each node of the identified pairs of nodes to the
`seeking node.
`
`U.S. Pat. No. 6,920,497
`
`1. A method in a computer for locating a computer through which
`to connect to a network, the method comprising:
`
`providing an identification of a portal computer or a plurality of
`portal computers, the portal computer or the plurality of portal
`computers having a communications port or communications
`ports with a call-in port being enabled for communications when
`
`
`
`Case 1:15-cv-00228-RGA Document 12-1 Filed 05/04/15 Page 4 of 4 PageID #: 954
`
`the portal computer or the plurality of portal computers is in a
`state to coordinate the connection of a seeking computer to the
`network, wherein the call-in port is a type of communications port;
`
`selecting the communications port or communications ports of the
`portal computer or the plurality of portal computers and
`attempting to communicate with the selected communications port
`or communications ports until communications with the call-in
`port is successful, wherein a port ordering algorithm is used to
`identify the call-in port, and wherein the communications ports
`selected by the port ordering algorithm may be re-ordered; and
`
`using the call-in port to request that the portal computer or the
`plurality of portal computers coordinate the connecting of the
`seeking computer to the network.