533333;:
`NUMBER
`SERIALNUMBER'.
`-33/553.3?3‘
`
`.
`
`‘
`
`,
`
`_-
`
`f:
`
`.
`
`11/33/33.
`
`-;3.
`
`~"
`
`3
`
`"
`
`'~
`
`'
`
`.
`”'
`
`PATENT
`NUMBER
`.
`"
`
`'
`
`3
`
`""-.GROUP'ART'UNIT'
`3307
`
`33WMMHND, TX;
`wammMILL..HUu3T3N. TX; 33013 3. mammHiLu.
`R. MDRE 33.. HDU3TQN.‘Txg 33v H. 333313. Hmu3333. 3x.
`
`:xé;:§;:{~:'
`
`3:33:33 m;3--I...3\3'.1:3 ' ~
`
`3
`
`.j
`
`fl
`
`, LIV/IIIi3.‘/"’EE3III{3
`
`3133333
`
`3333-33"'L.. 3333 {'3 '3 33333393
`
`.
`
`i
`
`"
`
`‘53:!333:E5I|2'=33\3 3:13... 133333553
`
`3;.,. 1332333333533
`
`1:2339‘33'33‘33'3?
`
`(3 yes 'En6
`"§oretgn priomy claimed
`. 8'5 USC119 commons me! C] yes
`no‘
`"V.°f333°d WW3'ACkf'IOMWQ'ed
`Examine'r‘snmas
`31333;:
`L. 33\7‘33333 3'
`3:4
`3.- I.) I... 333: H (-3 331 T
`
`_
`
`.
`
`‘
`
`3
`
`‘
`
`‘
`
`"
`
`" ..
`-
`
`‘
`
`3
`
`.
`
`,
`
`.
`"cwms
`3
`
`xFILINGu, FEE
`necawrso
`3
`.. ".'
`'
`
`.
`
`ATTORNEYS,
`DOCKET NO,
`-331333152:Fan‘s":
`‘
`
`"
`
`3
`
`"
`
`~
`
`' §Y$TEMjs METHHD me KINTHIUUTLM‘HTHRQHL MANAGEMPNF HN N333u3333
`
`.,,.
`
`.
`lé/flflfé
`L.:,..m3w.:mz3::YRIHYH :35n9 3nqu 0393333 12463331935.
`‘
`,,
`HU.S. DEPT. OF UOMU./PA‘F &TM"~“PTOv436L (Bev12'29
`
`..-..r w......... ......W....
`
`“......“m
`
`.....
`
`...-...
`
`..,..,,..
`
`£9
`
`7 PARTS OF APPLICATION
`”LED SEPARATELY
`‘ NOTICE OF ALLOWANCE MAILED '
`
`_
`
`‘
`
`'
`
`Ass3stant Examiner
`
`.
`
`,
`
`'
`
`'
`
`~
`
`.
`
`_
`
`‘
`
`.
`
`_
`
`I W /. )5 c1‘7
`. Anlications Examiner
`_
`CLAIMS ALLOWED
`'
`'
`Total Claims ,‘w 'P'rint Ciaim4
`
`3333.33RYE"’\~
`313,33"?3(‘0
`
`4-.
`‘.
`
`3
`
`»
`
`~
`
`I
`
`3
`
`.
`
`an
`.Q.0.0
`
`.
`
`EXHIBIT
`QF‘Soncs‘A LAW/[61>
`Z 00 BL
`
`

`

`UTILITY
`SERIAL
`NUMBER
`
`‘
`
`V
`
`""
`
`PATENT DATE
`
`PATENT
`NUMBER
`
`SERtAL NUMBER
`08/085,596
`
`‘ FILING DATE cuAss
`07/01/93
`'
`
`"
`
`'
`
`SUBCLASS
`
`‘
`
`_
`
`'
`
`.
`."‘>»/\\v>
`”1
`
`GROUPARY UNIT
`2307
`
`JAMES R. WDUDHILL, HOUSTON, TX; LOUIS R. WOODHILL, RICHMOND, TX;
`WILLIAM R. MORE JR., HOUSTON, TX:
`JAY H. BERLIN HOUSTON, TX.‘
`
`AppLitANTs
`
`*$CQNTINUING Dng****t*#****$***$*****\
`VERIFIED
`4112mm W8 tr
`
`“*FOREIGN/PCT APPLICATIONS$$$$$$******
`VERIFIED
`
`mm- mi
`
`FOREIGN FILING LICENSE GRANTED 10/05/93
`
`Foralgn priorlty claimed
`35 USC 119 conditions mat D vs: R no
`Verttled and Acknowledged
`Examlheri: :nitials
`CHR I STDPHER H. GEBHQRDT
`K I RKP‘ATR I CK 8c LOCKHART
`1500 OLIVER BUILDING
`P I TTSBURGH ,, PA 1 5222
`
`,
`
`ATTORNEV'S
`DOCKET NO.
`
`SYSTEM AND METHOD FOR DISTRIBUTED STORAGE M NAGE EN
`
`ON NETwORKED
`
`COMPUTER SYSTEMSAW (23WWM
`
`
`
`US. 3591" 07 COMMaVI‘. 6: TM otflco~ Fro-43m. (70V. 10-78)
`
`PARTS OF APPLICATION
`;
`”LED SEPARATELY
`NOTICE OF ALLOWANCE MAILED
`
`.
`
`‘
`
`_
`
`»
`
`Assistant Examiner
`
`'
`
`,
`
`Antications Examiner
`CLAIMS ALLOWED
`Total Claims
`Print Claim
`
`.
`
`,
`
`‘
`
`'
`
`‘
`
`; Amount Due
`
`iSSUE FEE
`Date Paid
`
`.
`
`'
`
`Sheets Drwg.
`
`DRAWlNG
`.
`
`Print Fig.
`
`i
`
`ISSUE I
`BATCH
`Primary Examiner NUMBER
`PREPARED FOR ISSUE,
`V
`
`WARNING: The information diSclosed herein may be restricted. Unauthorized disclosure may be prohibited
`by the United States Code Title 35, Sections 122, 181 and,368. Possession outside the U.S.
`n-p.w.a o T.-.A..m.ut. Am-.. in waa‘u‘uOn—J 6—. «Hohhdwmd Amn‘hvlnnk ”ant finn0vn~3¢~nn “at”
`
`

`

`08/085,596
`
`SYSTEM AND METHOD FOR DISTRIBUTED STORAGE
`MANAGEMENT ON NETWORKED COMPUTER SYSTEMS
`
`Transaction History
`
`Date
`O7-0l-l993
`
`Transaction Descri ition
`
`initial Exam Team nn
`
`08—02nl993 Notice Mailed-—A lication Incomlete--Filin; Date Assined
`10—01—1993 A lication Is Now Comm
`10-184993
`A , lication Catured on Microfilm
`
`1’0-29~l993
`
`Case Docketed to Examiner in GAU
`
`Case Docketed to Examiner in GAU
`10-20— 1994 Non~Fina1 Re'ection
`
`
`10914994 Mail NonvFinal Re' ection
`
`
`
`
`
`
`02-23-1995
`02-23-1995
`02-23-1995
`
`Information Disclosure Statement (IDS) Filed
`Information Disclosgifitatement IDS Filed
`Res onse after Non—Final Action
`
`Re uest for: Extension of Time - Granted
`02'23—1995
`03-15wl995 Date Forwarded to Examiner
`
`Final Rejection
`05—08-1995
`051 14995 Mail Finalwlggjection (FIOL — 326)
`ll-O9~l995 Reuest for Extension of Time ~ Granted
`
`01-11-1996 Aband. for Failure to Res 0nd to O A
`
`01—16-1996 Mail Abandonment for Failure to Resond to Office Action
`
`02~Ol-l996 Abandonment for Purposes of Filing an FWC - File Combined with Child
`A . , lication
`
`

`

`5,649,196
`
`SYSTEM & METHOD FOR DISTRIBUTED STORAGE MANAGEMENT
`ON NETWORKED COMPUTER SYSTEMS USING BINARY OBJECT
`
`IDENTIFIERS
`
`Transaction History
`
`
`Date
`12—14-1995
`
`01~23—l996
`
`10—24-1996
`
`Transaction Descrigtion
`Initial Exam Team nn
`
`A lication Ca tured on Microfilm
`
`Prelimina Amendment
`
`12—04-1996 Case Docketed to Examiner in GAU
`01-02-1997
`Mail Notice of Allowance
`01w02-l997
`02-05.1997
`02—28-1997
`
`Notice of Allowance Data Verification Comleted
`
`Amendment after Notice of Allowance Rule 312
`Date Forwarded to Examiner
`
`
`Mail Res onse to 312 Amendment PTO—271}
`
`'
`
`‘ 03-06-1997
`
`
`
`
`03—18-1997 Mailroom Date of Drawings)
`i03—20—l997
`Issue Fee Pa ment Verified
`O4~l4-l997 Drawing 5 Received at Publications
`
`
`
`
`
`
`
`
` 03-06~l 997 Res onse to Amendment under Rule 312
`
`
`
`04*15-1997 Drawin s Matched to A .lication
`04~18~1997 Drawingts) Processing Comgleted
`06—09—1 997
`Issue Notification Mailed
`
`
`07-15—1997
`Recordation of Patent Grant Mailed
`04—02-2002
`
`0403-2002
`
`Corresondcnce Address Chane
`Change in Power of AttorngflMaX Include Associate POA)
`01-25-2005 Applicant Has Filed a Verified Statement of Small Entity Status in Compliance
`
`with 37 CFR 1.27
`
`
`
`I
`
`
`
`

`

