公开(公告)号：US20060230245A1

公开(公告)日：2006-10-12

申请号：US11101589

申请日：2005-04-08

申请人： Alexander Gounares ,  Ashok Kuppusamy ,  John Douceur ,  Patrick Bozeman ,  Raymond Endres ,  William Bolosky

发明人： Alexander Gounares ,  Ashok Kuppusamy ,  John Douceur ,  Patrick Bozeman ,  Raymond Endres ,  William Bolosky

IPC分类号： G06F12/00

CPC分类号： H04L43/0817 ,  H04L41/22 ,  H04L67/1095 ,  H04L67/1097 ,  H04L67/36

摘要： The safety of data stored across distributed storage resources may be dynamically monitored and indicated to the user. Monitoring may occur in real time and/or in response to changes in the stored data. The notification may be in the form of, e.g., a visual indicator that appears in the taskbar of a graphical user interface of an operating system. The indicator may be presented in a particular color or having some other visual property associated with the particular data safety state. In addition, the user may be provided with a convenient way of obtaining additional storage resources. Upon automatically detecting that storage is running low, the user may be presented with a user interface that offers the user a way to easily add to the existing storage. For example, the user may be directed to a predefined Internet web site that is known to offer such additional storage.

摘要翻译： 存储在分布式存储资源中的数据的安全性可以被动态地监视并向用户指示。 监视可以实时地和/或响应于存储的数据的变化而发生。 该通知可以是例如出现在操作系统的图形用户界面的任务栏中的视觉指示器的形式。 指示器可以以特定颜色呈现或具有与特定数据安全状态相关联的一些其它视觉特性。 此外，可以向用户提供获得额外的存储资源的便利方式。 在自动检测到存储器运行低的情况下，可以向用户呈现用户界面，以向用户提供容易地添加到现有存储器的方式。 例如，用户可以被引导到已知提供这样的附加存储的预定义的因特网网站。

公开(公告)号：US20060085428A1

公开(公告)日：2006-04-20

申请号：US11053386

申请日：2005-02-07

申请人： Patrick Bozeman ,  Scott Colville ,  Mukul Gupta ,  Daniel Lovinger ,  Ravisankar Pudipeddi ,  Ramesh Shankar ,  Supriya Wickrematillake

发明人： Patrick Bozeman ,  Scott Colville ,  Mukul Gupta ,  Daniel Lovinger ,  Ravisankar Pudipeddi ,  Ramesh Shankar ,  Supriya Wickrematillake

IPC分类号： G06F17/30

CPC分类号： G06F17/30091 ,  G06F17/30194 ,  Y10S707/99953

摘要： A system and method for organizing and sorting targets received in a referral response and for realizing a target fail-back and a target priority policy in a distributed file system is provided. In one embodiment, a sorting method includes receiving a referral response in the form of a list of targets that are sorted into bounded sets. Having a sorted referral response in bounded sets provides a basis for implementing a target fail-back and a target priority policy. The computer system may select a target from a sorted list of targets sorted according to site-cost and/or target priority. Then, the computer system may determine if the set target is associated with a more preferred target when compared to all available targets in the sorted list and if not, switch back to a more preferred target.

公开(公告)号：US09594770B1

公开(公告)日：2017-03-14

申请号：US13170816

申请日：2011-06-28

申请人： Nicholas Kushmerick ,  Patrick Bozeman

发明人： Nicholas Kushmerick ,  Patrick Bozeman

IPC分类号： G06F17/30 ,  G06F9/455

CPC分类号： G06F17/30221 ,  G06F9/5011 ,  G06F17/30138 ,  G06F17/30233 ,  G06F2009/45583

摘要： Selecting a storage device to be mapped to a requested virtual disk includes maintaining attributes for a set of storage devices including a cost attribute, a capacity attribute and quality-of-service attributes. A request for a virtual disk includes request parameters including a price parameter, a capacity parameter and quality-of-service parameters. A device selection function generates a score for each storage device based on the request parameters and the storage device attributes, and identifies a best suited storage device by comparing the respective scores of the storage devices. The virtual disk is then created in satisfaction of the request with a mapping to the identified storage device to provide underlying physical data storage for the virtual disk.

