公开(公告)号：US06981138B2

公开(公告)日：2005-12-27

申请号：US09817812

申请日：2001-03-26

申请人： John R. Douceur ,  Atul Adya ,  William J. Bolosky ,  Marvin M. Theimer

发明人： John R. Douceur ,  Atul Adya ,  William J. Bolosky ,  Marvin M. Theimer

IPC分类号： H04L9/08 ,  H04L9/30 ,  H04L9/00

CPC分类号： H04L9/0825 ,  H04L9/0894

摘要： 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.

公开(公告)号：US06401126B1

公开(公告)日：2002-06-04

申请号：US09266194

申请日：1999-03-10

申请人： John R. Douceur ,  William J. Bolosky

发明人： John R. Douceur ,  William J. Bolosky

IPC分类号： G06F1516

CPC分类号： H04N21/2326 ,  H04L29/06 ,  H04L67/10 ,  H04L67/32 ,  Y10S707/99937

摘要： A distributed file server system has multiple data servers connected to stream data files continuously over a network to multiple clients. Data files are distributed across the data servers so that data blocks of the data files are stored at manage distributed portions of a schedule. Each data server sees a different portion of the schedule, but no one data server sees the whole schedule. The scheduler facilitates service of requested data streams from its corresponding data server according to a schedule portion that is available to the data server. The scheduler determines whether to insert a new data stream into the current slot it presently owns in its schedule portion, or to wait for a subsequent slot in the schedule based on a thrifty policy.

摘要翻译： 分布式文件服务器系统具有多个数据服务器连接，可通过网络将数据文件连续流式传输到多个客户端。 数据文件分布在数据服务器上，使得数据文件的数据块被存储在调度表的管理分布式部分。 每个数据服务器看到调度的不同部分，但没有一个数据服务器看到整个调度。 调度器根据可用于数据服务器的调度部分便利来自其对应数据服务器的请求数据流的服务。 调度器确定是否将新数据流插入其当前在其调度部分中拥有的当前时隙中，或者基于节俭策略等待该调度中的后续时隙。

公开(公告)号：US06389433B1

公开(公告)日：2002-05-14

申请号：US09354660

申请日：1999-07-16

申请人： William J. Bolosky ,  John R. Douceur ,  Scott M. Cutshall

发明人： William J. Bolosky ,  John R. Douceur ,  Scott M. Cutshall

IPC分类号： G06F1200

CPC分类号： G06F17/3015 ,  G06F11/1453 ,  Y10S707/968 ,  Y10S707/99931 ,  Y10S707/99933 ,  Y10S707/99952 ,  Y10S707/99953 ,  Y10S707/99956

摘要： A method and system that operates as a background process automatically identify and merge duplicate files into a single instance files, wherein the duplicate files become independent links to the single instance files. A groveler maintains a database of information about the files on a volume, including a file size and checksum (signature) based on the file contents. The groveler periodically acts in the background to scan the USN log, a log that dynamically records file system activity. New or modified files detected in the USN log are queued as work items, each work item representing a file. The volume may be scanned to add work items to the queue, which takes place initially or when there is a potential problem with the USN log. The groveler periodically removes items from the queue, calculates the signature of the corresponding file contents, and uses the signature and file size to query the database for matching files. The groveler then compares any matching files with the file corresponding to the work item for an exact duplicate, and if found, calls a single instance store facility to merge the files and create independent links to those files.

摘要翻译： 作为后台进程运行的方法和系统自动将重复文件识别并合并到单个实例文件中，其中重复文件成为单个实例文件的独立链接。 Groveler维护关于卷上的文件的信息的数据库，包括基于文件内容的文件大小和校验和（签名）。 Groveler定期在后台执行扫描USN日志，该日志是动态记录文件系统活动的日志。 在USN日志中检测到的新的或修改的文件被排队为工作项，每个工作项表示一个文件。 可以扫描卷以将工作项目添加到队列中，这最初发生或当USN日志存在潜在问题时。 groveler定期从队列中删除项目，计算相应文件内容的签名，并使用签名和文件大小来查询数据库的匹配文件。 然后，groveler将任何匹配的文件与与工作项相对应的文件进行比较，如果找到，则调用单个实例存储工具来合并文件，并创建到这些文件的独立链接。

