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

1. 发明授权

US09002939B2 Adaptive and dynamic replication management in cloud computing 有权
标题翻译：云计算中的自适应和动态复制管理
公开(公告)号：US09002939B2
公开(公告)日：2015-04-07
申请号：US13487203
申请日：2012-06-03
申请人： Guy Laden , Roie Melamed
发明人： Guy Laden , Roie Melamed
IPC分类号： G06F15/16 , H04L29/08
CPC分类号： H04L67/1095
摘要： A system for communicating information among a plurality of nodes of a network. The system comprises a plurality of disseminating modules installed in a plurality of nodes of a network which hosts a plurality of replicas of data having a plurality of objects, each the disseminating module has access to a dataset defining a plurality of write request dissemination topologies. Each disseminating module is defined to receive a write request from a client, to select dynamically one of the write request dissemination topologies according to at least one parameter of the client, and to disseminate the write request according to the selected write request dissemination topology.
摘要翻译：一种用于在网络的多个节点之间传送信息的系统。该系统包括安装在网络的多个节点中的多个传播模块，其托管具有多个对象的多个数据副本，每个传播模块可以访问定义多个写请求传播拓扑的数据集。每个传播模块被定义为接收来自客户端的写请求，根据客户端的至少一个参数动态地选择一个写请求传播拓扑，并根据所选择的写请求传播拓扑传播写请求。

2. 发明申请

US20120036187A1 DECENTRALIZED DATA CASTING IN AN ITEREST AWARE PEER NETWORK 失效
标题翻译：在真实的对等网络中进行分布式数据分析
公开(公告)号：US20120036187A1
公开(公告)日：2012-02-09
申请号：US12849872
申请日：2010-08-04
申请人： Eli Luboshitz , Roie Melamed , Yoav Tock
发明人： Eli Luboshitz , Roie Melamed , Yoav Tock
IPC分类号： G06F15/16
CPC分类号： H04L67/104 , H04L67/22 , H04L67/30
摘要： Systems and methods for data casting in an interest aware peer network are provided. The method comprises determining whether a set of interests associated with a node in a network is updated, wherein the set of interests comprises one or more topics IDs, wherein each topic ID corresponds to a topic of interest associated with said node; distributing the set of interests associated with the node to one or more neighboring nodes by way of a first distribution scheme until N nodes in the network are aware of the updated set of interests for the node; providing each node in the network with a mechanism to determine value of a topic of interest in a set of interests received in association with a node based on a topic ID included in the set of interests for the node.
摘要翻译：提供了一种感兴趣的对等网络中用于数据转换的系统和方法。该方法包括确定是否更新与网络中的节点相关联的一组兴趣，其中所述兴趣集合包括一个或多个主题ID，其中每个主题ID对应于与所述节点相关联的兴趣话题; 通过第一分配方案将与节点相关联的兴趣集合分发到一个或多个相邻节点，直到网络中的N个节点知道该节点的更新的兴趣集合; 为网络中的每个节点提供一种机制，用于基于包括在该节点的兴趣集中的主题ID来确定与节点相关联接收的一组兴趣中的感兴趣主题的值。

3. 发明申请

US20100257282A1 Optimized Multicasting Using an Interest-Aware Membership Service 失效
标题翻译：使用感兴趣的会员服务优化组播
公开(公告)号：US20100257282A1
公开(公告)日：2010-10-07
申请号：US12419316
申请日：2009-04-07
申请人： Roie Melamed , Yoav Tock
发明人： Roie Melamed , Yoav Tock
IPC分类号： G06F15/173
CPC分类号： H04L12/6418
摘要： A communications network with a structured overlay in which client nodes are interlinked to define a ring uses an interest-aware membership service to identify which client nodes are subscribed to a topic. One of the client nodes in a segment of the ring is designated to be a content-provider node, and a message concerning the topic is communicated to the node. The segment is divided into subsegments. At least one subsegment is redefined by using the interest-aware membership service to assign an outermost subscribing client node to serve as the respective terminal node of the subsegment. The message is broadcast from the content-provider node to the terminal node of the redefined subsegment. The steps of designating, communicating, dividing, redefining and broadcasting are recursively performed, using the subsegment as the segment.
摘要翻译：具有结构化覆盖的通信网络，其中客户端节点互连以定义环使用兴趣感知成员服务来识别哪些客户端节点被订阅到主题。环的一段中的一个客户端节点被指定为内容提供者节点，并且关于该主题的消息被传送到该节点。该段被划分为子段。通过使用感兴趣的成员服务来重新定义至少一个子段，以将最外面的订阅客户端节点分配为用作子段的相应终端节点。消息从内容提供商节点广播到重新定义的子段的终端节点。使用子段作为段，递归地执行指定，通信，划分，重新定义和广播的步骤。

