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

1. 发明授权

US07788223B2 Resource freshness and replication 有权
标题翻译：资源清新和复制
公开(公告)号：US07788223B2
公开(公告)日：2010-08-31
申请号：US11364234
申请日：2006-02-28
申请人： Huisheng Liu , Guhan Suriyanarayanan , Nikolaj S. Bjørner
发明人： Huisheng Liu , Guhan Suriyanarayanan , Nikolaj S. Bjørner
IPC分类号： G06F7/00 , G06F17/00 , G06F15/16
CPC分类号： G06F17/30578
摘要： Aspects of the subject matter described herein relate to resource replication systems. In aspects, a mechanism is described that detects when local resources are stale. Local resources may be stale when the time between a last successful synchronization activity and a current time exceeds a staleness value. If the local resources are determined to be stale, the local member may refrain from certain synchronization activities until the local member is allowed to resume these certain synchronization activities. If the local resources are not stale, additional synchronization activities including synchronizing resources between the member and an upstream or downstream partner may be performed.
摘要翻译：本文描述的主题的方面涉及资源复制系统。在一些方面，描述了一种机制来检测当地资源何时陈旧。当最后一次成功的同步活动与当前时间之间的时间超过了平淡度值时，本地资源可能会过时。如果当地资源被确定为陈旧，当地成员可以避免某些同步活动，直到允许当地成员恢复这些某些同步活动。如果本地资源不是过时的，则可以执行包括在成员和上游或下游伙伴之间同步资源的附加同步活动。

2. 发明授权

US07620721B2 Pre-existing content replication 失效
标题翻译：预先存在的内容复制
公开(公告)号：US07620721B2
公开(公告)日：2009-11-17
申请号：US11364235
申请日：2006-02-28
申请人： Guhan Suriyanarayanan , Huisheng Liu , Shobana M. Balakrishnan , Nikolaj S. Bjørner
发明人： Guhan Suriyanarayanan , Huisheng Liu , Shobana M. Balakrishnan , Nikolaj S. Bjørner
IPC分类号： G06F15/173
CPC分类号： G06F17/30215 , G06F17/30174 , H04L63/102 , H04L63/104
摘要： Aspects of the subject matter described herein relate to replicating initial content in resource replication systems. In aspects, each member participating in a replica group obtains a content set state from a directory service. The content set state indicates whether the member is allowed to synchronize resources with another member participating in the replica group. If the member is designated as a primary member, the member may replicate out resources to its downstream partners. If a member is not designated as a primary member, the member may not replicate out resources to its downstream partners until it has successfully synchronized resources with an upstream partner. Fence values may be set which control which resources win (and are replicated out) during synchronization.
摘要翻译：本文描述的主题的方面涉及在资源复制系统中复制初始内容。在方面，参与副本组的每个成员从目录服务获得内容集状态。内容设置状态指示成员是否被允许与参与副本组的另一成员同步资源。如果该成员被指定为主要成员，则该成员可以向其下游合作伙伴复制资源。如果成员未被指定为主成员，则成员可能无法向下游合作伙伴复制资源，直到其成功与上游合作伙伴同步资源。可以设置栅栏值，以控制哪些资源在同步期间获胜（并被复制出来）。

3. 发明授权

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

4. 发明授权

US07506007B2 Interval vector based knowledge synchronization for resource versioning 有权
标题翻译：基于时间向量的资源版本控制知识同步
公开(公告)号：US07506007B2
公开(公告)日：2009-03-17
申请号：US10791041
申请日：2004-03-01
申请人： Nikolaj S. Bjørner
发明人： Nikolaj S. Bjørner
IPC分类号： G06F12/00
CPC分类号： G06F17/30215 , G06F11/1482 , G06F11/2097 , Y10S707/99953 , Y10S707/99955
摘要： A method and system for synchronizing objects among members of a replica set. An interval vector is maintained on each member. The interval vector includes one or more intervals each of which has an upper and lower bound. During synchronization, the member sends the interval vector to the member with which it is synchronizing. The other member examines the interval vector and finds resources with versions that are not included in any of the intervals of the interval vector. The other member then transmits these resources to the first member which uses them to update its store. The first member also updates its interval vector to account for the received resources.
摘要翻译：用于在副本集合的成员之间同步对象的方法和系统。在每个成员上保持间隔向量。间隔向量包括一个或多个间隔，每个间隔具有上限和下限。在同步期间，成员将间隔向量发送到与其同步的成员。另一个成员检查间隔向量，并找到不包含在间隔向量的任何间隔中的版本的资源。然后，其他成员将这些资源发送到使用它们的第一个成员来更新其存储。第一个成员还更新其间隔向量以考虑接收到的资源。

5. 发明授权

US07290019B2 Garbage collection of tombstones for optimistic replication systems 有权
标题翻译：用于乐观复制系统的垃圾收集墓碑
公开(公告)号：US07290019B2
公开(公告)日：2007-10-30
申请号：US10779030
申请日：2004-02-13
申请人： Nikolaj S. Bjørner , Dan Teodosiu , Rostislav Yavorskiy
发明人： Nikolaj S. Bjørner , Dan Teodosiu , Rostislav Yavorskiy
IPC分类号： G06F17/30
CPC分类号： G06F17/30215 , G06F12/0253 , Y10S707/99953 , Y10S707/99957
摘要： A method and system for synchronizing objects among members of a replica set. Objects on members of the replica set are quickly synchronized via a join algorithm that takes advantage of version vectors. When an object is deleted, the object is tombstoned (i.e., marked as “dead”). Tombstones are also replicated between the connected members of the replica set. After a period of time (e.g., a timeout), the tombstones are deleted. A slow sync algorithm executes periodically to ensure that objects that were not deleted via replicated tombstones are eventually deleted. An époque algorithm provides that members that have been offline for a long period of time will update their objects before they participate in a join synchronization.
摘要翻译：用于在副本集合的成员之间同步对象的方法和系统。复制集成员上的对象可以通过利用版本向量的连接算法快速同步。当一个对象被删除时，该对象被刻录（即标记为“死”）。在复制集的连接成员之间也复制墓碑。经过一段时间（例如，超时），墓碑被删除。一个慢同步算法周期性地执行，以确保没有被复制的墓碑删除的对象最终被删除。 époque算法规定，长时间脱机的成员在参与连接同步之前会更新其对象。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式