IN THE UNITED STATES PATENT AND TRADEMARK OFFICE
`
`In re PATENT APPLICATION OF:
`
`Attorney Docket:
`
`2618-0020
`
`FARBER, David et al.
`
`Group Art Unit:
`
`2166
`
`Application Serial No.:
`
`l 1/980,679
`
`Examiner: PHAM, Khanh B.
`
`Application Filing Date: October 31, 2007
`
`Confirmation No.:
`
`682?
`
`Title: DISTRIBUTING AND ACCESSING DATA
`
`IN A DATA PROCESSING SYSTEM
`
`Date:
`
`October 5, 2009
`
`AMENDMENT
`
`Hon. Commissioner of Patents
`
`PO. Box 1450
`
`Alexandria, VA 22313-1450
`
`Sir:
`
`This Amendment is being filed in response to the non—final Office Action
`
`mailed 05/06/2009. Please amend this application as follows:
`
`Amendments to the claims begin on page 2 below.
`
`Remarks begin on page 11 below.
`
`A Petition fbr Extension of Time is being filed herewith, along with the
`
`required fee.
`
`EMCVMW 1037
`
`

`

`In re Application of: FARBER, David et a1.
`Application S.N.:
`l ”980,679
`Response to Non-Final Office Action
`
`IN THE CLAIMS
`
`Please amend the claims as follows. This listing of claims will replace all
`
`prior versions and listings of claims in the application.
`
`1. (Currently amended) A method of distributing a data item to a plurality
`
`of computers in a network of computers, wherein at least some of said computers
`
`in said network comprise part of a peer-to-peer (P2P) network of computersi the
`
`method comprising:
`
`(A)
`
`dividing the data item into a plurality of segments; and
`
`(B)
`
`foFeaeh—partieulaiLsegment—ef—said-pltuahty—efsegments;
`
`—(—b—l)—causing each said particular segment of said plurality of
`
`segments to be stored on a plurality of computers at—least—ene—eemputer in said
`
`P2P network;
`
`(C) maintaining information about the a—listeef computers in said P2P
`
`network onto which eachof said segments has have been stored; and
`
`
`(D) making available to other computers in said P2P network the
`
`information about the computers onto which said segments have been stored.
`
`2. (Original) A method as recited in claim 1 wherein each segment of the
`
`plurality of segments is distinct from each other segment.
`
`3. (canceled)
`
`

`

`In re Application of: FARBER, David et a1.
`Application S.N.:
`l 1/980,679
`Response to Non-Final Office Action
`
`4. (Currently amended) A method as recited in claim 1 wherein the
`
`information about the computers comprises a list of computers in the P2P network=
`
`the method further comprising:
`
`(D) maintaining, for each computer on said list of computers,
`
`information relating to a measure of availability of said each computer.
`
`5. (Original) A method as recited in claim 1 further comprising:
`
`for each particular segment, determining an identifier, said identifier being
`
`determined as a function of all of the data in said particular segment and only the
`
`data in said particular segment, where any two identical segments will have
`
`identical identifiers, and wherein the step (C) of maintaining further comprises
`
`associating each of said segments with its corresponding identifier.
`
`6. (Original) A method as recited in claim 1 wherein at least some of said
`
`plurality of segments are stored in an encoded form by compressing said at least
`
`some segments.
`
`7. (Original) A method as recited in claim 6 wherein at least some of said
`
`segments are compressed after being sent.
`
`8. (Original) A method as recited in claim 1 further comprising:
`
`for each particular segment, determining an identifier, said identifier being
`
`determined as a given function of the data comprising said particular segment,
`
`where any two identical segments will have identical identifiers, and wherein the
`
`

`