`Date
`
`?
`
`5333,21:
`
`
`
`.
`
`CONTE
`
`F
`
`uaxe
`i
`
`R
`
`d "
`
`,
`REGWH)
`
`\
`
`1
`
`'
`
`OCT 2 1. W95
`
`.
`
`1. Application
`‘.
`
`papers.
`
`'
`
`~
`
`GROUPZSOO'
`
`
`
`—-
`
`l.
`
`.
`
`312.
`
`
`4
`'
`‘
`
`'
`
`W14.Wm
`
`Wm@M
`
`-
`
`1
`
` 1am WW
`
`'
`
`,
`
`20;
`21.
`
`.
`
`‘
`
`‘
`
`..
`
`‘
`
`4
`
`‘
`
`.
`
`,
`
`4
`
`"
`
`'
`.
`_._._....._‘._W
`
`' W
`22.
`,
`.
`MamW
`
`
`
`24'W W
`
`
`
`25.
`
`.. W
`
`
`”
`
`.
`...._._...W
`26.
`L W
`h
`
`27.
`i
`
`‘ 28.WW
`
`-
`
`‘
`
`’
`
`'90
`
`.
`
`‘
`
`.
`
`.
`
`

`

`'
`
`Date
`Received
`Magfed
`RECEVED .
`
`JAN 2 5 39%
`
`GROUP 3200 N
`
`
`
`mm
`
`.
`
`Date
`Entered
`or
`Counted
`
`u
`
`CONTENTS '
`
`
`
`

