公开(公告)号：US07418454B2

公开(公告)日：2008-08-26

申请号：US10826674

申请日：2004-04-16

申请人： Yu Chen ,  Zheng Zhang ,  Xing Xie ,  Shiding Lin

发明人： Yu Chen ,  Zheng Zhang ,  Xing Xie ,  Shiding Lin

IPC分类号： G06F17/30 ,  G06F7/00

CPC分类号： H04L67/2804 ,  H04L67/2819 ,  H04L67/327 ,  Y10S707/99942 ,  Y10S707/99943

摘要： A data overlay is built as a data structure on a logical space defined by a distributed hash table (DHT) in a peer-to-peer network. The data overlay includes a tree having tree nodes that each have a zone mapped to a corresponding DHT node in the logical space of the DHT. The logical space of the DHT is mapped to machines, each of which corresponds to one or more of more of the tree node zones. The tree nodes are hierarchically situated by tree node zone size and my available resource so that tasks are performed by machines in the peer-to-peer network according to the respective abilities of the machines to supply the tasks' demand. The tree, which self-organizes and self-heals on the same scale as the underlying DHT, is used together and disseminate information from and to the DHT nodes using the hierarchy of the tree nodes.

摘要翻译： 在由对等网络中的分布式哈希表（DHT）定义的逻辑空间上构建数据覆盖层作为数据结构。 数据覆盖包括具有树节点的树，每个树节点具有映射到DHT的逻辑空间中的相应DHT节点的区域。 DHT的逻辑空间被映射到机器，每个机器对应于一个或多个更多的树节点区域。 树节点由树节点区域大小和可用资源分层位置，使得任务由对等网络中的机器根据机器提供任务需求的相应能力执行。 与DHT相同的规模自我组织和自我修复的树被一起使用，并使用树节点的层次结构向DHT节点传播信息。

公开(公告)号：US20050243740A1

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

申请号：US10826674

申请日：2004-04-16

申请人： Yu Chen ,  Zheng Zhang ,  Xing Xie ,  Shiding Lin

发明人： Yu Chen ,  Zheng Zhang ,  Xing Xie ,  Shiding Lin

IPC分类号： G06F17/30 ,  G06F12/00 ,  G06F13/00 ,  H04L29/08 ,  H04L1/00

CPC分类号： H04L67/2804 ,  H04L67/2819 ,  H04L67/327 ,  Y10S707/99942 ,  Y10S707/99943

摘要： A data overlay is built as a data structure on a logical space defined by a distributed hash table (DHT) in a peer-to-peer network. The data overlay includes a tree having tree nodes that each have a zone mapped to a corresponding DHT node in the logical space of the DHT. The logical space of the DHT is mapped to machines, each of which corresponds to one or more of more of the tree node zones. The tree nodes are hierarchically situated by tree node zone size and my available resource so that tasks are performed by machines in the peer-to-peer network according to the respective abilities of the machines to supply the tasks' demand. The tree, which self-organizes and self-heals on the same scale as the underlying DHT, is used together and disseminate information from and to the DHT nodes using the hierarchy of the tree nodes.

摘要翻译： 在由对等网络中的分布式哈希表（DHT）定义的逻辑空间上构建数据覆盖层作为数据结构。 数据覆盖包括具有树节点的树，每个树节点具有映射到DHT的逻辑空间中的相应DHT节点的区域。 DHT的逻辑空间被映射到机器，每个机器对应于一个或多个更多的树节点区域。 树节点由树节点区域大小和可用资源分层位置，使得任务由对等网络中的机器根据机器提供任务需求的相应能力执行。 与DHT相同的规模自我组织和自我修复的树被一起使用，并使用树节点的层次结构向DHT节点传播信息。

公开(公告)号：US07536426B2

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

申请号：US11193797

申请日：2005-07-29

申请人： Wei Chen ,  Chao Jin ,  Dan Teodosiu ,  Qiao Lian ,  Shiding Lin ,  Yu Chen ,  Zheng Zhang

发明人： Wei Chen ,  Chao Jin ,  Dan Teodosiu ,  Qiao Lian ,  Shiding Lin ,  Yu Chen ,  Zheng Zhang

IPC分类号： G06F12/00 ,  G06F17/30 ,  G06F17/00

CPC分类号： G06F11/1662 ,  Y10S707/99952 ,  Y10S707/99953 ,  Y10S707/99955

