会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • 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.
    • 描述支持基于分布式密钥的进程。 在一个实施例中,数据中心的服务器提供用于执行计算上昂贵的任务的基于密钥的过程,并且使用诸如环面的几何拓扑中的点对点连接。 在一个示例中,聚合树建立在数据中心的几何拓扑之上,每个聚合树是数据中心中形成树结构的一系列服务器。 在一个实施例中,使用基于密钥的过程的组合器功能,将数据包从树的树叶发送到根,并且沿树的每个服务器将数据包聚合。 在一个实施例中,如果服务器发生故障,则动态地重新计算树并且触发恢复阶段以重新发送在故障服务器处丢失的任何分组。 在一些实施例中,通过检查分组的内容来调度分组。
    • 2. 发明授权
    • 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.
    • 描述支持基于分布式密钥的进程。 在一个实施例中,数据中心的服务器提供用于执行计算上昂贵的任务的基于密钥的过程,并且使用诸如环面的几何拓扑中的点对点连接。 在一个示例中,聚合树建立在数据中心的几何拓扑之上,每个聚合树是数据中心中形成树结构的一系列服务器。 在一个实施例中,使用基于密钥的过程的组合器功能,将数据包从树的树叶发送到根,并且沿树的每个服务器将数据包聚合。 在一个实施例中,如果服务器发生故障,则动态地重新计算树并且触发恢复阶段以重新发送在故障服务器处丢失的任何分组。 在一些实施例中,通过检查分组的内容来调度分组。
    • 3. 发明授权
    • Content transfer
    • 内容转让
    • US08649276B2
    • 2014-02-11
    • US12183607
    • 2008-07-31
    • Gregory Francis O'SheaThomas Christian ZahnAntony Rowstron
    • Gregory Francis O'SheaThomas Christian ZahnAntony Rowstron
    • H04L12/26
    • H04L67/06H04L1/1614H04L1/1854H04L63/0442H04L67/1095H04L67/12
    • Content transfer between nodes in a communications network is required in many situations. For example, between fixed nodes in a data center, between a fixed node such as a base station and a mobile node such as a mobile telephone and between mobile nodes themselves such as personal digital assistants. In an embodiment a content transfer process for use between nodes where one node knows the size of content to be transferred is described. For example, a file is divided into blocks to be sent between the nodes. A node receiving a block keeps a record of the received blocks and sends that record to the sending node at certain times. By controlling the times at which the records are sent the number of messages that need to be sent to transfer the records is low and the blocks are transferred in an efficient manner.
    • 在许多情况下,需要通信网络中的节点之间的内容传输。 例如,在数据中心的固定节点之间,诸如基站的固定节点和诸如移动电话的移动节点之间以及诸如个人数字助理之类的移动节点本身之间。 在一个实施例中,描述了在一个节点知道要传送的内容的大小的节点之间使用的内容传送过程。 例如,文件被分成在节点之间发送的块。 接收块的节点保持接收到的块的记录,并在某些时间将该记录发送到发送节点。 通过控制发送记录的时间,需要发送以传送记录的消息的数量很少,并且以有效的方式传送块。
    • 4. 发明授权
    • Content discovery and transfer between mobile communications nodes
    • 移动通信节点之间的内容发现和传输
    • US08103718B2
    • 2012-01-24
    • US12183460
    • 2008-07-31
    • Gregory Francis O'SheaThomas Christian ZahnAntony Rowstron
    • Gregory Francis O'SheaThomas Christian ZahnAntony Rowstron
    • G06F15/16
    • H04L67/104G06F17/30174H04L63/123H04L67/06H04L67/1068H04L67/1095
    • Content discovery and content transfer between mobile communications nodes is often required, for example, to synchronize maps, traffic hot spot information and the like for vehicle mounted satellite navigation devices, pedestrian hand-held personal digital assistants and other mobile communications nodes. In an embodiment, content discovery processes using data structures designed in particular ways and sent using a single packet enable nodes to identify files to be transferred whilst keeping overheads down. In an embodiment a first and a second data structure are used, each being formed from slightly different information about a subset of the files to be synchronized. In another embodiment a single tree-based data structure is used. A process for transferring data between two mobile communications nodes is also described.
    • 通常需要移动通信节点之间的内容发现和内容传送,例如,为车载卫星导航设备,行人手持个人数字助理和其他移动通信节点同步地图,交通热点信息等。 在一个实施例中,使用以特定方式设计并使用单个分组发送的数据结构的内容发现过程使得节点能够识别要传送的文件,同时保持开销下降。 在一个实施例中,使用第一和第二数据结构,每个数据结构由关于要同步的文件的子集的稍微不同的信息形成。 在另一个实施例中,使用单个基于树的数据结构。 还描述了在两个移动通信节点之间传送数据的过程。
    • 5. 发明申请
    • Content Transfer
    • 内容转移
    • US20100027588A1
    • 2010-02-04
    • US12183607
    • 2008-07-31
    • Gregory Francis O'SheaThomas Christian ZahnAntony Rowstron
    • Gregory Francis O'SheaThomas Christian ZahnAntony Rowstron
    • H04B1/707
    • H04L67/06H04L1/1614H04L1/1854H04L63/0442H04L67/1095H04L67/12
    • Content transfer between nodes in a communications network is required in many situations. For example, between fixed nodes in a data center, between a fixed node such as a base station and a mobile node such as a mobile telephone and between mobile nodes themselves such as personal digital assistants. In an embodiment a content transfer process for use between nodes where one node knows the size of content to be transferred is described. For example, a file is divided into blocks to be sent between the nodes. A node receiving a block keeps a record of the received blocks and sends that record to the sending node at certain times. By controlling the times at which the records are sent the number of messages that need to be sent to transfer the records is low and the blocks are transferred in an efficient manner.
    • 在许多情况下,需要通信网络中的节点之间的内容传输。 例如,在数据中心的固定节点之间,诸如基站的固定节点和诸如移动电话的移动节点之间以及诸如个人数字助理之类的移动节点本身之间。 在一个实施例中,描述了在一个节点知道要传送的内容的大小的节点之间使用的内容传送过程。 例如,文件被分成在节点之间发送的块。 接收块的节点保持接收到的块的记录,并在某些时间将该记录发送到发送节点。 通过控制发送记录的时间,需要发送以传送记录的消息的数量很少,并且以有效的方式传送块。