`In re Application of: FARBER, David et a1.
`Application S.N.:
`l ”980,679
`Response to Non-Final Office Action
`
`step (C) of maintaining further comprises associating each of said segments with
`
`its corresponding identifier.
`
`9. (Currently amended) A method of distributing a plurality of data items to
`
`a plurality of computers in a network of computers, wherein at least some of said
`
`computers in said network comprise part of a peer—to—peer (P2P) network of
`
`computers, the method comprising:
`
`(A)
`
`¥or—eaeh—of—said—plural-H=_7Lefidata—items;
`
`(-a-l—)—dividing each of said plurality of data items the—data—item into
`
`a plurality of segments; and
`
`[[(a2)]]
`
`for—eaeh—pameular—segment—of—said-phiral-H-y-of
`
`59313339,
`
`
`(fl—(aafl—causing each said—partieulaasegment of said
`
`segments to be stored on a plurality of computers {at—least oneeomputer in
`
`said fl network;
`
`[[(B)]] (Q) maintaining a4ist~o£ information about computers in said P2P
`
`network onto which each—o¥ said segments for crash—oiE said plurality of data items
`
`has have been stored; and
`
`(D)
`
`makingJr available to other computers in said P2P network the
`
`information about the computers onto which said segments for said plurality of
`
`data items have been stored.
`
`l0. (Currently amended) A method of obtaining a data item at a first
`
`computer in a eer-to- eer P2P network of computers, said data item comprising
`
`

`

`In re Application of: FARBER, David et a1.
`Application S.N.:
`l ”980,679
`Response to Non-Final Office Action
`
`a plurality of segments, each of said plurality of segments being stored on more
`
`than one computer in said P2P network, the method comprising:
`
`(A)
`
`obtaining information about computers in said P2P network that may
`
`have a copy of for each particular segment of said plurality of segments that
`
`comprise said data itellirsaid—eompnter—z;
`
`(B) [[(al)]]
`
`based at least in part on said information, requesting said a_t
`
`least one particular segment of said plurality of segments that comprise said data
`
`item from at—least—one—of- a plurality of computers in said P2P network of
`
`computers; and
`
`Q[[(a2)]]
`
`obtaining said particular segment from said at least one of a
`
`plurality of computers in said P2P network of computers; and
`
`D
`
`obtainin r at least one other se 1rment of said luralit of se Iments
`
`from at least one other computer in said P2P network.
`
`1 1. (Currently amended) A method as recited in claim 10 further
`
`comprising:
`
`said first computer combining a plurality of received segments each—said
`
`particular—segment to form said data item.
`
`12. (canceled)
`
`13. (Currently amended) A method as recited in claim 10 further
`
`comprising, for each said particular segment that comprises said data item:
`
`

`

`In re Application of: FARBER, David et al.
`Application S.N.:
`l l/980,679
`Response to Non-Final Office Action
`
`obtaining a list of one tw_o or more computers in said P2P network that
`
`should have a copy of said particular segment stored thereon, and wherein said
`
`step [[(al)]] (E) of requesting comprises requesting said particular segment from
`
`at least tw_o of said computers that should have a copy of said particular segment
`
`stored thereon.
`
`14. (Currently amended) A method as recited in claim 1 1 wherein said
`
`segments are stored on computers in said network in an encoded form, and
`
`wherein said step [[(a2)]] (Q) of obtaining, obtains the encoded form of each said
`
`particular segment, the method further comprising:
`
`for each particular segment of said plurality of segments that comprise said
`
`data item:
`
`(a3)
`
`decoding the particular segment.
`
`15. (Original) A method as recited in claim 14 wherein the encoded form
`
`comprises a compressed form, and wherein step (a3) comprises decompressing the
`
`particular segment.
`
`16. (Currently amended) A method as recited in claim 10 wherein said
`
`particular segments have been stored on said plurality of computers prior to said
`
`step [[(al)]] (E) of requesting.
`
`l7. (Currently amended) A method of obtaining a data item at a first
`
`computer in a eer-to- eer P2P network of computers, said data item comprising
`
`

`