4. 发明申请

US20080317028A1 MULTICASTING IN A COMMUNICATION NETWORK 审中-公开
标题翻译：在通信网络中进行多播
公开(公告)号：US20080317028A1
公开(公告)日：2008-12-25
申请号：US11764809
申请日：2007-06-19
申请人： Gregory Chockler , Roie Melamed , Yoav Tock , Roman Vitenberg
发明人： Gregory Chockler , Roie Melamed , Yoav Tock , Roman Vitenberg
IPC分类号： H04L12/56 , H04J3/26
CPC分类号： H04L67/34 , H04L12/1886 , H04L45/16 , H04L67/327
摘要： Systems and methods for managing connections among nodes in a communication network are provided. The method comprises determining one or more topics of interest for a first node in the network, selecting a second node in the network that shares at least a first topic of interest with the first node, establishing a connection between the first node and the second node so that the second node covers at least the first topic of interest, and establishing additional connections between the first node and at least a third node in the network that covers at least the first topic of interest, in response to determining that the first node is not covered by a total of K nodes with respect to the first topic of interest. Preferably, the communication network is a publish/subscribe network.
摘要翻译：提供了用于管理通信网络中的节点之间的连接的系统和方法。该方法包括确定网络中的第一节点的感兴趣的一个或多个主题，选择网络中与第一节点共享至少第一主题的第二节点，建立第一节点和第二节点之间的连接使得所述第二节点至少覆盖所述第一主题，并且响应于确定所述第一节点是第一节点而在所述第一节点和所述网络中的至少第三节点之间建立至少覆盖所述第一主题的附加连接相对于感兴趣的第一个主题，不包括总共K个节点。优选地，通信网络是发布/订阅网络。

5. 发明申请

US20130325950A1 ADAPTIVE AND DYNAMIC REPLICATION MANAGEMENT IN CLOUD COMPUTING 有权
标题翻译：云计算中的自适应和动态复制管理
公开(公告)号：US20130325950A1
公开(公告)日：2013-12-05
申请号：US13487203
申请日：2012-06-03
申请人： Guy Laden , Roie Melamed
发明人： Guy Laden , Roie Melamed
IPC分类号： G06F15/16
CPC分类号： H04L67/1095
摘要： A system for communicating information among a plurality of nodes of a network. The system comprises a plurality of disseminating modules installed in a plurality of nodes of a network which hosts a plurality of replicas of data having a plurality of objects, each the disseminating module has access to a dataset defining a plurality of write request dissemination topologies. Each disseminating module is defined to receive a write request from a client, to select dynamically one of the write request dissemination topologies according to at least one parameter of the client, and to disseminate the write request according to the selected write request dissemination topology.
摘要翻译：一种用于在网络的多个节点之间传送信息的系统。该系统包括安装在网络的多个节点中的多个传播模块，其托管具有多个对象的多个数据副本，每个传播模块可以访问定义多个写请求传播拓扑的数据集。每个传播模块被定义为接收来自客户端的写请求，根据客户端的至少一个参数动态地选择一个写请求传播拓扑，并根据所选择的写请求传播拓扑传播写请求。

6. 发明授权

US08082331B2 Optimized multicasting using an interest-aware membership service 失效
标题翻译：使用感兴趣的会员服务优化多播
公开(公告)号：US08082331B2
公开(公告)日：2011-12-20
申请号：US12419316
申请日：2009-04-07
申请人： Roie Melamed , Yoav Tock
发明人： Roie Melamed , Yoav Tock
IPC分类号： G06F15/16
CPC分类号： H04L12/6418
摘要： A communications network with a structured overlay in which client nodes are interlinked to define a ring uses an interest-aware membership service to identify which client nodes are subscribed to a topic. One of the client nodes in a segment of the ring is designated to be a content-provider node, and a message concerning the topic is communicated to the node. The segment is divided into subsegments. At least one subsegment is redefined by using the interest-aware membership service to assign an outermost subscribing client node to serve as the respective terminal node of the subsegment. The message is broadcast from the content-provider node to the terminal node of the redefined subsegment. The steps of designating, communicating, dividing, redefining and broadcasting are recursively performed, using the subsegment as the segment.
摘要翻译：具有结构化覆盖的通信网络，其中客户端节点互连以定义环使用兴趣感知成员服务来识别哪些客户端节点被订阅到主题。环的一段中的一个客户端节点被指定为内容提供者节点，并且关于该主题的消息被传送到该节点。该段被划分为子段。通过使用感兴趣的成员服务来重新定义至少一个子段，以将最外面的订阅客户端节点分配为用作子段的相应终端节点。消息从内容提供商节点广播到重新定义的子段的终端节点。使用子段作为段，递归地执行指定，通信，划分，重新定义和广播的步骤。