摘要翻译： 选择要映射到请求的虚拟磁盘的存储设备包括维护一组存储设备的属性，包括成本属性，容量属性和服务质量属性。 对虚拟磁盘的请求包括请求参数，包括价格参数，容量参数和服务质量参数。 设备选择功能基于请求参数和存储设备属性为每个存储设备生成分数，并且通过比较存储设备的相应分数来识别最适合的存储设备。 然后通过映射到所识别的存储设备来创建满足该请求的虚拟磁盘，以为虚拟磁盘提供底层物理数据存储。

公开(公告)号：US20050256974A1

公开(公告)日：2005-11-17

申请号：US10844906

申请日：2004-05-13

申请人： Dan Teodosiu ,  Nikolaj Bjorner ,  Yuri Gurevich ,  Patrick Bozeman

发明人： Dan Teodosiu ,  Nikolaj Bjorner ,  Yuri Gurevich ,  Patrick Bozeman

IPC分类号： G06F15/16 ,  H04L29/06 ,  H04L29/08

CPC分类号： H04L69/04 ,  H04L67/1095

摘要： The present invention is used to update objects over limited bandwidth networks. Objects are updated between two or more computing devices using remote differential compression (RDC) techniques such that required data transfers are minimized. In one aspect, efficient large object transfers are achieved by recursively applying the RDC algorithm to its own metadata; a single or multiple recursion step(s) may be used in this case to reduce the amount of metadata sent over the network by the RDC algorithm. Objects and/or signature and chunk length lists can be chunked by locating boundaries at dynamically determined locations. A mathematical function evaluates hash values associated within a horizon window relative to potential chunk boundary.

摘要翻译： 本发明用于在有限带宽网络上更新对象。 使用远程差分压缩（RDC）技术在两个或多个计算设备之间更新对象，使得所需的数据传输最小化。 在一个方面，通过将RDC算法递归地应用于其自身的元数据来实现有效的大对象传送; 在这种情况下可以使用单个或多个递归步骤来减少由RDC算法通过网络发送的元数据量。 可以通过在动态确定的位置定位边界来分块对象和/或签名和块长度列表。 数学函数评估相对于潜在块边界的水平窗口中相关联的散列值。

公开(公告)号：US20070185932A1

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

申请号：US11275870

申请日：2006-02-01

申请人： Dan Teodosiu ,  David Steere ,  Muthukaruppan Annamalai ,  Nikolaj Bjorner ,  Michael Bohlander ,  Huisheng Liu ,  Patrick Bozeman

发明人： Dan Teodosiu ,  David Steere ,  Muthukaruppan Annamalai ,  Nikolaj Bjorner ,  Michael Bohlander ,  Huisheng Liu ,  Patrick Bozeman

IPC分类号： G06F17/30

CPC分类号： G06F17/30212

摘要： Various embodiments introduce the notion of a replication entity which implements a highly scalable file replication system. In one embodiment, the replication entity resides in the form of a scalable replication service. In at least some embodiments, the replication service provides a “drive in the sky” facility that can be used by individuals, such as subscribers, to synchronize their individual machines, such that their files are automatically replicated to a safe and always-on location. Alternatively or additionally, individuals such as subscribers can also access their files via a web-based interface when they are away from their machines.

摘要翻译： 各种实施例引入了实现高度可扩展性的文件复制系统的复制实体的概念。 在一个实施例中，复制实体驻留在可伸缩复制服务的形式中。 在至少一些实施例中，复制服务提供了可以被诸如订户之类的个人使用的“天空中的驱动器”来同步其各自的机器，使得它们的文件被自动地复制到安全且永远在位的位置 。 或者或另外，诸如订户的个人当他们离开他们的机器时也可以经由基于网络的界面访问他们的文件。

