专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2016124246A1 A SYSTEM, A NODE, A METHOD IN A COMMUNICATION NETWORK AND A COMPUTER PROGRAM AND CORRESPONDING COMPUTER PROGRAM PRODUCT 审中-公开
标题翻译：通信网络中的系统，节点，方法和计算机程序和对应的计算机程序产品
公开(公告)号：WO2016124246A1
公开(公告)日：2016-08-11
申请号：PCT/EP2015/052491
申请日：2015-02-06
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
发明人： HÄGGLUND, Andreas , KRISTIANSSON, Johan
IPC分类号： H04L29/08
CPC分类号： H04L67/1065 , H04L67/107 , H04L67/1072 , H04L67/16 , H04L67/34
摘要： An object of the present invention is to develop scalable and decentralized cloud platforms. That is achieved by introducing geographical process lookup.In this specification, geographical process lookup implies finding a running software process running a runtime environment associated with a geographical location. This process can also be used to find a runtime environment to deploy a new (software)process. According to embodiments of the present invention geographical process lookup is accomplished by combining geohash and Kademlia's ability to find nodes that are close to each other and by introducing special software agents so called process runtime agents, which are responsible for managing (e.g. deploying/starting) software processes. Geographical process lookup is then achieved according to embodiments by storing references to the process runtime agents in the DHT as key-values, with the key being the agent's geohash string generated from their geographic latitude and longitude coordinates, and the value being other information e.g. how to connect to the agent.
摘要翻译：本发明的目的是开发可扩展和分散的云平台。这通过引入地理过程查找来实现。在本规范中，地理过程查找意味着找到运行与地理位置相关联的运行时环境的软件进程。此过程也可用于查找运行时环境以部署新的（软件）进程。根据本发明的实施例，地理过程查找是通过结合geohash和Kademlia找到彼此接近的节点的能力并通过引入所谓的进程运行时代理程序的特殊软件代理来实现的，这些代理负责管理（例如部署/启动）软件流程。然后根据实施例通过将对DHT中的过程运行时代理的引用存储为键值来实现地理过程查找，其中密钥是从其地理纬度和经度坐标生成的代理的地理位置字符串，并且该值是其他信息。如何连接到代理。

2. 发明申请

WO2010047739A2 RAPID DISSEMINATION OF BULK INFORMATION TO WIDELY DISPERSED NETWORK NODES 审中-公开
标题翻译：快速发布大容量信息到宽带分布式网络节点
公开(公告)号：WO2010047739A2
公开(公告)日：2010-04-29
申请号：PCT/US2009005387
申请日：2009-09-30
申请人： SILVER SPRING NETWORKS INC , VAN GREUNEN JANA , SAN FILIPPO WILLIAM III , HUGHES STERLING
发明人： VAN GREUNEN JANA , SAN FILIPPO WILLIAM III , HUGHES STERLING
IPC分类号： H04L12/56
CPC分类号： H04L67/104 , H04L67/1002 , H04L67/101 , H04L67/1055 , H04L67/107 , H04L67/1072 , H04L67/1076
摘要： Bulk information is transferred to nodes in a communication network having a plurality of widely dispersed nodes. The information can be an image, content, or configuration information. The information is uni-cast to a selection of nodes by a central node or server, to seed the information at certain nodes in the network. The information is then distributed by these seed nodes to every other node in the network. A first algorithm selects which nodes should be seeded with information by the central node. A second algorithm distributes information in the network on a query basis.
摘要翻译：批量信息被传送到具有多个广泛分散的节点的通信网络中的节点。信息可以是图像，内容或配置信息。该信息由中央节点或服务器统一到节点的选择，以将信息种植在网络中的某些节点处。然后，这些信息由这些种子节点分发给网络中的每个其他节点。第一种算法选择哪些节点应该由中央节点接收信息。第二种算法是在查询的基础上分配网络中的信息。

3. 发明申请