`In re Application of: FARBER, David et al.
`Application S.N.:
`l l/980,679
`Response to Non-Final Office Action
`
`a plurality of segments, each of said plurality of segments being stored on a
`
`plurality of computers in said P2P network: said plurality of computers being
`
`distinct from said first computer, the method comprising:
`
`(A)
`
`for each particular segment of said plurality of segments that
`
`comprise said data item:
`
`(a0)
`
`obtaining a list of computers in said m network of
`
`computers that should have said particular segment;
`
`(al)
`
`requesting said particular segment from at least two
`
`computers oneeomputer on said list of computers; and
`
`(a2)
`
`obtaining [[of]] said particular segment from said at least one
`
`computer in said P2P network on—said—l-ist; and
`
`(B)
`
`combining each said particular segment to form said data item g
`
`said first computer,
`
`wherein at least two distinct segments are obtained in step (a2) from
`
`different computers in said P2P network.
`
`l8. (Canceled)
`
`19. (Original) A method as recited in claim 17 wherein said step (a2)
`
`obtains an encoded copy of said particular segment, the method further comprising
`
`the step of:
`
`(a3)
`
`decoding the encoded copy of the particular segment.
`
`

`

`In re Application of: FARBER, David et al.
`Application S.N.:
`l ”980,679
`Response to Non-Final Office Action
`
`20. (Original) A method as recited in claim 19 wherein said encoded copy
`
`is encoded by compressing said particular segment, and wherein said step (a3) of
`
`decoding comprises decompressing said encoded copy of the particular segment.
`
`21. (Currently amended) A method of storing a data item in a network of
`
`computers where at least some of said computers comprise a peer-to-peer network
`
`of computers, the method comprising:
`
`(A)
`
`dividing the data item into a plurality of parts; and
`
`(B)
`
`causing each particular part of said plurality of parts of said data
`
`item to be stored on a plurality of computers of at—least eneeomputeea said peer-
`
`to—peer network of computers;
`
`(C) maintaining {Hist of information about computers in said peer—to-
`
`peer network of computers onto which each—of said parts has have been stored; and
`
`(D) making the information about said computers available to other
`
`computers in said P2P network.
`
`22. (Canceled)
`
`23. (NEW) The method of claim 5 wherein the information made available
`
`to other computers in step (D) comprises: the identifier determined for a segment.
`
`24. (NEW) The method of claim 8 wherein the information made available
`
`to other computers in step (D) comprises: the identifier determined for a segment.
`
`

`

`In re Application of: FARBER, David et al.
`Application S.N.:
`l l/980,679
`Response to Non-Final Office Action
`
`25. (NEW) The method of claim 4 wherein the measure of availability of a
`
`computer comprises a measure of one or more measurement of bandwidth, cost,
`
`and reliability of a connection to the computer.
`
`26. (NEW) A method of obtaining a data item at a first computer in a peer-
`
`to—peer (P2P) network of computers, said data item comprising a plurality of
`
`segments, each of said plurality of segments having been stored on one or more
`
`computers in said P2P network, the method comprising:
`
`(A)
`
`for a particular segment of said plurality of segments that comprise
`
`said data item:
`
`(a1)
`
`obtaining information about computers in said P2P network
`
`that may have a copy of said particular segment, said information obtained
`
`for said particular segment including at least a substantially unique data
`
`identifier of the particular segment, said identifier having been determined
`
`as a given function of the data comprising said particular segment, where
`
`any two identical segments will have identical identifiers;
`
`(a2)
`
`based at least in part on said information obtained, requesting
`
`said particular segment from one or more computers in said P2P network;
`
`and
`
`(a3)
`
`in response to said requesting, obtaining said particular
`
`segment from at least one of said computers in said P2P network; and
`
`(B)
`
`repeating step (A) for multiple segments of said plurality of
`
`segments that comprise said data item; and
`
`