`

`
`PPLICATION SERIXC9bWaéfi
`2'
`‘ 94 ..
`03 55’5“.374 I;
`
`
`gileCA ‘ “SKAME (PLEASE PRINT)
`'
`
`
`
`‘ 3/ V
`
`
`
`ASSlSTANT EXAMINER (PLEASE STAM ORPRINT FULL NAME)
`"
`"T
`'
`//‘7/'
`
`
`.
`'
`'
`,
`3 us EPARTMENT'OFCMMEHCE'
`'
`(REM-91)
`I
`ISSUE CLASSIFICATION SLIP ,
`-
`Ememmommwinmncs
`\
`
`
`
`

`

`
`/. W
`m...— ~
`W—
`
`”mum
`
`
`m-
`
`
`—_-—
`
`
`spec-HAND II.“
`”-
`
`-— a
`,
`..
`
`
`
`
`
`
`
`
`
`
`INDEX OF CLAIMS.
`
`‘ Date
`
`,
`
`2
`
`I
`
`l
`
`3‘WIIIII
`i-fi'aEEEEEE
`..:-====.-=
`IIIIIIIIII
`
`
`
`,
`
`
`
`
`
`III-II
`$9
`10 IIIII
`an -n
`
`14
`
`I
`
`~ I
`
`"EA‘WII
`WEI ””4".
`‘-IMMII
`a
`’
`m...»
`as n
`_0. all
`III
`22 II
`
`
`
`III-III
`ZS BEEP-Pu:
`43 IIIIIIII
`~44 IIIIIIII
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`4
`
`'
`
`
`
`
`
`
`
`
`Ciaim
`a E
`
`Date
`
`g III-Ill
`.=====---
`..===:====
`54
`55 III—III
`
`59 IIII
`EII
`.61 I I
`
`63 E-I-I
`II:—
`III-
`68 I s
`59
`-
`i
`7°
`71
`72
`
`.64
`
`-
`-
`
`-II
`73
`IIIII ,
`III
`III-
`III
`26 I III—I
`_
`3; -=-—-=—
`-;7”-I=II
`IIIIIIIII- W . II—IIIII
`-..=.-.====.
`=m~===--
`32 ---
`5"
`.
`i’awmgs"6333:?“
`I
`-
`+
`assumed I 82
`
`
`s ,IIII .a
`‘2‘:
`swasssssssss II—II
`
`I 34 III-II
`A
`,onea!
`III-II
`:: .=====..
`=%.-====.--
`III-III
`III-III
`
`
`
`.
`
`IKE-III
`"BEE-.-
`IIIIIIII
`IIIIIII
`
`

`

`POSITION
`
`
`
`
`
`
`
`
`
`mm—
`
`TYPIST
`, —
`
`VERIFIER
`- Ea
`--
`'-
`-
`. I
`
`
`
`
`
`
`FiLE MAINT.
`
`DRAFTING.
`
` SPEC. HAND
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`INDEX OF CLAIMS
`
`
`Claim
`Date
`
`jg 2,2
`.6
`E g 30
`:.. u
`ail-II
`
`~
`
`I
`
`E====--
`III-III
`IlIIIIIII ~
`
`IIII-I I
`III-III
`' I
`II
`
`I
`
`I
`
`II
`
`—
`
`
`
`:
`
`'27 ‘1 III=II
`
`I II II
`28 =
`: I
`
`u 31
`
`
`
`:= =-.I= 2’ 2291111.;é1212iiiiiéliliiigll3313;:
`,. m .
`(hroug num era
`ancee
`—.--.
`{w :1::'"""“""'“':::::::::::: $332333;
`_.
`Me uvence
`
`Q , fl-=
`é:t:::1:.,....‘.‘,.‘,‘.A.:::::::::83:3;
`-' IIII
`; III-II
`
`III-IIIIII
`
`III-I i
`III-III-
`'
`43
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`

`

`J...
`
`[JR/085598
`PATENT APPLICATION SERIAL NO.
`
`U.S. DEPARTMENT OF COMMERCE
`PATENT AND TRADEMARK OFFICE
`‘
`FEE RECORD SHEET
`
`160 KM 07/22/93 08085596
`
`1 101
`
`932.00 OK 93085I
`
`

`

`
`
`
`
`fly/0&&$:96
`
`
`
`Docket No
`Commissioner of Patents and Trademarks
`
`Washington, 0.0. 20231
`
`m
`
`PA TENT
`
`"/ 93085
`W
`CW,
`
`NEW APPLICATION TRANSMITTAL
`
`Transmitted herewith for tiling is the patent application of
`
`lnventor(s):
`
`Z‘)0 fi/fiufifl/
`~W .W'
`James R. Woodhill et a1.
`
`WARNING Patent must be applied lor in the namels) oi all 0! the actual inventor(s) 37 OFF? 1 41(a) and
`1.553(1))
`
`For (title):
`
`SYSTEM AND METHOD FOR DISTRIBUTED STORAGE MANAGEMENT ON
`NETWORKED COMPUTER SYSTEMS
`1‘ Type of Application
`
`This new application is for a(n) (check one applicable item below):
`
`:53] Original
`
`Ci Design
`
`‘
`
`’
`
`[3 Plant
`WARNING: Do not use this transmittal for a completion in the US. of an international Application under 35
`U. S. C. 371(c)(4) unless the international Application is being filed as a divisional. continualionor
`continuation-impart application.
`
`NOTE:
`
`It one of the following 3 items apply then complete and attach ADDED PAGES FOR NEW APPLICA-
`TION TRANSMITTAL WHERE BENEFIT OF A PRIOR U. 8. APPLICATION CLAIMED.
`
`a Divisional
`
`[j Continuation
`
`[j Continuation—impart (CIP)
`
` -w
`
`CERTIFICATION UNDER 37 CFR 1.10
`
`l hereby certify that this New Application Transmittal and the doojumTts1reterredt<§61953enclosed therein are being
`deposited with the United States Postal Service on this date
`in an envelope
`as “Express Mail Poet. Ollice to Addressee“ Mailing Label Number H37 1 97 4
`7
`addressed ,
`to the: Commissioner of Patents and Trademarks. Washington, 0.0. 20231.
`Beth H. Retort
`
`
`
`ere/n has the number of the "Express Mail" mailing label
`NOTE: Each paper or lee referred to as enclos-
`placed thereon prior to mailing. 37 CFR 1.700)).
`
`(Application Transmittal [4-1]-—~page 1 of 7)
`
`
`
`