公开(公告)号：US5642152A

公开(公告)日：1997-06-24

申请号：US349889

申请日：1994-12-06

申请人： John R. Douceur ,  William J. Bolosky

发明人： John R. Douceur ,  William J. Bolosky

IPC分类号： H04N7/173 ,  H04N21/472 ,  H04N7/14

CPC分类号： H04N21/47202 ,  H04N7/17318 ,  H04N7/17336

摘要： A scalable method and system is provided for scheduling data transfer of a video-on-demand server system. A strategy is provided for locating available bandwidth and allocating available bandwidth to subscribers as needed. The input/output bandwidth of storage devices that store data for video image sequences is modeled as a series of bandwidth units. The series of bandwidth units form a schedule where consumer requests are allocated to a bandwidth unit for receiving video image sequences. The bandwidth units are allocated to consumer requests according to an anti-clustering scheduling algorithm. By utilizing an anti-clustering scheduling algorithm, consumer requests less frequently incur an unacceptably long latency before receiving video image sequences.

摘要翻译： 提供了一种可扩展的方法和系统，用于调度视频点播服务器系统的数据传输。 提供了一种定位可用带宽并根据需要为用户分配可用带宽的策略。 存储视频图像序列数据的存储设备的输入/输出带宽被建模为一系列带宽单位。 一系列带宽单元形成一个时间表，其中消费者请求被分配给用于接收视频图像序列的带宽单元。 带宽单位根据反聚类调度算法分配给用户请求。 通过利用反聚类调度算法，在接收视频图像序列之前，消费者的请求较不频繁地产生不可接受的长延迟。

公开(公告)号：US08719143B2

公开(公告)日：2014-05-06

申请号：US11613232

申请日：2006-12-20

申请人： Henricus Johannes Maria Meijer ,  Gary W. Flake ,  Arnold N. Blinn ,  William J. Bolosky ,  Lili Cheng ,  Michael Connolly ,  Alexander G. Gounares ,  James R. Larus ,  Matthew B. MacLaurin ,  Debi P. Mishra ,  Amit Mital ,  Ira L. Snyder, Jr. ,  David R. Treadwell, III

发明人： Henricus Johannes Maria Meijer ,  Gary W. Flake ,  Arnold N. Blinn ,  William J. Bolosky ,  Lili Cheng ,  Michael Connolly ,  Alexander G. Gounares ,  James R. Larus ,  Matthew B. MacLaurin ,  Debi P. Mishra ,  Amit Mital ,  Ira L. Snyder, Jr. ,  David R. Treadwell, III

IPC分类号： G06Q40/00 ,  G06Q30/08 ,  G06Q30/06

CPC分类号： G06Q30/08 ,  G06F11/202 ,  G06F17/303 ,  G06Q30/0611 ,  G06Q40/00

摘要： The claimed subject matter provides a system and/or a method that facilitates preserving and maintaining data and/or services associated with a network service. The network service can be any collection of resources that are maintained by a party (e.g., third-party, off-site, etc.) and accessible by an identified user over a network (e.g., WAN, Internet, etc.). An interface component can receive a termination notification related to the network service. An executor component can relocate at least a portion of one of data and a service associated with the terminated network service to a disparate replacement network service in order to preserve any services and/or data related therewith.

摘要翻译： 所要求保护的主题提供有助于保持和维护与网络服务相关联的数据和/或服务的系统和/或方法。 网络服务可以是由一方维护的任何资源集合（例如，第三方，非现场等），并且可以由被识别的用户通过网络（例如，WAN，因特网等）访问。 接口组件可以接收与网络服务相关的终止通知。 执行器组件可以将与终止的网络服务相关联的数据和服务中的一个的至少一部分重定位到不同的替换网络服务，以便保留与之相关的任何服务和/或数据。

公开(公告)号：US07716672B2

公开(公告)日：2010-05-11

