公开(公告)号：US08165041B2

公开(公告)日：2012-04-24

申请号：US12335066

申请日：2008-12-15

申请人： Jim Jianping Wang ,  Robert A. Lomme, Jr. ,  Ransom L. Richardson ,  Thomas D. Sanfilippo

发明人： Jim Jianping Wang ,  Robert A. Lomme, Jr. ,  Ransom L. Richardson ,  Thomas D. Sanfilippo

IPC分类号： H04L12/28 ,  H04L12/56

CPC分类号： H04L67/104 ,  H04L67/1002 ,  H04L67/1034 ,  H04L67/1072

摘要： A collaboration system using peer-to-multi-peer distribution of messages representing changes to a shared workspace. Each peer determines a distribution mechanism for messages to each of the target peers sharing the workspace. The selected distribution mechanism may depend on capabilities of a home relay associated with a peer initiating a message. Further, messages to subsets of the target peers sharing the workspace may be distributed using a session for each subset on which each message is sent only one time. The subset of target peers associated with some of the sessions may be selected so that target peers for which communication attempts have failed are grouped in the same session. In some scenarios, the initiating peer may provide multiple routing paths for target peers in a session and the home relay server may appropriately forward the message to the target peers, using one of the routing paths.

摘要翻译： 使用对等分配分发表示对共享工作空间进行更改的消息的协作系统。 每个对等体为共享工作空间的每个目标对等体确定消息的分发机制。 选择的分发机制可以取决于与发起消息的对等体相关联的家庭中继的能力。 此外，可以使用对于每个仅在一次发送每个消息的每个子集的会话来分发与共享工作空间的目标对等体的子集的消息。 可以选择与一些会话相关联的目标对等体的子集，使得通信尝试失败的目标对等体被分组在相同的会话中。 在一些情况下，发起对等体可以为会话中的目标对等体提供多个路由路径，并且归属中继服务器可以使用路由路径之一来适当地将消息转发到目标对等体。

公开(公告)号：US06941510B1

公开(公告)日：2005-09-06

申请号：US09588195

申请日：2000-06-06

申请人： Raymond E. Ozzie ,  Kenneth G. Moore ,  Ransom L. Richardson ,  Edward J. Fischer

发明人： Raymond E. Ozzie ,  Kenneth G. Moore ,  Ransom L. Richardson ,  Edward J. Fischer

IPC分类号： G06F12/00 ,  G06F17/22 ,  G06F17/27 ,  G06F17/30 ,  G06F15/00

CPC分类号： G06F17/30896 ,  G06F17/2205 ,  G06F17/2247 ,  G06F17/272

摘要： An in-memory storage manager represents XML-compliant documents as a collection of objects in memory. The storage manager allows real-time access to the objects by separate processes operating in different contexts. The data in the objects is stored in memory local to each process and the local memories are synchronized by means of a distributed memory system that stores the data in the same data region, but maps the data region to the address space of each process. Data corruption in the data region is prevented by a locking mechanism that prevents the processes from simultaneously modifying same data.

摘要翻译： 内存存储管理器将符合XML的文档表示为内存中对象的集合。 存储管理器允许通过在不同上下文中操作的单独进程实时访问对象。 对象中的数据存储在每个进程本地的存储器中，并且本地存储器通过将数据存储在相同数据区域中的分布式存储器系统来同步，但是将数据区域映射到每个进程的地址空间。 通过锁定机制防止数据区域中的数据损坏，从而阻止进程同时修改相同的数据。

公开(公告)号：US08073905B2

公开(公告)日：2011-12-06

申请号：US11821495

申请日：2007-06-22

申请人： Jack E. Ozzie ,  Raymond E. Ozzie ,  Ransom L. Richardson

发明人： Jack E. Ozzie ,  Raymond E. Ozzie ,  Ransom L. Richardson

IPC分类号： G06F15/16

CPC分类号： H04L63/0428 ,  H04L63/123 ,  Y10S707/99938

摘要： In a peer-to-peer collaboration system, deltas containing data change commands are organized in a persistent data structure called a delta log. The delta log is organized into blocks, which are the largest division in the delta log. In turn, blocks contain groups, groups contain chains and chains contain deltas. Delta blocks are used to implement priority deltas that are used to limit the collection of data change commands that must be transferred. Within a block the deltas are organized by groups, each of which is a set of deltas organized into chains. The delta group in used to determine which deltas to purge. The chains are ordered by increasing creator ID of the endpoint that created the chain. Organizing the delta log in this fashion allows the log to be “walked” to detect convergence problems. To achieve causality-preservation, each delta has a list of dependencies representing other deltas that must be executed before the current delta can be executed. The dynamics manager uses the ability to do (execute) and undo commands to perform roll back and roll forward operations on deltas in order to achieve convergence.