WO2008022328A2 SYSTEM AND METHOD OF SELECTIVE MEDIA CONTENT ACCESS THROUGH A RECOMMENDATION ENGINE 审中-公开
标题翻译：通过推荐发动机选择性媒体内容的系统和方法
公开(公告)号：WO2008022328A2
公开(公告)日：2008-02-21
申请号：PCT/US2007/076236
申请日：2007-08-17
申请人： SONY CORPORATION , SONY ELECTRONICS, INC. , GEORGIS, Nikolaos , LIN, Frank Li-De , HWANG, Paul , CHANG, Liang-jye , KUROKO, Masashi , MILLER, Timothy , NGUYEN, Djung , ZHENG, Jianyu, Roy , HANSON, Mark, A. , TSUCHIKWA, Gen , COLSEY, Nicholas, J. , TU, Edgar
发明人： GEORGIS, Nikolaos , LIN, Frank Li-De , HWANG, Paul , CHANG, Liang-jye , KUROKO, Masashi , MILLER, Timothy , NGUYEN, Djung , ZHENG, Jianyu, Roy , HANSON, Mark, A. , TSUCHIKWA, Gen , COLSEY, Nicholas, J. , TU, Edgar
IPC分类号： H04N5/445 , G06F13/00 , H04N7/10 , H04N7/025 , H04N7/16
CPC分类号： H04N7/10 , G06F17/30035 , H04L67/104 , H04L67/107 , H04L67/108 , H04L67/1082 , H04L67/1091 , H04L67/306 , H04N7/17318 , H04N21/25891 , H04N21/26241 , H04N21/2668 , H04N21/4331 , H04N21/4334 , H04N21/44222 , H04N21/4667 , H04N21/4668 , H04N21/472 , H04N21/4755 , H04N21/4756 , H04N21/4788 , H04N21/812
摘要： A personalized entertainment and information platform (Sphere) which provides personalized content delivery across different platforms and modes of delivery. A personal media device (e.g., PC, television, and so forth) interacts with a control server configured for accessing media content and metadata over the Internet. In response to input from the user and the history of user media selection and viewing, a prioritized recommendation list is generated and queued for downloading. The associated content is then downloaded automatically to the personal media device, without the need of user interaction. At this time the user can access the downloaded content immediately without a lengthy delay in waiting for content downloading. It will be appreciated that content such as shows and movies in HD format are of significant size (e.g., up to 50GB) which would require significant download time, and tie up network and system resources.
摘要翻译：个性化娱乐和信息平台（Sphere），提供跨不同平台和交付方式的个性化内容交付。个人媒体设备（例如PC，电视等）与被配置为通过因特网访问媒体内容和元数据的控制服务器进行交互。响应于用户的输入和用户媒体选择和观看的历史，生成优先级推荐列表并排队等待下载。然后将相关联的内容自动下载到个人媒体设备，而不需要用户交互。此时，用户可以在等待内容下载的情况下立即访问下载的内容，而不会有长时间的延迟。应当理解，诸如高清格式的节目和电影之类的内容具有相当大的尺寸（例如高达50GB），这将需要大量的下载时间，并且将网络和系统资源结合起来。

4. 发明申请

WO2006116055A2 FLOWER-PETAL RESOLUTIONS FOR PNRP 审中-公开
标题翻译：用于PNRP的花瓣分辨率
公开(公告)号：WO2006116055A2
公开(公告)日：2006-11-02
申请号：PCT/US2006015049
申请日：2006-04-20
申请人： MICROSOFT CORP
发明人： HORTON NOAH , LIEUALLEN BRIAN R
IPC分类号： H04L12/28
CPC分类号： H04L29/12132 , H04L61/1552 , H04L67/104 , H04L67/107
摘要： The claimed process and system provides a resolution process for a multi-level cache resolution protocol that involves a lookup procedure whereby the initiating node contacts each intermediate node directly using a communication link separate from any previous intermediate node. The resolution process may involve caching information from each contacted intermediate node during the resolution process to request leads on the target node in the form of a list of closer nodes known to the intermediary node.
摘要翻译：所要求的过程和系统为涉及查找过程的多级缓存解析协议提供解析过程，由此起始节点直接使用与任何先前中间节点分离的通信链路直接接触每个中间节点。解析过程可以涉及在解析过程期间从每个被联系的中间节点缓存信息，以中间节点已知的较近节点列表的形式请求目标节点上的线索。

5. 发明申请

