IPR2012-00026, IPR2013-00109
`PATENT 6,757,717 B1
`
`TRIAL HEARING
`NOVEMBER 18, 2013
`
`BEFORE THE PATENT TRIAL AND
`APPEAL BOARD
`
`Microsoft Dem. Ex. 1028
`IPR2012-00026 & IPR2013-00109
`
`
`PATENT 6,757,717 B1
`
`TRIAL HEARING
`NOVEMBER 18, 2013
`
`BEFORE THE PATENT TRIAL AND
`APPEAL BOARD
`
`Microsoft Dem. Ex. 1028
`IPR2012-00026 & IPR2013-00109
`
`
`
`717: NOTHING NEW
`
`PERLMAN … YOHE … DRP … SANTOS … 717
`
`Same solution to same problem
`
`1. sender sends receiver a digest of data
`2. receiver compares received digest to own digest for
`that data
`if no match, receiver requests unmatched data from
`sender
`
`3.
`
`2
`
`
`
`Yohe +
`Perlman 103
`√
`√
`
`1
`
`2
`
`√
`
`√
`√
`√
`
`3
`
`717: NOTHING NEW
`
`HTTP-
`DRP
`
`DRP +
`Mattis 103
`
`Santos
`
`Yohe
`
`Perlman
`
`√
`√
`
`√
`√
`√
`
`√
`√
`
`√
`√
`
`√
`√
`√
`√
`
`√
`
`√
`√
`
`√
`√
`√
`
`√
`√
`√
`
`34
`
`√
`√
`√
`
`√
`√
`√
`
`1
`-3
`6
`-7
`-9
`10
`11
`-12
`--14
`22
`-23
`-24
`
`
`
`CLAIM CONSTRUCTIONS
`
`• “Data access”
`• “Sender/computer,” “Receiver/computer”
`• “Search”
`• “Two other computers”
`
`(MSFT Reply (Paper 46), pp. 2-5)
`
`4
`
`
`
`“DATA ACCESS” = DATA ACQUISITION
`
`• Receiver need not first request the data (MSFT Reply, p. 2)
`
`(717, Fig. 8 excerpt)
`
`(717, 8:37-39)
`
`5
`
`
`
`“DATA ACCESS” = DATA ACQUISITION
`
`• Receiver need not first request the data (MSFT Reply, p. 2)
`
`(717, Claim 11 excerpt)
`
`6
`
`
`
`“SENDER/COMPUTER,”
`“RECEIVER/COMPUTER”
`• a computer that sends or receives data,
`respectively. A sender/computer can include
`multiple devices and can be an intermediary.
`(MSFT Reply, pp. 2-4)
`
`• 717 does not claim or even disclose:
`o Single-machine sender
`o Sender being source of the data
`o Receiver application using the data
`
`7
`
`
`
`“SEARCH” = CHECK FOR
`
`• 717 does not claim or even disclose checking
`multiple digest values for a match. (MSFT Reply, pp. 4-5;
`MSFT Opposition, Paper 48, pp. 8-9)
`
`(717, Fig. 5 excerpt)
`
`8
`
`
`
`“TWO OTHER COMPUTERS”
`
`• any two computers other than the gateway.
`(MSFT Reply, p. 5)
`
`(717, Claim 6 excerpt)
`
`9
`
`
`
`717: NOTHING NEW
`
`HTTP-
`DRP
`
`DRP +
`Mattis 103
`
`Santos
`
`Yohe
`
`Perlman
`
`√
`√
`√
`
`√
`√
`√
`
`1
`-3
`6
`-7
`-9
`10
`11
`-12
`--14
`22
`-23
`-24
`
`√
`√
`√
`
`√
`√
`√
`
`√
`√
`
`√
`√
`
`√
`√
`√
`√
`
`√
`
`√
`√
`
`√
`√
`
`√
`√
`√
`
`Yohe +
`Perlman 103
`√
`√
`
`1
`
`√
`
`√
`√
`√
`
`10
`
`
`
`1 717 CLAIMS 1, 3, 10
`
`RECEIVER
`
`SENDER
`
`Compare
`
`Create
`
`Permanent
`
`11
`
`
`
`717 CLAIMS 1, 3, 10
`
`Compare
`
`Create
`
`Permanent
`
`(717, Claim 1 excerpts)
`
`12
`
`
`
`YOHE = 717 CLAIMS 1, 3, 10
`
`RECEIVER
`
`Compare
`
`(Yohe, Fig. 2 excerpt)
`
`13
`
`
`
`YOHE = 717 CLAIMS 1, 3, 10
`
`RECEIVER
`
`Compare
`
`(Yohe, Claim 1 excerpt)
`
`14
`
`
`
`YOHE = 717 CLAIMS 1, 3, 10
`
`• Yohe directory is “data”:
`o Yohe refers to “data of the directory”
`o Directory sub-objects are files
`o Directory managed by “file system”
`o Unix directory is a file
`
`Compare
`
`(MSFT Reply (Paper 46), p. 6)
`
`15
`
`
`
`YOHE = 717 CLAIMS 1, 3, 10
`
`Create
`
`SENDER
`
`Permanent
`
`(Yohe, Fig. 2 excerpt)
`
`16
`
`
`
`YOHE = 717 CLAIMS 1, 3, 10
`
`SENDER
`
`Permanent
`
`Create
`
`(Yohe, Claim 1 excerpt)
`
`17
`
`
`
`YOHE + PERLMAN
`
`• Natural combination
`o Same problem
`o Same solution
`o Perlman: solution not limited to routers
` Perlman, Claims 1, 4-7
` Perlman, 8:52 – 9:2
`
`(MSFT Reply (Paper 46), pp. 12-14)
`
`18
`
`
`
`YOHE + PERLMAN
`
`tifiers from the contents of their databases so that the}; may
`
`-
`While there has been shown and desert
`embodiments for implementing a mechanism that efficiently
`synchronizes the LSP databases of routers coupled to a
`LAi's'. it is to be understood that various other adaptations
`and modifications ma}r be made within the spirit and scope
`of the invention. For example. the mechanism described
`herein may be used in an}; tvE of distributed svstem
`reguiring eflieient synchronization of the contents of data-
`bases stored on nodes of a computer network. In the case of
`such distributed systems. a designated node of the computer
`network generates the database identifier and distributes that
`identifier to other nodes coupled to the network According
`to the invention. the database identifier is uniquely repre-
`sentative of the contents of the designated node‘s database
`and the receiving nodes generate their own database iden—
`
`ag annsdfit
`
`(Perlman, 8:52-67) 19
`
`
`
`YOHE + PERLMAN
`= 717 CLAIMS 1, 3, 10
`• Perlman + Yohe Permanent Storage
`o Speed more important than size and persistence?
`RAM.
`o Size and persistence more important than speed?
`Permanent Memory.
`
`Permanent
`
`(MSFT Reply (Paper 46), p. 13)
`
`20
`
`
`
`717: NOTHING NEW
`
`HTTP-
`DRP
`
`DRP +
`Mattis 103
`
`Santos
`
`Yohe
`
`Perlman
`
`√
`√
`√
`
`√
`√
`√
`
`1
`-3
`6
`-7
`-9
`10
`11
`-12
`--14
`22
`-23
`-24
`
`√
`√
`√
`
`√
`√
`√
`
`√
`√
`
`√
`√
`
`√
`√
`√
`√
`
`√
`
`√
`√
`
`√
`√
`
`√
`√
`√
`
`Yohe +
`Perlman 103
`√
`√
`
`√
`
`√
`√
`√
`
`2
`
`21
`
`
`
`2 717 CLAIMS 22, 23, 24
`
`RECEIVER
`
`Search
`
`(717, Claim 22 excerpt)
`
`22
`
`
`
`PERLMAN = 717 CLAIMS 22, 23, 24
`
`(Perlman, 8:32-42)
`
`Search
`
`(Perlman, Fig. 7)
`
`(MSFT Reply (Paper 46), p. 10)
`
`23
`
`
`
`PERLMAN = 717 CLAIMS 22, 23, 24
`
`(Perlman, 7:46-54)
`
`Search
`
`(MSFT Reply (Paper 46), p. 10) 24
`
`
`
`PERLMAN + YOHE
`= 717 CLAIMS 22, 23, 24
`Perlman identifiers
`Yohe permanent memory
`
`+
`
`(Yohe, Fig. 2 excerpt)
`
`(Perlman, Fig. 7)
`
`(MSFT Reply (Paper 46), pp. 12-14) 25
`
`
`
`717: NOTHING NEW
`
`HTTP-
`DRP
`
`DRP +
`Mattis 103
`
`Santos
`
`Yohe
`
`Perlman
`
`√
`√
`√
`
`√
`√
`√
`
`√
`√
`√
`
`√
`√
`√
`
`3
`
`1
`-3
`6
`-7
`-9
`10
`11
`-12
`--14
`22
`-23
`-24
`
`√
`√
`
`√
`√
`
`√
`√
`√
`√
`
`√
`
`√
`√
`
`√
`√
`
`√
`√
`√
`
`Yohe +
`Perlman 103
`√
`√
`
`√
`
`√
`√
`√
`
`26
`
`
`
`3 717 CLAIMS 11, 12, 14
`
`SENDER
`
`Receive
`Response
`
`Separate
`Indications
`
`(717, Claim 12 excerpt)
`
`(717, Claim 14)
`
`27
`
`
`
`DRP = 717 CLAIMS 11, 12, 14
`
`1. DRP client receives digest(s) from server (DRP, 5:22-32)
`2. DRP client checks for digest(s) in its cache (id., 5:30-32)
`3. DRP client requests any unmatched data from server
`(id., 6:44, 7:20-28, 8:11-13)
`4. DRP server looks for and returns the requested data
`(id., 5:22-23, 7:31-39, 8:29-31, 9:22-32)
`
`Receive
`Response
`
`(MSFT Reply (Paper 46), pp. 9-10)
`
`28
`
`
`
`DRP = 717 CLAIMS 11, 12, 14
`
`1. DRP client receives separate digest for each data object
`in index file (DRP, 4:37-5:19, 7:20-29)
`2. DRP client requests only the unmatched data objects
`(id., 2:26-30, 6:40-7:1, 8:8-13).
`
`Separate
`Indications
`
`(MSFT Reply (Paper 46), p. 10)
`
`29
`
`
`
`717: NOTHING NEW
`
`HTTP-
`DRP
`
`DRP +
`Mattis 103
`
`Santos
`
`Yohe
`
`Perlman
`
`√
`√
`√
`
`√
`√
`√
`
`4
`
`√
`√
`√
`
`√
`√
`√
`
`1
`-3
`6
`-7
`-9
`10
`11
`-12
`--14
`22
`-23
`-24
`
`√
`√
`
`√
`√
`
`√
`√
`√
`√
`
`√
`
`√
`√
`
`√
`√
`
`√
`√
`√
`
`Yohe +
`Perlman 103
`√
`√
`
`√
`
`√
`√
`√
`
`30
`
`
`
`4 717 CLAIMS 6, 7, 9
`
`CACHING
`COMPUTER
`
`Permanent
`
`Compare
`
`(717, Claim 6 excerpt)
`
`31
`
`
`
`DRP = 717 CLAIMS 6, 7, 9
`
`• “caching computer” =
`o DRP client or DRP server
` Cache on disk (DRP, 4:40-42, 5:30-6:20, 7:2-8, 8:25-34,
`10:45-11:2)
` Compares digests (DRP, 5:30-33, 6:38-7:8, 7:31-32, 34-35,
`42-45, 8:7-27, 11:5-6)
`
`Permanent
`
`Compare
`
`(MSFT Reply (Paper 46), pp. 8-9)
`
`32
`
`
`
`CORRECTED MOTION TO AMEND (PAPER 44)
`
`• No:
`o Expert declaration
`o Proposed claim constructions
`o Attempt to distinguish
` all art of record
` all known art
`
`(MSFT Opposition (Paper 48), p. 15)
`
`33
`
`
`
`MOTION TO AMEND
`
`35
`
`√
`
`√
`
`√
`
`36
`
`√
`
`√
`
`√
`
`√
`
`37
`
`38
`
`39
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`40
`
`√
`
`√
`
`√
`
`√
`
`41
`
`√
`
`√
`
`√
`
`√
`
`√
`
`Ground
`
`Enlarged
`
`New Matter
`
`Indefinite
`
`5 67
`
`Non-responsive
`
`Anticipated by DRP
`
`Anticipated by Yohe
`
`(MSFT Opposition (Paper 48), p. 1)
`
`34
`
`
`
`5 DRP = PROPOSED CLAIMS 35-41
`
`Ground
`
`Enlarged
`
`New Matter
`
`Indefinite
`
`Non-responsive
`
`Anticipated by DRP
`
`Anticipated by Yohe
`
`5
`
`35
`
`√
`
`√
`
`√
`
`36
`
`√
`
`√
`
`√
`
`√
`
`37
`
`38
`
`39
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`40
`
`√
`
`√
`
`√
`
`√
`
`41
`
`√
`
`√
`
`√
`
`√
`
`√
`
`(MSFT Opposition (Paper 48), pp. 2-3, 5, 6, 8, 10, 12-13, 14)
`
`35
`
`
`
`DRP = PROPOSED CLAIMS 35-41
`
`• Proxyconn: “DRP fails to disclose, among other
`things, (1) caching computer having means for
`calculating a digital digest [Claim 37], (2)
`receiving a response signal [Claim 39], and (3)
`transmitting a digital digest in response to the
`request for data [Claim 39].”
`
`(Proxyconn Reply (Paper 49), p. 6)
`
`36
`
`
`
`DRP = PROPOSED CLAIM 37
`
`• “caching computer” =
`o DRP client or DRP server
` “calculates MD5 digests on cached data
`(client: DRP, 3:24-27, 5:26-28, 7:42-45, 8:25-27, 8:36, 9:30-31,
`10:45-11:6; server: id., 3:24-27, 5:26-28, 6:35, 8:25-27, 9:30-
`31, 10:45-11:2).”
`(MSFT Reply (Paper 46), pp. 8-9)
`
`37
`
`
`
`DRP = PROPOSED CLAIM 39
`
`1. DRP client receives digest(s) from server (DRP, 5:22-32)
`2. DRP client checks for digest(s) in its cache (id., 5:30-32)
`3. DRP client requests any unmatched data from server
`(id., 6:44, 7:20-28, 8:11-13)
`4. DRP server looks for and returns the requested data
`(id., 5:22-23, 7:31-39, 8:29-31, 9:22-32)
`
`Receive
`Response
`(MSFT Opposition (Paper 48), pp. 10-11)
`
`38
`
`
`
`6 YOHE = PROPOSED CLAIMS 35-38, 40-41
`
`Ground
`
`Enlarged
`
`New Matter
`
`Indefinite
`
`Non-responsive
`
`Anticipated by DRP
`
`Anticipated by Yohe
`
`6
`
`35
`
`√
`
`√
`
`√
`
`36
`
`√
`
`√
`
`√
`
`√
`
`37
`
`38
`
`39
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`40
`
`√
`
`√
`
`√
`
`√
`
`41
`
`√
`
`√
`
`√
`
`√
`
`√
`
`(MSFT Opposition (Paper 48), p. 1)
`
`39
`
`
`
`YOHE = PROPOSED CLAIMS 35-38, 40-41
`
`• Proxyconn: “Additionally, Yohe fails to disclose,
`among other things, (1) a receiver/computer
`configured to initiate a request for data [Claim
`35], (2) storing a digital digest in a permanent
`storage memory [Claim 36], (3) receiver/
`computer configured to search for a digital
`digest [Claim 38], and (4) sending a digital digest
`in response to a request [Claim 39*].”
`(Proxyconn Reply (Paper 49), p. 6)
`
`40
`
`
`
`YOHE = PROPOSED CLAIM 35
`
`• Client initiates request for data (MSFT Opposition (Paper
`48), p. 3)
`
`(Yohe, Fig. 15 excerpt)
`
`41
`
`
`
`YOHE = PROPOSED CLAIM 36
`
`• Client stores digest in permanent storage
`“Yohe’s client is programmed to store “the [e.g., MD5]
`signature obtained [from the server] into cache via LFS 28
`[the client’s local file system]” (e.g., id., Fig. 15 (728), 8:19-21).
`This Yohe client “cache” (aka “network file cache” (id., 6:14-
`15)) “resides in permanent storage” (id., 3:16-18; see id., 4:35-36,
`15:32-33 (“cache memory is disposed on a permanent
`storage disk of said remote client computer”)).”
`(MSFT Opposition (Paper 48), p. 3)
`
`42
`
`
`
`YOHE = PROPOSED CLAIM 38
`
`• Client configured to search for matching digest
`“In response to receiving an MD5 signature from the
`server, each Yohe receiver searches for data from its cache
`that has the same signature as that received from the
`sender, using a “directory signature comparator (DSC) 46”
`(Yohe, 5:1-3) “for comparing the signatures of data with one
`another to determine whether the signature of data of the
`remote client is valid” (id., 2:41-61), i.e., to “determine[]
`whether the signature of data match” (id., 13:34-35). (See id., 8:9-
`11, 8:13-21, 14:40-15:3, Abstract, Fig. 15 (719), claims 1, 8).”
`(MSFT Opposition (Paper 48), p. 9)
`
`43
`
`
`
`7 NON-RESPONSIVE
`
`Ground
`
`Enlarged
`
`New Matter
`
`Indefinite
`
`Non-responsive
`
`7
`
`Anticipated by DRP
`
`Anticipated by Yohe
`
`35
`
`√
`
`√
`
`√
`
`36
`
`√
`
`√
`
`√
`
`√
`
`37
`
`38
`
`39
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`√
`
`40
`
`√
`
`√
`
`√
`
`√
`
`41
`
`√
`
`√
`
`√
`
`√
`
`√
`
`(MSFT Opposition (Paper 48), pp. 4, 7, 14)
`
`44
`
`
`
`PROPOSED CLAIM 36 NON-RESPONSIVE
`
`INDEFINITE
`
`method
`step
`
`which
`one?
`
`(MSFT Opposition (Paper 48), p. 4)
`
`45
`
`
`
`PROPOSED CLAIM 36 NON-RESPONSIVE
`
`(MSFT Opposition (Paper 48), p. 4) 46
`
`
`
`PROPOSED CLAIM 38 NON-RESPONSIVE
`
`INDEFINITE
`
`No
`structure
`
`(717, Claim 10 excerpt)
`
`(Proposed Claim 38 excerpt)
`
`(MSFT Opposition (Paper 48), p. 7)
`
`47
`
`
`
`PROPOSED CLAIM 41 NON-RESPONSIVE
`
`112/1
`INDEFINITE
`
`(717, Claim 23)
`
`(Proposed Claim 41)
`
`(MSFT Opposition (Paper 48), p. 14)
`
`48
`
`
Accessing this document will incur an additional charge of $.
After purchase, you can access this document again without charge.
Accept $ Charge
Still Working On It
This document is taking longer than usual to download. This can happen if we need to contact the court directly to obtain the document and their servers are running slowly.
Give it another minute or two to complete, and then try the refresh button.
A few More Minutes ... Still Working
It can take up to 5 minutes for us to download a document if the court servers are running slowly.
Thank you for your continued patience.
This document could not be displayed.
We could not find this document within its docket. Please go back to the docket page and check the link. If that does not work, go back to the docket and refresh it to pull the newest information.
Your account does not support viewing this document.
You need a Paid Account to view this document. Click here to change your account type.
Your account does not support viewing this document.
Set your membership
status to view this document.
With a Docket Alarm membership, you'll
get a whole lot more, including:
- Up-to-date information for this case.
- Email alerts whenever there is an update.
- Full text search for other cases.
- Get email alerts whenever a new case matches your search.
One Moment Please
The filing “” is large (MB) and is being downloaded.
Please refresh this page in a few minutes to see if the filing has been downloaded. The filing will also be emailed to you when the download completes.
Your document is on its way!
If you do not receive the document in five minutes, contact support at support@docketalarm.com.
Sealed Document
We are unable to display this document, it may be under a court ordered seal.
If you have proper credentials to access the file, you may proceed directly to the court's system using your government issued username and password.
Access Government Site
