会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • INTER-PROXIMITY COMMUNICATION WITHIN A RENDEZVOUS FEDERATION
    • 在联合联合会内的互相通信
    • US20060282547A1
    • 2006-12-14
    • US11428133
    • 2006-06-30
    • Richard HashaLu XunGopala Kakivaya
    • Richard HashaLu XunGopala Kakivaya
    • G06F15/16
    • H04L45/02H04L12/4637
    • The present invention extends to methods, systems, and computer program products for facilitating inter-proximity communication within a rendezvous federation. Nodes maintain collateral ring set entry tables that include collateral rings and corresponding entry nodes into the collateral rings. Nodes can exchange collateral ring set entry state to update one another on the configuration of rings within a tree of rings. Nodes can refer to collateral ring set entry tables, as well as to other nodes, to identify entry nodes into rings that are collateral rings of the node. Messages can be sent to entry nodes in collateral rings. A message can include an indication that an entry node in a target proximity ring is to resolve the message to the node in the target proximity ring which has a node ID closest to an indicated destination node.
    • 本发明扩展到方法,系统和计算机程序产品,以促进会合联盟内的邻近间通信。 节点维护包括侧环和相应入口节点的附属环集入条目表。 节点可以交换附加环集入条件状态,以便在环树中的环配置上相互更新。 节点可以将附属环集入口表以及其他节点称为将节点标识为环节,该节点是该节点的侧环。 消息可以发送到边缘环的入口节点。 消息可以包括目标邻近环中的入口节点将消息发送到具有最接近所指示的目的地节点的节点ID的目标邻近环中的节点的指示。
    • 5. 发明申请
    • BROADCASTING COMMUNICATION WITHIN A RENDEZVOUS FEDERATION
    • 在联邦联邦广播通信
    • US20070002774A1
    • 2007-01-04
    • US11465316
    • 2006-08-17
    • Richard HashaLu XunGopala Kakivaya
    • Richard HashaLu XunGopala Kakivaya
    • H04L12/28
    • H04L45/122H04L12/1854H04L12/42H04L45/04H04L67/2814
    • The present invention extends to methods, systems, and computer program products for broadcasting communication within a rendezvous federation. Embodiments of the invention include inter-ring and intra-ring communication. Inter-ring communication includes sending a message to destination rings included in a node's Collateral Ring Set entry table. When a node identifies a destination ring that has not yet received a message, the node can send a ring notification message. The ring notification message propagates towards a publishing node until a responsible node in the message path to the publishing node is identified. The responsible node updates its entry table to include the ring and forwards the message to the destination ring. Intra-ring communication can include recursively partitioning ranges of nodes within a ring and forwarding the message to nodes included the partitioned ranges.
    • 本发明扩展到用于在会合联盟内广播通信的方法,系统和计算机程序产品。 本发明的实施例包括环形和环内通信。 环网间通信包括将消息发送到包含在节点的Collat​​eral Ring Set条目表中的目的地环。 当节点识别尚未接收到消息的目的地环时,节点可以发送振铃通知消息。 环通知消息向发布节点传播,直到发布节点的消息路径中的负责节点被识别为止。 负责节点更新其入口表以包括环,并将消息转发到目标环。 环内通信可以包括循环内的节点的递归分区范围,并将消息转发到包括分区范围的节点。
    • 6. 发明授权
    • Subfederation creation and maintenance in a federation infrastructure
    • 联合基础设施中的子建立和维护
    • US08392515B2
    • 2013-03-05
    • US12491841
    • 2009-06-25
    • Gopala Krishna R. KakivayaLu XunRichard L. Hasha
    • Gopala Krishna R. KakivayaLu XunRichard L. Hasha
    • G06F15/16
    • H04L12/42H04L29/12066H04L29/12113H04L61/1511H04L61/1541H04L67/104H04L67/1046H04L67/1065
    • A computational system determines that a joining node in the federation infrastructure desires to join an identified subfederation within the federation infrastructure. The system accesses the joining node's group table, where the group table includes membership information identifying subfederations within the federation infrastructure. Each node in the federation maintains neighborhood information for each subfederation of which the node is aware. The system determines that no entry for the identified subfederation exists in the joining node's group table and, based on the determination, routes a group join message to a rendezvous point within the federation infrastructure. The rendezvous point checks its group table for an entry corresponding to the identified subfederation. The system also receives an indication from the rendezvous point indicating that the rendezvous point's group table does not include a corresponding entry for the identified subfederation and that the joining node is the first member of the identified subfederation.
    • 计算系统确定联盟基础设施中的加入节点需要加入联合基础设施内的已标识的亚基。 系统访问加入节点的组表,其中组表包括标识联盟基础架构内子联盟的成员资格信息。 联盟中的每个节点维护节点知道的每个子文档的邻域信息。 系统确定在加入节点的组表中不存在所识别的子交换的条目,并且基于该确定,将组加入消息路由到联合基础设施内的会合点。 会合点检查其组表,以查找与所识别的亚基相对应的条目。 系统还从会合点接收指示会合点的组表不包括用于所识别的子交换的相应条目,并且加入节点是所识别的子交换的第一个成员的指示。
    • 8. 发明申请
    • STORING STATE OF DISTRIBUTED ARCHITECTURE IN EXTERNAL STORE
    • 分布式建筑在外部存储中的存储状态
    • US20110231450A1
    • 2011-09-22
    • US12724422
    • 2010-03-16
    • Rishi Rakesh SinhaLu Xun
    • Rishi Rakesh SinhaLu Xun
    • G06F17/30
    • G06F17/30566
    • Architecture that applies to a collection of nodes (e.g., a federation) and manages membership of the nodes to the collection via an external datastore. The storage of node state and collection state is stored in the external and highly available datastore. New nodes can now join the collection through the external store. The machines (nodes) in the collection create a lease with the external store that allows the external store to maintain precise knowledge of the set of machines alive in the collection. The external store thus allows the new machines to join the collection while ensuring that there exists only one ring in the collection. In other words, the disclosed architecture protocol ensures that any given point of time there is just one ring for the collection. Moreover, this can be in addition to a current join protocol, which ensures that consistent routing is available.
    • 适用于节点集合(例如,联合)并通过外部数据存储管理节点的集合的架构。 节点状态和收集状态的存储存储在外部和高可用性的数据存储中。 新节点现在可以通过外部存储来加入集合。 集合中的机器(节点)与外部存储创建租约,允许外部存储器保持集合中存在的一组机器的精确知识。 因此,外部存储允许新机器加入集合,同时确保集合中只有一个环。 换句话说,所公开的架构协议确保了任何给定的时间点只有一个环用于集合。 此外,这可以是当前的连接协议之外,这确保了一致的路由可用。