公开(公告)号：US20100088300A1

公开(公告)日：2010-04-08

申请号：US12245972

申请日：2008-10-06

Applicant: Abolade Gbadegesin ,  Viraj B. Mody ,  David C. Steere ,  William Michael Zintel ,  Bruce W. Copeland ,  Atul Adya ,  Thomas W. Kleinpeter

Inventor： Abolade Gbadegesin ,  Viraj B. Mody ,  David C. Steere ,  William Michael Zintel ,  Bruce W. Copeland ,  Atul Adya ,  Thomas W. Kleinpeter

IPC: G06F7/06 ,  G06F17/30

CPC classification number: H04L29/0854 ,  G06F17/30516 ,  H04L67/1095

Abstract: Clients may subscribe to resources for the purpose of receiving notifications of changes in the resource (e.g., a file is added to a shared folder). Storing subscriptions within persistent storage provides data security in the event of a service failure, at the cost of high latency in accessing subscription data. An efficient method for tracking a resource is provided herein. A subscription service creates subscriptions and monitors resources for a client. Upon a subscribed resource change, a notification service stores a notification of the change into a queue associated with the client. Efficient resource tracking is achieved because notification and subscription data is stored in low latency soft memory. The notification service is configured to detect a failure in the notification service and/or subscription service. In the event a service fails, the client provides a recovery mechanism by resubscribing to resources the client is interested in.

Abstract translation: 客户可以订阅资源，以便接收资源更改的通知（例如，将文件添加到共享文件夹）。 在永久存储器中存储订阅会在服务发生故障的情况下提供数据安全性，代价是访问订阅数据的高延迟。 本文提供了一种跟踪资源的有效方法。 订阅服务创建订阅并监视客户端的资源。 在订阅的资源更改时，通知服务将更改的通知存储到与客户端相关联的队列中。 由于通知和订阅数据存储在低延迟软存储器中，因此实现高效的资源跟踪。 通知服务被配置为检测通知服务和/或订阅服务中的故障。 在服务失败的情况下，客户端通过重新订阅客户端感兴趣的资源来提供恢复机制。

公开(公告)号：US07519623B2

公开(公告)日：2009-04-14

申请号：US10991656

申请日：2004-11-18

Applicant: John R. Douceur ,  Marvin M. Theimer ,  Atul Adya ,  William J. Bolosky

Inventor： John R. Douceur ,  Marvin M. Theimer ,  Atul Adya ,  William J. Bolosky

IPC: G06F17/30

CPC classification number: G06F17/30156 ,  Y10S707/99944 ,  Y10S707/99946 ,  Y10S707/99952 ,  Y10S707/99953

Abstract: Potentially identical objects (e.g., files) are located across multiple computers based on stochastic partitioning of workload. For each of a plurality of objects stored on a plurality of computers in a network, a portion of object information corresponding to the object is selected. The object information can be generated in a variety of manners (e.g., based on hashing the object, based on characteristics of the object, and so forth). Any of a variety of portions of the object information can be used (e.g., the least significant bits of the object information). A stochastic partitioning process is then used to identify which of the plurality of computers to communicate the object information to for identification of potentially identical objects on the plurality of computers.

公开(公告)号：US07478243B2

公开(公告)日：2009-01-13

申请号：US09814337

申请日：2001-03-21

Applicant: William J. Bolosky ,  Atul Adya ,  John R. Douceur

Inventor： William J. Bolosky ,  Atul Adya ,  John R. Douceur

IPC: H04L1/00

CPC classification number: G06F21/64 ,  G06F2221/2101 ,  H04L9/3236 ,  H04L9/3247 ,  H04L2209/20 ,  H04L2209/60 ,  H04L2209/80

Abstract: In a serverless distributed file system, the writer of a file can provide file authentication information to a verifying machine without having to compute a new digital signature every time a written file is closed. Periodically, the writer compiles a list of the hash values of all files that have been written over a recent interval, computes a hash of the list, and signs the hash. This signed list of hash values is known as a manifest, akin to a shipping manifest that enumerates the items in a shipment. The advantage of using a signed manifest is that the writer need only perform a single signature computation in order to authenticate the writes to multiple files, rather than having to compute a separate signature for each file, as it would if a signature were embedded in each file.

公开(公告)号：US20080228697A1

公开(公告)日：2008-09-18

申请号：US11725195

申请日：2007-03-16

Applicant: Atul Adya ,  Sergey Melnik ,  Zlatko Michailov ,  Colin Joseph Meek

Inventor： Atul Adya ,  Sergey Melnik ,  Zlatko Michailov ,  Colin Joseph Meek

IPC: G06F17/30

CPC classification number: G06F17/30575 ,  G06F17/30294 ,  G06F17/30595 ,  G06F17/30607

Abstract: A database update pipeline may be incorporated into a data access architecture for providing data services to applications, thereby bridging the gap between application data and data as persisted in databases. The update pipeline has the ability to translate changes made to object instances into data store change constructs, and carry those changes over to a data store. Such a pipeline can also advantageously perform the reverse operation, allowing applications to query using the database update pipeline, and receive materialized object instances.