7. 发明申请

US20090213754A1 Device, System, and Method of Group Communication 审中-公开
标题翻译：设备，系统和组通信方法
公开(公告)号：US20090213754A1
公开(公告)日：2009-08-27
申请号：US12037098
申请日：2008-02-26
申请人： Roie Melamed
发明人： Roie Melamed
IPC分类号： H04L12/28
CPC分类号： H04L67/104 , G06F9/546 , H04L45/00 , H04L45/16 , H04L45/64 , H04L67/1065
摘要： Device, system and method of group communication. For example, a computing apparatus capable of performing group communication may include a group communication service to communicate as a member of a group-communication-system including a plurality of members linked according to a distributed-hash-table overlay network topology, wherein the group communication service is to link to a set of one or more of the plurality of members according to the distributed-hash-table overlay network topology, and to route to a selected member of the set a group-communication-service message, intended for a destination member of the plurality of members. Other embodiments are described and claimed.
摘要翻译：设备，系统和组通信方法。例如，能够进行群组通信的计算装置可以包括作为群组通信系统的成员进行通信的组通信服务，所述组通信系统包括根据分布式散列表覆盖网络拓扑链接的多个成员，其中，所述群组通信服务是根据分布式散列表覆盖网络拓扑链接到多个成员中的一个或多个成员的集合，并且路由到组中的所选成员，该组通信服务消息旨在用于多个成员的目的地成员。描述和要求保护其他实施例。

8. 发明申请

US20100027442A1 CONSTRUCTING SCALABLE OVERLAYS FOR PUB-SUB WITH MANY TOPICS: THE GREEDY JOIN-LEAVE ALGORITHM 审中-公开
标题翻译：构建具有多个主题的PUB-SUB的可扩展覆盖：GREEDY JOIN-LEAVE ALGORITHM
公开(公告)号：US20100027442A1
公开(公告)日：2010-02-04
申请号：US12183319
申请日：2008-07-31
申请人： Gregory Chockler , Roie Melamed , Yoav Tock , Roman Vitenberg
发明人： Gregory Chockler , Roie Melamed , Yoav Tock , Roman Vitenberg
IPC分类号： H04L12/28
CPC分类号： H04L67/104 , H04L67/1044 , H04L67/1051
摘要： A method and system for constructing a single topic-connected overlay network are disclosed. A link contribution array, which stores sets of edges in an order according contribution values, is provided. A highest contribution index indicates a highest element in the link contribution array. The method includes performing, at every iteration, a Greedy Merge (GM) algorithm for selecting an edge from the highest element in the link contribution array, removing the selected edge from the link contribution array, and adding the selected edge to a set of overlay edges. After the selected edge is added to the set of overlay edges, contribution values of other edges are updated. The GM algorithm terminates when all elements in the link contribution array become empty. As an output, the GM algorithm generates a single topic-connected overlay network for all topics. A Greedy Join (GJ) and Greedy Leave (GL) functions are also disclosed.
摘要翻译：公开了一种用于构建单个主题连接的覆盖网络的方法和系统。提供了一种链接贡献阵列，其按照贡献值按顺序存储边缘集合。最高贡献指数表示链接贡献数组中的最高元素。该方法包括在每次迭代中执行用于从链路贡献阵列中的最高元素中选择边缘的贪婪合并（GM）算法，从链路贡献阵列中移除所选择的边缘，以及将所选边缘添加到一组覆盖边缘。在将所选边缘添加到叠加边缘集合之后，更新其他边缘的贡献值。当链接贡献数组中的所有元素变为空时，GM算法终止。作为输出，GM算法为所有主题生成单个主题连接的覆盖网络。还公开了贪婪加盟（GJ）和贪婪遗漏（GL）功能。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式