message itself.
`
`In b!2301, the routine performs the
`
`_, of order processing for this
`
`message. The broadcaster component queues messages from each originating process until it
`
`can send them in sequence number order to the application program.
`
`In block 2302, the
`
`routine invokes the distribute broadcast message routine to forward the message to the
`
`neighbors of this process.
`
`In decision block 2303, if a newly connected neighbor is waiting
`
`to receive messages, then the routine continues at block 2304, else the routine returns.
`
`In
`
`block 2304,
`
`the routine sends the messages in the correct order if possible for each
`
`originating process and then returns.
`
`Figure 24 is a flow diagram illustrating the processing of the distribute
`
`broadcast message routine in one embodiment. This routine sends the broadcast message to
`
`each of the neighbors of this process, except for the neighbor who sent the message to this
`
`process.’ In block 2401, the routine selects the next neighbor other than the neighbor who
`
`sent the message.
`
`In decision block 2402, if all such neighbors have already been selected,
`
`then the routine returns.
`
`In block 2403, the routine sends the message to the selected
`
`neighbor and then loops to block 2401 to select the next neighbor.
`
`Figure 26 is a flow diagram illustrating the processing of the handle connection
`
`port search statement routine in one embodiment. This routine is passed an indication of the
`
`neighbor that sent the message and the message itself.
`
`In block 2601, the routine invokes the
`
`distribute internal message which sends the message to each of its neighbors other than the
`
`sending neighbor.
`
`In decision block 2602, if the number of holes of this process is greater
`
`than zero, then the routine continues at block 2603, else the routine returns.
`
`In decision
`
`block 2603, if the requesting process is a neighbor, then the routine continues at block 2605,
`
`else the routine continues at block 2604.
`
`In block 2604,
`
`the routine invokes the court
`
`neighbor routine and then returns. The court neighbor routine connects this process to the
`
`requesting process if possible.
`
`In block 2605, if this process has one hole, then the neighbors
`
`with empty ports condition exists and the routine continues at block 2606, else the routine
`
`returns.
`
`In block 2606,
`
`the routine generates
`
`a condition check message
`
`(i. e.,
`
`condition_check) that includes a list of this process’ neighbors.
`
`In block 2607, the routine
`
`sends the message to the requesting neighbor.
`
`Figure 27 is a flow diagram illustrating the processing of the court neighbor
`
`routine in one embodiment. This routine is passed an indication of the prospective neighbor
`
`for this process. If this process can connect to the prospective neighbor, then it sends a port
`
`[03004-8002/SI.D03733.099]
`
`-35-
`
`7/31/00
`
`tor—OU:
`
`25
`
`30
`
`
`
`
`
`
`
`
`
`
`
`llfiillllifill"ll?115533..2:lI§IIIIIH‘“liiiill.1221.SE33}IlfffuH353?!‘EEEHIlfiinIII]!
`
`
`
`
`
`
`
`
`
`
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 167 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 167 of 1442
`
`

`
`
`
`
`
`
`
`..2!iI§11113.!"111]!.2132fliiiilifiiniiifil‘E3331ilffzn1133! G
`
`
`
`
`
`
`
`
`
`
`
`connection call extemniessage to the prospective neiglp and adds the prospective
`
`neighbor as a neighbor.
`
`In decision block 2701, if the prospective neighbor is already a
`
`neighbor, then the routine returns, else the routine continues at block 2702.
`
`In block 2702,
`
`the routine dials the prospective neighbor.
`
`In decision block 2703, if the number of holes of
`
`this process is greater than zero, then the routine continues at block 2704, else the routine
`
`continues at block 2706.
`
`In block 2704, the routine sends a port connection call external
`
`message (i.e., port_connection_cal1) to the prospective neighbor and receives its response
`
`(i. e., port_connection_resp). Assuming the response is successfully received, in block 2705,
`
`the routine adds the prospective neighbor as a neighbor of this process by invoking the add
`
`neighbor routine. In block 2706, the routine hangs up with the prospect and then returns.
`
`Figure 28 is a flow diagram illustrating the processing of the handle connection
`
`edge search call routine in one embodiment. This routine is passed a indication of the
`
`neighbor who sent the message and the message itself. This routine either forwards the
`
`message to a neighbor or proposes the edge between this process and the sending neighbor to
`
`the requesting process for edge pinning.
`
`In decision block 2801, if this process is not the
`
`requesting process or the number of holes of the requesting process is still greater than or
`
`equal to two, then the routine continues at block 2802, else the routine continues at block
`
`2813.
`
`In decision block 2802, if the forwarding distance is greater than zero,
`
`then the
`
`random walk is not complete and the routine continues at block 2803, else the routine
`
`continues at block 2804.
`
`In block 2803, the routine invokes the forward connection edge
`
`search routine passing the identification of the requesting process and the decremented
`
`forwarding distance. The routine then continues at block 2815.
`
`In decision block 2804, if
`
`the requesting process is a neighbor or the edge between this process and the sending
`
`neighbor is reserved because it has already been offered to a process,
`
`then the routine
`
`continues at block 2805, else the routine continues at block 2806. In block 2805, the routine
`
`invokes the forward connection edge search routine passing an indication of the requesting
`
`party and a toggle indicator that alternatively indicates to continue the random walk for one
`
`or two more computers.
`
`The routine then continues at block 2815.
`
`In block 2806, the
`
`routine dials the requesting process via the call-in port.
`
`In block 2807, the routine sends an
`
`edge proposal call external message (i. e., edge_proposal_call) and receives the response (i. e.,
`
`edge_proposal_resp).
`
`Assuming that the response is successfully received,
`
`the routine
`
`continues at block 2808.
`
`In decision block 2808, if the response indicates that the edge is
`
`[03004-8002/SL003 733.099]
`
`-37-
`
`7/31/00
`
`
`
`
`
`1113!!11211"ll1?'l§EIi
`
`20
`
`25
`
`30
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 168 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 168 of 1442
`
`