申请号：US11009655

申请日：2004-12-10

申请人： John R. Douceur ,  William J. Bolosky

发明人： John R. Douceur ,  William J. Bolosky

IPC分类号： G06F9/46

CPC分类号： G06F9/4881

摘要： A method and system for regulating tasks of background processes so as to reduce interference with foreground processes. The progress rate of a background task (e.g., amount of work performed per unit time) is measured and evaluated against a target amount. If the progress rate appears degraded, the background task is suspended for a computed time interval so as to back off from its interference with a foreground process. Each time the progress rate appears degraded, the time interval is exponentially increased from its previous value up to a maximum, however if the performance appears normal, the time interval is reset to a minimum. Evaluation of the work is statistically based so as to eliminate variations in measurements, and automatic calibration of the target amount is provided, as is a mechanism for prioritizing multiple background tasks.

摘要翻译： 一种用于调整后台进程任务的方法和系统，以减少对前台进程的干扰。 根据目标量测量和评估后台任务的进度（例如，每单位时间执行的工作量）。 如果进度速率出现降级，则后台任务将暂停计算的时间间隔，以避免其与前台进程的干扰。 每次进度出现退化时，时间间隔从先前的值到最大值都呈指数级增长，但是如果性能出现正常，则时间间隔被重置为最小值。 工作的评估是统计学的，以便消除测量中的变化，并且提供目标量的自动校准，以及用于优先考虑多个后台任务的机制。

公开(公告)号：US07689524B2

公开(公告)日：2010-03-30

申请号：US11536488

申请日：2006-09-28

申请人： Raymond E. Ozzie ,  William H. Gates, III ,  Gary W. Flake ,  Thomas F. Bergstraesser ,  Arnold N. Blinn ,  William J. Bolosky ,  Christopher W. Brumme ,  Lili Cheng ,  Michael Connolly ,  Dane A. Glasgow ,  Daniel S. Glasser ,  Alexander G. Gounares ,  James R. Larus ,  Matthew B. MacLaurin ,  Henricus Johannes Maria Meijer ,  Debi P. Mishra ,  Amit Mital ,  Ira L. Snyder, Jr. ,  Chandramohan A. Thekkath ,  Melora Zaner-Godsey

发明人： Raymond E. Ozzie ,  William H. Gates, III ,  Gary W. Flake ,  Thomas F. Bergstraesser ,  Arnold N. Blinn ,  William J. Bolosky ,  Christopher W. Brumme ,  Lili Cheng ,  Michael Connolly ,  Dane A. Glasgow ,  Daniel S. Glasser ,  Alexander G. Gounares ,  James R. Larus ,  Matthew B. MacLaurin ,  Henricus Johannes Maria Meijer ,  Debi P. Mishra ,  Amit Mital ,  Ira L. Snyder, Jr. ,  Chandramohan A. Thekkath ,  Melora Zaner-Godsey

IPC分类号： G06F15/18 ,  G06F17/00 ,  G06F5/00 ,  G06F9/44 ,  G06F15/16 ,  G06N7/02 ,  G06N7/06

CPC分类号： G06N5/02 ,  G06Q10/00

摘要： An intelligent personalized agent monitors, regulates, and advises a user in decision-making processes for efficiency or safety concerns. The agent monitors an environment and present characteristics of a user and analyzes such information in view of stored preferences specific to one of multiple profiles of the user. Based on the analysis, the agent can suggest or automatically implement a solution to a given issue or problem. In addition, the agent can identify another potential issue that requires attention and suggests or implements action accordingly. Furthermore, the agent can communicate with other users or devices by providing and acquiring information to assist in future decisions. All aspects of environment observation, decision assistance, and external communication can be flexibly limited or allowed as desired by the user.

摘要翻译： 智能个性化代理在决策过程中对用户的效率或安全问题进行监控，调节和建议。 代理监视环境并呈现用户的特征，并根据对用户的多个配置文件之一特有的存储的偏好来分析这些信息。 基于分析，代理可以建议或自动实现给定问题或问题的解决方案。 此外，代理可以确定需要注意的另一个潜在问题，并相应地提出或实施行动。 此外，代理可以通过提供和获取信息来协助未来的决定与其他用户或设备进行通信。 环境观察，决策辅助和外部沟通的各个方面可以根据用户的需要进行灵活的限制或允许。