Abstract translation: 数据库更新流水线可以被并入用于向应用提供数据服务的数据访问架构，从而桥接应用数据和数据之间的间隔，如同在数据库中一样。 更新管道具有将对象实例所做的更改转换为数据存储更改结构的能力，并将这些更改转发到数据存储。 这样的管道还可以有利地执行反向操作，允许应用程序使用数据库更新流水线进行查询，并且接收物化对象实例。

公开(公告)号：US07415608B2

公开(公告)日：2008-08-19

申请号：US11014262

申请日：2004-12-16

Applicant: William J. Bolosky ,  Gerald Cermak ,  Atul Adya ,  John R. Douceur

Inventor： William J. Bolosky ,  Gerald Cermak ,  Atul Adya ,  John R. Douceur

IPC: H04L29/00

CPC classification number: G06F17/30097 ,  G06F19/00 ,  H04L9/0656 ,  H04L9/3239 ,  H04L9/3249 ,  H04L2209/20 ,  H04L2209/38 ,  H04L2209/60

Abstract: A file format for a serverless distributed file system is composed of two parts: a primary data stream and a metadata stream. The data stream contains a file that is divided into multiple blocks. Each block is encrypted using a hash of the block as the encryption key. The metadata stream contains a header, a structure for indexing the encrypted blocks in the primary data stream, and some user information. The indexing structure defines leaf nodes for each of the blocks. Each leaf node consists of an access value used for decryption of the associated block and a verification value used to verify the encrypted block independently of other blocks. In one implementation, the access value is formed by hashing the file block and encrypting the resultant hash value using a randomly generated key. The key is then encrypted using the user's key as the encryption key. The verification value is formed by hashing the associated encrypted block using a one-way hash function. The file format supports verification of individual file blocks without knowledge of the randomly generated key or any user keys. To verify a block of the file, the file system traverses the tree to the appropriate leaf node associated with a target block to be verified. The file system hashes the target block and if the hash matches the access value contained in the leaf node, the block is authentic.

公开(公告)号：US07363375B2

公开(公告)日：2008-04-22

申请号：US10144518

申请日：2002-05-13

Applicant: Lili Qiu ,  Paramvir Bahl ,  Atul Adya

Inventor： Lili Qiu ,  Paramvir Bahl ,  Atul Adya

IPC: G06F15/173 ,  G06F15/16

CPC classification number: H04L47/10 ,  H04L47/11 ,  H04L47/15 ,  H04L47/70 ,  H04L47/762 ,  H04L47/822 ,  H04L47/824

Abstract: A method for refinishing a countertop in order to achieve a granite, a marble, or other desired look uses an oil-based paint having a glaze therein applied as a base coat to a countertop that has been prepared smooth and taped as needed. Once the base coat dries, one or more additional coats each coat may be the same color as the other additional coats or different from the other coats, and each additional coat being a different color from the base coat. One of three applicators is used for the additional coats including a feather, a rag, and a sponge, the selection of the applicator or applicators, and the color or colors to apply with each, being dependant on the particular look desired. Once all paint is applied and a dried, a polyurethane coat is applied to give additional luster, in order for the finish to be either more granite-like or more marble-like in appearance and in order to protect the finish.

Abstract translation: 为了实现花岗岩，大理石或其他所需的外观，用于修补台面的方法将其中具有釉料的油性涂料作为基底涂层涂覆到已经根据需要制备得光滑和胶带的台面上。 一旦底漆干燥，每个涂层的一个或多个附加涂层可以与其它附加涂层的颜色相同或与其它涂层不同，并且每个附加涂层与底涂层不同的颜色。 三个施加器中的一个用于附加的外套，包括羽毛，抹布和海绵，选择施用器或施用器，以及每个应用的颜色或颜色，取决于所期望的特定外观。 一旦施用所有的涂料并干燥后，施加聚氨酯涂层以产生额外的光泽，以使表面的外观上更加花岗岩状或更大的大理石状，并且为了保护表面。

公开(公告)号：US07346774B2

公开(公告)日：2008-03-18

申请号：US11206525

申请日：2005-08-18

Applicant: John R. Douceur ,  Atul Adya ,  William J. Bolosky ,  Marvin M. Theimer

Inventor： John R. Douceur ,  Atul Adya ,  William J. Bolosky ,  Marvin M. Theimer

IPC: H04L9/00

CPC classification number: H04L9/0825 ,  H04L9/0894

Abstract: A file that has been encrypted using a symmetric key and that has a corresponding access control entry with the symmetric key encrypted using the public key of a public/private key pair can be accessed. An encrypted key cache is also accessed to determine whether an access control entry to symmetric key mapping exists in the cache for the access control entry corresponding to the file. If such a mapping exists in the cache, then the mapped-to symmetric key is obtained form the cache, otherwise the encrypted symmetric key is decrypted using the private key of the public/private key pair. The encrypted key cache itself can also be encrypted and stored as an encrypted file.

