利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

61 条记录 (耗时 0.02 秒)

    Distributed network distance determination using a distributed hash table overlay network
    31.
    发明授权
    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
    32.
    发明申请
    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.

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

    Query Deployment Plan For A Distributed Shared Stream Processing System
    36.
    发明申请
    Query Deployment Plan For A Distributed Shared Stream Processing System 审中-公开
    分布式共享流处理系统的查询部署计划

    公开(公告)号：US20090192981A1

    公开(公告)日：2009-07-30

    申请号：US12244878

    申请日：2008-10-03

    申请人： Olga Papaemmanouil ,  Sujoy Basu ,  Sujata Banerjee

    发明人： Olga Papaemmanouil ,  Sujoy Basu ,  Sujata Banerjee

    IPC分类号： G06F17/30

    CPC分类号： G06F16/24568 ,  G06F16/2471

    摘要： A method of providing a deployment plan for a query in a distributed shared stream processing system includes storing a set of feasible deployment plans for a query that is currently deployed in the stream processing system. A query includes a plurality of operators hosted on nodes in the stream processing system providing a data stream responsive to a client request for information. The method also includes determining whether a QoS metric constraint for the query is violated, and selecting a deployment plan from the set of feasible deployment plans to be used for providing the query in response to determining the QoS metric constraint is violated.

    摘要翻译： 在分布式共享流处理系统中为查询提供部署计划的方法包括为当前部署在流处理系统中的查询存储一组可行部署计划。 查询包括托管在流处理系统中的节点上的多个运营商，提供响应于客户端信息请求的数据流。 该方法还包括确定是否违反了查询的QoS度量约束，并且违反了用于响应于确定QoS度量约束而用于提供查询的一组可行部署计划中的部署计划。

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

    公开(公告)号：US20070033167A1

    公开(公告)日：2007-02-08

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

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

    Selecting nodes close to another node in a network using location information for the nodes
    39.
    发明申请
    Selecting nodes close to another node in a network using location information for the nodes 有权
    使用节点的位置信息选择靠近网络中另一个节点的节点

    公开(公告)号：US20050198286A1

    公开(公告)日：2005-09-08

    申请号：US10767285

    申请日：2004-01-30

    申请人： Zhichen Xu ,  Sujata Banerjee ,  Sung-Ju Lee

    发明人： Zhichen Xu ,  Sujata Banerjee ,  Sung-Ju Lee

    IPC分类号： H04L12/56 ,  G06F15/173

    CPC分类号： H04L45/02 ,  H04L45/126 ,  H04L45/46 ,  H04L45/54

    摘要： A network includes a plurality of nodes. A set of candidate nodes from the plurality of nodes is selected based on location information for the candidate nodes and a first node also in the network. A clustering algorithm is applied to the location information for the candidate nodes and the first node, and a subset of the set of candidate nodes closest to the first node is identified based on the results of applying the clustering algorithm.

    摘要翻译： 网络包括多个节点。 基于候选节点的位置信息和网络中的第一节点来选择来自多个节点的一组候选节点。 聚类算法应用于候选节点和第一节点的位置信息，并且基于应用聚类算法的结果来识别最接近第一节点的候选节点集合的子集。