`

`In re Application of: FARBER, David et al.
`Application S.N.:
`l 1/980,679
`Response to Non-Final Office Action
`
`(C)
`
`combining the obtained segments to form said data item at said first
`
`computer, wherein at least two distinct segments are obtained from distinct
`
`computers in said P2P network.
`
`27. (New) The method of claim 26 wherein said data item is a compound
`
`file comprising a sequence of data segments.
`
`_10_
`
`

`

`In re Application of: FARBER, David et al.
`Application S.N.:
`l l/980,679
`Response to Non-Final Office Action
`
`Reconsideration and allowance of this application are respectfully
`
`REMARKS
`
`requested.
`
`By this Amendment, claims 3, 12, 18, and 22 have been canceled, and
`
`claims I, 9, 10,
`
`l l, l3, l4, l6, l7, and 21 have been amended. New claims 23-27
`
`have been added.
`
`The subject matter of canceled claims 3, 12, 18, and 22 has been
`
`incorporated into the claims from which the depended. Thus, e.g., independent
`
`claim 1 now recites that “at least some of said computers in said network comprise
`
`part of a peer-to-peer (P2P) network of computers.” Similar amendments have
`
`been made to independent claims 9, 10, 17, and 21.
`
`No new matter has been added by these amendments.
`
`Claims 1, 2, 4—1 1, 13-17, 19-21, and 23—27 are pending in this application.
`
`THE §102 REJECTIONS
`
`The Examiner rejected claims 1-22 under 35 U.S.C. § 102(e) as being
`
`anticipated by Woodhill er al. (US 5,649,196 A, hereinafter “Woodhill”). The
`
`grounds for this rejection are respectfully traversed.
`
`The present invention relates to a data processing system operable in a
`
`peer-to-peer (P2P) network. Data items (e.g., compound data files) are split into
`
`multiple segments, and the data segments are distributed to computers in the P2P
`
`network. A particular data segment may be located on a number of computers in
`
`the P2P network. (There is no requirement that the data segments that make up a
`
`data file all be located at the same computers in the network. Different data
`
`segments may be on the same or on different computers in the P2P network.)
`
`_11_
`
`

`

`In re Application of: FARBER, David et al.
`Application S.N.:
`l l/980,679
`Response to Non-Final Office Action
`
`In one aspect, e.g., as described in independent claims 1, 9, and 21 (and
`
`their respective dependents), the invention relates to distributing data in such a
`
`system, whereby each segment may be stored on one or more computers within
`
`the P2P network. Information about the computers onto which the segments have
`
`been stored is made available to other computers in the P2P network, thus
`
`allowing other, possibly anonymous, computers in the network to gain access to
`
`the data items and to rely on the availability of these data items.
`
`As recited in amended independent claim 1, this invention is a method of
`
`distributing a data item to a plurality of computers in a network of computers.
`
`At least some of the computers in the network comprise part of a peer—to-peer
`
`(P2P) network. The method includes the steps of: dividing the data item into a
`
`plurality of segments; and causing each segment of the plurality of segments to be
`
`stored on a plurality of computers in the P2P network. The method further
`
`includes the steps of maintaining information about the computers in the P2P
`
`network onto which the segments have been stored; and making available to other
`
`computers in the P2P network the information about the computers onto which the
`
`segments have been stored.
`
`Claim 5 depends from claim 1 and further recites the step of determining,
`
`for each particular segment, an identifier, the identifier being determined as a
`
`function of all of the data in the particular segment and only the data in the
`
`particular segment, where any two identical segments will have identical
`
`identifiers. Claim 8 requires that the identifier be determined as a given function
`
`of the data comprising the particular segment, where any two identical segments
`
`will have identical identifiers. For both claims 5 and 8, step (C) of maintaining
`
`further comprises associating each of the segments with its corresponding
`
`identifier. New claims 23 and 24 depend from claims 5 and 8, respectively, and
`
`_12_
`
`

`