摘要： Described is the differentiation of replicas in a large distributed object store as either being smoothing replicas based on an amount of load on storage nodes (bricks), or as spreading replicas based on a substantially random distribution among the system's bricks. The smoothing replicas are placed among the lowest usage bricks, while the spreading replicas are placed randomly throughout other bricks in the system independent of load. As a result, fast, primarily parallel data repair is facilitated by selecting a spreading replica when repair is needed, while load balancing is facilitated by placing a smoothing replica on a low-usage brick when a new replica is checked in, and selecting a smoothing replica when load balancing is triggered by overloading of a brick and/or addition of a new brick. Check-in, data repair and load balancing policies specify how to use smoothing replicas and spreading replicas.

摘要翻译： 描述了大型分布式对象存储区中的副本的区别，无论是基于存储节点（砖块）上的负载量来平滑副本，还是基于系统砖块之间的基本随机分布的扩展副本。 平滑复制品被放置在最低使用砖之间，而扩展复制品随机地放置在系统中与负载无关的其他砖块中。 因此，通过在需要修复时选择扩展副本来促进快速，主要并行的数据修复，同时通过在检查新的副本时将平滑副本放置在低使用率的砖上来帮助实现负载平衡，并且选择平滑 当负载平衡由砖的重载和/或添加新砖触发时的副本。 登录，数据修复和负载均衡策略规定了如何使用平滑副本和扩展副本。

公开(公告)号：US20100325476A1

公开(公告)日：2010-12-23

申请号：US12855271

申请日：2010-08-12

申请人： Zheng Zhang ,  Wei Chen ,  Yu Chen ,  Chao Jin ,  Dan Teodosiu ,  Qiao Lian ,  Shiding Lin

发明人： Zheng Zhang ,  Wei Chen ,  Yu Chen ,  Chao Jin ,  Dan Teodosiu ,  Qiao Lian ,  Shiding Lin

IPC分类号： G06F11/20

CPC分类号： H04L67/1097 ,  G06F11/1662 ,  G06F17/30575 ,  H04L69/40

摘要： An improved system and method for flexible object placement and soft-state indexing of objects in a distributed object store is provided. A distributed object store may be provided by a large number of system nodes operably coupled to a network. A system node provided may include an access module for communicating with a client, an index module for building an index of a replicated data object, a data module for storing a data object on a computer readable medium, and a membership and routing module for detecting the configuration of operable nodes in the distributed system. Upon failure of an index node, the failure may be detected at other nodes, including those nodes that store the replicas of the object. These nodes may then send new index rebuilding requests to a different node that may rebuild the index for servicing any access request to the object.

摘要翻译： 提供了一种用于灵活对象放置和分布式对象存储中对象的软状态索引的改进的系统和方法。 分布式对象存储可以由可操作地耦合到网络的大量系统节点提供。 提供的系统节点可以包括用于与客户端通信的访问模块，用于构建复制数据对象的索引的索引模块，用于在计算机可读介质上存储数据对象的数据模块，以及用于检测的成员和路由模块 分布式系统中可操作节点的配置。 在索引节点发生故障时，可能会在其他节点（包括存储对象副本的那些节点）中检测到故障。 然后，这些节点可以将新的索引重建请求发送到不同的节点，该节点可以重建用于服务对对象的任何访问请求的索引。

公开(公告)号：US07778984B2

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

申请号：US10993536

申请日：2004-11-19

申请人： Zheng Zhang ,  Wei Chen ,  Yu Chen ,  Chao Jin ,  Dan Teodosiu ,  Qiao Lian ,  Shiding Lin

发明人： Zheng Zhang ,  Wei Chen ,  Yu Chen ,  Chao Jin ,  Dan Teodosiu ,  Qiao Lian ,  Shiding Lin

IPC分类号： G06F7/00 ,  G06F17/00

CPC分类号： H04L67/1097 ,  G06F11/1662 ,  G06F17/30575 ,  H04L69/40

摘要： An improved system and method for flexible object placement and soft-state indexing of objects in a distributed object store is provided. A distributed object store may be provided by a large number of system nodes operably coupled to a network. A system node provided may include an access module for communicating with a client, an index module for building an index of a replicated data object, a data module for storing a data object on a computer readable medium, and a membership and routing module for detecting the configuration of operable nodes in the distributed system. Upon failure of an index node, the failure may be detected at other nodes, including those nodes that store the replicas of the object. These nodes may then send new index rebuilding requests to a different node that may rebuild the index for servicing any access request to the object.

摘要翻译： 提供了一种用于灵活对象放置和分布式对象存储中对象的软状态索引的改进的系统和方法。 分布式对象存储可以由可操作地耦合到网络的大量系统节点提供。 提供的系统节点可以包括用于与客户端通信的访问模块，用于构建复制数据对象的索引的索引模块，用于在计算机可读介质上存储数据对象的数据模块，以及用于检测的成员和路由模块 分布式系统中可操作节点的配置。 在索引节点发生故障时，可能会在其他节点（包括存储对象副本的那些节点）中检测到故障。 然后，这些节点可以将新的索引重建请求发送到不同的节点，该节点可以重建用于服务对对象的任何访问请求的索引。