公开(公告)号：US20050246393A1

公开(公告)日：2005-11-03

申请号：US11173754

申请日：2005-06-30

申请人： Joshua Coates ,  Patrick Bozeman ,  David Patterson

发明人： Joshua Coates ,  Patrick Bozeman ,  David Patterson

IPC分类号： G06F3/06 ,  G06F7/00 ,  G06F17/30 ,  H04L29/06

CPC分类号： G06F17/30194 ,  G06F3/0607 ,  G06F3/0643 ,  G06F3/067 ,  G06F17/30233 ,  H04L29/06 ,  H04L63/0823 ,  H04L63/12 ,  H04L67/1097 ,  H04L67/42

摘要： A network storage system includes a virtual file system (“VFS”) that manages the files of the network storage system, and a storage center that stores the files. The VFS and the storage center are separated, such that a client accesses the VFS to conduct file system operations and the client accesses the storage center to upload/download files. The client accesses the network storage system through one or more storage ports. The storage center includes a plurality of distributed object storage managers (DOSMs) and a storage cluster that includes a plurality of intelligent storage nodes. The network storage system includes additional storage centers at geographically disparate locations. The network storage system uses a multi-cast protocol to maintain file information at the DOSMs regarding files stored in the intelligent storage nodes, including files stored in disparate storage centers.

摘要翻译： 网络存储系统包括管理网络存储系统的文件的虚拟文件系统（“VFS”）和存储文件的存储中心。 VFS和存储中心分开，客户端访问VFS进行文件系统操作，客户端访问存储中心上传/下载文件。 客户端通过一个或多个存储端口访问网络存储系统。 存储中心包括多个分布式对象存储管理器（DOSM）和包括多个智能存储节点的存储集群。 网络存储系统在地理位置不同的地方包括额外的存储中心。 网络存储系统使用多播协议来维护DOSM中关于存储在智能存储节点中的文件的文件信息，包括存储在不同存储中心的文件。

公开(公告)号：US20050235043A1

公开(公告)日：2005-10-20

申请号：US10825735

申请日：2004-04-15

申请人： Dan Teodosiu ,  Nikolaj Bjorner ,  Yuri Gurevich ,  Patrick Bozeman

发明人： Dan Teodosiu ,  Nikolaj Bjorner ,  Yuri Gurevich ,  Patrick Bozeman

IPC分类号： G06F12/00 ,  G06F20060101 ,  G06F13/00 ,  G06F15/16 ,  G06F17/30 ,  G06K9/36 ,  H03M7/30 ,  H04L12/20 ,  H04L29/00 ,  H04L29/02 ,  H04L29/06 ,  H04N7/42

CPC分类号： H04L63/123 ,  H03M7/30 ,  H04L69/04 ,  Y10S707/99953 ,  Y10S707/99955

摘要： A method and system are related to updating objects over limited bandwidth networks. Objects are updated between two or more computing devices using remote differential compression (RDC) techniques such that required data transfers are minimized. In one aspect, efficient large object transfers are achieved by recursively applying the RDC algorithm to its own metadata; a single or multiple recursion step(s) may be used in this case to reduce the amount of metadata sent over the network by the RDC algorithm. Objects and/or signature and chunk length lists can be chunked by locating boundaries at dynamically determined locations. A mathematical function evaluates hash values associated within a horizon window relative to potential chunk boundary. The described method and system is useful in a variety of networked applications, such as peer-to-peer replicators, email clients and servers, client-side caching systems, general-purpose copy utilities, database replicators, portals, software update services, file/data synchronization, and others.