`In re Application of: FARBER, David et al.
`Application S.N.:
`l l/980,679
`Response to Non-Final Office Action
`
`require that “the information made available to other computers . . . comprises: the
`
`identifier determined for a segment.”
`
`Independent claim 9 recites a method of distributing a plurality of data
`
`items to a plurality of computers in a network of computers, wherein at least some
`
`of the computers in the network comprise part of a peer-to-peer (P2P) network of
`
`computers. The method of claim 9 includes the steps of dividing each of the
`
`plurality of data items into a plurality of segments; and causing each of the
`
`segments to be stored on a plurality of computers in the P2P network. (As noted
`
`earlier, there is no requirement that the data segments that make up a data file all
`
`be located at the same computers in the network. Different data segments for a
`
`particular file may be on the same or on different computers in the P2P network.
`
`Similarly, there is no requirement that each of data items be distributed over the
`
`same computers in the network). The method further includes the steps of
`
`maintaining information about computers in the P2P network onto which the
`
`segments for the plurality of data items have been stored; and making available to
`
`other computers in the P2P network the information about the computers onto
`
`which the segments for the plurality of data items have been stored.
`
`Independent claim 21 (as amended) recites a method of storing a data item
`
`in a network of computers where at least some of the computers comprise a peer-
`
`to-peer network of computers. The method includes the steps of: dividing the data
`
`item into a plurality of parts; and causing each particular part of the plurality of
`
`parts of the data item to be stored on a plurality of computers of the peer-to-peer
`
`network of computers. The method further requires maintaining information
`
`about computers in the peer-to-peer network of computers onto which the parts
`
`have been stored; and making the infomiation about the computers available to
`
`other computers in the P2P network.
`
`_13_
`
`

`

`In re Application of: FARBER, David et al.
`Application S.N.:
`l l/980,679
`Response to Non-Final Office Action
`
`In another aspect, e.g., as described in independent claims 10, 17, and 25
`
`(new), and their respective dependents, this invention relates to obtaining data
`
`items in such a system.
`
`Independent claim 10 (as currently amended) recites a method of
`
`obtaining a data item at a first computer in a peer-to-peer (P2P) network. As
`
`required by the claim, the data item comprises a plurality of segments, where each
`
`of the plurality of segments is stored on more than one computer in the P2P
`
`network. The method of claim 10 includes the steps of: obtaining information
`
`about computers in the P2P network that may have a copy of each particular
`
`segment of the plurality of segments that comprise the data item; and, based at
`
`least in part on the information, requesting at least one particular segment of the
`
`plurality of segments that comprise the data item from a plurality of computers in
`
`the P2P network. The method further requires obtaining the particular segment
`
`from at least one of the computers in the P2P network; and obtaining at least one
`
`other segment from at least one other computer in the P2P network.
`
`Independent claim 17 (as currently amended) recites a method of
`
`obtaining a data item at a first computer in a peer—to—peer (P2P) network. The
`
`data item comprises a plurality of segments, each of the segments being stored on
`
`a plurality of computers in the P2P network. (Note, again, that each different
`
`segment need not be stored on the same plurality of computers.) The method of
`
`claim 17 includes the steps of, for each of the plurality of segments that comprise
`
`the data item: (a0) obtaining a list of computers in the P2P network that should
`
`have the particular segment; (a1) requesting the particular segment from at least
`
`two computers on the list of computers; and (a2) obtaining the segment from at
`
`least one computer in the P2P network. The method of claim 17 further requires
`
`the step of combining the segments to form the data item on the first computer,
`
`_14_
`
`

`