`
`
`
`
`
`
`
`..a!f.'LIE]!‘“ililfllulfi:.1333}21353:Elf}???‘Elf113531:lliiiil
`
`
`
`
`
`
`
`
`
`
`
`acceptable to the req
`
`mg process,
`
`then the routine cofiues at block 2809, else the
`
`routine continues at block 2812.
`
`In block 2809, the routine reserves the edge between this
`
`process and the sending neighbor.
`
`In block 2810, the routine adds the requesting process as
`
`a neighbor by invoking the add neighbor routine.
`
`In block 2811, the routine removes the
`
`sending neighbor as a neighbor.
`
`In block 2812, the routine hangs up the external port and
`
`continues at block 2815. In decision block 2813, if this process is the requesting process and
`
`the number of holes of this process equals one, then the routine continues at block 2814, else
`
`the routine continues at block 2815.
`
`In block 2814, the routine invokes the fill hole routine.
`
`In block 2815,
`
`the routine sends an connection edge search response message (i. e.,
`
`connection_edge_search_response) to the sending neighbor indicating acknowledgement and
`
`then returns. The graphs are sensitive to parity. That is, all possible paths starting from a
`
`node and ending at that node will have an even length unless the graph has a cycle whose
`
`length is odd. The broadcaster component uses a toggle indicator to vary the random walk
`
`distance between even and odd distances.
`
`Figure 29 is a flow diagram illustrating the processing of the handle connection
`
`edge search response routine in one embodiment. This routine is passed as indication of the
`
`requesting process, the sending neighbor, and the message.
`
`In block 2901, the routine notes
`
`that
`
`the connection edge search response (i. e., connection_edge_search_resp) has been
`
`received and if the forwarding distance is less than or equal to one unreserves the edge
`
`between this process and the sending neighbor.
`
`In decision block 2902, if the requesting
`
`process indicates that the edge is acceptable as indicated in the message, then the routine
`
`continues at block 2903, else the routine returns. In block 2903, the routine reserves the edge
`
`between this process and the sending neighbor.
`
`In block 2904, the routine removes the
`
`sending neighbor as a neighbor.
`
`In block 2905,
`
`the routine invokes the court neighbor
`
`routine to connect to the requesting process.
`
`In decision block 2906, if the invoked routine
`
`was unsuccessful, then the routine continues at block 2907, else the routine returns.
`
`In
`
`decision block 2907, if the number of holes of this process is greater than zero, then the
`
`routine continues at block 2908, else the routine returns.
`
`In block 2908, the routine invokes
`
`the fill hole routine and then returns.
`
`Figure 30 is a flow diagram illustrating the processing of the broadcast routine
`
`in one embodiment. This routine is invoked by the application program to broadcast a
`
`message on the broadcast channel. This routine is passed the message to be broadcast.
`
`In
`
`[O3004-8002/SL003731099]
`
`-3 8-
`
`7/31/00
`
`10
`
`I-4 LII
`
`20
`
`25
`
`30
`
`
`
`
`
`».......':.u....-~, n$‘W
`
`
`
`III]:Ilifiii‘'11’?21-33
`
`
`
`
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 169 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 169 of 1442
`
`