Abstract translation: 可以访问已经使用对称密钥加密并具有使用公钥/私钥对的公钥加密的对称密钥的相应访问控制条目的文件。 还访问加密密钥高速缓存以确定对应于该文件的访问控制条目的高速缓存中是否存在对称密钥映射的访问控制条目。 如果高速缓存中存在这样的映射，则从高速缓存获得映射到对称密钥，否则使用公钥/私钥对的私钥解密加密的对称密钥。 加密的密钥缓存本身也可以加密并存储为加密文件。

公开(公告)号：US07272630B2

公开(公告)日：2007-09-18

申请号：US10991571

申请日：2004-11-18

Applicant: John R. Douceur ,  Marvin M. Theimer ,  Atul Adya ,  William J. Bolosky

Inventor： John R. Douceur ,  Marvin M. Theimer ,  Atul Adya ,  William J. Bolosky

IPC: G06F15/13

CPC classification number: G06F17/30156 ,  Y10S707/99944 ,  Y10S707/99946 ,  Y10S707/99952 ,  Y10S707/99953

Abstract: Potentially identical objects (e.g., files) are located across multiple computers based on stochastic partitioning of workload. For each of a plurality of objects stored on a plurality of computers in a network, a portion of object information corresponding to the object is selected. The object information can be generated in a variety of manners (e.g., based on hashing the object, based on characteristics of the object, and so forth). Any of a variety of portions of the object information can be used (e.g., the least significant bits of the object information). A stochastic partitioning process is then used to identify which of the plurality of computers to communicate the object information to for identification of potentially identical objects on the plurality of computers.

Abstract translation: 基于工作负载的随机划分，潜在地相同的对象（例如，文件）位于多个计算机之间。 对于存储在网络中的多个计算机上的多个对象中的每一个，选择与对象相对应的对象信息的一部分。 可以以各种方式生成对象信息（例如，基于对象的散列，基于对象的特征等）。 可以使用对象信息的各种部分中的任何一个（例如，对象信息的最低有效位）。 然后使用随机划分过程来识别多个计算机中的哪个计算机传达对象信息以便在多个计算机上识别可能相同的对象。

公开(公告)号：US07245936B2

公开(公告)日：2007-07-17

申请号：US11010660

申请日：2004-12-13

Applicant: Paramvir Bahl ,  Jitendra D. Padhey ,  Atul Adya

Inventor： Paramvir Bahl ,  Jitendra D. Padhey ,  Atul Adya

IPC: H04Q7/20 ,  H04B7/00

CPC classification number: H04W52/0216 ,  H04W52/0219 ,  H04W52/0241 ,  H04W52/46 ,  H04W72/14 ,  H04W84/12 ,  H04W88/04 ,  H04W88/06 ,  Y02D70/1226 ,  Y02D70/142

Abstract: A method and system for optimizing channel access scheduling for multiple wireless computing devices over a wireless network improves channel access efficiency with respect to a primary channel. An access point, or host computer, includes a host transceiver for receiving control information from the wireless computing devices over a low power channel. Upon receiving the control information, the access point applies a scheduling algorithm to schedule channel access for the wireless computing devices to transmit data over the primary communication channel. The wireless computing devices include a low power radio for receiving scheduling information via the low power channel during idle periods. When the scheduling information is received, the wireless computing device activates its primary channel network interface components to communicate data through the primary channel. When the computing device is idle, the device is configured to power down all of its components with the exception of the circuitry required to power the low power channel. As such, the low power channel is maintained in an active state for receiving scheduling information, such as an access schedule, during both idle and non-idle periods.

公开(公告)号：US07240060B2

公开(公告)日：2007-07-03

申请号：US11016388

申请日：2004-12-17

Applicant: Atul Adya ,  William J. Bolosky ,  Gerald Cermak ,  John R. Douceur ,  Marvin M. Theimer ,  Roger P. Wattenhofer

Inventor： Atul Adya ,  William J. Bolosky ,  Gerald Cermak ,  John R. Douceur ,  Marvin M. Theimer ,  Roger P. Wattenhofer

IPC: G06F7/00 ,  G06F17/30

CPC classification number: G06F17/30094 ,  G06F17/30171 ,  G06F17/30899 ,  G06F2201/825 ,  H04L63/0823 ,  H04L63/123 ,  Y10S707/956 ,  Y10S707/99931 ,  Y10S707/99938

Abstract: A serverless distributed file system manages the storage of files and directories using one or more directory groups. The directories may be managed using Byzantine-fault-tolerant groups, whereas files are managed without using Byzantine-fault-tolerant groups. Additionally, the file system may employ a hierarchical namespace to store files. Furthermore, the directory group may employ a plurality of locks to control access to objects (e.g., files and directories) in each directory.

Abstract translation: 无服务器分布式文件系统使用一个或多个目录组来管理文件和目录的存储。 可以使用拜占庭容错组来管理目录，而不使用拜占庭容错组来管理文件。 此外，文件系统可以使用分层命名空间来存储文件。 此外，目录组可以使用多个锁来控制对每个目录中的对象（例如，文件和目录）的访问。