WO02057917A2 PEER-TO-PEER NETWORK COMPUTING PLATFORM 审中-公开
标题翻译：对等网络计算平台
公开(公告)号：WO02057917A2
公开(公告)日：2002-07-25
申请号：PCT/US0201362
申请日：2002-01-18
申请人： SUN MICROSYSTEMS INC
发明人： TRAVERSAT BERNARD A , SLAUGHTER GREGORY L , SAULPAUGH THOMAS E , ABDELAZIZ MOHAMED M , DUIGOU MICHAEL J , POUYOUL ERIC , HUGLY JEAN-CHRISTOPHE , GONG LI , YEAGER WILLIAM J , JOY WILLIAM N , CLARY MICHAEL J
IPC分类号： G06F9/445 , G06F9/46 , G06Q30/00 , H04L12/58 , H04L29/06 , H04L29/08 , H04L29/12 , G06F17/60 , H04L12/56
CPC分类号： H04L67/104 , G06F9/4416 , G06F9/544 , G06Q10/10 , G06Q30/02 , H04L29/06 , H04L29/12009 , H04L29/12047 , H04L29/12113 , H04L29/12207 , H04L29/12452 , H04L29/12783 , H04L51/00 , H04L51/04 , H04L61/1541 , H04L61/20 , H04L61/2546 , H04L61/35 , H04L63/0209 , H04L63/029 , H04L63/0428 , H04L63/0442 , H04L63/061 , H04L63/08 , H04L63/0823 , H04L63/10 , H04L63/105 , H04L63/123 , H04L63/126 , H04L63/164 , H04L63/166 , H04L67/1044 , H04L67/1046 , H04L67/1048 , H04L67/1057 , H04L67/1059 , H04L67/1061 , H04L67/1063 , H04L67/1068 , H04L67/107 , H04L67/1093 , H04L67/1095 , H04L67/28 , H04L67/2814 , H04L67/2823 , H04L67/2842 , H04L67/34 , H04L69/329 , Y10S707/99939
摘要： A peer-to-peer platform that may provide mechanisms through which peers may discover each other, communicate with each other, and cooperate with each other to form peer groups is described. The peer-to-peer platform may comprise several layers including a peer-to-peer platform layer, a peer-to-peer services layer, and a peer-to-peer applications layer. At the highest abstraction level, the peer-to-peer platform may be viewed as a set of protocols. Each protocol may be defined by one or more messages exchanged among participants of the protocol. In one embodiment, the peer-to-peer platform may include, but is not limited to, one or more of a peer discovery protocol, a peer resolver protocol, a peer information protocol, a peer membership protocol, a pipe binding protocol, and an endpoint routing protocol. To underpin this set of protocols, the peer-to-peer platform may define a number of concepts including peer, peer group, advertisement, message, pipe, and endpoint.
摘要翻译：一种对等平台，可以提供对等体可以彼此发现，彼此通信，彼此协作以形成对等体组的机制。对等平台可以包括数个层，包括对等平台层，对等服务层和对等应用层。在最高抽象级别，对等平台可以被视为一组协议。每个协议可以由在协议的参与者之间交换的一个或多个消息来定义。在一个实施例中，对等平台可以包括但不限于对等体发现协议，对等解析器协议，对等信息协议，对等成员协议，管道绑定协议和管理绑定协议中的一个或多个端点路由协议。为了支持这套协议，对等平台可以定义许多概念，包括对等体组，对等体组，广告，消息，管道和端点。

6. 发明申请

WO2016138295A1 SCALABLE PEER MATCHING 审中-公开
标题翻译：可扩展对等体
公开(公告)号：WO2016138295A1
公开(公告)日：2016-09-01
申请号：PCT/US2016/019615
申请日：2016-02-25
申请人： MICROSOFT TECHNOLOGY LICENSING, LLC
发明人： HUNT, Brandon T. , BURBA, Alexander
IPC分类号： H04L29/08
CPC分类号： H04L67/104 , H04L67/1046 , H04L67/1048 , H04L67/1055 , H04L67/107 , H04L67/1089 , H04L67/1093
摘要： The techniques and systems described herein implement an improved peer matching service by coordinating peer matching requests across multiple peer matching nodes configured within a peer matching unit so that resource consumption can be spread out and resource limitations are not exceeded. Moreover, the peer matching service can determine if a peer matching unit is overloaded (e.g., experiencing an increased number of requests in a given time interval that is causing performance degradation), and the peer matching service can implement an action to scale out the number of requests within the peer matching unit (e.g., re-distribute some peer matching requests to another peer matching unit). In various examples, the peer matching service can determine if peer devices are co-located peer devices based on location information and can generate a list that prioritizes the co-located peer devices.
摘要翻译：本文描述的技术和系统通过在对等匹配单元内配置的多个对等匹配节点之间协调对等匹配请求来实现改进的对等体匹配服务，使得可以扩展资源消耗并且不超过资源限制。此外，对等体匹配服务可以确定对等匹配单元是否过载（例如，在导致性能下降的给定时间间隔中遇到增加的请求数量），并且对等匹配服务可以实现一个动作以缩小数量（例如，将一些对等匹配请求重新分配给另一个对等体匹配单元）。在各种示例中，对等体匹配服务可以基于位置信息来确定对等设备是否是同位置的对等设备，并且可以生成对共址对等设备进行优先级排列的列表。

