利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

85 条记录 (耗时 0.024 秒)

    Distributed network distance detemination using a distributed hash table overlay network
    3.
    发明申请
    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个最近的节点。

    Dynamic priority queue level assignment for a network flow
    4.
    发明授权
    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.

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

    Dynamic Priority Queue Level Assignment for a Network Flow
    5.
    发明申请
    Dynamic Priority Queue Level Assignment for a Network Flow 有权
    网络流的动态优先级队列级别分配

    公开(公告)号：US20110261831A1

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

    申请号：US12768722

    申请日：2010-04-27

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

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

    IPC分类号： H04L12/56

    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.

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

    Distributed network distance determination using a distributed hash table overlay network
    6.
    发明授权
    Distributed network distance determination using a distributed hash table overlay network 有权
    使用分布式哈希表覆盖网络的分布式网络距离确定

    公开(公告)号：US07965655B2

    公开(公告)日：2011-06-21

    申请号：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

    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个最近的节点。

    Path selection in a network
    7.
    发明授权
    Path selection in a network 有权
    网络中的路径选择

    公开(公告)号：US07643426B1

    公开(公告)日：2010-01-05

    申请号：US11412442

    申请日：2006-04-27

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

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

    IPC分类号： H04L12/28

    CPC分类号： H04L45/123 ,  H04L45/02 ,  H04L45/128 ,  H04L45/64

    摘要： A path in a network is selected by selecting candidate overlay paths between two nodes in the network based on a static network metric determined for each of a plurality of overlay paths. A time sensitive network metric is determined for each of the candidate overlay paths, and a path is selected from the candidate overlay paths based on the time sensitive network metrics.

    摘要翻译： 通过基于为多个覆盖路径中的每一个确定的静态网络度量来选择网络中的两个节点之间的候选覆盖路径来选择网络中的路径。 为每个候选覆盖路径确定时间敏感网络度量，并且基于时间敏感网络度量从候选覆盖路径中选择路径。

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

    公开(公告)号：US20050076210A1

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

    申请号：US10679092

    申请日：2003-10-03

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

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

    IPC分类号： H04L9/08 ,  H04L9/32 ,  H04L29/06 ,  H04L29/08 ,  H04L9/00

    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 form a 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.

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