公开(公告)号：US08010514B2

公开(公告)日：2011-08-30

申请号：US12855271

申请日：2010-08-12

申请人： Zheng Zhang ,  Wei Chen ,  Yu Chen ,  Chao Jin ,  Dan Teodosiu ,  Qiao Lian ,  Shiding Lin

发明人： Zheng Zhang ,  Wei Chen ,  Yu Chen ,  Chao Jin ,  Dan Teodosiu ,  Qiao Lian ,  Shiding Lin

IPC分类号： G06F7/00 ,  G06F17/00

CPC分类号： H04L67/1097 ,  G06F11/1662 ,  G06F17/30575 ,  H04L69/40

摘要： An improved system and method for flexible object placement and soft-state indexing of objects in a distributed object store is provided. A distributed object store may be provided by a large number of system nodes operably coupled to a network. A system node provided may include an access module for communicating with a client, an index module for building an index of a replicated data object, a data module for storing a data object on a computer readable medium, and a membership and routing module for detecting the configuration of operable nodes in the distributed system. Upon failure of an index node, the failure may be detected at other nodes, including those nodes that store the replicas of the object. These nodes may then send new index rebuilding requests to a different node that may rebuild the index for servicing any access request to the object.

摘要翻译： 提供了一种用于灵活对象放置和分布式对象存储中对象的软状态索引的改进的系统和方法。 分布式对象存储可以由可操作地耦合到网络的大量系统节点提供。 提供的系统节点可以包括用于与客户端通信的访问模块，用于构建复制数据对象的索引的索引模块，用于在计算机可读介质上存储数据对象的数据模块，以及用于检测的成员和路由模块 分布式系统中可操作节点的配置。 在索引节点发生故障时，可能会在其他节点（包括存储对象副本的那些节点）中检测到故障。 然后，这些节点可以将新的索引重建请求发送到不同的节点，该节点可以重建用于服务对对象的任何访问请求的索引。

公开(公告)号：US20070027916A1

公开(公告)日：2007-02-01

申请号：US11193797

申请日：2005-07-29

申请人： Wei Chen ,  Chao Jin ,  Dan Teodosiu ,  Qiao Lian ,  Shiding Lin ,  Yu Chen ,  Zheng Zhang

发明人： Wei Chen ,  Chao Jin ,  Dan Teodosiu ,  Qiao Lian ,  Shiding Lin ,  Yu Chen ,  Zheng Zhang

IPC分类号： G06F17/00

CPC分类号： G06F11/1662 ,  Y10S707/99952 ,  Y10S707/99953 ,  Y10S707/99955

摘要： Described is the differentiation of replicas in a large distributed object store as either being smoothing replicas based on an amount of load on storage nodes (bricks), or as spreading replicas based on a substantially random distribution among the system's bricks. The smoothing replicas are placed among the lowest usage bricks, while the spreading replicas are placed randomly throughout other bricks in the system independent of load. As a result, fast, primarily parallel data repair is facilitated by selecting a spreading replica when repair is needed, while load balancing is facilitated by placing a smoothing replica on a low-usage brick when a new replica is checked in, and selecting a smoothing replica when load balancing is triggered by overloading of a brick and/or addition of a new brick. Check-in, data repair and load balancing policies specify how to use smoothing replicas and spreading replicas.

摘要翻译： 描述了大型分布式对象存储区中的副本的区别，无论是基于存储节点（砖块）上的负载量来平滑副本，还是基于系统砖块之间的基本随机分布的扩展副本。 平滑复制品被放置在最低使用砖之间，而扩展复制品随机地放置在系统中与负载无关的其他砖块中。 因此，通过在需要修复时选择扩展副本来促进快速，主要并行的数据修复，同时通过在检查新的副本时将平滑副本放置在低使用率的砖上来帮助实现负载平衡，并且选择平滑 当负载平衡由砖的重载和/或添加新砖触发时的副本。 登录，数据修复和负载均衡策略规定了如何使用平滑副本和扩展副本。

公开(公告)号：US20060168154A1

公开(公告)日：2006-07-27

申请号：US10993536

申请日：2004-11-19

申请人： Zheng Zhang ,  Wei Chen ,  Yu Chen ,  Chao Jin ,  Dan Teodosiu ,  Qiao Lian ,  Shiding Lin

发明人： Zheng Zhang ,  Wei Chen ,  Yu Chen ,  Chao Jin ,  Dan Teodosiu ,  Qiao Lian ,  Shiding Lin

IPC分类号： G06F15/177