7. 发明申请

WO2012115783A1 METHOD AND APPARATUS FOR LOCALIZATION IN PEER-TO-PEER SYSTEMS 审中-公开
标题翻译：在对等系统中本地化的方法和装置
公开(公告)号：WO2012115783A1
公开(公告)日：2012-08-30
申请号：PCT/US2012/024292
申请日：2012-02-08
申请人： ALCATEL LUCENT , STEINER, Moritz, M. , KIM, Kyung, Hwa , VARVELLO, Matteo
发明人： STEINER, Moritz, M. , KIM, Kyung, Hwa , VARVELLO, Matteo
IPC分类号： H04L29/08
CPC分类号： H04L67/1046 , H04L67/1059 , H04L67/107
摘要： A multi-layer peer-to-peer (P2P) capability is provided. A multi-layer P2P system includes a plurality of P2P networks associated with a plurality of hierarchical layers. For example, a first hierarchical layer may include a first P2P network including all peer nodes of the P2P system, and a second hierarchical layer may include a plurality of second P2P networks where the second P2P networks of the second hierarchical layer include respective subsets of the peer nodes of the first P2P network. The second P2P networks of the second hierarchical layer may be organized based on one or more characteristics (e.g., the geographic locations of the peer nodes, the Internet Service Providers (ISPs) with which the peer nodes are associated, and the like). A node participating in the P2P system joins the first P2P network of the P2P system and one of the second P2P networks of the P2P system. The node may then interact with the first P2P network and/or the second P2P network for performing various functions within the P2P system.
摘要翻译：提供了多层对等（P2P）能力。多层P2P系统包括与多层分层相关联的多个P2P网络。例如，第一分层可以包括包括P2P系统的所有对等节点的第一P2P网络，第二分层可以包括多个第二P2P网络，其中第二层次的第二P2P网络包括相应的子集第一个P2P网络的对等节点。可以基于一个或多个特征（例如，与对等节点相关联的对等节点，互联网服务提供商（ISP）的地理位置等）来组织第二层次的第二P2P网络。参与P2P系统的节点加入了P2P系统的第一个P2P网络和P2P系统的第二个P2P网络之一。然后，节点可以与第一P2P网络和/或第二P2P网络交互，以在P2P系统内执行各种功能。

8. 发明申请

WO2010135251A1 LIMITED BROADCAST, PEERING AMONG DHTs, BROADCAST PUT OF LIMITED CONTENT ONLY 审中-公开
标题翻译：有限公司，仅限有限公司的内容广告
公开(公告)号：WO2010135251A1
公开(公告)日：2010-11-25
申请号：PCT/US2010/035126
申请日：2010-05-17
申请人： CISCO TECHNOLOGY, INC. , TIAN, Jining , MEDVED, Jan , DAVIE, Bruce Stuart
发明人： TIAN, Jining , MEDVED, Jan , DAVIE, Bruce Stuart
IPC分类号： H04L29/08 , H04L12/56
CPC分类号： H04L67/104 , H04L45/32 , H04L67/1065 , H04L67/107 , H04L67/1091
摘要： In system of networks that are not fully meshed with each other and that are capable of processing distributed hash table (DHT) Put and Get messages, message flooding of GET messages is limited by maintaining a list of DHTs the GET has visited. Also, PUT messages include not only the storage location key in the home network but also a list of networks that the PUT has visited, in essence establishing a dynamically changing path within the PUT back to the home network.
摘要翻译：在没有完全互相关联并且能够处理分布式散列表（DHT）Put和Get消息的网络系统中，GET消息的消息泛滥受到GET访问的DHT列表的限制。此外，PUT消息不仅包括家庭网络中的存储位置密钥，而且还包括PUT访问的网络列表，其本质上在PUT内建立动态改变的路径回到家庭网络。