`
`decision block 3001, Q process has at least one neighbogien the routine continues at
`
`block 3002, else the routine returns since it is the only process connected to be broadcast
`
`charmel.
`
`In block 3002, the routine generates an internal message of the broadcast statement
`
`type (i. e., broadcast _stmt).
`
`In block 3003, the routine sets the sequence number of the
`
`message.
`
`In block 3004,
`
`the routine invokes the distribute internal message routine to
`
`broadcast the message on the broadcast channel. The routine returns.
`
`Figure 31 is a flow diagram illustrating the processing of the acquire message
`routine in one embodiment. The acquire message routine may be invoked by the application
`
`program or by a callback routine provided by the application program. This routine returns a
`
`message.
`
`In block 3101, the routine pops the message from the message queue of the
`
`broadcast charmel.
`
`In decision block 3102, if a message was retrieved, then the routine
`
`returns an indication of success, else the routine returns indication of failure.
`
`Figures 32-34 are flow diagrams illustrating the processing of messages
`
`associated with the neighbors with empty ports condition.
`
`Figure 32 is a flow diagram
`
`illustrating processing of the handle condition check message in one embodiment.
`
`This
`
`message is sent by a neighbor process that has one hole and has received a request to connect
`
`to a hole of this process.
`
`In decision block 3201, if the number of holes of this process is
`
`equal to one, then the routine continues at block 3202, else the neighbors with empty ports
`
`condition does not exist any more and the routine returns.
`
`In decision block 3202, if the
`
`sending neighbor and this process have the same set of neighbors, the routine continues at
`
`block 3203, else the routine continues at block 3205.
`
`In block 3203, the routine initializes a
`
`condition double check message (i. e., condition_double_check) with the list of neighbors of
`
`this process. In block 3204, the routine sends the message internally to a neighbor other than
`
`sending neighbor. The routine then returns.
`
`In block 3205, the routine selects a neighbor of
`
`the sending process that is not also a neighbor of this process.
`
`In block 3206, the routine
`
`sends a condition repair message (i. e., condition_repair_stmt) externally to the selected
`
`process.
`
`In block 3207, the routine invokes the add neighbor routine to add the selected
`
`neighbor as a neighbor of this process and then returns.
`
`Figure 33 is a flow diagram illustrating processing of the handle condition
`
`repair statement routine in one embodiment. This routine removes an existing neighbor and
`
`connects to the process that sent the message.
`
`In decision block 3301, if this process has no
`
`holes, then the routine continues at block 3302, else the routine continues at block 3304.
`
`In
`
`[03004-8002/SL003733.099]
`
`-39-
`
`7/31/00
`
`
`
`20
`
`
`
`III]!lliill"ll?EIEEEIC
`
`25
`
`30
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 170 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 170 of 1442
`
`

`
`block 3302, the routin‘ , _,ects a neighbor that is not involv¥i the neighbors with empty
`ports condition.
`In block 3303, the routine removes the selected neighbor as a neighbor of
`
`this process. Thus, this process that is executing the routine now has at least one hole.
`
`In
`
`block 3304, the routine invokes the add neighbor routine to add the process that sent the
`
`5 message as a neighbor of this process. The routine then returns.
`
`Figure 34 is a flow diagram illustrating the processing of the handle condition
`
`double check routine. This routine determines whether the neighbors with empty ports
`
`condition really is a problem or whether the broadcast charmel is in the small regime.
`
`In
`
`decision block 3401, if this process has one hole, then the routine continues at block 3402,
`
`10
`
`else the routine continues at block 3403. If this process does not have one hole, then the set
`
`of neighbors of this process is not the same as the set of neighbors of the sending process. In
`
`decision block 3402, if this process and the sending process have the same set of neighbors,
`
`then the broadcast channel is not in the small regime and the routine continues at block 3403,
`
`else the routine continues at block 3406. In decision block 3403, if this process has no holes,
`
`D—‘ UI
`
`then the routine retums, else the routine continues at block 3404.
`
`In block 3404, the routine
`
`sets the estimated diameter for this process to one.
`
`In block 3405, the routine broadcasts a
`
`diameter reset internal message (i. e., diarneter_reset) indicating that the estimated diameter is
`
`one and then returns. In block 3406, the routine creates a list of neighbors of this process. In
`
`block 3407, the routine sends the condition check message (i. e., condition_check_stmt) with
`
`20
`
`the list of neighbors to the neighbor who sent the condition double check message and then
`
`returns.
`
`
`
`
`2553?!‘$33!!Iliifxilljfll
`
`
`
`
`..s::iI!!IIll“‘Ilfiflixiii:3I‘§EEiilifiisi
`
`1!]!SE2}!"ll?EEEEII
`
`From the above description,
`
`it will be appreciated that although specific
`
`embodiments of the technology have been described, various modifications may be made
`
`without deviating from the spirit and scope of the invention.
`
`For example,
`
`the
`
`25
`
`communications on the broadcast charmel may be encrypted. Also, the channel instance or
`
`session identifier may be a very large number (e.g., 128 bits) to help prevent an unauthorized
`
`user to maliciously tap into a broadcast charmel. The portal computer may also enforce
`
`security and not allow an unauthorized user
`
`to connect
`
`to the broadcast charmel.
`
`Accordingly, the invention is not limited except by the claims.
`
`[03004-8002/Sb0O3733.099]
`
`-40-
`
`1
`
`7/31/00
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 171 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 171 of 1442
`
`

`
`CLAIMS
`
`
`
`4
`
`5
`
`6
`
`7
`
`1
`
`2
`
`1
`
`IQ
`
`1
`
`2
`
`1
`
`2
`
`1
`
`2
`
`1
`
`2
`
`identifying pa' of participants of the network that are connected;
`
`disconnecting
`
`e participants of the identified pair from each other; and
`
`connecting each articipant of the identified pair of participants to the
`
`The method of cla
`
`1 wherein each participant is connected to 4
`
`
`
`The method of claim
`
`wherein the identifying of a pair includes
`
`added participant.
`
`participants.
`
`2.
`
`3.
`
`randomly selecting a pair of participants that
`
`e connected.
`
`
`
`4.
`
`The method of claim 3 whe in the randomly selecting of a pair includes
`
`sending a message through the network on a rand
`
`
`
`5.
`
`The method of claim 4 wherein hen a participant receives the message,
`
`the participant sends the message to a randomly selec d participant to which it is connected.
`
`6.
`
`The method of claim 4 where"
`
`the randomly selected path is
`
`approximately proportional to the diameter of the network.
`
`7.
`
`The method of claim 1 wherein the p
`
`'cipant to be added requests a
`
`portal computer to initiate the identifying of the pair of participants.
`
`
`
`
`
`
`
`
`
`
`
`Iliffllllifll"H?{E}:..s:ffLIll}!‘"IE}!.:::!IEliiiiIlffiu335$}?‘EEEEIIllffinllilill
`
`
`
`
`
`
`
`
`
`
`
`
`
`[03004-8002/SL003733.099]
`
`-41-
`
`7/31/00
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 172 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 172 of 1442
`
`

`
`1
`
`2
`
`3
`
`1
`
`8.
`
`The metho'd of claim 7 wherein the initiating of the identifying of the
`
`pair of participants includes the portal computer sending a message to a connected
`
`participant requesting an edge connection.
`
`9.
`
`The method of claim 8 wherein the portal computer indicates that the
`
`2 message is to travel a certain dist
`
`ce and wherein the participant that receives the message
`
`3
`
`4
`
`after the message has traveled tha certain distance is one of the participants of the identified
`
`pair of participants.
`
`
`
`10.
`
`The method 0 claim 9 wherein the certain distance is approximately
`
`2
`
`twice the diameter of the network.
`
`
`
`11.
`
`The method of
`
`laim 1 wherein the participants are connected via the
`
`Internet.
`
`12.
`
`The method of
`
`TCP/IP connections.
`
`
`
`aim 1 wherein the participants are connected via
`
`13.
`
`The method of claim wherein the participants are computer processes.
`
`14.
`
`A computer-based meth d for adding nodes to a graph that is m-regular
`
`and m-connected to maintain the graph as m- egular, where m is four or greater, the method
`
`
`comprising:
`
`identifying p pairs of node of the graph that are connected, where p is
`
`one half of m;
`
`
`
`disconnecting the nodes of ea h identified pair from each other; and
`
`V
`
`connecting each node of the id tified pairs of nodes to the added node.
`
`1
`
`2
`
`1
`
`2
`
`1
`
`1
`
`2
`
`3
`
`4
`
`5
`
`6
`
`7
`
`1
`
`2
`
`
`
`15.
`
`The method of claim 14 where’
`
`identifying of the p pairs of nodes
`
`includes randomly selecting a pair of connected nodes.
`
`
`
`tliiliIL)!"ll?33333
`
`[03004-8002/SL003731099]
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 173 of 1442
`
`-42-
`
`7/31/00
`
`
`
`
`
`
`
`
`
`.4231?)51:]!'"III}!..::ff§!‘.":3EiillfiiniiEE:‘.i‘‘E533!llffinIll]!
`
`
`
`
`
`
`
`
`
`
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 173 of 1442
`
`

