专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20070185932A1 Scalable File Replication and Web-based Access 有权
标题翻译：可扩展文件复制和基于Web的访问
公开(公告)号：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.
摘要翻译：各种实施例引入了实现高度可扩展性的文件复制系统的复制实体的概念。在一个实施例中，复制实体驻留在可伸缩复制服务的形式中。在至少一些实施例中，复制服务提供了可以被诸如订户之类的个人使用的“天空中的驱动器”来同步其各自的机器，使得它们的文件被自动地复制到安全且永远在位的位置。或者或另外，诸如订户的个人当他们离开他们的机器时也可以经由基于网络的界面访问他们的文件。

2. 发明申请

US20070220328A1 Shutdown recovery 有权
标题翻译：关机恢复
公开(公告)号：US20070220328A1
公开(公告)日：2007-09-20
申请号：US11363828
申请日：2006-02-28
申请人： Huisheng Liu , Guhan Suriyanarayanan , Nikolaj Bjorner , Dan Teodosiu
发明人： Huisheng Liu , Guhan Suriyanarayanan , Nikolaj Bjorner , Dan Teodosiu
IPC分类号： G06F11/00
CPC分类号： G06F11/1435 , Y10S707/99953
摘要： Aspects of the subject matter described herein relate to shutdown recovery for resource replication systems. In aspects, a mechanism is described in which a machine having replicated data thereon can recover from a dirty shutdown. First, the machine determines whether a dirty shutdown has occurred. If so, the machine automatically performs shutdown recovery by causing resource metadata stored by the machine to be consistent with resource data stored by the machine. This may involve fixing the resource metadata for updates to the resource data that were not flushed to disk or may involve deleting the resource metadata and restoring it from another machine replicating the data.
摘要翻译：本文描述的主题的方面涉及用于资源复制系统的关闭恢复。在一些方面，描述了一种机构，其中具有复制数据的机器可以从脏关闭恢复。首先，机器确定是否发生脏关闭。如果是这样，机器将通过使机器存储的资源元数据与机器存储的资源数据一致，自动执行关机恢复。这可能涉及将用于更新的资源元数据修复到未刷新到磁盘的资源数据，或者可能涉及删除资源元数据并将其从复制数据的另一个机器恢复。

3. 发明申请

US20050256974A1 Efficient algorithm and protocol for remote differential compression on a remote device 审中-公开
标题翻译：远程差分压缩的高效算法和协议
公开(公告)号：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算法通过网络发送的元数据量。可以通过在动态确定的位置定位边界来分块对象和/或签名和块长度列表。数学函数评估相对于潜在块边界的水平窗口中相关联的散列值。

4. 发明申请

US20070026373A1 Resource replication service protocol 审中-公开
标题翻译：资源复制服务协议
公开(公告)号：US20070026373A1
公开(公告)日：2007-02-01
申请号：US11266515
申请日：2005-11-02
申请人： Guhan Suriyanarayanan , Nikolaj Bjorner , Rafik Robeal , Shi Cong , Joseph Porkka , Christophe Robert , Dan Teodosiu , David Golds , Huisheng Liu , Shobana Balakrishnan
发明人： Guhan Suriyanarayanan , Nikolaj Bjorner , Rafik Robeal , Shi Cong , Joseph Porkka , Christophe Robert , Dan Teodosiu , David Golds , Huisheng Liu , Shobana Balakrishnan
IPC分类号： G09B3/00 , G09B7/00
CPC分类号： G06F8/00
摘要： Aspects of the subject matter described herein relate to replicating resources across machines participating in a replica set. In aspects, a downstream machine requests that an upstream machine notify the downstream machine when updates to resources of the replica set occur. When such updates occur, the upstream machine notifies the downstream machine. In response thereto, the downstream machine requests resource meta-data and may include a limit as to how much resource meta-data may be sent. The upstream machine responds with the requested resource meta-data. Thereafter, the downstream machine determines which data associated with the updated resources to request and requests such data.
摘要翻译：本文描述的主题的方面涉及在参与副本集合的机器之间复制资源。在这方面，下游机器要求上游机器在对副本集的资源进行更新时通知下游机器。当发生这种更新时，上游机器通知下游机器。响应于此，下游机器请求资源元数据，并且可以包括关于可以发送多少资源元数据的限制。上游机器用所请求的资源元数据进行响应。此后，下游机器确定与更新的资源相关联的哪个数据请求并请求这样的数据。

5. 发明申请

US20050235043A1 Efficient algorithm and protocol for remote differential compression 有权
标题翻译：用于远程差分压缩的高效算法和协议
公开(公告)号：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算法通过网络发送的元数据量。可以通过在动态确定的位置定位边界来分块对象和/或签名和块长度列表。数学函数评估相对于潜在块边界的水平窗口中相关联的散列值。所描述的方法和系统在各种联网应用中是有用的，例如对等复制者，电子邮件客户端和服务器，客户端缓存系统，通用复制实用程序，数据库复制器，门户，软件更新服务，文件 /数据同步等。

6. 发明申请

US20050262167A1 Efficient algorithm and protocol for remote differential compression on a local device 审中-公开
标题翻译：在本地设备上进行远程差分压缩的高效算法和协议
公开(公告)号：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算法通过网络发送的元数据量。可以通过在动态确定的位置定位边界来分块对象和/或签名和块长度列表。数学函数评估相对于潜在块边界的水平窗口中相关联的散列值。

7. 发明申请

