利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

61 条记录 (耗时 0.03 秒)

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

    Distributing decision making in a centralized flow routing system
    9.
    发明申请
    Distributing decision making in a centralized flow routing system 有权
    在集中流量路由系统中分配决策

    公开(公告)号：US20110273988A1

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

    申请号：US12662885

    申请日：2010-05-10

    申请人： Jean Tourrilhes ,  Praveen Yalagandula ,  Puneet Sharma ,  Jeffrey Clifford Mogul ,  Sujata Banerjee

    发明人： Jean Tourrilhes ,  Praveen Yalagandula ,  Puneet Sharma ,  Jeffrey Clifford Mogul ,  Sujata Banerjee

    IPC分类号： H04L12/26

    CPC分类号： H04L43/062 ,  H04L41/0816 ,  H04L45/38 ,  H04L45/42 ,  H04L47/32

    摘要： Local rules for managing flows devolved from a central controller are received at a switch. The central controller determines a global set of rules for managing flows. The switch receives a packet from a flow from a network and determines whether a metric for the flow satisfies a dynamic condition to trigger a metric report to the central controller. In response to a determination that the metric for the flow at the switch satisfies the dynamic condition to trigger a metric report to the central controller, the switch sends a metric report to the central controller, and the switch then receives an instruction to manage the flow from the central controller. In response to a determination that the metric for the flow at the switch does not satisfy the dynamic condition to trigger the metric report to the central controller, the switch manages the flow using the local rules for managing flows.

    摘要翻译： 在交换机上接收到用于管理从中央控制器传出的流量的本地规则。 中央控制器确定管理流量的全局规则集。 交换机从来自网络的流接收分组，并确定流的度量是否满足动态条件以触发对中央控制器的度量报告。 响应于确定交换机处的流量的度量满足动态条件以触发对中央控制器的度量报告，交换机向中央控制器发送度量报告，然后交换机接收管理流程的指令 从中央控制器。 响应于确定交换机处的流量的度量不满足触发向中央控制器的度量报告的动态条件，交换机使用用于管理流的本地规则管理流。