会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • API supporting server and key based networking
    • API支持服务器和基于密钥的网络
    • US09015345B2
    • 2015-04-21
    • US12969181
    • 2010-12-15
    • Gregory O'SheaAustin DonnellyAntony RowstronPaolo Costa
    • Gregory O'SheaAustin DonnellyAntony RowstronPaolo Costa
    • G06F15/16H04L29/14H04L29/06H04L29/08
    • H04L45/122H04L45/26H04L45/72H04L67/1038H04L69/14H04L69/40
    • An application programming interface (API) supporting server and key based networking is described. In an embodiment, the API receives either a key or a server address from a service running on a server in a direct-connect topology and returns data which identifies suitable next hops for transmission of a packet of data which has a destination of the received server address or of a server address which is encoded within the received key. In another embodiment, the key also encodes information specifying alternative server addresses for use in the event that the original server is unreachable. This information may also be used to define servers for replication of the key. A further embodiment describes a method of queuing packets for transmission against multiple links, where the packet is transmitted on the first available link and at this time is removed from the queues for the other links.
    • 描述了支持服务器和基于密钥的联网的应用程序编程接口(API)。 在一个实施例中,API从直接连接拓扑中的服务器上运行的服务接收密钥或服务器地址,并返回标识合适的下一跳的数据,用于发送具有所接收服务器的目的地的数据分组 地址或在接收到的密钥内编码的服务器地址。 在另一个实施例中,密钥还对指定替代服务器地址的信息进行编码,以在原始服务器不可达的情况下使用。 此信息也可用于定义用于密钥复制的服务器。 另一实施例描述了一种排队分组以对多个链路进行传输的方法,其中分组在第一可用链路上传输,并且此时从其他链路的队列中移除。
    • 2. 发明申请
    • API Supporting Server and Key Based Networking
    • API支持服务器和基于密钥的网络
    • US20120158998A1
    • 2012-06-21
    • US12969181
    • 2010-12-15
    • Gregory O'SheaAustin DonnellyAntony RowstronPaolo Costa
    • Gregory O'SheaAustin DonnellyAntony RowstronPaolo Costa
    • G06F15/16
    • H04L45/122H04L45/26H04L45/72H04L67/1038H04L69/14H04L69/40
    • An application programming interface (API) supporting server and key based networking is described. In an embodiment, the API receives either a key or a server address from a service running on a server in a direct-connect topology and returns data which identifies suitable next hops for transmission of a packet of data which has a destination of the received server address or of a server address which is encoded within the received key. In another embodiment, the key also encodes information specifying alternative server addresses for use in the event that the original server is unreachable. This information may also be used to define servers for replication of the key. A further embodiment describes a method of queuing packets for transmission against multiple links, where the packet is transmitted on the first available link and at this time is removed from the queues for the other links.
    • 描述了支持服务器和基于密钥的联网的应用程序编程接口(API)。 在一个实施例中,API从直接连接拓扑中的服务器上运行的服务接收密钥或服务器地址,并返回标识合适的下一跳的数据,用于发送具有所接收服务器的目的地的数据分组 地址或在接收到的密钥内编码的服务器地址。 在另一个实施例中,密钥还对指定替代服务器地址的信息进行编码,以在原始服务器不可达的情况下使用。 此信息也可用于定义用于密钥复制的服务器。 另一实施例描述了一种排队分组以对多个链路进行传输的方法,其中分组在第一可用链路上传输,并且此时从其他链路的队列中移除。
    • 3. 发明申请
    • Supporting Distributed Key-Based Processes
    • 支持分布式基于密钥的过程
    • US20120151292A1
    • 2012-06-14
    • US12967903
    • 2010-12-14
    • Antony RowstronPaolo CostaGregory Francis O'SheaAustin Donnelly
    • Antony RowstronPaolo CostaGregory Francis O'SheaAustin Donnelly
    • H04L1/18G06F15/16
    • G06F9/5066
    • Supporting distributed key-based processes is described. In an embodiment, servers at a data center provide a key-based process for carrying out computationally expensive tasks and are connected using point to point connections in a geometric topology such as a torus. In an example, aggregation trees are built on top of the geometric topology of the data center, each aggregation tree being a sequence of servers in the data center that forms a tree structure. In an embodiment packets of data are sent from the leaves of the trees to the root and at each server along the tree the packets are aggregated using a combiner function of the key-based process. In an embodiment, if a server fails, the trees are dynamically recomputed and a recovery phase is triggered to resend any packets lost at the failed server. In some embodiments, packets are scheduled by inspecting the content of the packets.
    • 描述支持基于分布式密钥的进程。 在一个实施例中,数据中心的服务器提供用于执行计算上昂贵的任务的基于密钥的过程,并且使用诸如环面的几何拓扑中的点对点连接。 在一个示例中,聚合树建立在数据中心的几何拓扑之上,每个聚合树是数据中心中形成树结构的一系列服务器。 在一个实施例中,使用基于密钥的过程的组合器功能,将数据包从树的树叶发送到根,并且沿树的每个服务器将数据包聚合。 在一个实施例中,如果服务器发生故障,则动态地重新计算树并且触发恢复阶段以重新发送在故障服务器处丢失的任何分组。 在一些实施例中,通过检查分组的内容来调度分组。
    • 4. 发明授权
    • Supporting distributed key-based processes
    • 支持分布式的基于密钥的进程
    • US08499222B2
    • 2013-07-30
    • US12967903
    • 2010-12-14
    • Antony RowstronPaolo CostaGregory Francis O'SheaAustin Donnelly
    • Antony RowstronPaolo CostaGregory Francis O'SheaAustin Donnelly
    • H03M13/00
    • G06F9/5066
    • Supporting distributed key-based processes is described. In an embodiment, servers at a data center provide a key-based process for carrying out computationally expensive tasks and are connected using point to point connections in a geometric topology such as a torus. In an example, aggregation trees are built on top of the geometric topology of the data center, each aggregation tree being a sequence of servers in the data center that forms a tree structure. In an embodiment packets of data are sent from the leaves of the trees to the root and at each server along the tree the packets are aggregated using a combiner function of the key-based process. In an embodiment, if a server fails, the trees are dynamically recomputed and a recovery phase is triggered to resend any packets lost at the failed server. In some embodiments, packets are scheduled by inspecting the content of the packets.
    • 描述支持基于分布式密钥的进程。 在一个实施例中,数据中心的服务器提供用于执行计算上昂贵的任务的基于密钥的过程,并且使用诸如环面的几何拓扑中的点对点连接。 在一个示例中,聚合树建立在数据中心的几何拓扑之上,每个聚合树是数据中心中形成树结构的一系列服务器。 在一个实施例中,使用基于密钥的过程的组合器功能,将数据包从树的树叶发送到根,并且沿树的每个服务器将数据包聚合。 在一个实施例中,如果服务器发生故障,则动态地重新计算树并且触发恢复阶段以重新发送在故障服务器处丢失的任何分组。 在一些实施例中,通过检查分组的内容来调度分组。