`In re Application of: FARBER, David et al.
`Application S.N.:
`l 1/980,679
`Response to Non-Final Office Action
`
`“wherein at least two distinct segments are obtained in step (a2) from different
`
`computers in the P2P network.”
`
`New independent claim 26 recites a method of obtaining a data item at a
`
`first computer in a peer—to—peer (P2P) network. The data item comprises a
`
`plurality of segments, each of the segments having been stored on one or more
`
`computers in the P2P network. The method comprising includes the step of: (A)
`
`for a particular segment of the plurality of segments that comprise the data item:
`
`(a l) obtaining information about computers in the P2P network that may have a
`
`copy of the particular segment, the information obtained for the particular segment
`
`including at least a substantially unique data identifier of the particular segment,
`
`the identifier having been determined as a given function of the data comprising
`
`the particular segment, where any two identical segments will have identical
`
`identifiers; (a2) based at least in part on the information obtained, requesting the
`
`particular segment from one or more computers in the P2P network; and (a3) in
`
`response to the requesting, obtaining the particular segment from at least one of
`
`the computers in the P2P network. Step (A) is repeated for multiple segments of
`
`the plurality of segments that comprise the data item. The obtained segments are
`
`combined to form the data item at the first computer, “wherein at least two distinct
`
`segments are obtained from distinct computers in the P2P network.”
`
`Note that the claims do not preclude (and do contemplate) that one or more
`
`portions of a compound data item may already be present on the computer trying
`
`to obtain the data item.
`
`Woodhill relates to “distributed storage management on a networked
`
`computer system and, more specifically, to a system and method for distributed
`
`storage management on a networked computer system including a remote backup
`
`_15_
`
`

`

`In re Application of: FARBER, David et al.
`Application S.N.:
`l 1/980,679
`Response to Non-Final Office Action
`
`file server and one or more local area networks in communication with the remote
`
`backup file server.” Woodhill, col. 1, lines 10—17.
`
`Woodhill describes a system for backing up and restoring data in a
`
`network. Woodhill, col. 1, lines ()5 et seq. Local computer files are backed up to a
`
`remote backup server via a wide area network (WAN). One copy of each file is
`
`made on the backup server, and one other copy of the file is made on another
`
`“local” computer (i.e., another computer on the same local area network (LAN)).
`
`The backup file on the LAN may be deleted if space is needed. If a file needs to
`
`be restored, it is obtained either from the other computer in the same LAN or, if
`
`that is not available, from the backup server via the WAN.
`
`Woodhill does not describe computers in a peer-to-peer (P2P) relationship.
`
`The Examiner relies on elements 20 in Woodhill’s Fig. 1 (reproduced below) to
`
`supposedly teach a P2P network. Applicant respectfully disagrees.
`
`
`
`
`
`-16-
`
`

`

`In re Application of: FARBER, David et al.
`Application S.N.:
`1 1/980,679
`Response to Non-Final Office Action
`
`As shown in Woodhill’s Fig. l (and described in Woodhill, col. 3, lines 8—
`
`30), each local computer 20 is part of a corresponding local area network 16.
`
`(“Each local area network 16 includes
`
`local computers 20 each in
`
`connnunication with their respective local area network 16 via data paths 17.” Id.
`
`lines 24 et seq.) But there is nothing in Woodhill to teach or in any way suggest
`
`that any of the computers across any local area network form a peer-to—peer
`
`network. Even if, arguendo, the local computers 20 within a LAN 16 in Woodhill
`
`do form a P2P network (which applicant does not accept), Woodhill’s remote
`
`backup file server 12 is not part of any such P2P network.
`
`As to claim 1, Woodhill lacks any teaching of the claimed: “causing each
`
`segment of said plurality of segments to be stored on a plurality of computers in
`
`said P2P network.” In Woodhill each segment is stored on the backup server and
`
`on one other computer 20 in the same LAN. As noted above, the backup server
`
`and the computer 20 are not part of a P2P network. Furthermore, Woodhill has no
`
`teaching of the claimed steps of “maintaining information about the computers in
`
`said P2P network onto which said segments have been stored; and making
`
`available to other computers in said P2P network the information about the
`
`computers onto which said segments have been stored.” In Woodhill the
`
`computer being backed up maintains its own information, but this information is
`
`not and would not be made available to other computers in the network.
`
`For at least these reasons, claim 1 and its dependents are patentable over
`
`Woodhill.
`
`Similar arguments apply to claims 9 and 2] and their dependents.
`
`As to the claims to obtaining data in a P2P network (claims 10, 17, and
`
`25 and their dependents), Woodhill lacks any teaching of the P2P network (as
`
`discussed above). Further, as to claim 10, Woodhill lacks any teaching of the
`
`claimed “requesting at least one
`
`segment
`
`from a plurality of computers
`
`_17_
`
`

