holes is odd then the routine continues at block 1913, else the routine returns.
`
`In block
`
`1913, the routine invokes the fill hole routine and then returns.
`
`Figure 20 is a flow diagram illustrating the processing of the handle port
`
`connection call routine in one embodiment. This routine is invoked when an external
`
`5 message is received then indicates that the sending process wants to connect to one hole of
`this process.
`In decision block 2001, if the number of holes of this process is greater than
`
`zero, then the routine continues at block 2002, else the routine continues at block 2003.
`
`In
`
`decision block 2002, if the sending process is not a neighbor, then the routine continues at
`
`10
`
`In block 2003, the routine sends a port
`block 2004, else the routine continues to block 2003.
`connection response external message (i. e., port_connection_resp) to the sending process that
`indicates that it is not okay to connect to this process. The routine then returns.
`In block
`
`2004, the routine sends a port connection response external message to the sending process
`
`that indicates that is okay to connect this process.
`
`In decision block 2005, if the sending of
`
`the message was successful,
`
`then the routine continues at block 2006, else the routine
`
`15
`
`continues at block 2007.
`
`In block 2006, the routine invokes the add neighbor routine to add
`
`the sending process as a neighbor of this process and then returns.
`
`In block 2007,the routine
`
`hangs up the external connection.
`
`In block 2008, the routine invokes the connect request
`
`routine to request that a process connect to one of the holes of this process. The routine then
`
`returns.
`
`20
`
`Figure 21 is a flow diagram illustrating the processing oi‘ the fill hole routine in
`
`one embodiment. This routine is passed an indication of the requesting process.
`
`If this
`
`process is requesting to fill a hole, then this routine sends an internal message to other
`
`processes. If another process is requesting to fill a hole, then this routine invokes the routine
`
`to handle a connection port search’ request.
`
`In block 2101,
`
`the routine initializes a
`
`25
`
`connection port search statement internal message (1'.e., connection_port_search_stmt).
`
`In
`
`decision block 2102, if this process is the requesting process, then the routine continues at
`
`block 2103, else the routine continues at block 2104.
`
`In block 2103, the routine distributes
`
`the message to the neighbors of this process through the internal ‘ports and then returns.
`block 2104, the routine invokes the handle connection port search routine and then returns.
`
`In
`
`30
`
`Figure 22 is a flow diagram illustrating the processing of the internal dispatcher
`
`routine in one embodiment. This routine is passed an indication of the neighbor who sent the
`
`internal message.
`
`In block 2201, the routine receives the internal message. This routine
`
`|o3oo4.sooi/sLoo3733.io6]
`
`-36-
`
`7/31/00
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 712 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 712 of 1442
`
`

`
`identifies the message type and invokes the appropriate routine to handle the message.
`
`In
`
`block 2202, the routine assesses whether to change the estimated diameterof the broadcast
`
`channel based on the information in the received message.
`
`In decision block 2203, if this
`
`process is the originating process of the message or the message has already been received
`
`(i. e., a duplicate), then the routine ignores the message and continues at block 2208, else the
`
`routine continues at block 2203A.
`
`In decision block 2203A, if the process is partially
`
`connected, then the routine continues at block 22038, else the routine continues at block
`
`2204.
`
`In block 2203B, the routine adds the message to the pending connection buffer and
`
`continues at block 2204.
`
`In decision blocks 2204-2207, the routine decodes the message
`
`type and invokes the appropriate routine to handle the message. For example, in decision
`
`block 2204, if the type of the message is broadcast statement (i. e., broadcast_strnt), then the
`
`routine" invokes the handle broadcast message routine in block 2205. After invoking the
`
`appropriate handling routine, the routine continues at block 2208.
`
`In decision block 2208, if
`
`the partially connected buffer is full,
`
`then the routine continues at block 2209, else the
`
`routine continues at block 2210.
`
`The broadcaster component collects all
`
`its internal
`
`messages in a buffer while partially connected so that it can forward the messages as it
`
`connects to new neighbors.
`If, however, that buffer becomes full, then the process assumes
`that it is now fully connected and that the expected number of connections was too high,
`
`because the broadcast channel is now in the small regime.
`
`In block 2209, the routine invokes
`
`the achieve connection routine and then continues in block 2210.
`
`In decision block 2210, if
`
`the application program message queue is empty, then the routine returns, else the routine
`
`continues at block 2212.
`
`In block 2212, the routine invokes the receive response routine
`
`passing the acquired message and then returns. » The received response routine is a callback
`
`routine of the application program.
`
`- Figure 23 is a flow diagram illustrating the processing of the handle broadcast
`
`message routine in one embodiment. This routine is passed an indication of the originating
`
`process, an indication of the neighbor who sent the broadcast message, and the broadcast
`
`message itself.
`
`In block 2301, the routine performs the out of order processing for this
`
`A 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.
`(03004-8001/SLO03733. 106]
`
`In decision block 2303, if a newly connected neighbor is waiting
`-37-
`7/31/00
`
`20
`
`25
`
`30
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 713 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 713 of 1442
`
`

`
`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
`
`5
`
`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
`
`10
`
`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
`
`is
`
`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
`
`20
`
`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
`
`a condition check‘ message (i.e.,
`the routine generates
`In block 2606,
`returns.
`condition_check) that includes a list of this process’ neighbors.
`In block 2607’, the routine
`
`sends the message to the requesting neighbor.
`
`25
`
`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
`
`connection call external message to the prospective neighbor and adds the prospective
`
`neighbor as a neighbor.
`
`In decision block 2701, if the prospective neighbor is already a
`
`30
`
`neighbor, then the routine retums, 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
`
`[03004-800]/Sb003733.l06]
`
`.38.
`
`.,,“,oo
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 714 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 714 of 1442
`
`

`
`continues at block 2706.
`
`In block 2704, the routine sends a port connection call external
`
`message (i. e., port_connection_call) 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
`
`5
`
`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
`
`10
`
`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"
`
`15
`
`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
`
`20
`
`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
`
`25
`
`edge proposal call external message (i. e., edgeJ)roposal_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
`
`acceptable to the requesting process,
`
`then the routine continues at block 2809, else the
`
`routine continues at block 2812.
`
`In block 2809, the routine reserves the edge between this
`
`30
`
`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
`
`(03004-8001/SLO03733.l06]
`
`-3 9-
`
`-,,3,,oo
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 715 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 715 of 1442
`
`

`
`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.,
`
`5
`
`connection_edge_search_response) to the sending neighbor indicating acknowledgement and
`
`then returns. The graphs are sensitive to parity. That is, all possible paths startingfrom 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.
`
`10
`
`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
`
`15
`
`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
`
`20
`
`routine to connect to the requesting process.
`
`In decision block 2906, if the invoked routine
`
`In
`was unsuccessful, then the routine continues at block 2907, else the routine retums.
`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.
`
`25
`
`'
`
`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 charmel. This routine is passed the message to be broadcast.
`
`In
`
`decision block 3001, if this process has at least one neighbor, then the routine continues at
`
`block 3002, else the routine retums since it is the only process connected to be broadcast
`
`30
`
`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
`
`[03004-8001/SL003733. 106]
`
`-40-
`
`7/31/00
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 716 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 716 of 1442
`
`

`
`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
`
`5
`
`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 channel.
`
`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
`
`10
`
`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
`
`15
`
`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
`
`20
`
`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.
`
`25
`
`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
`
`block 3302, the routine selects a neighbor that is not involved in the neighbors with empty
`
`30
`
`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
`
`[03004-8001/SL003733. nos]
`
`-4 1 -
`
`7,3 1,00
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 717 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 717 of 1442
`
`

`
`block 3304, the routine invokes the add neighbor routine to add the process that sent the
`
`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
`
`5
`
`decision block 3401, if this process has one hole, then the routine continues at block 3402,
`
`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,
`
`10
`
`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,
`
`then the routine returns, 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., diameter_reset) indicating that the estimated diameter is
`
`15
`
`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_checl<_stmt) with
`
`the list of neighbors to the neighbor who sent the condition double check message and then
`
`I
`
`returns.
`
`From the above description,
`
`it will be appreciated that although specific
`
`20
`
`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
`
`communications on the broadcast channel 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
`
`25
`
`security and not allow an unauthorized user
`
`to connect
`
`to the broadcast charmel.
`
`Accordingly, the invention is not limited except by the claims.
`
`[03004-8001/SLOO3733. 205]
`
`-42-
`
`7/; mo
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 718 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 718 of 1442
`
`

`
`CLAIMS
`
`1.
`
`A computer network for providing a conferencing system for a plurality
`
`of participants, each participant having connections to at least three neighbor participants,
`
`wherein an originating participant sends data to the other participants by sending the data
`
`through each of its connections to its neighbor participants and wherein each participant
`
`‘ sends data that it receives from a neighbor participant to its other neighbor participants.
`
`2.
`
`The computer network of claim 1 wherein each participant is connected
`
`to 4 other participants.
`
`3.
`
`The computer network of claim 1 wherein each participant is connected
`
`to an even number of other participants.
`
`4.
`
`The computer network of claim 1 wherein the network is m-regular,
`
`where m is the number of neighbor participants of each participant.
`
`5.
`
`The computer network of claim 1 wherein the network is nr-connected,
`
`where m is the number of neighbor participants of each participant.
`
`6.
`
`The computer network of claim 1 wherein the network is m-regular and
`
`m-connected, where m is the number of neighbor participants of each participant.
`
`7.
`
`8.
`
`peer connections.
`
`17
`
`I8
`
`The computer network of claim 1 wherein all the participants are peers.
`
`The computer network of claim 1 wherein the connections are peer-to-
`
`|o3oo4-soor /suoo3733. I06]
`
`-4 3 -
`
`7/31/00
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 719 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 719 of 1442
`
`

`
`19
`
`20
`
`21
`
`22
`
`23
`
`24
`
`25
`
`26
`
`27
`
`28
`
`29
`
`30
`
`31
`
`32
`
`33
`
`34
`
`35
`
`36
`
`37
`
`38
`
`39
`
`40
`
`9.
`
`The computer network of claim 1 wherein the connections are TCP/IP
`
`connections.
`
`10.
`
`The computer network of claim 1 wherein each participant is a process
`
`executing on a computer.
`
`11.
`
`The computer network of claim 1 wherein a computer hosts more than
`
`one participant.
`
`12.
`
`The computer network of claim 1 wherein each participant sends to each
`
`of its neighbors only one copy of the data.
`
`13.
`
`The computer network of claim 1 wherein the interconnections of
`
`participants form a broadcast channel for a topic of interest.
`
`14.
`
`A distributed conferencing system comprising:
`
`a plurality of broadcast channels, each broadcast channel for conducting
`
`a conference;
`
`and
`
`means for identifying a broadcast charmel for a conference of interest;
`
`means for connecting to the identified broadcast channel.
`
`15.
`
`The distributed conferencing system of claim 14 wherein means for
`
`identifying a conference of interest includes accessing a web server that maps conferences to
`
`corresponding broadcast channel.
`
`16.
`
`The distributed conferencing system of claim 14 wherein a broadcast
`
`channel
`
`is
`
`formed by attendee computers and a speaker computer
`
`that are each
`
`interconnected to at least three other computers.
`
`[D3004-800!/SlD03733.l06]
`
`-44-
`
`7/31/00
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 720 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 720 of 1442
`
`

`
`mi.
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 721 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 721 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 722 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 722 of 1442
`
`

`
`
`
`IPR2016-00726 -ACT
`Ex. 1102, p. 723 of 1
`
`ON, EA, TAKE-TWO, 2K, ROCKSTAR,
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 723 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 724 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 724 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 725 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 725 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 726 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 727 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 728 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 728 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 729 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 730 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 730 of 1442
`
`

`
`
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 731 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 731 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 732 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 732 of 1442
`
`

`
`32.:
`
`+.u::oU
`
`_.e.U
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 733 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 733 of 1442
`
`

`
`(“ r‘uL/vvv-Al Tue/F-V)
`-
`_k.o.zwvxe_DI4s.+«>v-<1._
`'_ C9v\n¢«;{”A'MX.En 90>
`
`Di sfmh-l~</*
`
` EASE“
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 734 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 734 of 1442
`
`

`
`
`
`
`
`Qecex‘ Jcé v3\'an-rfl
`W”:-so gt.
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 735 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 735 of 1442
`
`

`
`| AM Nfigkbor
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 736 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 736 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 737 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 737 of 1442
`
`

`
`S ‘Wait. Z’
`connected
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 738 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 738 of 1442
`
`

`
`Fri I‘?
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 739 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 739 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 740 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 740 of 1442
`
`

`
`1
`
`/0
`
`an --
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 741 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 741 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 742 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 742 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 743 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 743 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 744 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 744 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 745 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 745 of 1442
`
`

`
`V’
`
`Po -( {’S€ou-d/x
`
` ‘Howl l€Cavmecf-,2
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 746 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 746 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 747 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 747 of 1442
`
`

`
`D-‘ski M
`B to or’ cos
`0‘
`
`
`
`
`
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 748 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 748 of 1442
`
`

`
`
`DI'5{‘r§ M (’
`Bfw('.S{
`
`
`
`
`
`{wrwv NnJ.%k50‘/‘
`
`[:2 z‘j_
`
`
`I’; \\ r\U3\\
`-sale ‘D
`
`
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 749 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 749 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 750 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 750 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 751 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 751 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 752 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 752 of 1442
`
`

`
`.y
`
`03
`
`I
`
`reA.e.n»e6
`0? 'Crav~'fll:-nigh’-9
`
`\
`
`0‘!
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 753 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 753 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 754 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 754 of 1442
`
`

`
`
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 755 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 755 of 1442
`
`

`
`
`.514
`e so
`
`uJ'’‘-’¥3>»‘mf‘3‘§’ 8:
`
`. 03;
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 756 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 756 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 757 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 757 of 1442
`
`

`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 758 of 1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 758 of 1442
`
`

`
`
`
`http://www.faqs.org/rfcs/rfc 1 832.html
`
`01/29/2002--page 1
`
`Internet RFC/STD/FYIIBCP Archives
`
`
`
`RFC 1832
`
`[Index | Search | What's New I Comments | Help]
`
`Network Working Group
`Request for Comments: 1832
`Category: Standards Track
`
`R. Srinivasan
`Sun Microsystems
`August 1995
`
`XDR: External Data Representation Standard
`
`Status of this Memo
`
`This document specifies an Internet standards track protocol for the
`Internet community, and requests discussion and suggestions for
`improvements.
`Please refer to the current edition of the "Internet
`Official Protocol Standards" (STD l)
`for the standardization state
`and status of this protocol. Distribution of this memo is unlimited.
`
`ABSTRACT
`
`This document describes the External Data Representation Standard
`(XDR) protocol as it is currently deployed and accepted.
`
`TABLE OF CONTENTS
`
`INTRODUCTION
`IL.
`2. BASIC BLOCK SIZE
`3. XDR DATA TYPES
`3.1 Integer
`3.2 Unsigned Integer
`3.3 Enumeration
`,
`3.4 Boolean
`3.5 Hyper Integer and Unsigned Hyper Integer
`3.6 Floating—point
`3.7 Double-precision Floating-point
`3.8 Quadruple—precision Floating-point
`3.9 Fixed-length Opaque Data
`3.10 Variable—1ength Opaque Data
`3.11 String
`3.12 Fixed-length Array
`3.13 Variable—1ength Array
`3.14 Structure
`3.15 Discriminated Union
`3.16 Void
`3.17 Constant
`3.18 Typedef
`
`2
`2
`3
`3
`4
`4
`4
`4
`5
`6
`7
`8
`8
`9
`10
`10
`11
`11
`12
`12
`13
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex.1102,p.759of1442
`
`IPR2016-00726 -ACTIVISION, EA, TAKE-TWO, 2K, ROCKSTAR,
`Ex. 1102, p. 759 of 1442
`
`

`
`http://www.faqs.org/rfcs/rfc1832.htm1
`
`O1/29/2002--page 2
`
`3.l9 Optional-data
`3.20 Areas for Future Enhancement
`4. DISCUSSION
`5. THE XDR LANGUAGE SPECIFICATION
`5.1 Notational Conventions
`
`5.2 Lexical Notes
`
`5.3 Syntax Information
`5.4 Syntax Notes
`6. AN EXAMPLE OF AN XDR DATA DESCRIPTION
`7. TRADEMARKS AND OWNERS
`APPENDIX A: ANSI/IEEE Standard 754-1985
`APPENDIX B: REFERENCES
`
`Security Considerations
`Author's Address
`
`1.
`
`INTRODUCTION
`
`14
`15
`15
`17
`17
`
`17
`
`18
`19
`20
`21
`22
`24
`
`24
`24
`
`XDR is a standard for the description and encoding of data.
`useful for transferring data between different computer
`architectures, and has been used to communicate data between such
`diverse machines as the SUN WORKSTATION*, VAx*,
`IBM—PC*, and Cray*.
`XDR fits into the ISO presentation layer, and is roughly analogous in
`purpose to X.409,
`ISO Abstract