利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

61 条记录 (耗时 0.033 秒)

    Method and system for content downloads via an insecure communications channel to devices
    1.
    发明授权
    Method and system for content downloads via an insecure communications channel to devices 有权
    通过不安全的通信通道向设备下载内容的方法和系统

    公开(公告)号：US08464353B2

    公开(公告)日：2013-06-11

    申请号：US10679092

    申请日：2003-10-03

    申请人： David Andrew Thomas ,  Puneet Sharma ,  Sujata Banerjee ,  Sung-Ju Lee ,  Amy Csizmar Dalal

    发明人： David Andrew Thomas ,  Puneet Sharma ,  Sujata Banerjee ,  Sung-Ju Lee ,  Amy Csizmar Dalal

    IPC分类号： H04L29/06

    CPC分类号： H04L63/0428 ,  H04L9/0866 ,  H04L9/3239 ,  H04L63/18 ,  H04L67/06 ,  H04L69/329 ,  H04L2209/56 ,  H04L2209/60

    摘要： The present teachings provide for a method and system for facilitating content download to one or more remote devices via an insecure communication channel. The method comprises the steps of receiving at least one shared secret from a device via an insecure communications channel, each shared secret encoded and functioning as an identifier for the device, transmitting an encrypted file, from a file server, to the device associated with the encoded shared secret, receiving the shared secret in a plaintext forma via a secure communications channel, receiving a confirmation authorizing the release of a decryption key, and sending a decryption key corresponding to the transmitted file, for which the authorization for the release of the decryption key has been received. The decryption key is encrypted using the shared secret if transmission is via the insecure channel.

    摘要翻译： 本教导提供了一种用于促进通过不安全通信信道向一个或多个远程设备下载内容的方法和系统。 该方法包括以下步骤：经由不安全通信信道从设备接收至少一个共享秘密，每个共享秘密被编码并用作设备的标识符，从文件服务器将加密文件发送到与该文件相关联的设备 编码共享秘密，经由安全通信信道以明文形式接收共享秘密，接收授权解密密钥的释放的确认，以及发送与所发送的文件相对应的解密密钥，为此解密的解密权 钥匙已经收到。 如果传输是通过不安全的信道，则使用共享密钥对解密密钥进行加密。

    Network latency estimation
    2.
    发明授权
    Network latency estimation 有权
    网络延迟估计

    公开(公告)号：US08254264B1

    公开(公告)日：2012-08-28

    申请号：US11414059

    申请日：2006-04-28

    申请人： Sujata Banerjee ,  Puneet Sharma ,  Sung-Ju Lee

    发明人： Sujata Banerjee ,  Puneet Sharma ,  Sung-Ju Lee

    IPC分类号： G01R31/08 ,  H04L12/28

    CPC分类号： H04L43/0852 ,  H04L41/12 ,  H04L47/283

    摘要： A method includes sending signals from two nodes to a landmark, identifying common milestones along the routes, and determining distance information from the nodes to at least one of the common milestones. A system includes a program configured to send signals from two nodes to a landmark, identify common milestones along the routes, and provide distance information from each node to at least one of the common milestones, and a program configured to receive the distance information and provide a latency estimate based on the distance information.

    摘要翻译： 一种方法包括将信号从两个节点发送到地标，识别沿着路线的共同里程碑，以及确定从节点到至少一个公共里程碑的距离信息。 一种系统包括被配置为将信号从两个节点发送到地标的程序，沿着路线识别共同的里程碑，并且将每个节点的距离信息提供给公共里程碑中的至少一个，以及被配置为接收距离信息并提供 基于距离信息的延迟估计。

    Method and system for file downloads to portable computing devices
    4.
    发明申请
    Method and system for file downloads to portable computing devices 审中-公开
    文件下载到便携式计算设备的方法和系统

    公开(公告)号：US20050076214A1

    公开(公告)日：2005-04-07

    申请号：US10678936

    申请日：2003-10-03

    申请人： David Thomas ,  Edward Perry ,  Sujata Banerjee ,  Puneet Sharma ,  Amy Dalal ,  Sung-Ju Lee

    发明人： David Thomas ,  Edward Perry ,  Sujata Banerjee ,  Puneet Sharma ,  Amy Dalal ,  Sung-Ju Lee

    IPC分类号： G06F12/14 ,  G06F21/00 ,  G06F17/60

    CPC分类号： G06F21/10

    摘要： The present disclosure allows for the downloading of large digital media files in a progressive manner by allowing for a transfer of such digital media to occur over various sessions. A file server is described that receives a request to transmit a file whereupon the file server locates such requested file in its memory. For verification purposes a unique identifier is computed for the requested file such as an MD5 checksum of the digital file. Thereafter an encryption key, K1, is chosen. Using a second key, K2, the first key and the unique identifier are encrypted, and the requested file is encrypted using the first key. Both these encrypted values are then transmitted. Subsequently, for example, after payment is received, an unencrypted form of the first key is also transmitted. The first key can then be used to decrypt the requested file to unlock full functionality of the requested file.

    摘要翻译： 本公开允许通过允许这样的数字媒体的传送在各种会话上发生而以渐进的方式下载大型数字媒体文件。 描述了一种文件服务器，其接收传送文件的请求，因此文件服务器将这样的请求的文件定位在其存储器中。 为验证目的，为所请求的文件计算唯一的标识符，例如数字文件的MD5校验和。 此后选择加密密钥K1。 使用第二个键，K2，第一个键和唯一标识符被加密，并且使用第一个密钥加密所请求的文件。 然后传输这两个加密值。 随后，例如，在接收到支付之后，还发送第一密钥的未加密形式。 然后可以使用第一个密钥来解密所请求的文件，以解锁所请求文件的完整功能。

    Distributed network distance detemination using a distributed hash table overlay network
    6.
    发明申请
    Distributed network distance detemination using a distributed hash table overlay network 有权
    使用分布式哈希表覆盖网络分布式网络距离

    公开(公告)号：US20080181135A1

    公开(公告)日：2008-07-31

    申请号：US11700579

    申请日：2007-01-31

    申请人： Praveen Yalagandula ,  Puneet Sharma ,  Sujata Banerjee ,  Sung-Ju Lee

    发明人： Praveen Yalagandula ,  Puneet Sharma ,  Sujata Banerjee ,  Sung-Ju Lee

    IPC分类号： G08C15/00 ,  H04L12/28

    CPC分类号： H04L67/104 ,  H04L41/12 ,  H04L43/0829 ,  H04L43/0852 ,  H04L43/0864 ,  H04L43/10 ,  H04L67/1002 ,  H04L67/1065

    摘要： Distances are determined between an identified node and landmark nodes and milestone nodes in a network. The closest milestone or landmark node associated with a shortest of the measured distances is determined. A corresponding distributed hash table (DHT) overlay node is queried for distances between observed nearest nodes for the closest milestone or landmark node and the identified node. Distances between the identified node and the observed nearest nodes are calculated from distances received from the DHT overlay node and the measured distance to the closest milestone or landmark node. K-closest nodes from the identified node are selected from at least one of the closest milestone or landmark node and one or more of the observed nearest nodes based on the calculated distances.

    摘要翻译： 在一个网络中确定的节点和地标节点和里程碑节点之间确定距离。 确定与最短测量距离相关联的最近的里程碑或地标节点。 查询对应的分布式哈希表（DHT）覆盖节点，用于最近的里程碑或地标节点和已识别节点的观察最近节点之间的距离。 从从DHT覆盖节点接收的距离和到最近里程碑或地标节点的测量距离计算识别的节点和观察到的最近节点之间的距离。 基于计算出的距离，从最近的里程碑或地标节点中的至少一个和观察到的最近的节点中的至少一个中选出来自所识别的节点的K个最近的节点。

    Discovery across multiple registries
    9.
    发明授权
    Discovery across multiple registries 有权
    跨多个注册管理机构的发现

    公开(公告)号：US08880489B2

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

    申请号：US11198806

    申请日：2005-08-04

    申请人： Sujoy Basu ,  Sujata Banerjee ,  Shishir Garg ,  Sukesh Garg ,  Sung-Ju Lee ,  Pramila Mullan ,  Puneet Sharma

    发明人： Sujoy Basu ,  Sujata Banerjee ,  Shishir Garg ,  Sukesh Garg ,  Sung-Ju Lee ,  Pramila Mullan ,  Puneet Sharma

    IPC分类号： G06F7/00 ,  G06F17/30

    CPC分类号： G06F17/30864

    摘要： One embodiment relates to a system for linking together multiple registries and aggregating data from the multiple registries. The system includes a plurality of local resource or service (resource/service) registries, a distributed index storage and retrieval system, and at least one proxy registry. The proxy registry is configured to receive a search query from a client system, retrieve information from the distributed index storage and retrieval system as to which of the local resource/service registries are relevant to the search query, and obtain pertinent entries from said relevant resource/service registries. Other embodiments are also disclosed.

    摘要翻译： 一个实施例涉及用于将多个注册表链接在一起并聚合来自多个注册表的数据的系统。 该系统包括多个本地资源或服务（资源/服务）注册表，分布式索引存储和检索系统以及至少一个代理注册表。 代理注册表被配置为从客户端系统接收搜索查询，从分布式索引存储和检索系统检索关于哪个本地资源/服务注册表与搜索查询相关的信息，并且从所述相关资源获取相关条目 /服务注册表。 还公开了其他实施例。

    Dynamic priority queue level assignment for a network flow
    10.
    发明授权
    Dynamic priority queue level assignment for a network flow 有权
    网络流的动态优先级队列级别分配

    公开(公告)号：US08537846B2

    公开(公告)日：2013-09-17

    申请号：US12768722

    申请日：2010-04-27

    申请人： Puneet Sharma ,  Jean Tourrilhes ,  Praveen Yalagandula ,  Jung Gun Lee ,  Sung-Ju Lee ,  Sujata Banerjee

    发明人： Puneet Sharma ,  Jean Tourrilhes ,  Praveen Yalagandula ,  Jung Gun Lee ,  Sung-Ju Lee ,  Sujata Banerjee

    IPC分类号： H04L12/28

    CPC分类号： H04L49/205 ,  H04L47/17 ,  H04L47/2458

    摘要： Forwarding a flow in a network includes receiving the flow at a switch, determining an optimized priority queue level of the flow at the switch, and forwarding the flow via the switch using an optimized priority queue level of the flow at the switch. The flow passes through a plurality of switches, including the switch, in the network, and the optimized priority queue level of the flow at the switch is different from a priority queue level of the flow at a second switch of the plurality of switches. The second switch routes the flow at the second switch using the different priority queue level for the flow.

    摘要翻译： 转发网络中的流包括在交换机处接收流，确定交换机处的流优化优先级队列级别，以及使用交换机处的流优化优先级队列来经由交换机转发流。 该流程通过网络中的多个交换机（包括交换机），并且交换机处的流的优化优先级队列级别与多个交换机的第二交换机处的流的优先级队列级不同。 第二交换机使用流的不同优先级队列级别在第二交换机处路由流。