利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

61 条记录 (耗时 0.032 秒)

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

    Selecting service nodes for an end-to-end service path from a reduced search space
    22.
    发明申请
    Selecting service nodes for an end-to-end service path from a reduced search space 有权
    从减少的搜索空间中选择服务节点以实现端到端服务路径

    公开(公告)号：US20080181118A1

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

    申请号：US11700441

    申请日：2007-01-31

    申请人： Puneet Sharma ,  Manish Jain ,  Sujata Banerjee

    发明人： Puneet Sharma ,  Manish Jain ,  Sujata Banerjee

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

    CPC分类号： H04L67/16 ,  H04L45/02 ,  H04L45/306 ,  H04L45/48 ,  H04L45/64

    摘要： Service nodes in a service overlay network are selected to provide a service path for a requested service by determining a reduced search space of service nodes in the service overlay network that are operable to provide service components for the requested service. From the reduced search space of service nodes, service nodes are selected to form a service path that satisfies all quality of service constraints for the service.

    摘要翻译： 选择服务覆盖网络中的服务节点以通过确定服务覆盖网络中的可操作以提供所请求服务的服务组件的服务节点的减小的搜索空间来为所请求的服务提供服务路径。 从服务节点的减少的搜索空间中选择服务节点以形成满足服务的所有服务质量约束的服务路径。

    Power-based networking resource allocation
    26.
    发明授权
    Power-based networking resource allocation 有权
    基于电力的网络资源分配

    公开(公告)号：US08098658B1

    公开(公告)日：2012-01-17

    申请号：US11496860

    申请日：2006-08-01

    申请人： Parthasarathy Ranganathan ,  Puneet Sharma ,  Sujata Banerjee

    发明人： Parthasarathy Ranganathan ,  Puneet Sharma ,  Sujata Banerjee

    IPC分类号： H04L12/28

    CPC分类号： H04L45/00

    摘要： A method for routing network traffic in a data network having a plurality of network switches, the method including identifying network traffic to be routed in the data network, evaluating multiple options for provisioning resources in the data network to handle the identified network traffic, selecting one option from the multiple options for provisioning resources based on at least one predetermined policy, and controlling the plurality of network switches based on the selected option.

    摘要翻译： 一种用于在具有多个网络交换机的数据网络中路由网络流量的方法，所述方法包括识别要在数据网络中路由的网络流量，评估用于在数据网络中供应资源的多个选项以处理所识别的网络流量，选择一个 来自用于基于至少一个预定策略来供应资源的多个选项的选项，以及基于所选择的选项来控制所述多个网络交换机。

    Dynamic Priority Queue Level Assignment for a Network Flow
    27.
    发明申请
    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
    28.
    发明授权
    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个最近的节点。

    SYSTEM FOR CONTROLLING POWER CONSUMPTION OF A NETWORK
    29.
    发明申请
    SYSTEM FOR CONTROLLING POWER CONSUMPTION OF A NETWORK 失效
    控制网络功耗的系统

    公开(公告)号：US20110055611A1

    公开(公告)日：2011-03-03

    申请号：US12817907

    申请日：2010-06-17

    申请人： Puneet SHARMA ,  Brandon Heller ,  Priya Mahadevan ,  Sujata Banerjee ,  Xiaoyun Zhu ,  Ram Swaminathan ,  Parthasarathy Ranganathan

    发明人： Puneet SHARMA ,  Brandon Heller ,  Priya Mahadevan ,  Sujata Banerjee ,  Xiaoyun Zhu ,  Ram Swaminathan ,  Parthasarathy Ranganathan

    IPC分类号： G06F1/26 ,  G06F15/177

    CPC分类号： H04L45/00 ,  H04L45/02 ,  H04L45/127

    摘要： A system for controlling power consumption of a network includes at least one terminal to receive a plurality of requests to route data from a plurality of data sources to a plurality of data sinks, where the data sources and the data sinks are connected to each other through a plurality of network nodes forming the network, and a network configuration unit. The network configuration unit includes a selection module configured to select a configuration of the network nodes that allows the network to have a lowest overall power consumption of the network among a plurality of configurations of the network, and an output module configured to output a plurality of instruction signals to the network nodes to perform the network configuration. A network path for transmitting a network flow is selected that does not allow the network flow to be split and flow through another network path.

    摘要翻译： 用于控制网络功耗的系统包括至少一个终端，用于接收多个请求以将数据从多个数据源路由到多个数据宿，其中数据源和数据宿通过彼此连接 形成网络的多个网络节点，以及网络配置单元。 网络配置单元包括：选择模块，被配置为选择允许网络在网络的多个配置中具有网络的最低​​总功耗的网络节点的配置;以及输出模块，被配置为输出多个 指示信号到网络节点执行网络配置。 选择用于发送网络流的网络路径，其不允许网络流被分裂并流过另一网络路径。