公开(公告)号：US20090287890A1

公开(公告)日：2009-11-19

申请号：US12121776

申请日：2008-05-15

申请人： William J. Bolosky

发明人： William J. Bolosky

IPC分类号： G06F12/00

CPC分类号： G06F3/0656 ,  G06F3/061 ,  G06F3/0659 ,  G06F3/0676

摘要： The write optimizer described in this disclosure optimizes write traffic to a disk. The write optimization technique writes small data sets to be written to a disk drive to a log file in write optimized order and rewrites the small data sets to disk drive in read optimized order when the disk drive is idle. The write optimizer reserves a portion of a disk to be used for write performance improvement, and then takes all small writes to the disk and writes them to the reserved area rather than to their intended destination. When the disk becomes idle (or the reserved area full), the write optimizer takes the data that has been written to the reserved area and that has not been subsequently overwritten and copies it to its final location.

摘要翻译： 本公开中描述的写优化器优化了对磁盘的写入流量。 写入优化技术将写入磁盘驱动器的小数据集以写入优化顺序写入日志文件，并在磁盘驱动器空闲时以读取优化顺序将小数据集重写为磁盘驱动器。 写优化器保留用于写性能改进的一部分磁盘，然后对磁盘进行所有小写操作，并将其写入保留区而不是其预期目的地。 当磁盘空闲（或保留区域已满）时，写入优化器将已经写入保留区域的数据，并且未被覆盖，并将其复制到其最终位置。

公开(公告)号：US07574598B2

公开(公告)日：2009-08-11

申请号：US11150801

申请日：2005-06-10

申请人： John R. Douceur ,  William J. Bolosky ,  Marvin M. Theimer

发明人： John R. Douceur ,  William J. Bolosky ,  Marvin M. Theimer

IPC分类号： H04L29/06

CPC分类号： H04L9/3236 ,  H04L9/3247 ,  Y10S707/99953 ,  Y10S707/99955

摘要： Cryptographic protocols and methods of employing the same are described. The described protocols advantageously enable two or more identical encryptable objects that are coded for encryption with different keys to be identified as identical without access to either the unencrypted objects or the keys that are used in the encryption process. Additionally, the protocols enable two or more identical encryptable objects to be processed with different encryption keys, yet be stored in a manner so that the total required storage space is proportional to the space that is required to store a single encryptable object, plus a constant amount for each distinct encryption key. In various embodiments, the encryptable objects comprise files and the cryptographic protocols enable encrypted files to be used in connection with single instance store (SIS) systems.

摘要翻译： 描述了使用它们的密码协议和方法。 所描述的协议有利地使得被编码用于具有不同密钥的加密的两个或更多个相同的可加密对象被识别为相同，而不访问加密过程中使用的未加密对象或密钥。 另外，这些协议允许使用不同的加密密钥来处理两个或多个相同的可加密对象，但是以一定的方式存储，使得所需的总存储空间与存储单个可加密对象所需的空间成正比，加上常数 每个不同加密密钥的数量。 在各种实施例中，可加密对象包括文件，并且加密协议使加密文件能够与单实例存储（SIS）系统相关联使用。

公开(公告)号：US07401220B2

公开(公告)日：2008-07-15

申请号：US11014491

申请日：2004-12-16

申请人： William J. Bolosky ,  Gerald Cermak ,  Atul Adya ,  John R. Douceur

发明人： William J. Bolosky ,  Gerald Cermak ,  Atul Adya ,  John R. Douceur

IPC分类号： H04L29/00

CPC分类号： G06F17/30097 ,  G06F19/00 ,  H04L9/0656 ,  H04L9/3239 ,  H04L9/3249 ,  H04L2209/20 ,  H04L2209/38 ,  H04L2209/60

摘要： 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.