`

`In re Application of: FARBER, David et a1.
`Application S.N.:
`l 1/980,679
`Response to Non-Final Office Action
`
`in said P2P network.” As noted above, in Woodhill, if a file needs to be restored,
`
`that file is obtained either from the other computer 20 in the same LAN or, if that
`
`is not available, from the backup server via the WAN. But Woodhill does not
`
`request a segment from a plurality of computers in a P2P network. Claim 10
`
`further requires obtaining one segment “from said at least one of a plurality of
`
`computers in said P2P network” and another segment “from at least one other
`
`computer in said P2P network.” This feature is lacking from Woodhill where a
`
`file is restored either from another computer 20 in the same LAN or, if that is not
`
`available, from the backup server (as noted, backup server and the computer 20
`
`are not part of a P2P network).
`
`For at least these reasons, claim 10 and its dependents are patentable over
`
`Woodhill.
`
`Similar arguments apply to claims 17 and 25 and their dependents.
`
`[11 view of the above, withdrawal of this rejection under §102 is respectfully
`
`requested.
`
`RELATED APPLICATIONS
`
`The Examiner’s attention has previously been directed to co-pending US.
`
`Patent Applications which are directed to related technical subject matter. The
`
`attached Form PTO-1449 (modified) lists office actions issued in applications
`
`1 1/017,650 and 1 1/724,232. As these patent applications are stored electronically
`
`at the PTO, no copies are being provided herewith. If the Examiner requires
`
`copies of any of these applications or any additional information regarding any of
`
`the documents cited herein, the Examiner is respectfully requested to contact the
`
`undersigned at the number provided.
`
`_18_
`
`

`

`In re Application of: FARBER, David et a1.
`Application S.N.:
`l ”980,679
`Response to Non-Final Office Action
`
`CONCLUSION
`
`Applicant respectfully submits that this application is in condition for
`
`allowance, and an early action allowing the claims is earnestly solicited.
`
`Should the Examiner believe that a telephone call will resolve any
`
`outstanding issues in this case, he is invited to telephone the undersigned at the
`
`number provided.
`
`until/ u nless an issue fee transmittal sheet is filed.
`
`CU STO M ER N U M BER
`
`Respectfully submitted,
`
`
`
`
`CHARGE STATEMENT: De osit Account No. 501860, order no. 2618-0020.
`The Commissioner is hereby authorized to charge any fee specifically authorized hereafter. or any missing
`
`
`or insufficient fee(s) filed, or asserted to be filed, or which should have been filed herewith or concerning any
`
`
`paper filed hereafter, and which may be required under Rules 16—18 (missing or insufficiencies only} now or
`hereafter relative to this application and the resulting Official Document under Rule 20, or credit any
`overpayment, to our AccountingrOrder Nos. shown above, for which purpose a duplicate copy of this sheet
`
`is attached
` This CHARGE STATEMENT does not authorize charge of the issue fee
`
`
`
` [Brian Siritzky/Reg. No. 37,497
`
`
`
`Brian Siritzky, PILD.
`Registration NO . 37 49?
`
`75948
`
`Davidson Bcrquisl Jackson & Gowdcy LLP
`4300 Wilson Blvd, "i'lh Floor,
`Arlington Virginia 22203
`Main; (703) 894—64onomx; (703) 894—6430
`
`By:
`
`_19_
`
`