摘要翻译： 一种方法和系统与通过有限带宽网络更新对象有关。 使用远程差分压缩（RDC）技术在两个或多个计算设备之间更新对象，使得所需的数据传输最小化。 在一个方面，通过将RDC算法递归地应用于其自身的元数据来实现有效的大对象传送; 在这种情况下可以使用单个或多个递归步骤来减少由RDC算法通过网络发送的元数据量。 可以通过在动态确定的位置定位边界来分块对象和/或签名和块长度列表。 数学函数评估相对于潜在块边界的水平窗口中相关联的散列值。 所描述的方法和系统在各种联网应用中是有用的，例如对等复制者，电子邮件客户端和服务器，客户端缓存系统，通用复制实用程序，数据库复制器，门户，软件更新服务，文件 /数据同步等。

公开(公告)号：US07584220B2

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

申请号：US11053386

申请日：2005-02-07

申请人： Patrick Bozeman ,  Scott Eric Colville ,  Mukul Gupta ,  Daniel Edward Lovinger ,  Ravisankar V. Pudipeddi ,  Ramesh Shankar ,  Supriya Wickrematillake

发明人： Patrick Bozeman ,  Scott Eric Colville ,  Mukul Gupta ,  Daniel Edward Lovinger ,  Ravisankar V. Pudipeddi ,  Ramesh Shankar ,  Supriya Wickrematillake

IPC分类号： G06F17/30

CPC分类号： G06F17/30091 ,  G06F17/30194 ,  Y10S707/99953

摘要： A system and method for organizing and sorting targets received in a referral response and for realizing a target fail-back and a target priority policy in a distributed file system is provided. In one embodiment, a sorting method includes receiving a referral response in the form of a list of targets that are sorted into bounded sets. Having a sorted referral response in bounded sets provides a basis for implementing a target fail-back and a target priority policy. The computer system may select a target from a sorted list of targets sorted according to site-cost and/or target priority. Then, the computer system may determine if the set target is associated with a more preferred target when compared to all available targets in the sorted list and if not, switch back to a more preferred target.

摘要翻译： 提供了一种用于组织和分类在引荐响应中接收的目标并且用于实现分布式文件系统中的目标故障恢复和目标优先级策略的系统和方法。 在一个实施例中，排序方法包括以分类为有界集合的目标列表的形式接收推荐响应。 在有界集合中进行排序的引用响应为实现目标故障恢复和目标优先级策略提供了基础。 计算机系统可以从根据站点成本和/或目标优先级排序的排序的目标列表中选择目标。 然后，当与排序列表中的所有可用目标相比较时，计算机系统可以确定所设置的目标是否与更优选的目标相关联，如果不是，则切换回更优选的目标。

公开(公告)号：US20050262167A1

公开(公告)日：2005-11-24

申请号：US10844907

申请日：2004-05-13

申请人： Dan Teodosiu ,  Nikolaj Bjorner ,  Yuri Gurevich ,  Patrick Bozeman

发明人： Dan Teodosiu ,  Nikolaj Bjorner ,  Yuri Gurevich ,  Patrick Bozeman

IPC分类号： G06F17/30

CPC分类号： G06F16/20

摘要： The present invention is used to update objects over limited bandwidth networks. Objects are updated between two or more computing devices using remote differential compression (RDC) techniques such that required data transfers are minimized. In one aspect, efficient large object transfers are achieved by recursively applying the RDC algorithm to its own metadata; a single or multiple recursion step(s) may be used in this case to reduce the amount of metadata sent over the network by the RDC algorithm. Objects and/or signature and chunk length lists can be chunked by locating boundaries at dynamically determined locations. A mathematical function evaluates hash values associated within a horizon window relative to potential chunk boundary.

摘要翻译： 本发明用于在有限带宽网络上更新对象。 使用远程差分压缩（RDC）技术在两个或多个计算设备之间更新对象，使得所需的数据传输最小化。 在一个方面，通过将RDC算法递归地应用于其自身的元数据来实现有效的大对象传送; 在这种情况下可以使用单个或多个递归步骤来减少由RDC算法通过网络发送的元数据量。 可以通过在动态确定的位置定位边界来分块对象和/或签名和块长度列表。 数学函数评估相对于潜在块边界的水平窗口中相关联的散列值。