9. 发明申请

WO2006018819A1 REAL TIME RESPONSES IN DECENTRALISED NETWORKS 审中-公开
标题翻译：分散式网络中的实时响应
公开(公告)号：WO2006018819A1
公开(公告)日：2006-02-23
申请号：PCT/IB2005/052718
申请日：2005-08-18
申请人： KONINKLIJKE PHILIPS ELECTRONICS N.V. , PETERS, Marc, A. , VAN DEN BOOMEN, Wilhelmus, H., G., M. , KOBZHEV, Alexander, B. , HERON, Dale, R. , ASHLEY, Alexis, S., R.
发明人： PETERS, Marc, A. , VAN DEN BOOMEN, Wilhelmus, H., G., M. , KOBZHEV, Alexander, B. , HERON, Dale, R. , ASHLEY, Alexis, S., R.
IPC分类号： H04L29/08
CPC分类号： H04L67/104 , H04L67/1068 , H04L67/107 , H04L69/329
摘要： A method of enabling a user to obtain a query result in a data network is provided taken latency problems of decentralised networks comprising a number of entities into account. The method comprises the steps of sending a query from a requesting entity to a number of further entities in the data network, receiving responses from at least some of the further entities and determining an initial relative response time for an initial group of said responses,determining a current relative response time for further incoming responses, comparing the initial relative response time with the current relative response time, and presenting the responses to a user of the requesting entity when the difference between the initial relative response time and the current relative response time exceeds a relative response-time parameter. Further, a computer readable medium and a device provided with or for carrying out such methods are provided.
摘要翻译：提供了一种使用户能够在数据网络中获得查询结果的方法，其中考虑到包括多个实体的分散式网络的延迟问题。该方法包括以下步骤：将查询从请求实体发送到数据网络中的多个其他实体，从至少一些其他实体接收响应，并确定初始组的所述响应的初始相对响应时间，确定用于进一步输入响应的当前相对响应时间，将初始相对响应时间与当前相对响应时间进行比较，以及当初始相对响应时间和当前相对响应时间之间的差超过时，向请求实体的用户呈现响应相对响应时间参数。此外，提供了一种计算机可读介质和设置有或用于执行这些方法的设备。

10. 发明申请

WO2004110024A1 LOAD BALANCING IN A PEER TO PEER ENVIROMENT 审中-公开
标题翻译：负载平衡与对等环境
公开(公告)号：WO2004110024A1
公开(公告)日：2004-12-16
申请号：PCT/US2004/017594
申请日：2004-06-02
申请人： SONY COMPUTER ENTERTAINMENT INC. , BATES, John, P. , BERKEY, Howard
发明人： BATES, John, P. , BERKEY, Howard
IPC分类号： H04L29/06
CPC分类号： H04L67/1008 , H04L67/1002 , H04L67/1012 , H04L67/1023 , H04L67/104 , H04L67/1048 , H04L67/1059 , H04L67/107
摘要： A method of dynamically balancing a load on a fully connected grid (FCG) in a peer-to-peer environment includes determining if a first number of peers connected in a first FCG is greater than a preselected limit. If the first number of peers connected to the first FCG is greater than the preselected limit, then partitioning the first FCG into two or more subdivided FCGs, wherein each of the subdivided FCGs includes at least one peer connection that was previously connected in the first FCG. A subdivided location identifier can also be published for each respective resource included in each peer connection. A system for dynamically balancing a load on a fully connected grid (FCG) in a peer-to-peer environment is also described.
摘要翻译：在对等环境中动态平衡完全连接的网格（FCG）上的负载的方法包括确定在第一FCG中连接的第一数量的对等体是否大于预选极限。如果连接到第一FCG的第一数量的对等体大于预先选择的限制，则将第一FCG划分成两个或更多个细分FCG，其中每个细分FCG包括先前连接在第一FCG中的至少一个对等连接。还可以为包括在每个对等连接中的每个相应的资源公布细分位置标识符。还描述了用于在对等环境中动态平衡完全连接网格（FCG）上的负载的系统。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式