`
`,1O
`O
`The meth\ d of claim 14 wherein the nodes are computers and the
`
`16.
`
`connections are point-to-point c
`
`unications connections.
`
`1
`
`2
`
` ,
`
`17.
`
`The method o claim 14 wherein m is even.
`
`
`
`
`
`
`
`Alli:III]!‘“Ill!..e:i.'Ifffiiii1511:iii‘?‘!f:":i|11551:11:11
`
`
`
`
`
`
`
`
`
`
`
`1
`
`2
`
`3
`
`4
`
`5
`
`6
`
`7
`
`1
`
`18.
`
`A method of mi \‘ting adding of a participant to a network, the method
`
`comprising:
`
`
`
`receiving a connec on message from the participant to be added; and
`
`sending a connectio edge search message to a neighbor participant of
`
`the participant that received the messag wherein the connection edge search message is
`
`forwarded to neighbor participants until a participant that receives the connection edge
`
`search message decides to connect to the p
`
`'cipant to be added.
`
`19.
`
`The method of claim 8 wherein the sent connection edge search
`
`2 message includes an indication of the numbe of participants to which the connection edge
`
`3
`
`1
`
`2
`
`1
`
`2
`
`1
`
`2
`
`search message should be forwarded.
`
`20.
`
`The method of claim 19 w ere
`
`tl1
`
`umber f participants is based on
`
`the diameter of the network.
`
`21.
`
`The method of claim 19
`
`in the number of participants is
`
`approximately twice the diameter.
`
`22.
`
`The method of claim 18 wherein when a participant decides to connect
`
`to the participant to be added, the neighbor participant that sent the connection edge search
`
`3 message to the participant that decided to connect also decides to connect to the participant
`
`4
`
`to be added.
`
`1
`
`23.
`
`The method of claim 18 wherein participants that receive the connection
`
`
`
`lliillIII}!"ll-"7§l§3EI
`
`
`
`
`
`2
`3
`
`-43-
`
`edge search message forward the connection edge searchimessage to a randomly selected
`neighbor.
`[03004-8002/SL003733.099]
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 174 of 1442
`
`\
`
`f
`\
`
`7/31/oo
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 174 of 1442
`
`

