Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 1 of 549 PageID #: 39777
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 1 of 549 PagelD #: 39777
`
`EXHIBIT 67
`EXHIBIT 67
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 2 of 549 PageID #: 39778
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 2 of 549 PagelD #: 39778
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 3 of 549 PageID #: 39779
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 3 of 549 PagelD #: 39779
`
`EXHIBIT 68
`EXHIBIT 68
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 4 of 549 PageID #: 39780
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 4 of 549 PagelD #: 39780
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 5 of 549 PageID #: 39781
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 5 of 549 PagelD #: 39781
`
`EXHIBIT 69
`EXHIBIT 69
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 6 of 549 PageID #: 39782
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 6 of 549 PagelD #: 39782
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 7 of 549 PageID #: 39783
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 7 of 549 PagelD #: 39783
`
`EXHIBIT 70
`EXHIBIT 70
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 8 of 549 PageID #: 39784
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 8 of 549 PagelD #: 39784
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 9 of 549 PageID #: 39785
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 9 of 549 PagelD #: 39785
`
`EXHIBIT 71
`EXHIBIT 71
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 10 of 549 PageID #: 39786
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 10 of 549 PagelD #: 39786
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 11 of 549 PageID #: 39787
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 11 of 549 PagelD #: 39787
`
`EXHIBIT 72
`EXHIBIT 72
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 12 of 549 PageID #: 39788
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 12 of 549 PagelD #: 39788
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 13 of 549 PageID #: 39789
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 13 of 549 PagelD #: 39789
`
`EXHIBIT 73
`EXHIBIT 73
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 14 of 549 PageID #: 39790
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 14 of 549 PagelD #: 39790
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 15 of 549 PageID #: 39791
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 15 of 549 PagelD #: 39791
`
`EXHIBIT 74
`EXHIBIT 74
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 16 of 549 PageID #: 39792
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 16 of 549 PagelD #: 39792
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 17 of 549 PageID #: 39793
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 17 of 549 PagelD #: 39793
`
`EXHIBIT 75
`EXHIBIT 75
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 18 of 549 PageID #: 39794
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 18 of 549 PagelD #: 39794
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 19 of 549 PageID #: 39795
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 19 of 549 PagelD #: 39795
`
`EXHIBIT 76
`EXHIBIT 76
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 20 of 549 PageID #: 39796
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 20 of 549 PagelD #: 39796
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 21 of 549 PageID #: 39797
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 21 of 549 PagelD #: 39797
`
`EXHIBIT 77
`EXHIBIT 77
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 22 of 549 PageID #: 39798
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 22 of 549 PagelD #: 39798
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 23 of 549 PageID #: 39799
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 23 of 549 PagelD #: 39799
`
`EXHIBIT 78
`EXHIBIT 78
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 24 of 549 PageID #: 39800
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 24 of 549 PagelD #: 39800
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 25 of 549 PageID #: 39801
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 25 of 549 PagelD #: 39801
`
`EXHIBIT 79
`EXHIBIT 79
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 26 of 549 PageID #: 39802
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 26 of 549 PagelD #: 39802
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 27 of 549 PageID #: 39803
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 27 of 549 PagelD #: 39803
`
`EXHIBIT 80
`EXHIBIT 80
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 28 of 549 PageID #: 39804
`
`Appr. No. 091629,042
`rrney Docket No. 030048009US. ,^/
`/
`.
`-4-'//
`--r-:r )< ' '?-
`Express Mail Label EV 335522411 US
`t
`t /,4
`q /1t<
`')
`/.r{ * -/e}\
`'{QE ).1"
`;:-i=-a-t-
`-
`;
`"1,\
`/u
`nnnNT4frz
`{ * \$ $$ f;
`IN THE UNITED STATES PATENT AND TRADEMARK OFFICE Ch,,
`7d/.4
`\r,* #
`7d?i
`|
`\,.t
`#
`,
`I Exelvm.mn: Bn-aorEy E. Enprvnx J
`r\l.Sil"pLIcArIoN oF: Fnso B. Hotr il.qt
`\r-
`Yk+.lJFl
`AppLrcRrroNNo.: 091629,042
`I AnrUlur: 2153
`Jurv 31, 2000
`Fnpo:
`| Coxr. No: 4750
`FOR: DISTRIBUTED GAME ENVIRONMENT
`
`tt
`
`r
`
`Amendment Under 37 C.F.R I 1.111
`
`RECHIVED
`sEP 1 5 2003
`
`Technology Center 2100
`
`Commissioner for Patents
`P.O. Box 1450
`Alexandria, V A 223 1 3 - 1450
`
`Sir.
`
`In response to the Office Action dated May 21,2003, please amend the above-identified
`
`agplication as follows :
`
`Amendments to the Claims are reflected in the listing of the Claims which begins on
`
`page2of this paper.
`
`Amendments to the Drawings begin on page 6 of this paper and include attached
`
`drawing sheets.
`
`Remarks/Arguments begin on page 7 of this paper.
`
`09/1118003 s$flYA$I1 00000005 096e904e
`0l F[:1t01
`
`84.00 0F
`
`[03004.8009/0A 2003-05-21 RESPONSE.DOCI
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 29 of 549 PageID #: 39805
`
`AFDI: No. 091629,042
`
`Amendments to the Claims
`
`, .Jrney Docket No. 030048009US
`
`This listing of claims will replace
`
`all prior
`
`versions, and listings, of claims in the
`
`application:
`
`l.
`(Currently amended) A computer network for providing a game environment 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;furtlg1
`
`wherein the network is {n-regular. where m is the exact number of neighbor participants of each
`
`participant and further wherein the number of participants is at least two greater than m thus
`
`I\
`
`c\
`
`resulting in a non-complete graph.
`
`2.
`
`(Original) The computer network of claim I wherein each participant is connected
`
`to 4 other participants
`
`3.
`
`(Original) The computer network of claim I wherein each participant is connected
`
`to an even number of other participants.
`
`(Cancelled)
`
`rl ./
`4 ,S
`
`(Original) The computer network of claim I wherein the network is m-connected,
`
`I
`where m is the number of neighbor participants of each participant.
`
`[03004.8009/0A 200345-2,t R ESPONS E. DOCI
`
`2
`/1 n
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 30 of 549 PageID #: 39806
`
`Appl. No.091629,042
`
`f (Original) The computer network of claim I wherein the network is m-regular and
`
`{ .orney Docket No. 030048009US
`
`m-connected, where m is the number of neighbor participants of each participant.
`
`?7
`
`'tfl 4
`
`(Original) The computer network of claim 1 wherein the connections are TCPIP
`
`connectlons.
`
`cl
`'-/
`
`(Original) The computer network of claim I wherein each participant is a process
`
`f
`executing on a computer.
`
`,0I
`/(
`one participant. t
`
`(Original) The computer network of claim 1 wherein a computer hosts more than
`
`il,^
`"W
`of its neighbors only one copy of the data.
`
`(Original) The computer network of claim 1 wherein each participant sends to each
`
`,rLIt
`y
`
`(Original) The computer network of claim I wherein the interconnections of
`
`participants form a broadcast channel for a game of interest.
`
`[03004.8009/0A 2003-05-21 RESPONSE.DOCI
`
`lA
`
`(Original) The computer network of claim I wherein all the participants are peers.
`
`
`4t
`,fa
`,
`(Original) The computer network of claim I wherein the connections are peer-to-
`nl /
`i l\ f, p""rconnections.
`l/1, rrh
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 31 of 549 PageID #: 39807
`
`AppL. No. 091629,042
`
`, ,rrney Docket No. 030048009US
`
`Ifi
`
`(Cunently Amended) A distributed game system comprising:
`
`a plurality of broadcast channels, each broadcast channel for playing a game-each
`
`-
`
`of the broadcast channels for providing game information related to said game to 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
`
`where m is the exact number of neighbor participants of each participant and further wherein the
`
`\
`t/-r\ .
`I i, \t number of participants is at least two greater than m thus resulting in a non-complete graph;
`V" NA\-
`S M
`
`means for identifying a broadcast channel for a game of interest; and
`
`means for connecting to the identified broadcast channel.
`
`.ltq
`(z
`,{
`(Original) The distributed game system of claim {l,ffr.r.in means for identifiing a
`\
`game of interest includes accessing a web server that maps games to corresponding broadcast
`
`channel.
`
`fformed by player computers that are each interconnected to at least three other computers.
`
`\9
`(Original) The distributed game system of claim \wherein a broadcast channel is
`
`(fi'
`
`participants. each participant having connections to exactly four neighbor participants. wherein an
`
`originatingparticipant sends data to the other participants by sending the data through each of its
`
`[03004.8009/0A 200&05-21 RESPONSE.DOCI
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 32 of 549 PageID #: 39808
`
`Appl.No.ost62s,o42 ld
`
`rq
`
`[$
`
`h{,}r$DocketNo.030048ooeus
`
`one DartlclDant.
`
`. rl
`lY19( (New) A computer networ
`participants, each participant having connections to at least tkee neighbor participants. wherein
`
`ing a game environment for a plurality of
`
`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 partjcipants. further wherein the network is m-
`
`regular and the network forms an incomplete graph.
`
`lo3oo4.8ooe/oA 2003-05-21 REspoNsE.Docl
`
`Ai
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 33 of 549 PageID #: 39809
`
`Appl. No. 091629,042
`
`, ,in.y Docket No. 030048009US
`
`Amepdments to the Drawinss
`
`The attached sheets of drawings include changes to Figures 6 and 7. These sheets, which
`
`include Figures 6 and 7 , replace the original sheets including Figures 6 and 7, respectively.
`
`Attachment: Replacement Sheets
`
`lo3oo4.8oo9/oA 2oo3-0+21 RESpoNsE.Docl
`
`6
`
`N
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 34 of 549 PageID #: 39810
`
`Appf. No. 091629,042
`
`, rroe! Docket No. 030048009US
`
`REMARKS/ARGUMENTS
`
`Reconsideration and withdrawal of the rejections set forth in the Office Action dated May
`
`21,2003 are respectfully requested. In that Office Action, the Examiner objected to the drawings
`
`as failing to include certain reference signs mentioned in the description. Two replacement sheets
`
`for Figures 6 and 7 are submitted herewith with the appropriate reference signs included. The
`
`Examiner is requested to approve these replacement sheets for entry into this application.
`
`Turning to the rejection of the claims based upon the prior art, the Examiner rejects
`
`Claims L4-16 under 35 U.S.C. $ 1020) being anticipated by Microsoft's Internet Gaming Zone;
`
`as well as being in public use more than one year prior to the filing date of this application as
`
`evidenced by the Internet Gaming Zone (IGZ) article. The Examiner also rejects Claims 1-13 as
`
`being obvious over the Alagar et al. paper.
`
`The Cited Prior Art:
`
`The IGZ article is a press release detailing the Internet Gaming Zone by Mcrosoft. As
`
`detailed in the press release, the IGZ article describes a system that allows for multi-player gaming
`
`via the Internet. There is however no indication as to how such a network system is implemented.
`
`The Alagar reference relates to a reliable mobile wireless network. The term "mobile
`
`wireless network" as trsed in Alagar means that the network does not contain any static support
`
`stations. The example given in the Alagar reference is of a military theater where each of the
`
`nodes (troops, tanks, etc. . . .) are mobile and can communicate with each other using wireless
`
`transmissions. Because of the mobile nature of the networlg there are frequent changes in link
`
`connectivity between various nodes. The mobile wireless network, because it does not contain
`
`any static support stations, is dissimilar to the Internet or even cellular telephony.
`
`[03004.8009/0A 2003-05-21 RESPONSE.DOC]
`
`7
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 35 of 549 PageID #: 39811
`
`Appl. No. 091629,042
`
`, "rrney Docket No.030048009US
`
`Because of the mobile nature of the network nodes, the Alagar reference teaches that two
`
`mobile nodes are "neighbors" if they can hear each other. Each host detects its neighbors by
`
`periodically broadcasting a probe message. A host that hears a probe message sends an
`
`acknowledgement to the probing host. Every host maintains a list of neighbors and periodically
`
`updates the list based on acknowledgements received. When two hosts become neighbors, a
`
`wireless link is established between them, and they execute a handshake procedure. As part of the
`
`handshake procedure, they update their list ofneighbors.
`
`Because of the mobile nature of the nodes, it is not uncommon that the link may be
`
`disconnected between two nodes. Because of this, messages are transmitted from node to node
`
`using a flooding methodology that involves transmitting the message to every node in the
`
`network. Thus, to broadcast a message, a mobile node transmits the message to all of its
`
`neighbors. On receiving a broadcast message, an intermediate mobile host retransmits the
`
`message to all of its neighbors. The Alagar reference also provides a methodology for limiting the
`
`amount of retransmission of messages. This is accomplished by means of an acknowledgement
`
`protocol.
`
`The Examiner's Arguments:
`
`The Examinertejects Claims 14-16 under 35 U.S.C. $ 102 as being anticipated by the IGZ
`
`article. The Examiner argues that the IGZ articlediscloses a plurality of broadcast channels and
`
`means for broadcasting a broadcast channel for topics of interest.
`
`Next, the Examiner rejects Claims l-13 under 35 U.S.C. $ 103 as being obvious over the
`
`Alagar et al. reference. The Examiner argues that Alagar discloses a plurality of nodes that form a
`
`network and that the data is sent to the other participants by a flooding technique.
`
`Applicants respectfully request reconsideration.
`
`[03004.8009/0A 2003-05-21 RESPONSE.DOC]
`
`8
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 36 of 549 PageID #: 39812
`
`Appl. No.091629,042
`
`Jrney Docket No. 030048009US
`
`Annlicants' Amendments and Arguments:
`Applicants have significantly amended independent Claims I and 14. In addition, new
`
`independent Claims 17 and 19 have been added which applicants believe should be allowable over
`
`the cited prior art in view of the remarks set forth below. In view of the substantial amendments
`
`made to Claim 14 to include all of the limitations of Claim 1, the arguments will be primarily
`
`directed towards the Alagar reference which was used to reject Claims l-13.
`
`First, one important aspect of the Alagar reference is that the flooding protocol disclosed
`
`in Alagar dictates that when a node receives a message, that node will rebroadcast that message to
`
`all of its neighbors. See Alagar at page 239, column l, lines 13-15. Specifically, the Alagar
`
`reference at page 239, column 2, lines 7-23 dictates that whenever a host (i.e., node) receives a
`
`message, that message is broadcast to all of its neighbors.
`In contrast, the present claimed invention of Claim I dictates and requires that each
`
`participant only rebroadcasts received messages to its neighbors other than the neighbor from
`
`which the node received the message. The Alagar reference requires a larger number of messages
`
`to be broadcast. For example, if m is the number of nodes and N is the number of neighbors for
`
`each node, then the total number of messages is m x N.
`
`In contrast, bj limiting the rebroadcast to "other neighbors," this reduces the number of
`
`messages to be broadcast to (m-l)N + 1. For large networks, the saved bandwidth can be
`
`significant. For this sole reason alone, Claim I has a requirement of "other neighbors" which is
`
`not fairly shown in the Alagar reference. Therefore, Claim I and all dependent claims therefrom
`
`are in condition for allowance.
`
`Secondly, the Alagar reference teaches the indiscriminant linking with neighbors regardless
`
`of the number of total neighbors that are capable of being connected. For example, Alagar
`
`[03004.8009/0A 2003-0$21 RESPONSE.DOCI
`
`I
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 37 of 549 PageID #: 39813
`
`Appl. No. 091629,042
`
`, rrney Docket No. 030048009US
`
`teaches that the definition of a "neighbor" is any two mobile hosts that can "hear" each other. See
`
`Alagar at page 238, column 1, lines 5-6. In other words, there is no "regulanty" to the network
`
`formed by Alagar because each of the nodes can link to as few as one neighbor or a potentially
`
`extremely large number of neighbors. The only limitation is that the node will link and classify as
`
`a neighbor any other node that is within hearing distance. This is precisely the opposite of the
`
`amended claimed invention. Claim I as amended requires that each participant in the network
`
`connects to and forms a neighbor bond to exactly an m number of neighbors. Independent claims
`
`14 and l7 contain similar limitations.
`
`Figure 1 of the Alagar reference is deceiving in that it coincidentally shows a 4-regular
`
`network. However, that is not the typical situation as is clear from a careful review of the Alagar
`
`reference. Column I of page 238 of the Alagar reference clearly indicates that there is in fact
`
`nonregularity in a computer network formed because the number of neighbors is not set at a
`
`predetermined number, but rather based upon the particular encountered terrain of the mobile
`
`nodes.
`
`Claim I as amended requires that the computer network be m regular at substantially all
`
`times where there are not new nodes entering or leaving the network. Furthermore, Claim 17
`
`requires that the netldork is "in a stable 4-regular state." For this reason, the claims are allowable
`
`over the cited prior art.
`
`Third, and yet another independent reason for allowing the claims, as amended, over the
`
`Alagar patent, is that the claims as amended now require that the computer network so formed is
`not a "complete graph." A complete graph is a network that is characterized by N: m * l. A
`
`"complete graph" in graph theory is that each node has a connection to every other node in the
`
`network. Thus, Figure I of the Alagar reference shows a complete graph. Each of the nodes has
`
`[03004.8009/0A 2003-05-21 RESPONSE.DOC]
`
`10
`
`{\
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 38 of 549 PageID #: 39814
`
`Appl. No. 091629,042
`
`/rney Docket No. 030048009US
`
`a connection to every other node in the network. Obviously, for a five-node network, this will
`
`require four communications connections for each node.
`
`Claims I and 17 have been amended to recite that there are at least two more nodes than
`
`there are marimum number of neighbors. For example, Claim 17 requires that for a 4-regular
`
`network, there are at least six participants. Claim 1 requires that the parameter N is at least two
`
`greater than the parameter m. Alagar does not show this limitation whatsoever. In fact, the only
`m-regular network shown in Alagar is a complete graph. It is the combination of having a
`
`computer network that is m regular and that is not a complete graph that is patentable over the
`
`Alagar reference. This combination has been shown to produce an efficient and stable computer
`
`network. Claim 19 is specifically directed to this aspect of the invention.
`
`In view of the foregoing, the claims pending in the application comply with the
`
`requirements of 35 U.S.C. $ 112 and patentably define over the prior art. A Notice of Allowance
`
`is, therefore, respectfully requested. If the Examiner has any questions or believes a telephone
`
`conference would expedite prosecution of this application, the Examiner is encouraged to call the
`
`undersigned at (206) 359-6488.
`
`a/ /
`"/ / rc)/ /1
`//
`
`eu1",
`
`Correspondence Address:
`Customer No. 25096
`Perkins Coie LLP
`P.O. Box 1247
`Seattle, Washington 981I l'1247
`(206) 3s9-8ooo
`
`Respectfully submitted,
`
`Perkins Coie LLP
`
`Registration No. 36,878
`
`[03004.8009/0A 2003-05-21 RESPONSE.DOCI
`
`11
`
`N
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 39 of 549 PageID #: 39815
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 39 of 549 PagelD #: 39815
`
`EXHIBIT 81
`EXHIBIT 81
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 40 of 549 PageID #: 39816
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 40 of 549 PagelD #: 39816
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 41 of 549 PageID #: 39817
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 41 of 549 PagelD #: 39817
`
`EXHIBIT 82
`EXHIBIT 82
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 42 of 549 PageID #: 39818
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 42 of 549 PagelD #: 39818
`
`THIS EXHIBIT HAS BEEN
`THIS EXHIBIT HAS BEEN
`REDACTED ,IN ITS ENTIRETY
`REDACTEDIN ITS ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 43 of 549 PageID #: 39819
`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 43 of 549 PagelD #: 39819
`
`EXHIBIT 83
`EXHIBIT 83
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 RFA
`
`
`
`ininiiiiin£|
`
`US007596633B2
`
`US 7,596,633 B2
`(10) Patent No.:
`a2) United States Patent
`Maiet al.
`(45) Date of Patent:
`Sep. 29, 2009
`
`
`(54)
`
`(75)
`
`ISLAND RECOVERYIN A PEER-TO-PEER
`RELAY NETWORK
`
`Inventors: Anthony Mai, San Marcos, CA (US):
`Glen Van Datta, San Diego, CA (US)
`s
`c
`ter Entertai
`t
`Sony Computer Entertainmen
`America Inc., Forster City, CA (US)
`
`(73) Assi
`ssignee:
`
`2001/0046213 A1* 11/2001 Sakoda wo... eeeees 370/328
`2002/0055989 Al
`5/2002 Stringer-Calvert et al.
`2002/0119821 Al
`8/2002 Sen etal.
`2002/0184310 Al
`12/2002 Traversatet al.
`2003/0055892 Al
`3/2003 Huitemaet al.
`2005/0007964 AL*
`1/2005 Falcoetal. ow.. 370/256
`
`(*) Notice:
`
`Subject to any disclaimer, the term ofthis
`patent is extended or adjusted under 35
`U.S.C. 154(b) by 857 days.
`
`FOREIGN PATENT DOCUMENTS
`
`EP
`EP
`
`0913 965
`1 107 508
`
`5/1999
`6/2001
`
`(21) Appl. No.: 10/701,298
`
`(22)
`
`Filed:
`
`Nov. 3, 2003
`
`(65)
`
`Prior Publication Data
`
`US 2005/0086369 Al
`
`Apr. 21, 2005
`
`Related U.S. Application Data
`(60) Provisional application No. 60/513,098,filed on Oct.
`20, 2003.
`
`(51)
`
`(56)
`
`Int. Cl.
`(2006.01)
`GO6F 15/16
`(52) US. CL.
`ceccccsssseesssseee 709/249; 709/224; 709/244,
`370/216
`(58) Field of Classification Search ................. 709/228,
`709/237, 238, 224, 227, 244, 249; 370/216,
`370/230
`See applicationfile for complete searchhistory
`References Cited
`U.S. PATENT DOCUMENTS
`
`,
`
`6,590,865 B1*
`6,920,501 B2*
`7,177,951 B1*
`7,194,654 B2*
`2001/0044339 Al
`
`7/2003 Ibaraki et al.
`......0.0..0.. 370/230
`7/2005 Chuetal. oe 709/228
`
`........... 709/249
`2/2007 Dykeman etal.
`3/2007 Wrayetal. ............ 370/216
`11/2001 Corderoet al.
`
`2300
`
`(Continued)
`OTHER PUBLICATIONS
`
`Song Jiang et al: “FloodTrial : an efficient file search technique in
`unstructured peer-to-peer systems” GLOBECOM 2003, vol. 5. Dec.
`1, 2003,
`pp. 2891-2895, XP010678188.
`PP
`
`(Continued)
`
`Primary Examiner—Ramy Mohamed Osman
`(74) Attorney, Agent, or Firm—Frommer Lawrence & Haug
`LEP: William S. Frommer; ThomasF. Presson
`57
`ABSTRACT
`67)
`
`.
`:
`Methods and apparatus for implementing peer-to-peerrelay.
`In one implementation, a method of island recovery in a peer
`system in a peer-to-peer relay network includes: detecting the
`presence of two or more islands in a peer-to-peer relay net-
`work, wherein each island includesat least one peer system;
`joining two detected islands by connecting a peer system in a
`first island to a peer system in a second island; wherein peer
`systems in different islands are not connected.
`
`16 Claims, 31 Drawing Sheets
`
`START
`
`p— 2305
`
`
`SETi=1
`
`2310
`
`
`SELECT STARTING PEER
`
`
`
`MARK PEERS CONNECTED
`TO STARTING PEERIN
`ISLANDi
`
`UNMARKED PEER
`REMAINS?
`
`NO
`
`DETERMINE NUMBER
`OFISLANDS(i)
`
`
`
`
`
`
`
`2330
`
`2325
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 45 of 549 PagelD #: 39821
`
`US 7,596,633 B2
`Page 2
`
`FOREIGN PATENT DOCUMENTS
`
`WO
`WO
`
`WO 02/11366
`WO 03/069495
`
`2/2002
`8/2003
`
`OTHER PUBLICATIONS
`
`Dutkiewicz E Ed —Institute of Electrical and Electronics Engineers:
`“Impact of transmit range on throughput performance in mobile ad.
`hoc networks” ICC 2001. 2001 IEEE International Conference on
`Communications. Conference Record. Helsinky, Finland,
`Jun.
`11-14, 2001, IEEE International Conference on Communications,
`
`1 of 10, Jun. 11, 2001, pp.
`New York, NY: IEEE, US, vol. vol.
`2933-2937, XP 010553662 ISBN:0-7803-7097-1.
`Kim Y Ed —Association for Computing Machinery: “Simple and.
`Fault—Tolerant Key Agreement by Dynamic Collaborative Groups”
`Proceedings ofthe 77” ACM Conference on Computer and Commu-
`nications Security. CS 2000. Athens, Greece, Nov. 1-4, 2000. ACM
`Conference on Computer and Communications Security, New Your,
`NY: ACM,US,vol. CONF.7, Nov. 1, 2000, pp. 1-38, XP 002951317
`ISBN: 1-58113 -203-4.
`
`* cited by examiner
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 46 of 549 PagelD #: 39822
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 1 of 31
`
`US 7,596,633 B2
`
`FIG. 1
`
`110
`
`SERVER
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 47 of 549 PagelD #: 39823
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 2 of 31
`
`US 7,596,633 B2
`
`FIG. 2
`
`MESSAGE
`
`ADDRESSING DATA
`
`205
`
`210
`
`215
`
`220
`
`230
`
`ORIGIN IDENTIFIER
`
`SEQUENCE VALUE
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 48 of 549 PagelD #: 39824
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 3 of 31
`
`US 7,596,633 B2
`
`FIG. 3
`
`wwoOSo
`
`START
`
`
`
`RECEIVE MESSAGE
`
`305
`
`310
`
`
`
`
`
`USING RELAY RULES 315
`
`
`SELECT CONNECTIONS
`
`
`
`RELAY MESSAGE TO
`SELECTED
`CONNECTIONS
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 49 of 549 PagelD #: 39825
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 4 of 31
`
`US 7,596,633 B2
`
`FIG. 4
`
`START
`
`
`RECORD
`MESSAGE
`RECEIVED
`
`
`
`412
`
`415
`
`420
`
` RECEIVED
`
`
`MESSAGE FROM
`CONNECTION i?
`
`YES
`
`
`
`
`
`
`MESSAGE
`THROUGH
`CONNECTION
`
` RELAY
`
`YES
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 50 of 549 PagelD #: 39826
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 5 of 31
`
`US 7,596,633 B2
`
`FIG. 5
`
`oT Oo O
`
`505
`
`510
`
`515
`
`520
`
`START
`
`CONNECT TO SERVER
`
`
`
`SUBMIT CREATE
`NETWORK REQUEST
`
`
`
`
`
`REGISTER NETWORK
`AT SERVER
`
`SEND CONFIRMATION
`TO PEER
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 51 of 549 PagelD #: 39827
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet6 of 31
`
`US 7,596,633 B2
`
`FIG. 6
`
`START
`
`600
`
`605
`
`610
`
`CONNECT TO SERVER
`
`SELECT GRID
`
`630
`
`RECEIVE ADDRESSES
`OF GRID MEMBERS
`
`SEND JOIN MESSAGE
`TO GRID MEMBERS
`
`RECEIVE JOIN
`RESPONSES
`
`615
`
`620
`
`625
`
`
`
`SELECTCONNECTIONS 635
`
`SELECT CONNECTIONS
`
`
`
`OPEN CONNECTIONS
`
`END
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 52 of 549 PagelD #: 39828
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 7 of 31
`
`US 7,596,633 B2
`
`FIG. 7
`
`~oO So
`
`START
`
`
`
`SELECT FIRST
`POSITIVE RESPONSE
`
`
`
`705
`
`710
`
`715
`
`
`
`
`SELECT LAST POSITIVE
`RESPONSE
`
`
`
`RANDOMLY SELECT
`FROM REMAINING
`POSITIVE RESPONSES
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 53 of 549 PagelD #: 39829
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 8 of 31
`
`US 7,596,633 B2
`
`FIG. 8
`
`[ee]iO iO
`
`805
`
`810
`
`815
`
`820
`
`825
`
`START
`
`NEW PEER SELECTS
`NEGATIVE RESPONSE
`
`NEW PEER SENDS
`FORCE CONNECTION
`REQUEST
`
`RECIPIENT PEER
`SELECTS CONNECTION
`TO CLOSE
`
`CONNECTION
`
`CLOSE EXISTING
`
`CONNECTION
`
`OPEN NEW
`
`END
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 54 of 549 PagelD #: 39830
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 9 of 31
`
`US 7,596,633 B2
`
`cooO ©
`
`FIG. 9
`
`START
`
`DISCONNECTION
`
`SEND CONNECTION
`AVAILABLE MESSAGE
`
`
`
`RELAY CONNECTION
`AVAILABLE MESSAGE
`THROUGH GRID
`
`RECEIVE CONNECTION
`AVAILABLE
`RESPONSES
`
`SELECT CONNECTION
`
`OPEN CONNECTION
`
`END
`
`905
`
`910
`
`915
`
`920
`
`925
`
`930
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 55 of 549 PagelD #: 39831
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 10 of 31
`
`US 7,596,633 B2
`
`FIG. 10
`
`
`SEND PING MESSAGE
`
`TO CONNECTED
`PEERS
`
`
`
`
`
`RESPONSES TO PING
`MESSAGE
`
` START 1005
`
` EVALUATE
`
`
`
`
`DISCONNECT FROM
`CONNECTIONS WITH
`
`FAILED RESPONSES
`
`1010
`
`1015
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 56 of 549 PagelD #: 39832
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 11 of 31
`
`US 7,596,633 B2
`
`FIG. 11
`
`1105,
`
`1110
`
`SERVER
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 57 of 549 PagelD #: 39833
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 12 of 31
`
`US 7,596,633 B2
`
`FIG. 12
`
`= = ©io
`
`1110
`
`SERVER
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 58 of 549 PagelD #: 39834
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 13 of 31
`
`US 7,596,633 B2
`
`FIG. 13
`
`1105,
`
`1110
`
`SERVER
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 59 of 549 PagelD #: 39835
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 14 of 31
`
`US 7,596,633 B2
`
`FIG. 14
`
`
`
`1110
`
`SERVER
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 60 of 549 PagelD #: 39836
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 15 of 31
`
`US 7,596,633 B2
`
`FIG. 15
`
`1105,
`
`1105,
`
`1105,
`
`1110
`
`SERVER
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 61 of 549 PagelD #: 39837
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet16 of 31
`
`US 7,596,633 B2
`
`FIG. 16
`
`
`
`1110
`
`SERVER
`
`

`

`Case 1:16-cv-00454-RGA Document 474-1 Filed 04/24/18 Page 62 of 549 PagelD #: 39838
`
`U.S. Patent
`
`Sep. 29, 2009
`
`Sheet 17 of 31
`
`US 7,596,633 B2
`
`FIG. 17
`
`1105,
`
`1105,
`
`1105,
`
`