US20050195839A1 Universal naming scheme for peer-to-peer resources 失效
标题翻译：通用命名方案，用于对等资源
公开(公告)号：US20050195839A1
公开(公告)日：2005-09-08
申请号：US11067569
申请日：2005-02-25
申请人： Dan Teodosiu , Nikolaj Bjorner , Markus Breunig
发明人： Dan Teodosiu , Nikolaj Bjorner , Markus Breunig
IPC分类号： H04L29/06 , H04L29/08 , H04L29/12 , H04L12/56
CPC分类号： H04L61/1552 , H04L29/12066 , H04L29/12132 , H04L61/1511 , H04L67/104 , H04L67/1046 , H04L67/1063
摘要： Peer devices register with a resource locator service so that the peer devices can be uniquely identified in a networking environment. An addressing scheme addresses a peer resource in the networking environment based on the unique identifier of a peer device that is a master publisher of the resource. Based on the addressing scheme, the resource locator service can track the location of the master publisher of the resource as well as additional locations of peer devices that have cached the resource and made it available. In various embodiments, the resource locator service can service requests for peer resources by providing a list of locations where the resource is expected to be available or, in the case of non-compatible requester, provide access to the resource itself.
摘要翻译：对等设备向资源定位器服务注册，以便可以在网络环境中唯一地标识对等设备。寻址方案基于作为资源的主发行者的对等设备的唯一标识符来寻址网络环境中的对等资源。基于寻址方案，资源定位器服务可以跟踪资源的主发行者的位置以及缓存资源并使其可用的对等设备的附加位置。在各种实施例中，资源定位器服务可以通过提供预期资源可用的位置列表来提供对对等资源的请求，或者在不兼容请求者的情况下提供对资源本身的访问。

8. 发明申请

US20050147044A1 Locator and tracking service for peer-to-peer resources 有权
标题翻译：定位器和跟踪服务的对等资源
公开(公告)号：US20050147044A1
公开(公告)日：2005-07-07
申请号：US11056997
申请日：2005-02-14
申请人： Dan Teodosiu , Nikolaj Bjorner , Markus Breunig
发明人： Dan Teodosiu , Nikolaj Bjorner , Markus Breunig
IPC分类号： H04L29/06 , H04L29/08 , H04L29/12 , H04L12/56
CPC分类号： H04L61/1511 , H04L29/06 , H04L29/12066 , H04L29/12132 , H04L61/1552 , H04L67/104 , H04L67/1072 , H04L67/1093 , H04L69/329
摘要： A resource naming service (RNS) server receives peer resource requests from peer platforms through a networking environment. The RNS server, possibly in cooperation with other RNS servers and peer registrars generates a response to the request to enable the peer platforms to access the requested peer resources. In one embodiment, a response includes a list of locations of peer devices in the networking environment where a resource is expected to be available. A requesting device can then choose to access the resource from one or more of the listed peer locations.
摘要翻译：资源命名服务（RNS）服务器通过网络环境从对等体平台接收对等资源请求。可能与其他RNS服务器和对等注册器合作的RNS服务器产生对请求的响应，以使对等体平台能够访问所请求的对等资源。在一个实施例中，响应包括在预期资源可用的联网环境中的对等设备的位置列表。然后，请求设备可以选择从所列出的一个或多个对等位置访问资源。

9. 发明申请

US20060047855A1 Efficient chunking algorithm 审中-公开
标题翻译：高效分块算法
公开(公告)号：US20060047855A1
公开(公告)日：2006-03-02
申请号：US10844893
申请日：2004-05-13
申请人： Yuri Gurevich , Nikolaj Bjorner , Dan Teodosiu
发明人： Yuri Gurevich , Nikolaj Bjorner , Dan Teodosiu
IPC分类号： G06F15/16
CPC分类号： H04L63/123 , G06F16/182
摘要： The present invention provides a method for chunking an object. The method is arranged to provide efficient chunking of objects such that objects can be efficiently updated between a remote machine and a local machine over a network. The chunking algorithm is applicable in networked application such as file synchronization using remote differential compression (RDC) techniques. The chunking algorithm provides enhanced efficiencies by locating chunk boundaries around local maxima.
摘要翻译：本发明提供一种用于分块对象的方法。该方法被设置为提供对象的有效分块，使得可以通过网络在远程机器和本地机器之间有效地更新对象。分块算法适用于使用远程差分压缩（RDC）技术的文件同步等网络应用。分块算法通过在局部最大值周围定位块边界来提供更高的效率。

10. 发明申请

US20050141532A1 Universal naming scheme for peer-to-peer resources 失效
公开(公告)号：US20050141532A1
公开(公告)日：2005-06-30
申请号：US11067572
申请日：2005-02-25
申请人： Dan Teodosiu , Nikolaj Bjorner , Markus Breunig
发明人： Dan Teodosiu , Nikolaj Bjorner , Markus Breunig
IPC分类号： H04L29/06 , H04L29/08 , H04L29/12 , H04L12/28
CPC分类号： H04L61/1552 , H04L29/12066 , H04L29/12132 , H04L61/1511 , H04L67/104 , H04L67/1046 , H04L67/1063
摘要： Peer devices register with a resource locator service so that the peer devices can be uniquely identified in a networking environment. An addressing scheme addresses a peer resource in the networking environment based on the unique identifier of a peer device that is a master publisher of the resource. Based on the addressing scheme, the resource locator service can track the location of the master publisher of the resource as well as additional locations of peer devices that have cached the resource and made it available. In various embodiments, the resource locator service can service requests for peer resources by providing a list of locations where the resource is expected to be available or, in the case of non-compatible requester, provide access to the resource itself.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式