EFFICIENT POINT-TO-MULTIPOINT DATA RECONCILIATION
    1.
    发明申请
    EFFICIENT POINT-TO-MULTIPOINT DATA RECONCILIATION 审中-公开
    有效的点对多点数据重新配置

    公开(公告)号:US20110238623A1

    公开(公告)日:2011-09-29

    申请号:US13155607

    申请日:2011-06-08

    IPC分类号: G06F17/30

    CPC分类号: H04L63/123 H04N21/631

    摘要: Efficient reconciliation of different versions of a target file or dataset can be facilitated using a hash hierarchy of a master version of the dataset. Each level of the hash hierarchy has hashes of blocks of the master version that may be sub-blocks of the hashes in the level above. The top level of the hash hierarchy, having the hashes of the largest blocks of the master, may be transmitted on a first communication channel, possibly a one-way or broadcast communication channel. Streams of encodings of each lower level of the hash hierarchy may be transmitted on respective communication channels. The encodings for a level of the hierarchy may be combinations, such as random linear combinations, of the hashes of that level. A receiver with a target dataset can receive the top level hashes from the first channel and use them to determine which lower hashes are needed to identify parts of the master missing from the target. The encodings can be used to help obtain needed lower level hashes that can be used to more finely identify missing parts. Different receivers may not have to wait for a particular piece of information about the master. Rather, any received information (e.g. encoding) about the master will most likely allow any receiver to advance its understanding of the master dataset. Receivers will usually not have to wait for delivery of a particular hash in the hierarchy.

    摘要翻译: 可以使用数据集的主版本的散列层次结构来促进目标文件或数据集的不同版本的高效协调。 散列层次结构的每个级别都具有可以是上述级别中的散列子块的主版本块的散列。 可以在第一通信信道,可能是单向或广播通信信道上发送具有主机的最大块的散列的散列层级的顶层。 可以在各个通信信道上发送散列层级的每个较低级别的编码流。 层级的级别的编码可以是该级别的散列的组合,诸如随机线性组合。 具有目标数据集的接收器可以从第一个通道接收顶级散列,并使用它们来确定需要哪些较低的散列来识别目标中丢失的主要部分。 编码可用于帮助获得所需的较低级别的哈希值,可用于更精确地识别缺失的部分。 不同的接收机可能不必等待关于主机的特定信息。 相反,关于主机的任何接收到的信息(例如编码)将很可能允许任何接收机提高对主数据集的理解。 接收者通常不必等待传递层次结构中的特定散列。

    Efficient point-to-multipoint data reconciliation
    2.
    发明申请
    Efficient point-to-multipoint data reconciliation 有权
    高效的点对多点数据协调

    公开(公告)号:US20060235895A1

    公开(公告)日:2006-10-19

    申请号:US11109011

    申请日:2005-04-18

    IPC分类号: G06F17/30

    CPC分类号: H04L63/123 H04N21/631

    摘要: Efficient reconciliation of different versions of a target file or dataset can be facilitated using a hash hierarchy of a master version of the dataset. Each level of the hash hierarchy has hashes of blocks of the master version that may be sub-blocks of the hashes in the level above. The top level of the hash hierarchy, having the hashes of the largest blocks of the master, may be transmitted on a first communication channel, possibly a one-way or broadcast communication channel. Streams of encodings of each lower level of the hash hierarchy may be transmitted on respective communication channels. The encodings for a level of the hierarchy may be combinations, such as random linear combinations, of the hashes of that level. A receiver with a target dataset can receive the top level hashes from the first channel and use them to determine which lower hashes are needed to identify parts of the master missing from the target. The encodings can be used to help obtain needed lower level hashes that can be used to more finely identify missing parts. Different receivers may not have to wait for a particular piece of information about the master. Rather, any received information (e.g. encoding) about the master will most likely allow any receiver to advance its understanding of the master dataset. Receivers will usually not have to wait for delivery of a particular hash in the hierarchy.

    摘要翻译: 可以使用数据集的主版本的散列层次结构来促进目标文件或数据集的不同版本的高效协调。 散列层次结构的每个级别都具有可以是上述级别中的散列子块的主版本块的散列。 可以在第一通信信道,可能是单向或广播通信信道上发送具有主机的最大块的散列的散列层级的顶层。 可以在各个通信信道上发送散列层级的每个较低级别的编码流。 层级的级别的编码可以是该级别的散列的组合,诸如随机线性组合。 具有目标数据集的接收器可以从第一个通道接收顶级散列,并使用它们来确定需要哪些较低的散列来识别目标中丢失的主要部分。 编码可用于帮助获得所需的较低级别的哈希值,可用于更精确地识别缺失的部分。 不同的接收机可能不必等待关于主机的特定信息。 相反,关于主机的任何接收到的信息(例如编码)将很可能允许任何接收机提高对主数据集的理解。 接收者通常不必等待传递层次结构中的特定散列。

    EFFICIENT POINT-TO-MULTIPOINT DATA RECONCILIATION

    公开(公告)号:US20110264629A1

    公开(公告)日:2011-10-27

    申请号:US13155356

    申请日:2011-06-07

    IPC分类号: G06F7/00

    CPC分类号: H04L63/123 H04N21/631

    摘要: Efficient reconciliation of different versions of a target file or dataset can be facilitated using a hash hierarchy of a master version of the dataset. Each level of the hash hierarchy has hashes of blocks of the master version that may be sub-blocks of the hashes in the level above. The top level of the hash hierarchy, having the hashes of the largest blocks of the master, may be transmitted on a first communication channel, possibly a one-way or broadcast communication channel. Streams of encodings of each lower level of the hash hierarchy may be transmitted on respective communication channels. The encodings for a level of the hierarchy may be combinations, such as random linear combinations, of the hashes of that level. A receiver with a target dataset can receive the top level hashes from the first channel and use them to determine which lower hashes are needed to identify parts of the master missing from the target. The encodings can be used to help obtain needed lower level hashes that can be used to more finely identify missing parts. Different receivers may not have to wait for a particular piece of information about the master. Rather, any received information (e.g. encoding) about the master will most likely allow any receiver to advance its understanding of the master dataset. Receivers will usually not have to wait for delivery of a particular hash in the hierarchy.

    Efficient point-to-multipoint data reconciliation
    4.
    发明授权
    Efficient point-to-multipoint data reconciliation 有权
    高效的点对多点数据调节

    公开(公告)号:US07984018B2

    公开(公告)日:2011-07-19

    申请号:US11109011

    申请日:2005-04-18

    IPC分类号: G06F7/00 G06F17/00

    CPC分类号: H04L63/123 H04N21/631

    摘要: Efficient reconciliation of different versions of a target file or dataset can be facilitated using a hash hierarchy of a master version of the dataset. Each level of the hash hierarchy has hashes of blocks of the master version that may be sub-blocks of the hashes in the level above. The top level of the hash hierarchy, having the hashes of the largest blocks of the master, may be transmitted on a first communication channel, possibly a one-way or broadcast communication channel. Streams of encodings of each lower level of the hash hierarchy may be transmitted on respective communication channels. The encodings for a level of the hierarchy may be combinations, such as random linear combinations, of the hashes of that level. A receiver with a target dataset can receive the top level hashes from the first channel and use them to determine which lower hashes are needed to identify parts of the master missing from the target. The encodings can be used to help obtain needed lower level hashes that can be used to more finely identify missing parts. Different receivers may not have to wait for a particular piece of information about the master. Rather, any received information (e.g. encoding) about the master will most likely allow any receiver to advance its understanding of the master dataset. Receivers will usually not have to wait for delivery of a particular hash in the hierarchy.

    摘要翻译: 可以使用数据集的主版本的散列层次结构来促进目标文件或数据集的不同版本的高效协调。 散列层次结构的每个级别都具有可以是上述级别中的散列子块的主版本块的散列。 可以在第一通信信道,可能是单向或广播通信信道上发送具有主机的最大块的散列的散列层级的顶层。 可以在各个通信信道上发送散列层级的每个较低级别的编码流。 层级的级别的编码可以是该级别的散列的组合,诸如随机线性组合。 具有目标数据集的接收器可以从第一个通道接收顶级散列,并使用它们来确定需要哪些较低的散列来识别目标中丢失的主要部分。 编码可用于帮助获得所需的较低级别的哈希值,可用于更精确地识别缺失的部分。 不同的接收机可能不必等待关于主机的特定信息。 相反,关于主机的任何接收到的信息(例如编码)将很可能允许任何接收机提高对主数据集的理解。 接收者通常不必等待传递层次结构中的特定散列。

    Apparatus and methods for providing translucent proxies in a communications network
    8.
    发明授权
    Apparatus and methods for providing translucent proxies in a communications network 失效
    在通信网络中提供半透明代理的装置和方法

    公开(公告)号:US07016973B1

    公开(公告)日:2006-03-21

    申请号:US09713214

    申请日:2000-11-16

    摘要: The Translucent Proxying of TCP (TPOT) device and methods use TCP-OPTIONS and IP tunneling to guarantee that all IP packets belonging to a specific TCP connection will traverse the proxy which intercepts the first packet of data. This guarantee allows the ad-hoc deployment of TPOT devices anywhere within the communication network, and does not restrict the placement of proxy devices at the edge of the network. Furthermore, no extra signaling support is required for the TPOT device to properly function while the addition of TPOT devices to communication networks significantly improves the throughput of intercepted TCP packets of data.

    摘要翻译: TCP(TPOT)设备和方法的半透明代理使用TCP-OPTIONS和IP隧道来保证属于特定TCP连接的所有IP包将遍历拦截第一个数据包的代理。 此保证允许在通信网络内的任何地方临时部署TPOT设备,并且不会限制代理设备在网络边缘的位置。 此外,当TPOT设备添加到通信网络时,TPOT设备不需要额外的信令支持,从而显着提高了所拦截的TCP数据包的吞吐量。

    User specific request redirection in a content delivery network
    9.
    发明申请
    User specific request redirection in a content delivery network 有权
    内容传送网络中的用户特定请求重定向

    公开(公告)号:US20060020684A1

    公开(公告)日:2006-01-26

    申请号:US10894725

    申请日:2004-07-20

    IPC分类号: G06F15/16

    摘要: A method and apparatus for providing user specific request redirection in a content delivery network includes parsing a page having embedded objects intended for redirection to at least one cache server, and transforming the embedded objects into relative uniform resource locators (URLs). A content-base token is inserted into an HTTP response header in response to a user request for the page. In an instance where the content-base token is not supported by the server and/or client devices, a base token is inserted into the page in response to a user request for the page. The content-base token and base token provide identification of a server or URL prefix where the embedded objects in the page are to be retrieved. The requested page is then sent to the user's browser. The browser constructs absolute URLs from the embedded URLs using either the received content-base token or base token, to retrieve embedded objects from the server.

    摘要翻译: 一种用于在内容传递网络中提供用户特定请求重定向的方法和装置包括:将具有用于重定向的嵌入对象的页解析到至少一个缓存服务器,以及将嵌入的对象变换为相对统一的资源定位符(URL)。 响应于用户对该页面的请求,将内容令牌插入HTTP响应头。 在服务器和/或客户端设备不支持内容库令牌的情况下,响应于用户对该页面的请求,将基本标记插入页面。 内容库令牌和基本令牌提供要检索页面中的嵌入对象的服务器或URL前缀的标识。 然后将请求的页面发送到用户的浏览器。 浏览器使用接收到的内容基础令牌或基本令牌从嵌入式URL构建绝对URL,以从服务器检索嵌入的对象。

    Nasal peptide pharmaceutical formulation
    10.
    发明申请
    Nasal peptide pharmaceutical formulation 审中-公开
    鼻肽药物制剂

    公开(公告)号:US20050158247A1

    公开(公告)日:2005-07-21

    申请号:US10516613

    申请日:2003-06-24

    CPC分类号: A61K9/0043 A61K47/18

    摘要: The invention provides a pharmaceutical formulation comprising: (1) THAM, which is tris(hydroxymethyl)aminomethane, as a selective absorbefacient to enhance through the nasal mucosa-lined epithelium the absorption of substances of peptide nature; and (2) a therapeutically effective amount of active nasal peptide, its pharmaceutically acceptable salt or its peptidic fragment; in a pharmaceutically acceptable, aqueous liquid diluent or carrier, said formulation being in a form suitable for nasal administration.

    摘要翻译: 本发明提供一种药物制剂,其包含:(1)THAM,其是三(羟甲基)氨基甲烷,作为选择性吸收剂,以增强穿过鼻粘膜上皮的吸收肽性质的物质; 和(2)治疗有效量的活性鼻肽,其药学上可接受的盐或其肽片段; 在药学上可接受的水性液体稀释剂或载体中,所述制剂为适合于鼻内给药的形式。