Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 1 of 116 PageID #: 33044
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 1 of 116 PagelD #: 33044
`
`EXHIBIT A-1
`EXHIBIT A-1
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 2 of 116 PageID #: 33045
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 2 of 116 PagelD #: 33045
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 3 of 116 PageID #: 33046
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 3 of 116 PagelD #: 33046
`
`EXHIBIT A-2
`EXHIBIT A-2
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 4 of 116 PageID #: 33047
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 4 of 116 PagelD #: 33047
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 5 of 116 PageID #: 33048
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 5 of 116 PagelD #: 33048
`
`EXHIBIT A-3
`EXHIBIT A-3
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 6 of 116 PageID #: 33049
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 6 of 116 PagelD #: 33049
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 7 of 116 PageID #: 33050
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 7 of 116 PagelD #: 33050
`
`EXHIBIT A-4
`EXHIBIT A-4
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 8 of 116 PageID #: 33051
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 8 of 116 PagelD #: 33051
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 9 of 116 PageID #: 33052
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 9 of 116 PagelD #: 33052
`
`EXHIBIT A-5
`EXHIBIT A-5
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 10 of 116 PageID #: 33053
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 10 of 116 PagelD #: 33053
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 11 of 116 PageID #: 33054
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 11 of 116 PagelD #: 33054
`
`EXHIBIT A-6
`EXHIBIT A-6
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 12 of 116 PageID #: 33055
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 12 of 116 PagelD #: 33055
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 13 of 116 PageID #: 33056
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 13 of 116 PagelD #: 33056
`
`EXHIBIT A-7
`EXHIBIT A-7
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 14 of 116 PageID #: 33057
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 14 of 116 PagelD #: 33057
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 15 of 116 PageID #: 33058
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 15 of 116 PagelD #: 33058
`
`EXHIBIT D-1
`EXHIBIT D-1
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 16 of 116 PageID #: 33059
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 16 of 116 PagelD #: 33059
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 17 of 116 PageID #: 33060
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 17 of 116 PagelD #: 33060
`
`EXHIBIT D-2
`EXHIBIT D-2
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 18 of 116 PageID #: 33061
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 18 of 116 PagelD #: 33061
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 19 of 116 PageID #: 33062
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 19 of 116 PagelD #: 33062
`
`EXHIBIT E-1
`EXHIBIT E-1
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 20 of 116 PageID #: 33063
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 20 of 116 PagelD #: 33063
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 21 of 116 PageID #: 33064
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 21 of 116 PagelD #: 33064
`
`EXHIBIT E-2
`EXHIBIT E-2
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 22 of 116 PageID #: 33065
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 22 of 116 PagelD #: 33065
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 23 of 116 PageID #: 33066
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 23 of 116 PagelD #: 33066
`
`EXHIBIT E-3
`EXHIBIT E-3
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 24 of 116 PageID #: 33067
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 24 of 116 PagelD #: 33067
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 25 of 116 PageID #: 33068
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 25 of 116 PagelD #: 33068
`
`EXHIBIT E-4
`EXHIBIT E-4
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 26 of 116 PageID #: 33069
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 26 of 116 PagelD #: 33069
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 27 of 116 PageID #: 33070
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 27 of 116 PagelD #: 33070
`
`EXHIBIT E-5
`EXHIBIT E-5
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 28 of 116 PageID #: 33071
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 28 of 116 PagelD #: 33071
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 29 of 116 PageID #: 33072
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 29 of 116 PagelD #: 33072
`
`EXHIBIT E-6
`EXHIBIT E-6
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 30 of 116 PageID #: 33073
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 30 of 116 PagelD #: 33073
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 31 of 116 PageID #: 33074
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 31 of 116 PagelD #: 33074
`
`EXHIBIT E-7
`EXHIBIT E-7
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 32 of 116 PageID #: 33075
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 32 of 116 PagelD #: 33075
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 33 of 116 PageID #: 33076
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 33 of 116 PagelD #: 33076
`
`EXHIBIT E-8
`EXHIBIT E-8
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 34 of 116 PageID #: 33077
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 34 of 116 PagelD #: 33077
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 35 of 116 PageID #: 33078
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 35 of 116 PagelD #: 33078
`
`EXHIBIT E-8
`EXHIBIT E-8
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 36 of 116 PageID #: 33079
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 36 of 116 PagelD #: 33079
`
`REDACTED
`REDACTED
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 37 of 116 PageID #: 33080
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 37 of 116 PagelD #: 33080
`
`EXHIBIT E-9
`EXHIBIT E-9
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 38 of 116 PageID #: 33081
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 38 of 116 PagelD #: 33081
`
`EXHIBIT F-1
`EXHIBIT F-1
`
`

`