CPC分类号： H04L67/1097 ,  G06F11/1662 ,  G06F17/30575 ,  H04L69/40

摘要： An improved system and method for flexible object placement and soft-state indexing of objects in a distributed object store is provided. A distributed object store may be provided by a large number of system nodes operably coupled to a network. A system node provided may include an access module for communicating with a client, an index module for building an index of a replicated data object, a data module for storing a data object on a computer readable medium, and a membership and routing module for detecting the configuration of operable nodes in the distributed system. Upon failure of an index node, the failure may be detected at other nodes, including those nodes that store the replicas of the object. These nodes may then send new index rebuilding requests to a different node that may rebuild the index for servicing any access request to the object.

摘要翻译： 提供了一种用于灵活对象放置和分布式对象存储中对象的软状态索引的改进的系统和方法。 分布式对象存储可以由可操作地耦合到网络的大量系统节点提供。 提供的系统节点可以包括用于与客户端通信的访问模块，用于构建复制数据对象的索引的索引模块，用于在计算机可读介质上存储数据对象的数据模块，以及用于检测的成员和路由模块 分布式系统中可操作节点的配置。 在索引节点发生故障时，可能会在其他节点（包括存储对象副本的那些节点）中检测到故障。 然后，这些节点可以将新的索引重建请求发送到不同的节点，该节点可以重建用于服务对对象的任何访问请求的索引。

公开(公告)号：US07590519B2

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

申请号：US11269133

申请日：2005-11-08

申请人： Shiding Lin ,  Aimin Pan ,  Rui Guo ,  Zheng Zhang

发明人： Shiding Lin ,  Aimin Pan ,  Rui Guo ,  Zheng Zhang

IPC分类号： G06F9/455

CPC分类号： G06F17/5009

摘要： Distributed system simulation is enhanced by extending the simulation window. In a described implementation, the simulation window extension is facilitated with a slow message relaxation scheme. For example, especially when the simulation window is extended, slow unscheduled events can arrive at a logical process with a timestamp that is prior to (e.g., less than) the local time of a receiving logical process that is participating in a simulation. To ameliorate issues created by a slow unscheduled message and its corresponding slow unscheduled event, a current logical time of the receiving logical process is substituted for the original timestamp of the slow unscheduled event to transform it into a punctual unscheduled event.

摘要翻译： 通过扩展仿真窗口来增强分布式系统仿真。 在所描述的实现中，通过慢消息松弛方案来促进模拟窗口扩展。 例如，特别是当模拟窗口被扩展时，缓慢的非预定事件可以到达逻辑进程，该时间戳在参与模拟的接收逻辑进程的（例如，小于）本地时间之前。 为了改善缓慢的非计划消息及其相应的缓慢的非调度事件所产生的问题，接收逻辑进程的当前逻辑时间被替换为慢速非预定事件的原始时间戳，以将其转换成准时的非调度事件。

公开(公告)号：US20070130219A1

公开(公告)日：2007-06-07

申请号：US11269131

申请日：2005-11-08

申请人： Shiding Lin ,  Rui Guo ,  Zheng Zhang

发明人： Shiding Lin ,  Rui Guo ,  Zheng Zhang

IPC分类号： G06F17/30 ,  G06F12/00

CPC分类号： H04L41/00 ,  H04L41/145

摘要： The traversal of runtime spanning trees is facilitated in a distributed operational environment. Distributed traversal of runtime spanning trees may be implemented in different scenarios. However, by way of example only, distributed traversal of runtime spanning trees is described herein primarily in the context of a distributed system simulation scenario. Ensuring that each unscheduled event is processed within a simulation round (i.e., within a quantum barrier) in which it is created is especially challenging when executing an operation (e.g., performing a simulation) with a distributed apparatus. To address this challenge, unscheduled events are set to correspond to event nodes in a tree. Parent events that beget child events are assigned token values. The token value of a parent event is split and assigned to its child events such that a runtime spanning tree may be distributively traversed by summing the token values of leaf nodes of the spanning tree.

摘要翻译： 在分布式操作环境中促进运行时生成树的遍历。 运行时生成树的分布遍历可以在不同的情况下实现。 然而，仅作为示例，主要在分布式系统仿真场景的上下文中描述了运行时生成树的分布式遍历。 确保在使用分布式设备执行操作（例如，执行模拟）的模拟循环（即在量子势垒内）处理每个未调度的事件是特别有挑战性的。 为了解决这个挑战，将非计划事件设置为与树中的事件节点相对应。 设置子事件的父事件被分配令牌值。 父事件的令牌值被拆分并分配给其子事件，使得运行时生成树可以通过对生成树的叶节点的令牌值求和来分布遍历。