摘要翻译： 在对等协作系统中，包含数据更改命令的增量组织在称为增量日志的持久数据结构中。 增量日志被组织成块，它们是三角洲日志中最大的部分。 反过来，块包含组，组包含链和链包含三角形。 增量块用于实现优先级增量，用于限制必须传送的数据更改命令的收集。 在一个街区内，三角洲由团体组织，每个组是一组组织成链子的三角洲。 三角洲组用于确定要清除的三角洲。 链通过增加创建链的端点的创建者ID进行排序。 以这种方式组织增量日志允许日志“走”来检测收敛问题。 为了实现因果保存，每个增量都有一个表示其他三角形的依赖关系列表，必须在执行当前增量之前执行。 动态管理器使用能够执行（执行）和撤销命令来对三角形执行回滚和前滚操作，以实现收敛。

公开(公告)号：US20100150157A1

公开(公告)日：2010-06-17

申请号：US12335066

申请日：2008-12-15

申请人： Jim Jianping Wang ,  Robert A. Lomme, JR. ,  Ransom L. Richardson ,  Thomas D. Sanfilippo

发明人： Jim Jianping Wang ,  Robert A. Lomme, JR. ,  Ransom L. Richardson ,  Thomas D. Sanfilippo

IPC分类号： H04L12/28

CPC分类号： H04L67/104 ,  H04L67/1002 ,  H04L67/1034 ,  H04L67/1072

摘要： A collaboration system using peer-to-multi-peer distribution of messages representing changes to a shared workspace. Each peer determines a distribution mechanism for messages to each of the target peers sharing the workspace. The selected distribution mechanism may depend on capabilities of a home relay associated with a peer initiating a message. Further, messages to subsets of the target peers sharing the workspace may be distributed using a session for each subset on which each message is sent only one time. The subset of target peers associated with some of the sessions may be selected so that target peers for which communication attempts have failed are grouped in the same session. In some scenarios, the initiating peer may provide multiple routing paths for target peers in a session and the home relay server may appropriately forward the message to the target peers, using one of the routing paths.

摘要翻译： 使用对等分配分发表示对共享工作空间进行更改的消息的协作系统。 每个对等体为共享工作空间的每个目标对等体确定消息的分发机制。 选择的分发机制可以取决于与发起消息的对等体相关联的家庭中继的能力。 此外，可以使用对于每个仅在一次发送每个消息的每个子集的会话来分发与共享工作空间的目标对等体的子集的消息。 可以选择与一些会话相关联的目标对等体的子集，使得通信尝试失败的目标对等体被分组在相同的会话中。 在一些情况下，发起对等体可以为会话中的目标对等体提供多个路由路径，并且归属中继服务器可以使用路由路径之一来适当地将消息转发到目标对等体。

公开(公告)号：US07340502B2

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

申请号：US10279785

申请日：2002-10-24

申请人： Ransom L. Richardson ,  Raymond E. Ozzie ,  Jack E. Ozzie

发明人： Ransom L. Richardson ,  Raymond E. Ozzie ,  Jack E. Ozzie

IPC分类号： G06F15/16

CPC分类号： H04L63/0428 ,  H04L63/123 ,  Y10S707/99938

摘要： In a peer-to-peer collaboration system, deltas containing data change commands are organized in a persistent data structure called a delta log. The delta log is organized into blocks, which are the largest division in the delta log. In turn, blocks contain groups, groups contain chains and chains contain deltas. Delta blocks are used to implement priority deltas that are used to limit the collection of data change commands that must be transferred. Within a block the deltas are organized by groups, each of which is a set of deltas organized into chains. The delta group in used to determine which deltas to purge. The chains are ordered by increasing creator ID of the endpoint that created the chain. Organizing the delta log in this fashion allows the log to be “walked” to detect convergence problems. To achieve causality-preservation, each delta has a list of dependencies representing other deltas that must be executed before the current delta can be executed. The dynamics manager uses the ability to do (execute) and undo commands to perform roll back and roll forward operations on deltas in order to achieve convergence.

摘要翻译： 在对等协作系统中，包含数据更改命令的增量组织在称为增量日志的持久数据结构中。 增量日志被组织成块，它们是三角洲日志中最大的部分。 反过来，块包含组，组包含链和链包含三角形。 增量块用于实现优先级增量，用于限制必须传送的数据更改命令的收集。 在一个街区内，三角洲由团体组织，每个组是一组组织成链子的三角洲。 三角洲组用于确定要清除的三角洲。 链通过增加创建链的端点的创建者ID进行排序。 以这种方式组织增量日志允许日志“走”来检测收敛问题。 为了实现因果保存，每个增量都有一个表示其他三角形的依赖关系列表，必须在执行当前增量之前执行。 动态管理器使用能够执行（执行）和撤销命令来对三角形执行回滚和前滚操作，以实现收敛。