`

`2. Benefit of Prior us. Application(s) (35 use 120)
`NOTE:
`It the new application being transmitted Is a divisional, continuation or a continuation-impart ol'a parent
`case, or where the parent base is an International Application which designated the U.S.. then check
`the following item and complete and attach ADDED PAGES FOR NEW APPLlCA TION TRANSMiTTAL
`WHERE BENEFIT OF PRIOR U.S. APPLICA TION(S) CLAIMED.
`
`[j The new application being transmitted claims the benefit of prior U.S. applica-
`tionts) and enclosed are ADDED PAGES FOR NEW APPLICATION TRANSMIT-
`TAL WHERE BENEFIT OF PRIOR U.S. APPLICATION(S) CLAIMED.
`
`3. Papers Enclosed Which Are Required For Filing Date Under 37 CFR 1.53(b) (Reg-
`ular) or 37 CFR 1.153 (Design) Application
`”3.3.." Pages of specification
`.8”, Pages of claims
`ml.” Pages of Abstract-
`“.13 Sheets ct drawing
`
`[3 formal
`
`g]
`
`informal
`
`WARNING: DO NOT submit original drawings. A high quality copy of the, drawings should be supplied when
`filing a patent application. The drawings that are submitted to the Ollice must be on strong, white,
`smooth, and non~shiny paper and meet the standards according to § 1.84. It corrections to the
`drawings are necessary, they should be made to the original drawing and a high-quality copy at
`the corrected original drawing then submitted to the Office. Only oneicopy ls required or de-
`sired. Comments on proposed new 37 cm 1.84. Notice of March 9, 1988 (1990 0.6. 5762).
`
`NOTE:
`
`"Identifying indicia such as the serial number, group and unit, title of theinvention, attorney’s docket
`number, inventors name, number of sheets, etc, not to exceed 23/4 inches (7.0 cm.) in width may be
`placed in a centered location between the side edges within three fourths inch (19.1 mm.) of the top
`edge. Either this marking technique on the front of the drawing or the placement, although not pre-
`ferred, of this information and the title of the invention an the back of the drawings is acceptable. " Pro-
`posed 37 CFR 1.234(1). Notice of March 9, 1988 (1090 0.6. 57-62).
`
`4. Additional papers enclosed
`
`Preiiminary Amendment
`
`Information Disclosure Statement.
`
`Form PTO~1449
`
`Citations
`
`Declaration of Biological Deposit
`
`Authorization of AttorneyIs) to Accept and Follow Instructions from Representa-
`tive
`
`Special Comments
`Other
`
`CIDDECIDED
`
`(Application Transmittal [4-11—page 2 of 7)
`
`
`
`
`
`

`

`
`
`5. Declaration or oath
`
`C] Enclosed
`
`executed by (check all applicable boxes)
`
`[3
`iii
`
`lnventor(s).
`legal representative of inventorts). 37 CFR 1.42
`or 1.43
`
`D joint inventor or person showing a proprietary
`interest on behalf of inventor who refused to
`sign or cannot be reached.
`
`D this is the petition required by 37 CFR 1.47 and the statement
`required by 37 CFR 1.47 isalso attached. See item 73 lye/aw tor
`lee,
`
`Not Enclosed.
`
`WARNtNG:
`
`,Where the tiling is a completion in the (1.3 of an International Application but where a declaration is not
`available or where the completion 0/ the US. application contains sub/eat matter in addition to the
`International Application the application may be treated as a continuation or continuation-impart, as the
`case may be. utilizing ADDED PAGE FOR NEW APPLICA TION TRANSMITTAL WHERE BENEFIT OF PRIOR
`US. APPLICATION CLAIMED
`
`Ci Application is made by a person authorized under 37 CFR t4l (c) on behalf
`Of all the above named inventorls). {The declaration or oath, along wrlh the Surcharge
`root/tied by 37 OFF? 1 H979) can be tiled subsequent/y)
`
`NOTE
`
`It IS important that all the correct invenIOits) are named tor tiling under 37 CFR 1.4 1(0) and t.53{bt.
`
`[It
`
`Showing that the filing is authorized (Not required unless calledinlo question
`37 CFR l.4 ltd).
`
`6.
`
`lnventorship Statement
`
`WARNING:
`
`It the named Inventors are each not the inventors 0/ all the claims an explanation. including the ownership
`oi the various claims at the time the last claimed invention was made. should be submitted
`
`The inventorship for all the claims in thisapplication are:
`lit The same
`
`.
`,
`i_
`or
`[I] Are not the same. An explanation, including theownership of the various claims at the
`time the last claimed invention vies made,
`
`Cl
`
`is submitted.
`
`D will be submitted.
`
`7. Language
`
`NOTE: An application including a signed oath or declaration may be filed in a language other than English.
`A verified English translation of the non-English Ianguage'application and the processing tea at
`$130.00 required by 37 CFR t. t7{t<) is required to be filed with the application or within such time
`as may be set by the Office. 37 CPR 1.52M).
`
`NOTE: A non-English oath or declaration in the form provided or approved by the PTO need not be translated.
`37 CFR 7.69m.
`
`English
`
`l3 ‘ non—English
`
`C]
`
`the attached translation is a verified translation. 37 CFR 1.52ld).
`
`(Application Transmittal [ct-llwpage
`
`3 of 7)
`
`
`
`
`

