知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

12 records (took 0.016 seconds)

    NETWORK CODING-BASED ANONYMOUS COMMUNICATION
    1.
    发明申请
    NETWORK CODING-BASED ANONYMOUS COMMUNICATION 有权
    基于网络编码的无线通信

    公开(公告)号：US20140250301A1

    公开(公告)日：2014-09-04

    申请号：US14193984

    申请日：2014-02-28

    Applicant: CALIFORNIA INSTITUTE OF TECHNOLOGY

    Inventor： Christopher S. Chang ,  Tracey C. Ho ,  Michelle Effros

    IPC: H04L29/06

    CPC classification number: H04L63/0407 ,  H04L45/64 ,  H04L63/18 ,  H04L67/104

    Abstract: A computer-based peer-to-peer anonymous networking using a coding scheme with a formal information theoretic security characterization to construct a corresponding overlay subgraph is presented. A code construction based on linear coding which can be used for data transfer in an anonymous network is also presented. Various performance and simulation of the presented codes are provided in the Annex A1 which makes part of the present disclosure.

    Abstract translation: 提出了一种基于计算机的对等匿名网络，使用具有正式信息理论安全表征的编码方案来构建相应的覆盖子图。 还提出了可以用于匿名网络中的数据传输的基于线性编码的代码构造。 在附件A1中提供了所提出的代码的各种性能和模拟，这是本公开的一部分。

    Distributed storage allocation for heterogeneous systems
    2.
    发明授权
    Distributed storage allocation for heterogeneous systems 有权

    公开(公告)号：US09632829B2

    公开(公告)日：2017-04-25

    申请号：US14210181

    申请日：2014-03-13

    Applicant: CALIFORNIA INSTITUTE OF TECHNOLOGY

    Inventor： Zhao Li ,  Tracey C. Ho ,  Derek Leong ,  Hongyi Yao

    IPC: G06F12/00 ,  G06F9/50 ,  G06F3/06

    CPC classification number: G06F9/5016 ,  G06F3/0614 ,  G06F3/0631 ,  G06F3/0689

    Abstract: Allocation of storage budget in a computer-based distributed storage system is described, where associated computer-based storage nodes have heterogeneous access probabilities. The problem is to allocate a given storage budget across the available computer-based nodes so as to store a unit-size data object (e.g. file) with a higher reliability (e.g. increased probability for the storage budget to be recovered). Efficient algorithms for optimizing over one or more classes of allocations are presented. A basic one-level symmetric allocation is presented, where the storage budget is spread evenly over an appropriately chosen subset of nodes. Furthermore, a two-level symmetric allocation is presented, where the budget is divided into two parts, each spread evenly over a different subset of computer-based storage nodes, such that the amount allocated to each node in the first subset is twice that of the second subset. Further expansion of the two-level symmetric allocation is provided with a three-level and a generic k-level symmetric allocation.

    Erasure coding scheme for deadlines
    4.
    发明授权
    Erasure coding scheme for deadlines 有权
    截止日期的擦除编码方案

    公开(公告)号：US08914713B2

    公开(公告)日：2014-12-16

    申请号：US13625857

    申请日：2012-09-24

    Applicant: California Institute of Technology

    Inventor： Svitlana Vyetrenko ,  Tracey C. Ho ,  Hongyi Yao ,  Omer Tekin

    IPC: H03M13/00 ,  G11C29/00 ,  H03M13/37 ,  H03M13/15 ,  H03M13/45 ,  H03M13/29 ,  H04L1/00

    CPC classification number: H03M13/373 ,  H03M13/154 ,  H03M13/293 ,  H03M13/455 ,  H04L1/0061 ,  H04L1/0067 ,  H04L1/0077 ,  H04L1/0078 ,  H04L1/0082

    Abstract: Error correction coding for streaming communication is provided. A streaming problem is modeled as a non-multicast network problem with a nested receiver structure. Each packet in the streaming problem corresponds to a link, and each deadline in the streaming problem corresponds to a receiver in the non-multicast network problem. For the non-multicast network problem, content to be transmitted in multiple packets to multiple receivers is obtained. Each of the receivers is required to decode specific independent messages from the content, at given time steps, and has access to a subset of the content received by another receiver. The content is allocated into multiple packets to be transmitted on multiple links. No coding occurs across information demanded by different receivers. A capacity region defines a set of information rate vectors that can be communicated to the receivers successfully. A rate vector is successfully communicated if it complies with various inequalities.

    Abstract translation: 提供了流媒体通信的纠错编码。 流问题被建模为具有嵌套接收机结构的非多播网络问题。 流式传输问题中的每个数据包都对应一个链接，并且流媒体问题中的每个截止日期对应于非多播网络问题中的接收者。 对于非组播网络问题，可以获得要以多个分组发送到多个接收机的内容。 需要每个接收机在给定的时间步骤从内容中解码特定的独立消息，并且可以访问由另一接收机接收的内容的子集。 内容被分配到多个分组中以在多个链路上传输。 不同接收机所要求的信息不发生编码。 容量区域定义可以成功地传送到接收器的一组信息速率向量。 如果符合各种不平等的情况，速率向量成功传达。

Patent Agency Ranking