`!
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 39 of 116 PageID #: 33082
`Case 1:16-cv-00455 F
`=
`--
`° =
`2
`;
`PATENT NUMBER
`“
`°
`z
`OR BSC
`g
`g7013
`Se
`[eli
`wl
`eS
`s
`ivi
`= E
`670134"
`U.S. UTILITY Patent Application
`PATENT DATE
` foe
`Na
`
`
`
`
`
`APPLICATIONNO.|CONT/PRIOA|GLASS EXAMINER
`
`o9/erz9n4e
`
`Joe.
`/ o"|
`
`
`
`APPLICANTS
`
`TITLE
`
`PTO-2040
`12/98
`
`ORIGINAL
`CLASS
`
`||
`
`ISSUING CLASSIFICATION
`CROSS REFERENCE(S)
`SUBCLASS (ONE SUBCLASS PER BLOCK)
`
`CLASS
`
`TERMINAL
`DISCLAIMER
`
`("| The term of this patent
`subsequent to
`has been disclaimed.
`
`(date)
`
`
`
`
`
`
`
`|
`
`,
`The term of this patent shall
`Dung C. Dinh
`nol extend beyond the expiration date |
`Primary Examiner
`of U.S Patent. No.2”
`/
`SN é
`‘
`.
`a (Primary Examigar)
`_| The terminal ___s months of
`this patent have been disclaimed.
`
`—-—~
`
`{Legalinstruments Examiner)
`
`Amount res
`7 afl ft }3i
`(Date)
`
`Date Paid
`Am oh |
`ISSUE BATCH NUMBER
`
`WARNING:
`The information disclosed herein may be restricted, Unauthorized disclogure may be pronibited by the United States Code Title 35, Sections 122, 1681 and 368.
`Possession outside the U.S, Patent & Trademark Ofice |s restricted to authorized employaes and contractors only.
`foe
`FILED WITH: [_] Disk (CRF) []FICHE [_] CD-Rom
`:
`(Attached in pocket on right inside flap)
`
`iss SE IN FILE
`
`(FACE)
`
`AB-TT 000057
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 40 of 116 PageID #: 33083
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 40 of 116 PagelD #:
`33083
`
`Appl.No.09/629,042
`Express Mail Label EV 335522411 U!
`ee Y
`KN
`IN THE UNITED STATES PATENT AND TRADEMARK OFFICE
`0 ps ¥
`Sy... INBEAPPLICATION OF: FRED B. HOLTETAL.
`EXAMINER: BRADLEY E. EDELMAN
`“APPLICATION NO,:
`09/629,042
`ARTUNIT:
`2153
`
`mneyDocketNo.ment)
`“A;
`PATENT
`2D
`.
`(Yup
`
`6°
`,_e
`
`FILED:
`
`JULY 31, 2000
`
`ConF. No:
`
`4750
`
`For: DISTRIBUTED GAME ENVIRONMENT
`
`Amendment Under 37 C.F.R. § 1.111
`
` RECEIVED
`SEP 15 2003
`Technology Center 2100
`
`issi
`
`nara “es
`
`P,
`
`Alexandria, VA 22313-1450
`
`Sir:
`
`In response to the Office Action dated May 21, 2003, please amend the above-identified
`
`application as follows:
`
`Amendments to the Claimsare reflected in the listing of the Claims which begins on
`
`page 2 of this paper.
`
`Amendments to the Drawings begin on page 6 of this paper and include attached
`
`drawing sheets.
`
`Remarks/Arguments begin on page 7 ofthis paper.
`
`09/12/2003 BSAYASI1 00000005 09629042
`
`02 FCsi20i
`
`44.00 OF
`
`[03004.8009/0A, 2003-05-21 RESPONSE.DOC]
`
`1
`
`i
`
`AB-TT 000216
`
`

`

`
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 41 of 116 PageID #: 33084
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 41 of 116 PagelD #:
`33084
`
`Ppl. No. 09/629,042
`
`Amendments to the Claims
`
`; boy Docket No. 030048009US
`
`This listing of claims will replace all prior versions, and listings, of claims in the
`
`application:
`
`aWa
`
`1.
`
`(Currently amended) A computer network for providing a game environmentfor 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 ofits connections to its neighbor participants and wherein each participant
`
`further
`
`sends data that it receives from a neighborparticipant to its other neighborparticipants,
`
`|
`
`i whereinthenetworkism-regular, wheremistheexactnumberofneighborparticipantsofeach
`
`articipan
`
`rt
`
`herein the number of
`
`icipants
`
`is
`
`at least two
`
`preater than m thu
`
`resulting in a non-complete graph.
`
`2.
`
`(Original) The computer network of claim 1 wherein each participant is connected
`
`to 4 otherparticipants.
`
`3.
`(Original) The computer network of claim 1 wherein each participant is connected
`"to an even numberofother participants.
`
`ys
`Hk,
`
`(Cancelled)
`(Original) The computer network ofclaim 1 wherein the network is m-connected,
`
`where m is the number ofneighborparticipants of each participant.
`
`[03004.8009/0A2003-05-21 RESPONSE.DOC]
`
`2
`
`As
`
`dh
`
`AB-TT 000217
`
`

`

`SSSSSSSSsESae
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 42 of 116 PageID #: 33085
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 42 of 116 PagelD #:
`33085
`
`Appl. No. 09/629,042
`
`»
`
`.orney Docket No. 030048009US
`
`& (Original) The computer network of claim 1 wherein the network is m-regular and
`
`m-connected, where m is the number ofneighborparticipants of each participant.
`
`pf
`(Original) The computer network ofclaim 1 wherein all the participants are peers.
`L (Original) The computernetwork ofclaim 1 whereinthe connections are peer-to-
`iin vs
`
`onnectio
`
`a (Original) The computer network of claim 1 wherein the connections are TCP/IP
`
`connections.
`
`a (Original) The computer network of claim 1 wherein each participant is a process
`
`executing on a computer.
`
`6
`mH.
`
`(Original) The computer network of claim 1 wherein a computer hosts more than
`
`one participant.
`
`(Original) The computer network ofclaim 1 wherein each participant sends to each
`
`{ J
`
`ofits neighbors only one copyofthe data.
`
`b (Original) The computer network of claim 1 wherein the interconnections of
`
`participants form a broadcast channel for a gameofinterest.
`
`[03004,8009/0A 2003-05-21 RESPONSE.DOC]
`
`AB-TT 000218
`
`

`

`
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 43 of 116 PageID #: 33086
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 43 of 116 PagelD #:
`33086
`
`Appl. No. 09/629,042
`
`»
`
`omey Docket No. 030048009US
`
`J&—(Currently Amended)Adistributed game system comprising:
`
`a plurality of broadcast channels, each broadcast channel for playing a game, each
`
`
`of the broadcast channels for providinggameinformation related to said game to a plurality of
`
`
`
`an originati
`icipant
`sends data to the other participants by
`sending the data
`throu
`f
`
`
`its connections to its neighbor participants and wherein each participant sends da
`it receives
`
`
`a nei
`
`r
`
`participant to its neighbor participants, further wherein the network is m-regular.
`
`
`
`ct numberof neighborparticipants of
`
`where
`
`
`
`
`
`
`
`
`
`each participan
`
`wherein the
`
`
`
`(\ isatleastumberof participants two terthanmthusresulting inanon-complete graph;
`
`meansforidentifying a broadcast channel for a gameofinterest; and
`
`meansfor connecting to the identified broadcast channel.
`
`ae
`Ae
`BOP fa
`DE (Original) The distributed game system ofclaim Niwherein meansfor identifying a
`
`game ofinterest includes accessing a web server that maps games to corresponding broadcast
`
`channel.
`
`ie
`4
`1
`2
`Mw (Original) The distributed game system ofclaim wherein a broadcast channel is
`formed by player computers that are each interconnectedto at least three other computers,
`
`eat
`
`w) A computer network for
`
`yt icipants, each participanthaving
`
`connections t
`
`providing
`
`a
`
`four
`
`ly
`
`nei
`
`
`originating participant sends data to theotherparticipants by sending the data through each ofits
`
`e environment for a
`
`r
`
`partici
`
`plurality
`
`of
`
`whereinan
`
`[03004.8009/0A2003-05-21 RESPONSE.DOC]
`
`(Ly 4A
`
`A
`AB-TT 000219
`
`

`

`
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 44 of 116 PageID #: 33087
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 44 of 116 PagelD #:
`33087
`
`.
`
`ppl. No, 09/629,042
`
`beoTY oad
`
`ha
`
`ey
`
`{
`
`Docket No, 030048009US
`
`connections to its neighbor participants and wherein each participant sends data that it receives
`
`from a neighborparticipant to its neighbor participants, further wherein the networkis in a stable
`
`
`
`
`
`
`
`4-regular six participantstoresult in a non-completestate and wherein there t h.
`
`
`
`17
`
`one participant.
`
`ew) The computer network of Claim + Sherein
`
`computer hi
`
`ore than
`
`if
`
`|o___
`
`(New) A computer network for providing a game environment for a plurality of
`
`
`
`an originati
`
`rticipant sends data to the other participants by
`
`sending
`
`the
`
`each of
`
`
`
`sends dataits connections to its neighbor participants and wherein each participant that it receives
`
`
`
`further wherein the network is m-
`icipants,
`from a neighbor participant to its other neighbor
`
`
`
`regular and the network forms an incomplete graph.
`
` U (New)ThecomputernetworkotChinwhereinacomputerhostsmorethan
`
`
`oneparticipant.
`
`[03004.8009/0A2003-05-21 RESPONSE.DOC]
`
`/|—T+
`
`hy
`AB-TT 000220
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 45 of 116 PageID #: 33088
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 45 of 116 PagelD #: 33088
`
`| “Appl. No. 09/629,042
`
`Amendments to the Drawings
`
`' ai) Docket No. 030048009US
`
`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
`
`[03004,8009/0A 2003-05-21 RESPONSE.DOC]
`
`6
`
`i
`AB-TT 000221
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 46 of 116 PageID #: 33089
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 46 of 116 PagelD #:
`33089
`
`“Appl. No. 09/629,042
`
`.
`
`+
`
`amey Docket No. 030048009US
`
`REMARKS/ARGUMENTS
`
`Reconsideration and withdrawal ofthe 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
`
`Examineris 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 14-16 under 35 U.S.C. § 102(b) 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.
`
`
`
`TheCitedPriorArt:
`
`The IGZ article is a press release detailing the Internet Gaming Zone by Microsoft. As
`
`detailed in the press release, the IGZ article describes a system that allows for multi-player gaming
`
`via the Internet. There is however noindication 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 tised 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 network, 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
`
`h
`AB-TT 000222
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 47 of 116 PageID #: 33090
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 47 of 116 PagelD #:
`33090
`
`Appl. No. 09/629,042
`
`»
`
`.amey Docket No. 030048009US
`
`Because of the mobile nature ofthe 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 maintainsalist of neighbors and periodically
`updates the list bales on acknowledgements received. When two hosts become neighbors, a
`
`wirelesslink is established between them, and they execute a handshake procedure. As part of the
`
`handshake procedure, they update their list of neighbors.
`
`Because of the mobile nature of the nodes,
`
`it is not uncommon that the link may be
`
`disconnected between two nodes. Because ofthis, 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
`
`ofits
`
`neighbors. On receiving a broadcast message, an intermediate mobile host retransmits the
`
`messagetoall of its neighbors. The Alagar reference also provides a methodology forlimiting the
`
`amount of retransmission of messages. This is accomplished by means of an acknowledgement
`
`protocol.
`
`The Examiner's Arguments:
`
`The Examinerrejects Claims 14-16 under 35 U.S.C. § 102 as being anticipated by the IGZ
`article. The Examiner argues that the IGZ article discloses a plurality of broadcast channels and
`
`means for broadcasting a broadcast channelfor topics ofinterest.
`
`Next, the Examiner rejects Claims 1-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
`
`aN
`AB-TT 000223
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 48 of 116 PageID #: 33091
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 48 of 116 PagelD #:
`33091
`
`Appl. No. 09/629,042
`
`,
`
`smey Docket No. 030048009US
`
`Applicants' Amendments and Arguments:
`
`Applicants have significantly amended independent Claims 1 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 ofthe remarks set forth below.
`
`In view of the substantial amendments
`
`made to Claim 14 to includeall of the limitations of Claim 1, the arguments will be primarily
`
`directed towards the Alagar reference which wasused to reject Claims 1-13.
`
`First, one important aspect of the Alagar reference is that the flooding protocoldisclosed
`
`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 1, 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 messageis broadcast to all of its neighbors.
`
`In contrast, the present claimed invention of Claim 1 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 numberof neighbors for
`
`each node, then the total number of messages is m x N.
`
`In contrast, by limiting the rebroadcast to "other neighbors," this reduces the number of
`
`messages to be broadcast to (m-1)N + 1, For large networks, the saved bandwidth can be
`
`significant. For this sole reason alone, Claim 1 has a requirement of "other neighbors" which is
`
`not fairly shown in the Alagar reference. Therefore, Claim 1 andall dependentclaims therefrom
`
`are in condition for allowance.
`
`
`
`
`
`
`
`Secondly,theAlagarreferenceteachestheindiscriminantlinkingwithneighborsregardless
`
`
`
`
`
`
`
`
`
`
`
`ofthenumberoftotalneighborsthatarecapableofbeingconnected,For example, Alagar
`
`
`
`
`
`[03004,8009/0A2003-05-21 RESPONSE.DOC]
`
`9
`
`b |
`
`AB-TT 000224
`
`

`

`|
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 49 of 116 PageID #: 33092
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 49 of 116 PagelD #:
`33092
`
`‘Appl. No. 09/629,042
`
`.
`
`amey 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 "regularity" to the network
`
`formed by Alagar because each of the nodes can link to as few as one neighbor or a potentially
`
`extremely large numberof neighbors. The only limitation is that the node will link and classify as
`
`
`
`
`
`a neighbor any other node that is within hearing distance.‘Thisispreciselytheoppositeofthe
`
`
`
` Independent claims
`
`14 and 17 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 1 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.
`
`Furthermore, Claim 17
`
`requires that the network is "in a stable 4-regular state.” For this reason, the claims are allowable
`over the cited priorart.
`|
`
`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+1. A
`
`“complete graph" in graph theory is that each node has a connection to every other node in the
`
`network. Thus, Figure | of the Alagar reference shows a complete graph. Each of the nodes has
`
`[03004.8009/0A 2003-05-21 RESPONSE.DOC]
`
`10
`
`DX
`AB-TT 000225
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 50 of 116 PageID #: 33093
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 50 of 116 PagelD #: 33093
`
`- Appl. No. 09/629,042
`
`.
`
`amey Docket No, 030048009US
`
`a connection to every other node in the network. Obviously, for a five-node network, this will
`
`require four communications connectionsfor each node.
`
`Claims 1 and 17 have been amended torecite that there are at least two more nodes than
`
`there are maximum numberof 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 ofthe 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 ofthis application, the Examiner is encouragedtocall the
`
`
`
`undersigned at (206) 359-6488.
`
`Date: Z (Ol 03
`
`Correspondence Address:
`Customer No. 25096
`Perkins Coie LLP
`P.O. Box 1247
`Seattle, Washington 98111-1247
`(206) 359-8000
`
`Respectfully submitted,
`Perkins Coie LLP
`
`Chun M. Ng
`Registration No. 36,878
`
`as
`
`[03004,8009/0A 2003-05-21 RESPONSE.DOC|
`
`11
`
`NM
`AB-TT 000226
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 51 of 116 PageID #: 33094
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 51 of 116 PagelD #: 33094
`
`EXHIBIT F-2
`EXHIBIT F-2
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 52 of 116 PageID #: 33095
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 52 of 116 PagelD #: 33095
`
`FILE HISTORY
`
`US 6,714,966
`
`PATENT:
`
`6,714,966
`
`INVENTORS: Holt, Fred B.
`
`Bourassa,Virgil E.
`
`TITLE:
`
`Information delivery service
`
`aS US2000629043A
`NO:
`
`FILED:
`
`31 JUL 2000
`
`ISSUED:
`
`30 MAR 2004
`
`COMPILED:
`
`16 JUL 2014
`
`AB-TT 000349
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 53 of 116 PageID #: 33096 APPLICATION NO,
`
`09/629043
`
`2
`
`ri as i hia I ‘t
`Vircal Brnie
`
`ae
`
`op
`
`J
`
`“
`
`pee of Correction
`BEST COPY
`
`040
`
`iN 9-9 2004
`
`
`ISSUING CLASSIFICATION
`
`CROSS REFERENCE(S)
`
`
`|cease|| SUBCLASS (ONE SUBCLASS PER BLOCK)
`|got|7} =| 2
`
`TrenaTonascassimcaron|ues—|
`GloiclF]Bi=|si
`atsi|
`
`CLAIMS ALLOWED
`
`
`
`Sheets Drwg.|Figs. Drwg.|Print Fig. Total Claims Print Claim for O.G,
`
`
`
`37) 4)|24|gi|Bl
`
`|] The term of this patent
`NOTICE OF ALLOWANCE MAILED
`subsequentto
`(date) bed Oddity ao/03
`has been disclaimed.
`(Assistant Examinar)
`{Date}
`€1_
`The icrm of this patent shall
`nol extend bayand the expiration data
`U.S Patent. No.
`lia
`ta
`
`‘ Dung C.Dinh
`:
`Primary Examiner
`
`{s | o} | 63
`
`1a¢
`
`[1] The terminal ____monthsof
`this patent have been disclaimed.
`
`
`(Leos! instruments Examiner)
`(Data)
`
`WARNING:
`
`ISSUE BATCH NUMBER
`
`i
`
`orized disclosure may ba prohibited by tha United States Code Tillie 45, Sections 122, 181 and 368
`isgggtricted to authorized amployees and contractors only.
`
`FILED wiTH: [_] pisk (CRF) [[]FIcHE [(]cp-Rom
`(Attached in pocket on right inmide Map)
`
`(FACE)
`
`AB-TT 000350
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 54 of 116 PageID #: 33097
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 54 of 116 PagelD #: 33097
`
`Appl. No. 09/629,043
`
`Attornt
`
`Jocket No. 030048007US
`
`2
`gt’ S EIN THE UNITED STATES PATENT AND TRADEMARK OFFICE
`
`xs
`
`PATENT
`
`Mail Label EV 335522408 US
`
`RESPPLICATION OF: FRED B. HOLT ET AL.
`
`EXAMINER: BRADLEY E. EDELMAN
`
`APPLICATION NO.:
`
`09/629,043
`
`FILED:
`
`JULY 31, 2000
`
`ARTUNIT:
`
`2153
`
`Conf. No:
`
`4749
`
`For:
`INFORMATION DELIVERY SERVICE
`
`
`Amendment Under 37 C.F.R. § 1,111
`
`SEP 15 2003
`
`Technology Center 2190
`
`Commissioner for Patents
`P.O. Box 1450
`Alexandria, VA 22313-1450
`
`Sir:
`
`In response to the Office Action dated June 20, 2003, please amend the above-identified
`
`application as follows:
`
`Amendments to the Claims are reflected in the listing of the Claims which begins on
`
`page 2 ofthis paper.
`
`Amendments to the Drawings begin on page 5 of this paper and include attached
`
`drawing sheets.
`
`Remarks/Arguments begin on page6 ofthis paper.
`
`[03004-8007/Amend_6_20_03.doc)
`
`1
`
`AB-TT 000611
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 55 of 116 PageID #: 33098
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 55 of 116 PagelD #: 33098
`
`.
`
`Appl. No. 09/629,043
`
`Attorne Jocket No. 030048007US
`
`Amendmentsto the Claims
`
`This listing of claims will replace all prior versions, and listings, of claims in the
`
`application:
`
`
`1.
`
`(Currently amended) A computer network for providing an information delivery
`
`service 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, further wherein the network is m-regular, where m is the exact numberofneighbor
`
` r
`
`in a non-complete graph.
`
`esulting
`
`2.
`
`(Original) The computer network of claim 1 wherein each participant is connected
`
`to 4 other participants.
`
`3.
`
`(Original) The computer network of claim 1 wherein each participant is connected
`
`to an even number ofother participants.
`
`
`= es
`
`4.
`
`(Cancelled)
`
`7 (Original) Thecomputernetwork ofclaim 1 whereinthe networkism-connected;——- -
`
`
`()weremisthenumberofneighborparticipantsofeachparticipant.
`
`_..
`
`saaa
`
`[03004-8007/Amend_6_20_03.doc]
`
`2
`
`suet
`
`AB-TT 000612
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 56 of 116 PageID #: 33099
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 56 of 116 PagelD #: 33099
`
`Appl. No. 09/629,043
`
`Attorne
`
`Jocket No. 030048007US
`
`& (Original) The computer network of claim | wherein the network is m-regular and
`
`m-connected, where m is the number ofneighborparticipants ofeach participant.
`
`a,
`
`(Original) The computer network ofclaim 1 wherein all the participants are peers.
`
`2 (Original) Thecomputernetworkofclaim 1 whereinthe connections are peer-to-
`
`peer connections.
`
`Ly
`
`9g
`
`(Original) Thecomputer network ofclaim 1 whefein the connections are TCP/IP
`
`connections.
`
`+ (Original) Thecomputernetworkofclaim 1 whereineachparticipantisaprocess
`
`executing on a computer.
`
`10
`Me (Original) The computer network ofclaim ] wherein a computer hosts more than
`
`one participant.
`
`Be (Original) The computer network of claim 1 wherein each participant sends to
`
`each of its neighbors only one copy of the data.
`
`we (Original) The computer network of claim 1 wherein the interconnections of
`
`participants form a broadcast channel for a topic ofinterest,
`
`[03004-8007/Amend_6_20_03.dac}
`
`3 L| lo
`
`h
`
`AB-TT 000613
`
`

`

`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 57 of 116 PageID #: 33100
`Case 1:16-cv-00455-RGA Document 468-1 Filed 05/14/19 Page 57 of 116 PagelD #: 33100
`
`Appl. No. 09/629,043
`
`Attorne
`
`Jocket No. 030048007US
`
`> (Currently amended) An information delivery service comprising:
`
`a plurality of broadcast channels, each broadcast channel for distributing information