`

`8. Assignment
`EX An assignment of the invention to LEGENT C03? oration
`
`
`
`D is attached. A separate U "COVER SHEET FOR ASSlGNMENT (DOCU-
`MENT) ACCOMPANYING NEW PATENT APPLICATION" or C] FORM PTO
`‘ 1906 is also attached.
`
`X]
`
`will follow.
`
`NOTE:
`
`"ii an assignment is submitted with a new application, send two separate letters-one for the
`application and one for the assignment." Notice of May 4, 1990 (7114 0.6. 77-78).
`
`9. Certified Copy
`
`Certified copyties) ot applicationls)
`
`
`(country)
`
`.
`
`(appint no.)
`
`3
`
`(filed)
`
`
`(country)
`(appln. no.)
`(med).
`
`
`(country)
`
`‘ (appln. no.)
`
`.
`
`(filed)
`
`from which priority is claimed
`
`E3
`[I]
`
`ls(are) attached.
`will follow.
`
`'NOTE:
`
`The foreign application forming the basis for the claim for priority must he telerred to in the oath or
`declaration, 37 CH? 165(3) and 7.63.
`'
`
`NOTE: This item is for any foreign priority for which the application being filed directly relates. if any parent
`(1.8. application or InternationaiAppiication from which this application claims benefit under 35 Ms. C.
`120 is itself entitled to priority lrom a prior foreign application then complete item 18 on the ADDED
`PAGES FOR NEW APPLiCA TION TRANSMITTAL WHERE BENEFIT OF PRIOR us. APPLICA-
`TiONtS) CLAIMED.
`
`)0. Fee Calculation (37 CFR 1.16)
`
`At
`
`[34 Regular application
`
`CLAIMS AS FILED
`
`Number filed
`
`Number Extra
`
`Rate
`
`Basic Fee
`
`37 CFR 116(8)
`
`$710.00
`
`Total
`.
`
`Claims (37 CFR 1.16(c)) 20 ~20:
`0
`x
`$ 22.00
`-
`0
`
`independent
`.
`Claims (37 CFR 1.1603»
`6 was
`3
`x
`$ 74.00
`222'00
`
`
`if any
`Multiple dependent claim(s_),
`
`‘ ‘(37 CFR' 1.16(d)) $230.00
`
`
`
`
`
`E3 Amendment cancelling extra claims enclosed.
`
`Cl Amendment deleting multiple—dependencies enclosed.
`
`[3
`
`Fee for extra claims is not being paid at this time.
`
`NOTE:
`
`If the fees for extra claims are not paid on filing they must be paid or the claims cancelled by
`amendment, prior to the expirationiof the time‘per/od set for response by the Patent and Trademark
`Office in any notice of fee deficiency. 37 CFR 1.16td).
`Filing Fee Calculation
`
`
`35 932 ' 00
`
`(Application Transmittal |4¥1|~page
`
`4 of 7)
`
`
`
`
`
`
`
`

`

`B.
`
`0,
`
`[:3 Design application
`($280.00w37 CFR 1.160))
`Filing Fee Calculation
`
`[:3 Plant applicatiOn
`($460.00w87 CPR 1.165(9))
`
`Filing fee calculation
`11. Small Entity Statement(s)
`
`$
`
`S
`
`‘
`
`
`
`E] Verified Statementts) that this is a filing by a small entity under 37 CFR 1,9 and
`127 islare) attached.
`
`Filing Fee Calculation (50% of A, B or C above}
`
`83
`
`NOTE: Any excess of the full lee paid will be refunded if a verified statement and a refund request are filed
`within 2 months of the date of timely payment of a full fee. 37 OFF? i,28(a)i
`
`t2. Request for International-Type Search (37 CPR 1.104(dli (complete, if applicable)
`
`[3 Please prepare an international-type search report for this application at
`time when national examination on the merits takes 'place.
`
`the
`
`13. Fee Payment Being Made At This Time
`
`[:1 Not Enclosed
`
`'
`
`$ 932,00
`I
`
`
`35
`
`[i No filing fee is to be paid at this time. (This and the surcharge required by
`37 OFF? 1.16(e) can be paid subsequently.)
`-
`‘
`Enclosed p
`[g basicfilingfee
`[:3
`recording assignment
`($40.00; 37 CPR 121(0))
`
`'
`
`'
`
`I
`
`[j
`
`C]
`
`petition fee for filing by other
`than all the inventors or person
`on behalf of the inventor where
`inventor refused to Sign or cannot
`be reached. ($130.00; 37 CFR
`1.47 and 1.1700)
`
`for processing an application with
`a specification in a non~English
`language. ($130.00; 37 CFR 152(0) and
`l.17(k)
`
`[:1 processing and retention fee
`($130.00; 37 CPR 153(0) and 1.210))
`
`s
`
`$~Wm
`
`C]
`
`fee for international-type search report ($35.00;
`37 CFR 1.21(e)).
`
`15
`
`NOTE:
`
`37 CFR t.21(/) establishes a fee for processing and retaining any application which is abandoned for
`failing to complete the application pursuant to 37 CFH 7.53(d) and this, as‘weil as the changes to 37
`CFR 153 and 1. 78, indicate that in order to obtain the benefit of a prior U. 8, application, either the ba-
`sic iiiing fee must be paid or the processing and retention fee of § 1.21 (i) must be paid within 1 year
`from notification under§ 53(d).
`
`Total fees enclosed
`
`$ 922 . 0 O
`
`(Application Transmittal [4-11wpage 5 of 7)
`
`
`
`
`
`

`

`
`
`
`
`14. Method of Payment of Fees
`Check in the amount of 55W
`
`{:1 Charge Account No.m in the amount cl 3%. A
`duplicate of this transmittal is attached.
`
`NOTE: Fees should be itemized in such a manner that it is clear for which purpose the less are pawl. 37 CPR
`122(1)).
`
`15. Authorization to Charge Additional Fees
`.
`WARNING:
`it no fees are to be paid on filing the following items should not be completed.
`WARNING: Accurately count claims, especially multiple dependent claims,
`to avoid unexpected high charges
`it extra claim charges are authorized
`
`,
`
`The Commissioner is hereby authorized to charge the following additional fees
`by1th1is paper)and during the entire pendency of this application to Account No
`
`
`[Q 37 CFR 1.16(a). (t) or (g) (tiling tees)
`[3 87 CFR 1.16(b), (c) and (d) (presentation of extra claims)
`NOTE: Because additional tees for excess or multiple dependent claims not paid on filing or on later presenta‘
`tion must only be paid or these claims cancelledby amendment prior to the expiration of the time peri-
`od set for response by the PTO in any notice of tee deficiency (37 CFF? 1.16(d)),
`it might be best not to
`authorize the PTO to charge additional claim lees except possibly when dealing with amendments at
`ter final action.
`
`[Q 37 CFR 1.16(e) (surcharge for tiling the basic filing fee and/or declaration
`on a date later than the filing date of the application)
`
`[3 37 CFR 1.17 {application processing tees)
`WARNING: While 37 CFR 1,17(a), (b), (c) and (d) deal with extensions 0/ time under § 1.136(a) this aulhoriza~
`tion should be made only with the knowledge tnal “Submission of the appropriate extenSIon lee
`under 37 C. F. Fl. 1 136(3) Is to no avail unless a request or petition (or extensionis tiled " (Empha
`sis added) Notice of November 519851060( O. G 27).
`
`[j 37 CFR 1.18 (issue tee at or before mailing of Notice of
`Allowance. pursuant to 37 CPR 1.311(b))
`
`NOTE: Where an authorization to charge the issue tee to-a deposit account has been filed before the mailing
`of a Notice of Allowance, the issue lee will be automatically charged to the deposit account at the time
`at mailing the notice of allowance. 37 CFF? 1.~311(b).
`
`NOTE:
`
`37 CFR 1.28(b) requires "Notification 01 any change in loss oi entitlement to small entity status must be
`tiled in the application . prior to paying, or at the time of paying, .
`. issue lee“. From the wording at
`37 OFF? 1 26(1)). (a) notification of change of status must be made even it the lee is paid as "other than
`a small entity" and (b) no nolIlication is required it the change Is to another small entity.
`
`16.
`
`instructions As To Overpayment
`
`
`[:1
`
`credit Account No.
`
`refund
`Reg. No. 3 3 ,1 3 O
`
`.
`
`‘
`
`_
`
`Tel. NO. (41 2) 3 5 5-8 6 41
`
`74 S g
`SIGNATURE OF ATTORNEY
`Christogher H. Gebhardt
`Type or print name of attorney
`Kirkpatrick & LockhartW .
`
`P.O.Address 1500vOliver Building w”
`
`‘
`tsburgh, PA 15-222
`
`
`‘
`
`(Application Transmittal [bu—page 6 cl 7)
`
`
`
`

`

`[j
`
`Incorporation by reference of added pages
`
`Check the following item if the application in this transmittal claims the ben-
`efit of prior U.S. application(s) (including an international application enter-
`ing the US. stage as a continuation, divisional or C-l-P application) and
`complete and attach the A0080 PAGES FOR NEW APPLICATION
`TRANSMITTAL WHERE BENEFIT OF PRIOR U.S. APPLICATIONtS)
`CLAIMED
`‘
`
`[3 Plus Added Pages For New Application Transmittal Where Benefit Of Prior US.
`Application(s) Claimed
`
`Number ol pages added
`
`{:3 Plus Added Pages For Papers Referred To in item 4 Above
`Number of pages added m
`
`[:3 Plus "Assignment Cover Letter Accompanying New Application"
`' Number ol pages added
`
`Statement Where No Further Pages Added
`
`(If no further pages form a part of this Transmittal then end this Transmittai
`with this page and check the following item)
`-
`
`This transmittal ends with this page.
`
`(Application Transmittal [4-115—page 7 of 7)
`
`
`
`
`
`

`

`
`
`TITLE
`SYSTEM AND METHOD FOR DISTRIBUTED STORAGE MANAGEMENTW
`“““””””””””” ONNETWORKED COMPUTER 8Y§TEMS§'
`
`“yam-W
`
`Inventors:
`
`James R. Woodhill
`
`Louis R. Woodhill
`.
`William Russell More, Jr.
`Jay Harris Berlin
`
`
`
`
`
`

`

`
`
`
`
`10
`
`15
`
`20
`
`25
`
`3O
`
`
`BAG
`OUN OF THE .NVENTION
`
`
`
`Field of the Igygptiop
`
`The present invention is directed generally to a system
`
`and method for distributed storage management on a networked
`
`computer system and, more specifically,
`
`to a system and method
`
`for distributed storage management on a networked computer
`
`i
`
`system including a remote backup file server and one or more
`
`local area networks in communication with the remote backup
`
`file server,
`
`es ri
`
`o
`
`o
`
`the Ba k ton
`
`of the
`
`ve
`
`io
`
`Backup copies of information stored on a computer system
`
`must be made so that if a failure occurs which causes the
`
`original copies of the data to be lost,
`
`the lost data can be
`
`recovered as it existed at the time when the last backup copy Ll
`
`was made. Backup/restore systems haVe a long history on‘all
`
`types of computer systems from mainframes to minicomputers,
`
`local area netwOrk file servers and desktop workstations.
`
`I
`
`Historically, backup systems have operated by making
`copies of a computer systemis files on a special backup
`
`input/output device such as a magnetic tape drive,
`
`floppy'
`
`diskette driVe, or optical disk drive. Most systems allow full
`
`backup, partial backup (e.g., specified drives, directories, or
`
`files), or incremental backups based on files changed after a
`
`certain date or time. Copies of files made during a backup
`
`rprocedure are stored on these special backup devices and are
`
`then later retrieved during a restore operation either under
`
`file names derived from the original file,
`
`from the date/time
`
`of the backup operation or from a serially~incremented number.
`
`The backup procedure is typically'accomplished on an individual
`
`computer/file server basis, rather than through a single
`
`“5,;
`
`
`
`

`

`10
`
`15
`
`20
`
`3O
`
`25
`
`the computer resources of two computers at most (the one
`
`processing the files to be backed up and the one with the
`
`backup device attached) are employed to effect the backup
`
`process, regardless of the actual number of computers networked
`together.
`V
`‘
`V
`
`Today,
`
`the absolute numbers of computers networked
`
`together by organizations are increasing rapidly as is the
`
`number of different types of computers and operating systems in
`
`use. At the same time,
`
`the number of storage deviCes and the
`
`capacities incorporated into each of these units is growing
`
`even more rapidly.
`
`in this environment,
`
`the backup/restore
`
`‘ approaches which have been traditionally used have become less
`
`reliable, more expensive, and more consumptive of human time
`
`and attention.
`
`Thus,
`
`the need exists for a system designed to overcome
`
`the limitations of the existing backup/restore systems that
`have the following characteristics:
`(1)
`is capable of operating
`
`on a networked computer system incorporating various types of
`computers and operating systems;
`(2)
`is capable of
`
`accommodating a large array of large capacity storage devices;
`(3)
`is reliable;
`(4)
`is capable of operating with a minimum:
`I
`amount of human intervention; and (5)
`is relatively
`
`inexpensive.
`
`sum/mm 92 111E ; imagggg
`
`The present invention is directed to a system for the
`
`distributed management of the storage space and data on a
`
`networked computer system wherein the networked computer system
`
`includes at least two storage devices for storing data files
`
`comprised of one or more binary objects.
`The distributed
`storage management system includes means for selectively
`
`copying the binary objects stored on one of the storage devices
`
`
`
`

`

`
`
`to another of the storage devices and means for calculating a
`
`current value for a binary object identifier.for selected
`
`binary objects stored on the storage devices wherein the
`
`calculation of the binary object identifier is based upon the
`
`lactual data contents of the associated binary object.
`
`The
`
`distributed storage management system further includes means
`for storing the current value of the binary object identifier
`
`as a previous value of the binary object identifier, means for
`
`comparing the current value of the binary object identifier
`
`associated with a particular binary object to one or more
`previous values of the binary object identifier associated vith;
`that particular binary object and means for commanding the
`
`means for selectively copying binary objects in response to the
`
`means for comparing.
`
`The present invention is further directed to a method for
`
`the management of the storage space and data on a computer
`system wherein the computer system includes at least two
`
`storage area for storing data files cemprised of one or more
`binary objects.
`The storage space management method includes
`the following steps:
`(1) Selectively copying the binary objects
`
`stored in one of the storage areas to another of the storage
`
`areas;
`
`(2) calculating a current value for a binary object
`
`identifier for selected binary objects stored in the storage
`
`areas wherein the calculation of the binary object identifier
`
`is based upon the actual data contents of the associated binary
`
`object:
`
`(3) storing the current value of the binary object
`
`identifier as a previous value of the binary object identifier;
`
`'(4) comparing the cUrrent value of.the,binary object identifier,
`
`associated with a particular binary object to one or more
`
`previous values of the binary object identifier associated with
`
`that particular binary object; and (5) controlling the step for
`
`
`
`10
`
`15
`
`20
`
`25
`
`30
`
`

`

`selectively copying binary objects in response to the step for
`
`comparing.
`' The system and method of the present invention for the
`management of the storage space on a computer system provide a
`
`backup/restore system that is capable of operating on a
`
`networked computer system incorporating various types of
`
`computers and operating systems,
`
`is capable of accommodating a
`
`large array of large capacity storage devices,
`
`is reliable,
`
`is
`
`capable of operating with a minimum amOunt of human
`
`intervention and is relatively inexpensive. These and other
`
`advantages and benefits of the present invention will become
`
`apparent from the description of a preferred embodiment
`
`hereinbelow.
`
`BRIEF DESCRIPTION OE 2H3 DgAWINGS
`
`For the present invention to be clearly understood and
`
`readily practiced, a preferred embodiment will now be
`
`described, by way of example only, with reference to the
`accompanying figures whereini
`V
`
`FIG. 1 illustrates a simplified representation of a
`
`networked computer system in which the system and method of the
`
`preseht invention may be employed;
`FIG. 2 illustrates the manner in which the Distributed
`
`Storage Manager program of the present invention allocates the
`
`storage space on each of the storage devices illustrated in
`
`FIG. 1;
`
`FIG.
`
`3 illustrates the File Database utilized by the
`
`Distributed Storage Manager program of the present invention;
`
`:FIGI 4 illustrates the Backup Queue Database utilized by
`
`the Distributed Storage Manager program of the present
`
`
`
`
`
`10
`
`15
`
`20
`
`25
`
`30
`
`inventibn; and
`
`

`

`‘FIGS. 5a — 51 illuStrate flow charts explaining the
`
`operation of the Distributed Storage Manager program of the
`
`present invention.
`
`DETAILED DESCRIPTIO§ 0F TEE PREFfiRRED EMBODIQEEE
`
`FIG.
`
`1 illustrates a simplified representation of a
`
`typical networked computer system 10 in which the system and
`
`method of the present invention for distributed storage
`
`management on networked computer systems may be employed.
`
`A
`
`remote backup file server 12 is in communication, via data path
`13, with a wide area netWork 14.
`The wide area network 14 is,
`in turn,
`in communication with a plurality of local area
`
`networks 16 via data paths 15. Those of ordinary skill in the
`
`art will recognize that any number of wide area networks 14 may
`
`be in communication with remote backup file server 12 and that
`
`any number of local area networks 16 (from 1 to more than 100)
`
`‘ may be in communication with each wide area network 14. Those
`
`of ordinary skill in the art will also recognize that the means
`
`for communication between remote backup file server 12, wide
`
`area network 14 and local area networks 16 over data paths 13
`
`and 15 is well known.
`
`Each local area network 16 includes multiple user
`
`workstations l8 and local computers 20 each in communication
`
`with their respective local area network 16 via data paths 1?.
`
`Again,
`
`those of ordinary skill in the art will recognize that
`
`the means for communidation between user workstations 18, 1°°§;;
`computers 20 and local area networks 16 via data paths 17‘is
`
`well known.
`
`The storage space on each disk drive 19 on each
`
`localicomputer 20 in the networked computer system 10 is
`
`allocated as follows and as is shown in FIG. 2:
`
`(1) operating
`
`system files 22;
`
`(2) a Distributed storage Manager program 24
`
`which embodies the system and method of the present invention
`
`
`
`
`
`10
`
`15
`
`20
`
`25
`
`30
`
`

`

`
`
`(the operation of which is described in detail hereinbelow);
`(3) a File Database 25 (the structure of which is described in
`
`detail hereinbelow);
`
`(4) a Badkup Queue Database 26 (the
`
`structure of which is described in detail hereinbelow);
`
`(5)
`
`local computer data files 28;
`
`(6)
`
`free disk space 30 and (7)
`
`compressed storage files 32 (created by the Distributed Storage
`
`Manager program 24 of the present
`more fully hereinbelow).
`l
`
`invention as is explained
`l
`
`The Distributed Storage Manager program 24 of the present
`
`invention builds and maintains the File Database 25 on one of
`
`the disk drives 19 on each local computer 20 in the networked
`
`computer system 10 according to the structure illustrated in
`
`The File Database 25 stores information relating to
`FIG. 3.
`each file that has been backed up‘by the Distributed Storage
`
`Manager program 24 since the initialization of that program on
`
`The File Database 25 is comprised of
`each local computer 20.
`three levels of records organized according to a predefined
`
`hierarchy.
`
`The top level record, File Identification Record
`
`34,'includes identification information for each file that has
`
`been backed up by Distributed Storage Manager program 24. File
`Identification Record 34 contains the following elements:
`(1)
`
`Record Type 36 (identifies the file as either a directory file
`or a regular file);
`(2) File Location 38 (name of the directory
`in which the file resides);
`(3) File Name 40 (name of the
`
`file);
`(4) Migration Status 41 (explained more fully
`hereinbelo