`
`‘r/_
`
`24.
`
`A method in a omputer system for connecting to a new participant of a
`
`network, the method comprising:
`
`receiving at a p
`
`'cipant a connection edge search message;
`
`identifying a n ighbor participant of the participant that received the
`
`connection edge search message;
`
`
`
`notifying the ne ghbor participant to connect to the new participant;
`
`disconnecting
`
`e participant from the identified neighbor participant;
`
`and
`
`connecting the p
`
`'cipant to the new participant.
`
`25.
`
`The method of cl
`
`'
`
`24 including determining whether the participant is
`
`the last participant in a path of participants through which the connection edge search
`
`message was sent.
`
`26.
`
`The method of cl
`
`'
`
`, her in when the participant is not the last
`
`participant in the path, sending the co
`
`ec
`
`ge search message to a neighbor of the
`
`participant.
`
`
`
`27.
`
`The method of claim 26 including randomly selecting the neighbor
`
`participant to which the connection edge se ; ch message is to be sent.
`\
`
`28.
`
`The method of claim 2 wherein the received connection edge search
`
`message includes an indication of the nurnbe of participants through which the connection
`
`edge search message is to be sent.
`
`
`
`
`
`
`
`
`
`
`
`
`
`iliilllIlI.'l!‘ll?tl§§I.;a.'lfIllfll‘"IE]!.s:3.‘fI.'!§§EiiIiffilzE1355!‘$335!!ilfffnIII]!
`
`
`
`
`
`
`
`
`
`
`
`
`
`29.
`
`The method of claim 24 iilcluding when the participant is already a
`
`neighbor of the new participant, sending the co
`
`ection edge search message to a neighbor
`
`participant of the participant.
`
`30.
`
`The method of claim 24 wherein the participants are computer
`
`PIOCCSSCS.
`[03004-8002/SL003731099]
`
`\
`\
`
`\
`
`-44-
`
`7/31/oo
`
`1 2
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 175 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 175 of 1442
`
`

`
`p
`I
`-
`)
`\
`The method of c1 herem the connections are pomt-to-pomt
`
`31.
`
`connections.
`
`32.
`
`A computer-readable medium containing instructions for controlling a
`
`omputer system to connect a participant to a network of participants, each participant being
`connected to three or more other participants, the network representing a broadcast charmel
`
`1
`
`2
`
`3
`
`a1
`
`
`
`
`
`
`
`
`
`
`
`..z.'ffIlliffl!"'lffll..z:ffI93335}tlffin5333!!‘El!1155::Ilili
`
`
`
`
`
`
`
`
`
`4 wherein each participant forwards broadcast messages that
`
`it receives to its neighbor
`
`5
`
`6
`
`7
`
`8
`
`9
`
`1
`
`2
`
`1
`
`2
`
`1
`
`2
`
`3
`
`1
`
`2
`
`3
`
`1
`
`2
`
`participants, by a method comprising:
`
`identifying a pair of participants of the network that are connected;
`
`disconnecting the participants of the identified pair from each other; and
`
`connecting each participant of the identified pair of participants to the
`
`added participant.
`
`33.
`
`The computer-readable medium of claim 32 wherein each participant is
`
`connected to 4 participants.
`
`34.
`
`The computer-readable medium of claim 32 wherein the identifying of a
`
`pair includes randomly selecting a pair of participants that are connected.
`
`35.
`
`The computer-readable medium of claim 34 wherein the randomly
`
`selecting of a pair includes sending a message through the network on a randomly selected
`
`path.
`
`36.
`
`The computer-readable medium of claim 35 wherein when a participant
`
`receives the message, the participant sends the message to a randomly selected participant to
`
`which it is connected.
`
`37.
`
`The computer-readable medium of claim 35 wherein the randomly
`
`selected path is approximately twice a diameter of the network.
`
`
`
`lliillllffll"Ill?:1E§EfI
`
`
`
`
`
`[03004-8002/SL003733.099]
`
`-45-
`
`7/31/00
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 176 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 176 of 1442
`
`

`
`38.
`
`The computer-readable medium of claim 32 wherein the participant to
`
`be added requests a portal computer to initiate the identifying of the pair of participants.
`
`0
`
`39.
`
`The computer—readable medium of claim 38 wherein the initiating of the
`
`identifying of the pair of participants includes the portal computer sending a message to a
`
`connected participant requesting an edge connection.
`
`
`
`.45.._»....;x
`
`40.
`
`The comp ter-readable medium of claim 38 wherein the portal
`
`computer indicates that the mess - e is to travel a certain distance and wherein the participant
`
`that receives the message after
`
`e message has traveled that certain distance is one of the
`
`identified pair of participants.
`
`41.
`
`A method in
`
`computer system for connecting to a participant of a
`
`network, the method comprising:
`
`receiving at a p
`
`'cipant a connection port search message sent by a
`
`requesting participant; and
`
`when the participant has a port that is available through which it can
`
`connect to the requesting participant,
`
`4
`
`participant proposing that the requesting participant connect to the available port of the
`
`sending a port connection message to the requesting
`
`participant; and
`
`
`
`message flrat indicates the requesting partic' ant accepts to connect to the available port,
`
`when the participant receives a port proposal response
`
`connecting the participant to the requesting p
`
`
`'cipant.
`\0
`
`
`The method of cla
`41 ' cluding:
`when the participant o s)uo,t/ltave a port that is available through which
`
`42.
`
`it can connect to the requesting participant
`neighbor participant.
`
`
`
`ding the connection port search message to a
`
`
`
`
`
`
`
`
`
`
`
`lliffllllfill"ll?iliffii..z!i'.§llIII|l"“llllill.s::!fIfffiiii11535:;1335!?‘fill115351»£1.73!
`
`
`
`
`
`
`
`
`
`
`
`
`
`[03004-8002/Sb003733.099]
`
`-46-
`
`7/31/00
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 177 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 177 of 1442
`
`

`
`0
`The method (\)f claim 41 wherein a port is available when the requesting
`
`43.
`
`participant is not already connected to the participant and the participant has an empty port.
`
`
`
`44.
`
`A method in a computer system of detecting neighbors with empty ports
`
`condition in a network, the method omprising:
`
`receiving at a first participant a connection port search message
`
`indicating that a second participant h s an empty port; and
`
`when the first p
`
`
`'cipant is already connected to the second participant
`
`and the first participant has an empty ort, sending a condition check message from the first
`
`participant
`
`to the second participan wherein the condition check message identifies
`
`neighbors of the first participant.
`
`1
`
`2
`
`1
`
`2
`
`3
`
`4
`
`5
`
`6
`
`7
`
`8
`
`ilfiiil 1
`fifffif..a:ifIIII]!"'||.’IIl|..:!3II3533?}ilfffn£13333?'!3EEiiiiiiin
`
`
`
`
`
`
`
`
`
`
`45.
`
`The method of cla'
`
`46
`
`The method of claim 5 including:
`when the third partici
`t receives the condition repair message,
`
`1
`
`2
`
`3
`
`4
`
`5
`
`1
`
`2
`
`3
`
`4
`
`5
`
`1
`
`disconne ting from a neighbor of the third participant
`
`other than the first participant; and
`
`connecting to the second participant.
`
`47.
`
`The method of claim 44 inc uding:
`
`when the second participant eceives the condition check message,
`
`when the secon participant has the same neighbors as the
`
`first participant, sending a condition double check
`
`neighbor of the second participant.
`
`essage to a third participant that is a
`
`48.
`
`The method of claim 47 including:
`
`
`
`[03004-8002/SIJ)03733.099]
`
`-47-
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 178 of 1442
`
`7/31/00
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 178 of 1442
`
`

`
`whgie third pariticipantreceives the cogion double check message,
`
`/
`
`when the third panicipant does not have the same
`neighbors as the first participant, sendihg a condition check message to a fourth participant
`
`that is not the first participant or the second articipant.
`
`
`
`49.
`
`The method of c1a'
`
`48
`
`mg:
`
`when the fourth p
`
`' ant receives the condition check message,
`
`directing the fifth participant to connect to the first participant or the second participant.
`
`sendin a condition repair message to a fifth participant
`
`1_....._......
`
`._n..1...m.4.«2..1.lrim.nan.
`
`2
`
`3
`4
`
`5
`
`1
`
`2
`
`3
`
`4
`
`
`
`
`
`
`
`
`
`
`
`
`
`III}!IE3!‘iii?£13552asifffiIIIIIH"'EH35,.:!if§E553}tlfffu6353!.‘'53!21332:;I121!
`
`
`
`
`
`
`
`
`
`
`
`
`
`[O3004-8002/SL003733.099]
`
`-48-
`
`7/31/00
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 179 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 179 of 1442
`
`

`
`
`
`
`Tb‘
`-.
`. "
`.
`';t1;°rf=_1 If for L\r1:m\.u. pro usc ONLY
`' 0;; NOT get mailed to the applicant.
`K
`
`NOTICE op F11,ING/ CL.-‘LEVI FEE(S) D?
`(CALCU"LAT[ON SHEET)
`
`_—o....
`
`-
`
`*
`
`
`
`A.PPLIC.~1TIO;‘<'NU1VIBER: %
`
`Total Fee Calculation
`
`
`
`F.‘
`
`I:
`
`TA."
`
`SE. E3117?’
`
`'7 E:
`
`r\_
`.
`
`75*
`676.50 -=
`we
`T
`T
`25/
`/3
`_m
`}
`52%»
`-%
`M =
`"
`'3 ~—L ‘ 1 75% J
`= 3/2 re
`
`
`
`30,,
`
`.0__
`
`-n H;
`
`‘('1
`-~
`-Cw”.
`
`53.21": Filing F::
`-
`-
`1C-.1.’ L'3.:'.._. /‘O
`'
`L:d:_::::.’::.: C!~-'-—~- ;.3
`
`.‘v .1. Dc: C‘ "' P.':::-
`
`St.::.'.;:;:
`
`F
`Total
`Number
`C1‘ Cmfc
`:: (‘:31-...,
`E___J
`\
`__
`--
`5...;
`__
`rt:
`
`5
`1w
`_
`C:
`5
`
`30!/IO!
`
`g
`
`S?
`
`-:0 =
`r
`_
`‘L "'
`
`‘i
`
`K
`
`T f.%y6ffi
`
`
`
`/36)§\-J‘
`
`_
`=
`
`(4.3% as
`
`531:: Tr.:...Ia:cu
`
`13:;
`
`TOTAL FE‘ CU.CL'I_.A"'I
`
`'
`
`F::: CL: upon
`
`LL: :.::u:« L-
`
`
`
`B”‘“*”CE D“
`
`= 5
`
`Patsnt E,x~-—.:m,_:' :
`
`FOR“ °‘PE‘R4‘~M-01 (Rev, 11/97)
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 180 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 180 of 1442
`
`

`
`
`
`
`
`
`
`
`
`I
`
`Application or Docke Number
`
`PATENT APPLICATION FEE DETERMINATION RECORD
`
`Effective December 29, 1999
`CAWI3 A3 F”-ED ' PART I
`Column 1
`
`Column 2
`
`f
`C‘ T’
`sALL ENTITY
`
`” f
`oTI-IER THAN
`OR sMA|_|_ ENTITY
`
`
`
`
`
`
`NUMBER EXTRA v
`T_—_I_’_‘ FILED
`I:
`
`INDEPENDENT CLAIMS' L{
`
`MULTIPLE DEPENDENT CLAIM PRESENT
`
`* If the difference in column 1 is less than zero, enter “O” in column 2
`
`CLAIMS AS AMENDED - PART II
`Column 2
`
`OTHER THAN
`SMALL ENTITY OR SMALL ENTITY
`
`Column 3
`
`NUMBER
`PRESENT
`
`PREVIOUSLY
`ExmA
`PAID FOR‘
`
`I
`E I"
`I.II
`21%
`FIRST PRESEN ‘
`I IN OF MULTIPLE DEPENDET CLAIM
`
`REMAINING
`AFTER
`AMENDMENT
`
`AMENDMENTA i. Q.
`
`
`ADD"
`TIONAL
`
`
`
`OR ADDIT. FEEU
`
`TOTAL
`
`
`
`UIII
`
`
`
`AUDI‘
`TIONAL
`
`FEE
`
`CLAIMS
`HIGHEST
`
`REMAINING
`NUMBER
`AFTER
`PREVIOUSLY
`AMENDMENT
`PAID FoR
`
`
`
`
`
`AMENDMENT8
`
`
`
`HIGHEST
`NUMBER
`/REVIOUSLY
`PAID FOR
`
`
`
`
`REMAINING
`AFTER
`AMENDMENT
`
`
`AMENDMENTC
`
`_E-f
`'"dePe"de"‘_
`FIRST PRESENTATION OF MULTIPLE DEPENDENT CLAIM
`
`
`It the entry in column 1 is less than the entry in column 2, write “O" in column 3.
`'
`“ If the “Highest Number Previously Paid For" IN THIS SPACE is less than 20, enter "20."
`'''II the “Highest Number Previously Paid For" IN THIS SPACE is less than 3, enter "3."
`The “Highest Number Previously Paid For" (Total or Independent) is the highest number found in the appropriate box in column 1.
`
`
`
`
`
`
`
`FORM PTO-875
`IPR2aHe.«m1=m3 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 181 of 1442
`
`Patent and Trademark omce, u.s. DEPARTMENT OF COMMERCE
`
`RATE
`
`
`
`
`TIONAL
`
`X$I 8:
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 181 of 1442
`
`

`
`.
`
`‘
`
`i,
`
`‘
`
`Page1of2
`
`Vthsi-uNGToN. D.C. 2023i www.uspto.gov
`
`COMMISSIONER FOR PATENTS
`UNITED STATEs PATENT AND TRADEMARK OFFICE
`
`09/629,570
`
`o7_/3 I/2000
`
`FIRSTNAMEDAPPLICANT
`Virgil E. Bourassa
`
`PTOSB/05 (4/93)
`
`.l°5%C§JE|NS CONE LLP
`PATEWEA
`PO BOX 1247
`SEATTLE, WA 98111-1247
`
`.
`FORMALITIES LETTER
`llllllllllllllIllllllllllllIllllllllllllllllllllllllllllllllllllllllllllllllllllllll
`, OC0000000O5422946
`
`Date Mailed: 09/25/2000
`
`NOTICE TO FILE MISSING PARTS OF NONPROVISIONAL APPLICATION
`
`FILED UNDER 37 CFR1.53(b)
`
`Filing Date Granted
`
`An application number and filing date have been accorded to this application. The item(s) indicated below,
`however, are missing. Applicant is given TWO MONTHS from the date of this Notice within which to file all
`required items and pay any fees required below to avoid abandonment. Extensions of time may be obtained by
`filing a petition accompanied by the extension fee under the provisions of 37 CFR 1.136(a).
`
`o The statutory basic filing fee is missing.
`Applicant must submit $ 690 to complete the basic filing fee and/or file a small entity statement claiming
`such status (37 CFR 1.27).
`
`o Total additional claim fee(s) for this application is $816.
`- $504 for 28 total claims over 20.
`