Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 1 of 123 PageID #: 37335
`
`IN THE UNITED STATES DISTRICT COURT
`FOR THE DISTRICT OF DELAWARE
`
`ACCELERATION BAY LLC,
`
`Plaintiff,
`
`v.
`
`ELECTRONIC ARTS INC.,
`
`Defendant.
`
`)
`)
`)
`)
`)
`)
`)
`)
`)
`
`C.A. No. 16-454 (RGA)
`
`REDACTED - PUBLIC VERSION
`
`DECLARATION OF KATHLEEN B. BARRY
`IN SUPPORT OF ELECTRONIC ART INC.’S OPENING BRIEF
`IN SUPPORT OF ITS MOTIONS FOR SUMMARY JUDGMENT AND
`TO EXCLUDE EXPERT OPINIONS UNDER FRE 702
`VOLUME 8 OF 8
`MORRIS, NICHOLS, ARSHT & TUNNELL LLP
`Jack B. Blumenfeld (#1014)
`Stephen J. Kraftschik (#5623)
`1201 North Market Street
`P.O. Box 1347
`Wilmington, DE 19899
`(302) 658-9200
`jblumenfeld@mnat.com
`skraftschik@mnat.com
`
`OF COUNSEL:
`
`Michael A. Tomasulo
`Gino Cheng
`David K. Lin
`Joe S. Netikosol
`WINSTON & STRAWN LLP
`333 South Grand Avenue, 38th Floor
`Los Angeles, CA 90071
`(213) 615-1700
`
`Attorneys for Defendant
`
`David P. Enzminger
`Louis L. Campbell
`WINSTON & STRAWN LLP
`275 Middlefield Road, Suite 205
`Menlo Park, CA 94025
`(650) 858-6500
`
`Dan K. Webb
`Kathleen B. Barry
`WINSTON & STRAWN LLP
`35 West Wacker Drive
`Chicago, IL 60601
`(312) 558-5600
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 2 of 123 PageID #: 37336
`
`Krista M. Enns
`WINSTON & STRAWN LLP
`101 California Street, 35th Floor
`San Francisco, CA 94111
`(415) 591-1000
`
`Michael M. Murray
`Anup K. Misra
`WINSTON & STRAWN LLP
`200 Park Avenue,
`New York, NY 10166
`(212) 294-6700
`
`Andrew R. Sommer
`Thomas M. Dunham
`Michael Woods
`Paul N. Harold
`Joseph C. Masullo
`WINSTON & STRAWN LLP
`1700 K Street, N.W.
`Washington, DC 20006
`(202) 282-5000
`
`Original Filing Date: March 23, 2018
`Redacted Filing Date: April 5, 2018
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 3 of 123 PageID #: 37337
`
`
`
`
`
`
`
`
`
`
`
`EXHIBIT E-11
`
`CONFIDENTIAL – OUTSIDE COUNSEL
`ONLY
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 4 of 123 PageID #: 37338
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 4 of 123 PagelD #: 37338
`
`REDACTED
`REDACTED
`IN ITS
`IN ITS
`ENTIRETY
`ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 5 of 123 PageID #: 37339
`
`
`
`
`
`
`
`
`
`
`
`EXHIBIT E-12
`
`CONFIDENTIAL – OUTSIDE COUNSEL
`ONLY
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 6 of 123 PageID #: 37340
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page6 of 123 PagelD #: 37340
`
`REDACTED
`REDACTED
`IN ITS
`IN ITS
`ENTIRETY
`ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 7 of 123 PageID #: 37341
`
`
`
`
`
`
`
`
`
`
`
`EXHIBIT E-13
`
`CONFIDENTIAL – OUTSIDE COUNSEL
`ONLY
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 8 of 123 PageID #: 37342
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 8 of 123 PagelD #: 37342
`
`REDACTED
`REDACTED
`IN ITS
`IN ITS
`ENTIRETY
`ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 9 of 123 PageID #: 37343
`
`
`
`
`
`
`
`
`
`
`
`EXHIBIT E-14
`
`CONFIDENTIAL – OUTSIDE COUNSEL
`ONLY
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 10 of 123 PageID #: 37344
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 10 of 123 PagelD #: 37344
`
`REDACTED
`REDACTED
`IN ITS
`IN ITS
`ENTIRETY
`ENTIRETY
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 11 of 123 PageID #: 37345
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 11 of 123 PagelD #: 37345
`
`
`
`
`
`
`
`
`
`
`
`EXHIBIT F-1
`EXHIBIT F-1
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 12 of 123 PageID #: 37346
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 12 of 123 PagelD #: 37346
`
`| “Appl,No.09/628,042
`
`
`sExpressMailLabelEV335522411US
`
`
`InesDocketNo.030048008
`
`We
`PATENT
`6 Ry
`bg
`INTHEUNITEDSTATES PATENTANDTRADEMARKOFFICE
`Pr 8 |)
`
`eee:
`INRYAPPLICATiONOF FREOB. HOLTeran
`EXAMINER: BRADLEYE. EpeuMaANn
`aCOrCATIONNO.:
`-09/689,042
`| ArrUner:
`2153
`Fru:
`JULY 31, 2000
`| Cone. No:
`4750
`
`pose
`wie jem,
`
`on
`
`\
`
`For: DISTRIBUTED GAME ENVIRONMENT
`
` «RECEIVED
`Amendorent Under37 CFR. §1.111
`SEP 15 2003
`Technology Center 2100
`
`Obaa
`
`Alexandria, VA22313-1450
`
`Sir:
`
`In response to the Office Action dated May 21, 2003, please amend the above-identified
`
`application asfollows:
`
`Amendments to the Claims are reflected in the listing of the Claims. which begins on
`
`page 2 ofthis paper.
`
`Amendments to the Drawings begm on page 6 of this paper and includeattached
`
`drawingsheets.
`
`Remarks/Arguments begin on pave 7 ofthis paper
`
`Oo1oaed RSAYGRL: GuGG000R OGLAIOG?
`
`GTR.
`
`6
`
`{OG004BORDA 2005-05-23 RESPONSEDOG)
`
`4
`
`“see
`
`Page 02330
`
`ATV1I0013079
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 13 of 123 PageID #: 37347
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 13 of 123 PagelD #: 37347
`
`PUARBI, Ne, 09/629,042
`
`
`
`Amendments to the Claims
`
`
`
`irney Docket No, 030048000US
`
`This listing of claims will replace all prior versions, and listings, of claims in the
`
`maintains
`i_Bpplication:
`Iaanenenneerens)
`
`networkism-regular,wheremistheexactnumberofneighbor participantsofeach
`
`t.
`
`(Currently amended) A computer network for providing a gameenvironment for a
`
`plurality of participants, each participant having connections
`
`fo at
`
`least
`
`three neighbor
`
`participants, wherein an originating participant sends data to the other participants by sendingthe
`
`data through each of ifs connections to its neighbor participants and wherein each participant
`
`sends data that it receives from a neighbor participant to its other neighbor participants,farther
`
`whereinthe
`
`<
`
`(Original) The computer network of claim | wherein each participant is connected
`
`to-4 other participants.
`
`3,
`
`(Original) The computer network ofclaim | wherein each participant is connected
`
`to an even number ofother participants.
`
`wool
`
`4.
`Fee
`
`(Cancelled)
`
`H ‘ {Onginal) The computer network ofclaim ] wherein the network is m-connected,
`
`where m is the number ofneighbor participants of each participant.
`
`[03004CONBIOA 2003.05.21 RESPONBE.DOR!
`
`Z
`AY
`
`“ye
`
`Page02331
`
`ATV1I0013080
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 14 of 123 PageID #: 37348
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 14 of 123 PagelD #: 37348
`
`\
`
`“ Appl. No. 09/628,042
`
`
`
`
`
`Scdrney Docket No. o3d04a009UIS
`
`& (Original) The computer network of claim 1 wherein the network is m-regular and
`
`m-connected, where m is the number ofneighbor participants ofeach participant.
`
`Pp
`(Original) The computernetwork ofclaim | wherein all the participants are peers,
`L (Original)Thecomputer network ofclaim | wherein theconnectionsarepeer-to-
`ifrrm
`
`2°—(Original) The computer network ofclaim 1 wherein the connections ate TCP/AP
`
`JS (Original) The computer network ofclaim | wherein each participant is a process
`
`executing on a computer.
`
`,A
`
`t—Original) The computer network of claim 1 wherein a compater hosts more than
`
`one participant.
`
`{
`JX—(Original) The computer network of claim 1 wherein each participant sends to each
`
`ofits neighbors only one copy ofthe data.
`
`he
`
`(Original) The computer network of claim 1] wherein the interconnections of
`
`participants form a broadcast channel for a gameofinterest.
`
`$02004BOOGIDA 2002-05-21 RESPONSEDOC}
`
`-3b>
`
`fs
`
`Page023320
`
`ATV10013081
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 15 of 123 PageID #: 37349
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 15 of 123 PagelD #: 37349
`
`“Appl, No. 08/629,042 ©)
`
`
`smey Docket Ne. o30048009US
`
`7J—(
`
`Currently Amended)Adistributed game systemcomprising:
`
`a plurality of broadcast channels, each broadcast channel for playing a game,each
`
`ofthebroadcastchannelsforprovidinggameinformation related to sai
`
`
`
`means for connecting to the identified broadcast channel L-
`
`means for identifying abroadcast channel for a game ofinterest; and
`
`sultinginanon-completegraph,
`
`Je (Gripinal)Thedistributedgamesystemofclaim Iimeansforidentifyinga
`
`>
`
`game ofinterest includes accessing a web server that maps games to corresponding broadcast
`
`channel
`
`io[?,
`es
`
`=
`(Original) The distributed game system ofclaim 14 wherein a broadcast channel is
`
`formed by player computers that are each intercanmected fo at least three orher computers.
`
` _ t=
`
`[03004BOOS/DA2008-05-21 RESPONSENOG}
`
`éj[ 4
`
`ates
`
`Page 02333
`
`ATV1I0013082
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 16 of 123 PageID #: 37350
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 16 of 123 PagelD #: 37350
`
`
`
`(D3004,8N09/OA 2003-05-21 RESPONSE.DOG]
`
`4S
`
`Page 02334
`
`ATV10013083
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 17 of 123 PageID #: 37351
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 17 of 123 PagelD #: 37351
`
`| ‘Appi. No. 08/629,042 ©
`
`
`C2iney Docket No. 0300480038US
`
`The attached sheets of drawings include changes to Figures 6 and 7. These sheets, which
`
`include Figures 6 and 7, replace the onginal sheets including Figures 6 and 7, respectively.
`
`Attachment: Replacement Sheets
`
`(03004,B0C9OA 2003-05-21 RESPONSEDOC}
`
`6
`
`Page 02335
`
`ATVI0013084
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 18 of 123 PageID #: 37352
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 18 of 123 PagelD #: 37352
`
`‘Appl. No, 09/629,042
`
`
`
`
`ey Docket No. 030048009US
`
`
`
`Reconsideration and withdrawalofthe rejections set forth in the OfficeAction dated May
`
`21, 2003 are respectfullyrequested. In that Office Action, the Examiner objectedto the drawings
`
`as failing to include certain reference signs mentioned im the description. Twa replacement sheets
`
`for Figures @ 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. 14-16 under 35 U.S.C. § 102(b) being anticipated by Micrusoft's Interset 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 (1GZ) article. The Examiner aiso rejects Claims 1-13 as
`
`being obvious over the Alager et al. paper.
`
`
`
`|
`
`The IGZ article is a press release detailing the Internet Gaming Zone by Microsoft. As
`detailed inthe press release, the [GZ article describes a system that allows fer multi-playergaming
`
`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 used 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 communicaie 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.
`
`JOSOO4SONG/OA2003.08.21RESPONSECOC!
`
`7
`
`h
`
`Page 02336
`
`ATV1I0013085
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 19 of 123 PageID #: 37353
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 19 of 123 PagelD #: 37353
`
`Appl. No. 099629,042
`
`
`
`
`
`dmey Docket No. o30048006US
`
`Because ofthe mobile nature ofthe network nodes, the Alagar reference teaches thal 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
`
`wirelesslink is established between them, and they execute a handshake procedure. As part of the
`
`handshakeprocedure, they update their list of neighbors.
`
`Because of the mobile nature of the nodes, # is not uncontmion that the link may be
`
`disconnected between two nodes. Because of this, messaves are transmilted from node to node
`
`using a flooding methodology that involves transmitting the message to every node im the
`
`network. Thus, to broadcast a message, a mobile node transmits the measage to all of its
`
`neighbors. On receiving a broadcast message, an intermediate mobile host retransmits the
`
`message to all ofits neighbors. The Alagar reference also provides a methodology for limitingthe
`
`amount of yetransmission of messages.
`
`‘This is accomplished by means of an acknowledgement
`
`protocol,
`
`
`
`The Examiner rejects Claims14-16 under 35 US.C. §102 as boing anticipated by the 1GZ
`“article. The Examiner argues that the 1GZ article discloses a plurality of broadoast channels and
`
`means for broadcasting a broadcast channel for topics ofinterest.
`
`Next, the Examiner rejects Claims 1-13 under 35 U.S.C. § 103 as beingobvious over the
`
`Alagar etal. reference. The Examiner argues that Alagar discloses a plurality of nodes thatform a
`
`network and that the data is sent ic theother participants by a flooding techmque.
`
`Applicants respectfilly request reconsideration.
`
`[23004SONN/OA2003.05-2} RESPONSE.DOR}
`
`8
`
`NK
`
`Page 02337
`
`ATV1I0013086
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 20 of 123 PageID #: 37354
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 20 of 123 PagelD #: 37354
`
`.
`
`Appl. No, 09/629,042
`
`
`
`
`
`a
`fecarney Docket No, 090048008US
`
`Applicants
`
`Applicants have significantly amended independent Claims 1 and 14.
`
`In addition, new
`
`made to Claim 14 to includeall of the limitations of Claim 1, the arguments will be primarily directed towards theAlagar refereniuewhich was used to reject Claims 1-13.
`
`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
`
`Firat, one iniportant aspect of the Alagar reference is that the flooding protocol disclosed
`
`in Alagar dictates that when a node receives a message, that node will rebroadeadt that message to
`
`ali of ite neighbors. See Alager at page 239, column 1, lines 13-15. Specifically, the Alagar
`
`reference at page 239, column 2, lines7-23 dictates that whenevera host (1.¢., node) receives a
`
`message, that message is broadcast to all ofits neighbors.
`
`Tn 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 Alugarreference requires a larger number of messages
`
`to be broadcast. Por example, if mis the number ofnodes and N is the number of neighbors for
`
`each node, then the total number of messages ism x N.
`
`In contrast, by limiting the rebroadcast to “other neighbors,” this reduces the number of
`
`messages to be broadcast ta (m-1)N + 1. For large networks, the saved bandwidth can be
`
`significant. For this sole reason alone, Claim | has a requirement of “other neighbors" which is
`
`wot fairly shown in the Alagar reference. Therefore, Claim | and all dependent claims therefrom
`
`are in condition for adawance.
`
`Secondly, the Alegar reference teaches the indigeriminant linking with neighbors regardless
`
`For example, Alagar
`
`of the number of total neighbors that are capable of heing connected.
`
`103004SQUSIDA 2003.05.01 RESPONSE.DOC]
`
`9
`
`Bs
`
`Page 02338
`
`ATV10013087
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 21 of 123 PageID #: 37355
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 21 of 123 PagelD #: 37355
`i
`
`_ Appl. No, 09/629,042
`
` _ Oocket No, o20048008US
`
`network. Thus, Figure | ofthe Alagar reference shows a complete eraph. Eachof the nodes has
`
`teaches that the definition of a “neighbor”is any two mobile hosts that can “hear eachother. See
`
`Alagar at page 238, columm1, fines 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 number ofneighbors. 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 1 as amended requires that cach participant in the network
`
`connects to andforms a neighbor bondto exactly an m number of neighbors
`
`Independent clainis
`
`i4 and 17contain similar limitations.
`
`Figure 1 of the Alagar reference is deceiving in that it coincidentally shows « 4-regular
`
`network. However, thatis aot the typical situation as is clear from a caretul review of the Alagar
`
`reference. Calum 1 of page 236 of the Alagar reference clearly indicates that there is in fut
`
`nonrepularity 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 1 as amended requires that the computer network be m regular at substantially alt
`
`times where there are not new nodes entering or leaving the network. Furthermore, Claim 17
`
`requires thet the networkis “in a stable 4-regular state.” For this reason, the claims are allowable
`
`over thecited 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 4 “complete graph." A complete graph is a network thatis characterized by N=m+ 1. A
`
`"complete graph" in graph theory is that each node has @ connection to every other node in the
`
`(03004.SO0G/5A 2003-05-21 RESPONSE.DOC}
`
`40
`
`pyi
`
`Page 02339
`
`ATV1I0013088
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 22 of 123 PageID #: 37356
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 22 of 123 PagelD #: 37356
`
` "Appl. No, 09/628,042
`
`a connectionto every other nade in the network. Obviously, for a five-nade network, this will
`
`network. Claim 19 is specifically directedto this aspect of theinverition.
`
`require four communications connections for each node.
`
`Cisims | and 17 have been amended to recite that there are at least two more nodes than
`
`there are maxima number of neighbors. For example, Claun 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 notshow this limitation whatzocver.
`
`In fact, the only
`
`m-reguiar network shown in Alager 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
`
`Alapar reference. This combination has been shown to produce an efficient and stable computer
`
`In view of the foregoing,
`
`the claims pending in the application comply with the
`
`reqiirements of35 U.S.C. § 112 and patentably define over the prior art. ANotice of Allowance
`
`is, therefore, respectfully requested.
`
`If the Examiner has any questions or believes a telephone
`
`conference would expedite prosecution ofthisapplication, the Examiner is encouraged to call the
`
`undersigned af (206) 359-6488.
`
`Yeofes_ote aicsci
`
`pac OE ee
`.
`Chun M. Ng
`=>
`
`Registration No, 36,878
`
`Respectfully submitted,
`
`Perkins Coie LLP
`
`Correspondence Address:
`Customer No. 25096
`Perkins Cole LLP
`P.O, Bax 1247
`Seattle, Washington 98111-1247
`(206) 349-8000
`
`$03004BO08/OA 2009-05-21 RESPONSEDOC]
`
`a
`
`Page 02340
`
`ATV1I0013089
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 23 of 123 PageID #: 37357
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 23 of 123 PagelD #: 37357
`
`
`
`
`
`
`
`
`
`
`
`EXHIBIT F-2
`EXHIBIT F-2
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 24 of 123 PageID #: 37358
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 24 of 123 PagelD #: 37358
`
`OS,65; 64
`
`ry
`Express Mail No, EV336677851US
`a»
`IN THE UNITED STATES PATENT AND TRADEMARKOFFICE
`
`
`
`RE APPLICATION OF: FRED B.HOLT ET AL.
`
`APPLICATION NO.:
`
`09/629,576
`
`FILED:
`
`JULY 31, 2000
`
`2155
`‘_Dsitorney DocketNo. 03004ER01US
`yi
`eT Fr
`patent oewad
`a“
`
`tr?
`
`EXAMINER: YOUNG N. Won
`
`ARTUNIT:
`
`2155
`
`ConF. No:
`
`5408
`
`For: BROADCASTING NETWORK
`
`Amendment Under 37G.F.R.§ 1.111 RECEIVED
`Commissioner for Patents
`4
`MAY 0 7 2004
`P.O. Box 1450
`Alexandria, VA 22313-1450
`Technology Center 2100
`
`Sir;
`
`The present communication responds to the Office Action dated February 4,
`2004 in the above-identified application. Please amend the application as follows:
`
`Amendments to the Specification begin on page 2.
`
`Amendments to the Claims are reflected In the listing of claims- beginning on
`
`page 6.
`
`Remarks begin on page 13.
`
`.
`
`2
`
`“fe
`
`Jus
`
`Page 00248
`
`ATV10009320
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 25 of 123 PageID #: 37359
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 25 of 123 PagelD #: 37359
`
`(‘)
`
`c iis Docket No. Gl00sa007US
`
`Amendments to the Specification:
`
`in accordance with 37 CFR 1.72(b), an abstractof the disclosure has been
`
`In accordance with 37 CFR 1.73, a brief surnmary of the invention
`included on page 3.
`has been included on page 4.
`[In addition, the status of the related caseslisted an page
`4 of the specification has been undated and can be found on page 5.
`
`Page 00249
`
`ATV1I0009321
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 26 of 123 PageID #: 37360
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 26 of 123 PagelD #: 37360
`j
`;
`
`
`
`gf
`
`; agdesgoo1us
` f
`
`{3
`
`ABSTRACT
`
`A technique for broadcasting data across a network is provided. An originating
`participant sends data to another participant, which in turn sends the date that it
`
`receives from a neighbor participant to its other neighbor participants. Communication
`in the broadcast network is controlled by a contact module that locates the neighbor
`
`participants to which the seeking participant can be connected and by a join module that
`
`establishes the connection between the neighbor participants and the seeking
`participant. Data is nurnbered sequentially so that data that is received out of order can
`
`\"
`
`be queued and rearranged.
`
`$$$tf
`
`Page 00250
`
`ATV10009322
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 27 of 123 PageID #: 37361
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 27 of 123 PagelD #: 37361
`
` SUNMARY OF THE INVENTION
`
`Embadiments of the invention deal with a non-routing table based method for
`broadcasting messages in a network. More specifically, a network in which each
`
`participant has at least three neighbor participants broadcasts data through each of its
`connections fo neighbor participants, which in turn send the data that it receives to its
`
`other neighbor participants. The data is numbered sequentially so that data that is
`received out of order can be queued and rearranged.
`
`Communication within the broadcast channel is controlled by a contact module
`
`and by a join module. The cantact module locates a portal computer and requests the
`
`located portal computer to provide an indication of neighbor participants to which the
`participant can be connected. The join module receives the indication of the neighbor
`participants and establishes a connection between the seeking participant and each of
`
`vy
`ey
`
`the indicated neighbor participants.
`
`Each participant in the network is connected to neighbor participants, and the
`paricipants and connections between them form an m-requiar graph, where m is
`
`in addition, when a participant receives data from a neighbor
`greater than 2.
`participant,it sends the data to &s other neighbor participants.
`
`eeenancies |
`
`Page 00251
`
`ATV1I0009323
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 28 of 123 PageID #: 37362
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 28 of 123 PagelD #: 37362
`
`
`
`CHANNEL,” filed on July 31, 2000 ¢@ tomey-Decket-No-03004
`Application No.00/629,577, “LEAVING A BROADCAST CHANNEL,” filed oni St,
`2000Sata (, Dasket-No--036048008-US}, U.S. Patent Application No._09/629,575,
`antiled "BROABCASTING ON A BROADCAST CHANNEL,” filed on July 31, 2000
`oo
`
`(AttorneyBocks
`U.S. Patent Application No.nae Sentitled
`
`Patent Application No,_09/629,043,
`entitled
`‘ mr
`AUCTION SYSTEM,” filedon July31,oysterrrsy Ducks
`Wor gsesssosr vs LS
`
`“NOTUSOU4SDOTUS), U.S. Patent
`SERVICE,” fled on July 31, 2000.
`Application No._09/629,024, eittitied “DISTRIBUTED cSON} ERENCING SYSTEN,* filed
`
`on July 34, 2000
`(Attorney Desket-No--030048008-99 and U.S. Patent Application
`
`No,09/628,042,
`entifled
`“DISTRIBUTED GAME
`ENVIRONMENT,”
`filed
`on
`
`
`
`y OOF800SUS),Atorney—t Pees
`July 31, 2000
`pey—Decket-No--08
`
`incorporatedherein by referende
`
`
`,
`
`the disclosures of which are
`
`a
`
`5
`
`Page 00252
`
`ATVI0009324
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 29 of 123 PageID #: 37363
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 29 of 123 PagelD #: 37363
`
`+*
`
`pee
`
`{ ?
`9
`
`- Amendments to the Claims:
`
`leet
`
`Si
`ey
`Docket No.
`re
`
`OOS
`
`Following is a complete listing of the claims pending in the application, as
`
`“ol
`
`
`
`
`
`amended:
`
`
`4.
`(Currently Arnended)
`A non-routing table based computer network
`having 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 fo its other neighbor participants, and wherein data is numbered sequentially
`
`80that data received out of order can be queued and rearranged.
`
`
`
`The computer network of claim 1 wherein each parlicipantis
`(Original)
`2.
`connected to 4 otherparticipants.
`
`3
`
`(Original)
`
`The carnputer network of claim 1 wherein each participant is
`
`connected to an even number of other participants.
`
`The acl network of claim 1 wherein the nebwork is m-
`{Original}
`4.
`regular, where m is the number of neighbor participants of each participant.
`
`
`(Original)
`5.
`The
`connected, where m is the numb
`
`6.
`
`(Original)
`
` T
`
`
`
`
`reguiar and m-connected, where m is the number of neighbor participants of each
`
`
`4
`AO (Original}
`are peers.
`
`The computer network of claim 1 wherein all the participants
`
`Page 00253
`
`ATV1I0009325
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 30 of 123 PageID #: 37364
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 30 of 123 PagelD #: 37364
`
`FZ
`faa
`
`* AttomayDocketNe, Ga6048001US
`‘2
`
`ae
`
`(Original)
`
`The cornputer network of claim 1 wherein the connections
`
`are peerto-peer connections.
`ve
`
`are TCPHP connections.
`
`AS—{Original) ~The computer network of claim 1 wherein the connections
`
`The computer network of claim 1 wherein each participant is
`se (Srginal)
`a process executing on a computer.
`
`% 3
`
`4=(Original)=The computer network of claim 1 wherein a computer hosts
`more than one participant.
`
`4
`
`4
`x
`
`4ێ.
`
`(Original)
`
`The computer network of claim 1 wherein each participant
`
`sends to each of its neighbors only one copy of the data.
`
`
`
`14,=(Original) vRG component of claim 13 wherein each participant is a
`
`computer process.
`
`
`
`
`
`
`
`45. (Original)/The component of claim 13 wherein the indicated
`
`
`
`participants are computér processes executing on different computer systems.
`poe
`/
`
`eet
`
`He
`
`Page 00254
`
`ATV1I0009326
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 31 of 123 PageID #: 37365
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 31 of 123 PagelD #: 37365
`{
`
`G
`Hetil
`
`=" AltomayDocketNo. G40048001U5
`Y
`
`16.
`
`(Original)
`
`The componenf of claim 13 including:
`
`a broadcast module that receives data from a neighbor participant of the
`
`participant and transmits the regeived data to the other neighbor participants.
`
`
`
`17.
`
`(Original)
`
`The component of claim 13 including:
`
`
`
`
`{ module that receives a request to connect to another
`
`Ara neighbor participant, and connects to the other
`
`participant.
`
`
`THe component of claim 13 wherein the connections are
`48. (Original)
`| established using the TCP/IPprotocol.
`
`A ¢ 19.
`
`A non-routing table based broadcast channel
`
`rlicipants connected to the broadcast channel: and
`
`participant connected to the broadcast channel,
`
`(CurreritlyAmended)
`
`or participants, compri
`
`nications network that provides peer-to-peer communications
`
`
`
`an indicationoffour neighbor participants of that participant; and
`
`
`st component that receives data from a neighborparticipant
`nications network and that sends the received data to its other
`using the co
`neighbor parti¢ipants to effect the broadcasting of the data to each participant of
`
`the broadcast bhannel, wherein data is numbered sequentially so that data
`
`received out of order can be queued and rearranged,
`
`|
`
`\o
`“
`The broadcast channeiof claim 49wherein the broadcast
`(Original)
`20.
`component disregards received data that it has already sentto its neighbor participants.
`
`Page 00255
`
`ATV10009327
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 32 of 123 PageID #: 37366
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 32 of 123 PagelD #: 37366
`i
`
`fs
`2
`
`
`{-<
`" Attomey Docket No. O30048001US
`(e
`The broadcast channel of claim 49°wherein a participant
`(Original)
`Wor
`connects to the broadcast channel by contacting a participant already connected to the
`
`broadcast channel.
`
`we
`The broadcast channel of claim 19Wherein each participant
`
`{6
`The broadcast channel of claimjewherein each participant
`
`Ye
`The broadcast channel of claim 49°wherein each participant
`
`\3
`2k (Original)
`is a computer process.
`4
`RE (Orginal)
`is a computer thread.
`‘S
`B& (Original)
`is a computer.
`x
`channel
`broadcast
`The
`={(Original)
`2&8
`communications network uses TCP/IP protocol.
`
`x
`:
`
`‘e
`claim Ww wherein
`
`of
`
`the
`
`A,
`de’
`
`(Original)
`
`The
`
`broadcast
`
`channel
`
`of
`
`ye
`claim 49° wherein
`
`the
`
`communications network is the internet.
`
`it
`ot (Orginal)
`
`\e
`The broedcast channel of claimSewherein the participants
`
`are peers.
`oe
`
`
`
`graph, where m is greater thar,
`
`non-routing table based broadcast channel
`A
`(Currently Amended)
`28.
`comprising @ plurality of participants, /each participant being connected to neighbor
`
`egnnections between them forming an m-reguilar
`participants, the participants and
`é ang the numberof participants is greater than m.
`
`
`
`
`The ML)et channel of claim 28 wherein the graph is m-
`
`{Original} , broadcastchannel ofclaim 25 wherein m is even.
`
`{Original)
`
`29,
`
`connected.
`
`30.
`
`
`
`WP
`
`ss
`iFx
`
`2}
`
`Page 00256
`
`ATV1I0009328
`
`

`

`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 33 of 123 PageID #: 37367
`Case 1:16-cv-00454-RGA Document 462 Filed 04/05/18 Page 33 of 123 PagelD #: 37367
`
`
`
`34.
`
`(Original)
`
`numberof participants is even.
`
`Q&itomey Docket No. 036048001US
`
`The broadcast channd¢! of claim 28 wherein m is odd and the
`
`
`
`: i
`
`:
`
`x
`
`32.
`
`{Original}
`
`The broadcast chénnel of claim 28 wherein the participants
`
`are computer processes.
`
`
`
`33.
`
`(Original)
`
`The broadcast channel of claim 28 wherein the participants
`
`are computers.
`
`
`
`The broadepst channel of claim 28 wherein the connections
`{Original}
`34.
`
`are established using TCPAP protocal
`
`36,
`
`38.
`(Original}
`The broalicast channel! of claim 28 wherein a message is
`broadcast on the broadcast channel!
`by an originating participant sending the message
`to each of its neighbor participanté
`and by each participant upon receiving a message
`from a neighbor participant sending
`the messageto its other neighbor participants.
`
`A nen-routing table based broadcast channel
`(Currently Amended)
`artiipants, each participant being connected to neighbor —
`
`where m is greater a
`fi ity af d connections between them forrn an m-reguiar graph,
`}-wherein when a participant receives data from a
`
`Sthe data to its other neighbor participants, and wherein
`“Lieemveeconcnsnteonemenessnervonannt
`|he broadcast channel of claim 36 wherein the number of
`
`rearranged.
`
`37.
`
`(Original)
`
`participants is greater than m.
`
`
`
`38. (Original){The broadcast channei of claim $6 wherein the graph is m-
`
`connected.
`
`39,
`
`{Original
`
`The broadcast channel of claim 36 wherein m is even.
`
`4g.
`
`Page 00257
`
`ATV1I0009329
`
`

`

`