利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

54 条记录 (耗时 0.047 秒)

    Methods and apparatus for proxying of devices and services using overlay networks
    1.
    发明授权
    Methods and apparatus for proxying of devices and services using overlay networks 有权
    使用覆盖网络代理设备和服务的方法和设备

    公开(公告)号：US08606967B2

    公开(公告)日：2013-12-10

    申请号：US12485538

    申请日：2009-06-16

    申请人： Vidya Narayanan ,  Ranjith S. Jayaram ,  Lakshminath R. Dondeti ,  Edward T. L. Hardie ,  Noam A. Ziv ,  Ramachandran Subramanian

    发明人： Vidya Narayanan ,  Ranjith S. Jayaram ,  Lakshminath R. Dondeti ,  Edward T. L. Hardie ,  Noam A. Ziv ,  Ramachandran Subramanian

    IPC分类号： G06F13/00

    CPC分类号： H04L67/104 ,  H04L67/1063 ,  H04L67/1065 ,  H04L67/1091 ,  H04L67/1093 ,  H04L67/2814

    摘要： Methods and apparatus for proxying of devices and services using overlay networks. A method for operating a proxy includes obtaining meta-data associated with at least one of a device and a service, generating a searchable index of the meta-data, and publishing the searchable index on the overlay network as at least one of a distributed index and a centralized index. Another method includes receiving a request from a device or a service using a non overlay protocol to receive at least one of data and services from the overlay network, searching an index of meta-data on the overlay network based on the request, identifying a node associated with the at least one of data and services based on the index, establishing a direct connection with the node, and obtaining the at least one of data and services using the direct connection.

    摘要翻译： 使用覆盖网络代理设备和服务的方法和设备。 用于操作代理的方法包括获得与设备和服务中的至少一个相关联的元数据，生成元数据的可搜索索引，以及在覆盖网络上发布可搜索索引作为分布式索引 和集中索引。 另一种方法包括使用非覆盖协议从设备或服务接收请求，以从覆盖网络接收数据和服务中的至少一个，基于该请求搜索覆盖网络上的元数据的索引，识别节点 与所述索引中的所述至少一个数据和服务相关联，建立与所述节点的直接连接，以及使用所述直接连接来获得所述数据和服务中的至少一个。

    METHODS AND APPARATUS FOR PROXYING OF DEVICES AND SERVICES USING OVERLAY NETWORKS
    2.
    发明申请
    METHODS AND APPARATUS FOR PROXYING OF DEVICES AND SERVICES USING OVERLAY NETWORKS 有权
    使用覆盖网络来代理设备和服务的方法和设备

    公开(公告)号：US20090313290A1

    公开(公告)日：2009-12-17

    申请号：US12485538

    申请日：2009-06-16

    申请人： Vidya Narayanan ,  Ranjith S. Jayaram ,  Lakshminath R. Dondeti ,  Edward T. L. Hardie ,  Noam A. Ziv ,  Ramachandran Subramanian

    发明人： Vidya Narayanan ,  Ranjith S. Jayaram ,  Lakshminath R. Dondeti ,  Edward T. L. Hardie ,  Noam A. Ziv ,  Ramachandran Subramanian

    IPC分类号： G06F17/30 ,  G06F15/16

    CPC分类号： H04L67/104 ,  H04L67/1063 ,  H04L67/1065 ,  H04L67/1091 ,  H04L67/1093 ,  H04L67/2814

    摘要： Methods and apparatus for proxying of devices and services using overlay networks. A method for operating a proxy includes obtaining meta-data associated with at least one of a device and a service, generating a searchable index of the meta-data, and publishing the searchable index on the overlay network as at least one of a distributed index and a centralized index. Another method includes receiving a request from a device or a service using a non overlay protocol to receive at least one of data and services from the overlay network, searching an index of meta-data on the overlay network based on the request, identifying a node associated with the at least one of data and services based on the index, establishing a direct connection with the node, and obtaining the at least one of data and services using the direct connection.

    摘要翻译： 使用覆盖网络代理设备和服务的方法和设备。 用于操作代理的方法包括获得与设备和服务中的至少一个相关联的元数据，生成元数据的可搜索索引，以及在覆盖网络上发布可搜索索引作为分布式索引 和集中索引。 另一种方法包括使用非覆盖协议从设备或服务接收请求，以从覆盖网络接收数据和服务中的至少一个，基于请求搜索覆盖网络上的元数据的索引，识别节点 与所述索引中的所述至少一个数据和服务相关联，建立与所述节点的直接连接，以及使用所述直接连接来获得所述数据和服务中的至少一个。

    Secure node identifier assignment in a distributed hash table for peer-to-peer networks
    3.
    发明授权
    Secure node identifier assignment in a distributed hash table for peer-to-peer networks 有权
    用于对等网络的分布式哈希表中的安全节点标识符分配

    公开(公告)号：US09344438B2

    公开(公告)日：2016-05-17

    申请号：US12342021

    申请日：2008-12-22

    申请人： Lu Xiao ,  Vidya Narayanan ,  Edward Thomas Lingham Hardie ,  Ranjith S. Jayaram ,  Ramachandran Subramanian ,  Lakshminath Reddy Dondeti

    发明人： Lu Xiao ,  Vidya Narayanan ,  Edward Thomas Lingham Hardie ,  Ranjith S. Jayaram ,  Ramachandran Subramanian ,  Lakshminath Reddy Dondeti

    IPC分类号： G06F15/16 ,  H04L29/06 ,  H04L29/08

    CPC分类号： H04L63/126 ,  H04L63/1458 ,  H04L63/1466 ,  H04L67/104 ,  H04L67/1046 ,  H04L67/1057 ,  H04L2463/142

    摘要： A multi-party commitment method is provided whereby a joining node uses contributions provided by contributor nodes in a peer-to-peer overlay network to generate a node identifier. The joining node generates a first contribution and sends a join request to an introducer node (or a plurality of contributor nodes), where the join request seeks to obtain one or more contributions for generating the node identifier within an identifier space of the overlay network. A hash of the first contribution may be included as part of the join request. In response, the joining node may receive a plurality of contributions, wherein the contributions are bound to each other and the first contribution by a prior external multi-node commitment operation. The joining node can then generate its node identifier as a function of the first contribution and the received contributions. Consequently, collusion between nodes and malicious manipulation during ID generation can be frustrated.

    摘要翻译： 提供了一种多方承诺方法，其中加入节点使用对等覆盖网络中的贡献者节点提供的贡献来生成节点标识符。 加入节点生成第一贡献并将连接请求发送到导引器节点（或多个贡献者节点），其中连接请求寻求获得用于在覆盖网络的标识符空间内生成节点标识符的一个或多个贡献。 作为连接请求的一部分，可以包括第一贡献的散列。 作为响应，加入节点可以接收多个贡献，其中贡献通过先前的外部多节点承诺操作彼此绑定和第一贡献。 然后，加入节点可以生成其作为第一贡献和接收到的贡献的函数的节点标识符。 因此，在ID生成期间，节点之间的串通和恶意操纵可能会受挫。

    SECURE NODE IDENTIFIER ASSIGNMENT IN A DISTRIBUTED HASH TABLE FOR PEER-TO-PEER NETWORKS
    4.
    发明申请
    SECURE NODE IDENTIFIER ASSIGNMENT IN A DISTRIBUTED HASH TABLE FOR PEER-TO-PEER NETWORKS 有权
    用于对等网络的分布式散列表中的安全节点标识符分配

    公开(公告)号：US20100161817A1

    公开(公告)日：2010-06-24

    申请号：US12342021

    申请日：2008-12-22

    申请人： Lu Xiao ,  Vidya Narayanan ,  Edward Thomas Lingham Hardie ,  Ranjith S. Jayaram ,  Ramachandran Subramanian ,  Lakshminath Reddy Dondeti

    发明人： Lu Xiao ,  Vidya Narayanan ,  Edward Thomas Lingham Hardie ,  Ranjith S. Jayaram ,  Ramachandran Subramanian ,  Lakshminath Reddy Dondeti

    IPC分类号： G06F15/173

    CPC分类号： H04L63/126 ,  H04L63/1458 ,  H04L63/1466 ,  H04L67/104 ,  H04L67/1046 ,  H04L67/1057 ,  H04L2463/142

    摘要： A multi-party commitment method is provided whereby a joining node uses contributions provided by contributor nodes in a peer-to-peer overlay network to generate a node identifier. The joining node generates a first contribution and sends a join request to an introducer node (or a plurality of contributor nodes), where the join request seeks to obtain one or more contributions for generating the node identifier within an identifier space of the overlay network. A hash of the first contribution may be included as part of the join request. In response, the joining node may receive a plurality of contributions, wherein the contributions are bound to each other and the first contribution by a prior external multi-node commitment operation. The joining node can then generate its node identifier as a function of the first contribution and the received contributions. Consequently, collusion between nodes and malicious manipulation during ID generation can be frustrated.

    摘要翻译： 提供了一种多方承诺方法，其中加入节点使用对等覆盖网络中的贡献者节点提供的贡献来生成节点标识符。 加入节点生成第一贡献并将连接请求发送到导引器节点（或多个贡献者节点），其中连接请求寻求获得用于在覆盖网络的标识符空间内生成节点标识符的一个或多个贡献。 作为连接请求的一部分，可以包括第一贡献的散列。 作为响应，加入节点可以接收多个贡献，其中贡献通过先前的外部多节点承诺操作彼此绑定和第一贡献。 然后，加入节点可以生成其作为第一贡献和接收到的贡献的函数的节点标识符。 因此，在ID生成期间，节点之间的串通和恶意操纵可能会受挫。

    Support for multiple access modes for home base stations
    5.
    发明授权
    Support for multiple access modes for home base stations 有权

    公开(公告)号：US10743251B2

    公开(公告)日：2020-08-11

    申请号：US12607899

    申请日：2009-10-28

    申请人： Gavin B. Horn ,  Osok Song ,  Ramachandran Subramanian

    发明人： Gavin B. Horn ,  Osok Song ,  Ramachandran Subramanian

    IPC分类号： H04W48/20 ,  H04W8/02 ,  H04W48/02

    摘要： Systems and methodologies are described that facilitate supporting multiple access modes for a base station in a wireless communication environment. The base station can leverage hybrid, closed, or open access mode. A whitelist of a mobile device that successfully registers on the base station can be selectively updated to include a CSG ID of the base station. For example, the CSG ID of the base station can be added to the whitelist when the base station operates in closed access mode, while adding the CSG ID can be skipped when the base station operates in hybrid access mode. According to another example, the CSG ID can be selectively added based upon a received accept cause value. Additionally or alternatively, a CSG ID and an access mode indicator can be transmitted from a base station to a network node for implementing access control and/or paging optimization at the network node.

    Method and apparatus for supporting emergency calls (eCalls)
    9.
    发明授权
    Method and apparatus for supporting emergency calls (eCalls) 失效
    支持紧急呼叫的方法和装置（eCalls）

    公开(公告)号：US08200185B2

    公开(公告)日：2012-06-12

    申请号：US12415310

    申请日：2009-03-31

    申请人： Stephen W. Edge ,  Ramachandran Subramanian

    发明人： Stephen W. Edge ,  Ramachandran Subramanian

    IPC分类号： H04M11/04 ,  H04W24/00

    CPC分类号： H04W4/90 ,  H04W76/50

    摘要： Techniques for supporting eCalls are described. In an aspect, an eCall indicator may be used to indicate an eCall being established. In one design, a terminal may generate a message including an eCall indicator and may send the message to originate an eCall. The eCall indicator may indicate (i) whether or not a call is an eCall or (ii) whether an eCall is initiated automatically by the terminal or manually by a user. In another aspect, a terminal may avoid sending signaling for mobility management and connection management to wireless networks except for eCalls and designated calls. The terminal may avoid performing location updating, performing registration, responding to paging requests, etc. The terminal may exchange signaling with a wireless network for an eCall initiated by the terminal. After the eCall is initiated, the terminal may perform location updating with the wireless network and call establishment for the eCall.

    摘要翻译： 描述了用于支持eCall的技术。 在一方面，eCall指示符可以用于指示正​​在建立的eCall。 在一种设计中，终端可以生成包括eCall指示符的消息，并且可以发送消息来发起eCall。 eCall指示符可以指示（i）呼叫是否是eCall，或者（ii）eCall是由终端自动启动还是由用户手动启动。 在另一方面，终端可以避免发送用于移动性管理和连接管理到除了eCall和指定呼叫之外的无线网络的信令。 终端可以避免执行位置更新，执行注册，响应寻呼请求等。终端可以与由终端发起的eCall的无线网络交换信令。 在eCall启动之后，终端可以利用无线网络执行位置更新，并为eCall呼叫建立。

    CYCLE PLANNING TOOL WITH EVENT CONFLICT RESOLUTION FOR TERRITORY MANAGEMENT
    10.
    发明申请
    CYCLE PLANNING TOOL WITH EVENT CONFLICT RESOLUTION FOR TERRITORY MANAGEMENT 有权
    周期规划工具与事件冲突解决区域管理

    公开(公告)号：US20120004941A1

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

    申请号：US13234892

    申请日：2011-09-16

    申请人： Kim Aleksiejczyk ,  Mietek Ciszkowski ,  Sayee Natarajan ,  Jake Stahl ,  Ramachandran Subramanian

    发明人： Kim Aleksiejczyk ,  Mietek Ciszkowski ,  Sayee Natarajan ,  Jake Stahl ,  Ramachandran Subramanian

    IPC分类号： G06Q10/00

    CPC分类号： G06Q10/06 ,  G06Q10/0631 ,  G06Q10/1093 ,  G06Q10/1097

    摘要： Electronically creating a schedule plan of events which replicates one or more previously scheduled events. A source date range is acquired into a memory of a machine A set of previously scheduled events within the source date range is identified. A target date range is received through a user interface. At least a portion of the previously scheduled events is assigned to a date within the received target date range to create the schedule plan. The schedule plan is posted to a calendar. Another method creates a schedule plan on the basis of one or more search criteria used for identifying any match from a database. At least a portion of any matches are assigned a time slot within a target date range of a calendar program.

    摘要翻译： 电子地创建复制一个或多个先前安排的事件的事件的计划计划。 源日期范围被获取到机器的存储器中。识别源日期范围内的一组先前调度的事件。 通过用户界面接收目标日期范围。 至少一部分先前计划的事件被分配到接收的目标日期范围内的日期以创建调度计划。 时间表计划已发布到日历。 另一种方法基于用于识别来自数据库的任何匹配的一个或多个搜索条件来创建计划计划。 任何比赛的至少一部分在日历程序的目标日期范围内被分配一个时隙。