会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • METHOD AND SYSTEM FOR RESILIENT PACKET TRACEBACK IN WIRELESS MESH AND SENSOR NETWORKS
    • 用于无线网格和传感器网络中的恢复分组跟踪的方法和系统
    • WO2008119672A4
    • 2009-03-26
    • PCT/EP2008053325
    • 2008-03-19
    • IBMIBM UKLIU ZHENYANG HAOYE FAN
    • LIU ZHENYANG HAOYE FAN
    • H04L29/06H04L12/22
    • H04L63/1458H04L63/1466H04L2463/146H04W84/20
    • A system and method for packet traceback in a network includes maintaining an identity number (ID) for each node in a network and generating a signature (e.g., a message authentication code (MAC)) using a secret key shared between each node on a forwarding path and a sink. Each forwarding node leaves a mark by appending its ID and a signature in the packet, either in a deterministic manner or with a probability. Upon receiving a packet at the sink, correctness of the signatures included in each packet is verified in the reverse order by which these signatures were appended. A last valid MAC is determined in the forwarding path to determine the locations of compromised nodes that collude in false data injection attacks.
    • 用于网络中的分组追踪的系统和方法包括:维护网络中的每个节点的身份号码(ID),并使用在转发中的每个节点之间共享的秘密密钥来生成签名(例如,消息认证码(MAC)) 路径和水槽。 每个转发节点通过以确定性方式或以概率在分组中附加其ID和签名来留下标记。 在接收器处接收到数据包后,每个数据包中包含的签名的正确性按照附加这些签名的相反顺序进行验证。 在转发路径中确定最后一个有效MAC,以确定在虚假数据注入攻击中共谋的被破坏节点的位置。
    • 5. 发明申请
    • PRIVACY PRESERVING QUERY METHOD AND SYSTEM FOR USE IN FEDERATED COALITION NETWORKS
    • 隐私保护用于联合联合网络的查询方法和系统
    • WO2014182571A3
    • 2015-01-22
    • PCT/US2014036629
    • 2014-05-02
    • IBM
    • BERMAN THOMASCALO SERAPHINSU LUVYVYAN DAVIDYE FAN
    • H04L12/54H04L12/28H04L25/14
    • H04L45/24
    • In at least one embodiment, a method and a system include a node potentially having information responsive to an information request distributed into, for example, a federated coalition network where the node receives at least one information request packet, conducts a search of information at the node to determine if requested information is present, when the requested information is present, then the node sends an acknowledgement to a requesting node, linear network codes the requested information into m packets where m is greater than or equal to k, which is the number of packets needed to be received by the requesting node to reconstruct the requested information, selects multiple paths between the node and the requesting node such that no third party will see more than k -1 different packets, and transmits the m packets distributed over the selected paths.
    • 在至少一个实施例中,方法和系统包括潜在地具有响应于分发到例如节点接收至少一个信息请求分组的联盟联盟网络的信息请求的信息的节点在 节点,以确定所请求的信息是否存在,当所请求的信息存在时,节点向请求节点发送确认,线性网络将请求的信息编码为m个分组,其中m大于或等于k,其是数字 需要由请求节点接收以重构所请求的信息的分组,选择节点和请求节点之间的多个路径,使得没有第三方将看到超过k -1个不同的分组,并且发送分布在所选择的 路径。
    • 6. 发明申请
    • SYSTEM AND APPARATUS FOR OPTIMALLY TRADING OFF THE REPLICATION OVERHEAD AND CONSISTENCY LEVEL IN DISTRIBUTED APPLICATIONS
    • 系统和装置,以便在分布式应用中优化和一致性水平的交换
    • WO2008014062A2
    • 2008-01-31
    • PCT/US2007071403
    • 2007-06-15
    • IBMLIU ZHENYANG HOAYE FANXIA HONGUI
    • LIU ZHENYANG HOAYE FANXIA HONGUI
    • G06F17/30
    • G06F17/30578Y10S707/99932Y10S707/99953Y10S707/99955
    • Methods and systems are provided for optimally trading off replication overhead and consistency levels in distributed data replication where nodes are organized in a hierarchy. The root node has the original data that need to be replicated at all other nodes, and the replicated copies have a freshness threshold that must be satisfied. The data are propagated through periodic updates in the hierarchy. Each node periodically sends data to its child nodes. Given the freshness threshold, an algorithm and its distributed protocol can determine the optimal update period for each link of the hierarchy such that the freshness threshold is satisfied for every node and the overall replication overhead is minimized. The systems and methods can be used in any scenario where replicated data have consistency requirements, such as in a replicate overlay assisted resource discovery system.
    • 提供了方法和系统,用于最佳地折中分布式数据复制中的复制开销和一致性级别,其中节点被组织在层次结构中。 根节点具有需要在所有其他节点进行复制的原始数据,并且复制副本具有必须满足的新鲜度阈值。 数据通过层次结构中的定期更新进行传播。 每个节点周期性地向其子节点发送数据。 给定新鲜度阈值,算法及其分布式协议可以确定层次结构的每个链路的最佳更新周期,使得每个节点满足新鲜度阈值,并将整体复制开销最小化。 系统和方法可以在复制数据具有一致性要求的任何情况下使用,例如在复制覆盖辅助资源发现系统中。
    • 7. 发明申请
    • A METHOD AND SYSTEM FOR FEDERATED RESOURCE DISCOVERY SERVICE IN DISTRIBUTED SYSTEMS
    • 分布式系统中联合资源发现服务的方法与系统
    • WO2007149701A3
    • 2008-11-06
    • PCT/US2007070544
    • 2007-06-06
    • IBMLIU ZHENYANG HAOYE FAN
    • LIU ZHENYANG HAOYE FAN
    • G06F7/00G06F17/30
    • G06F17/30545
    • Methods and systems are provided for identifying and allocating resources disposed within a plurality of distributed and autonomous computing systems, each of which may have its own legacy resource discovery service. Resource identification servers disposed within each one of the distributed computing systems communicate resource attribute data to a tree hierarchy of dedicated servers. The resource attribute data are maintained in native formats within the distributed computing systems and are mapped to a common format provided by the dedicated servers. The resource attribute data are aggregated at each node within the tree hierarchy, communicated up through the tree hierarchy to one or more root nodes and replicated down through all of the nodes. Additional system robustness is provided through period resource checks and resource attribute data updates. Resource allocation queries are submitted to any level node within the hierarchy and forwarded to the proper computing system for processing.
    • 提供了用于识别和分配布置在多个分布式和自主计算系统内的资源的方法和系统,每个计算系统可以具有其自己的传统资源发现服务。 布置在分布式计算系统的每一个内的资源识别服务器将资源属性数据传送到专用服务器的树层。 资源属性数据以分布式计算系统内的本机格式进行维护,并映射到由专用服务器提供的通用格式。 资源属性数据在树层次结构中的每个节点进行聚合,通过树层次结构传递到一个或多个根节点,并通过所有节点进行复制。 通过周期资源检查和资源属性数据更新来提供额外的系统稳健性。 资源分配查询被提交到层次结构中的任何级节点,并转发到正确的计算系统进行处理。