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

1. 发明申请

WO2011032986A1 DEVICE AND METHOD FOR GENERATING CONFIRMATIONS OF DATA TRANSFERS BETWEEN COMMUNICATION EQUIPMENTS, BY DATA COMPARISON 审中-公开
标题翻译：通过数据比较产生通信设备之间的数据传输确认的设备和方法
公开(公告)号：WO2011032986A1
公开(公告)日：2011-03-24
申请号：PCT/EP2010/063554
申请日：2010-09-15
申请人： THOMSON LICENSING , PICCONI, Fabio , VARVELLO, Matteo , DIOT, Christophe
发明人： PICCONI, Fabio , VARVELLO, Matteo , DIOT, Christophe
IPC分类号： H04L29/06 , H04L9/32
CPC分类号： H04L63/126
摘要： A method is intended for generating confirmations of data transfers between communication equipments (CE1 -CE2) connected to a communication network (CN). This method consists, when an application running in a first communication equipment (CE1 ) wants to transfer data packets to at least one second communication equipment (CE2), i) in transmitting a request, comprising communication identifiers of the first (CE1 ) and second (CE2) communication equipments and requesting a data transfer control, to first (GW1 ) and second (GW2) auxiliary communication equipments acting as interfaces between the communication network (CN) and the first (CE1 ) and second (CE2) communication equipments, respectively, and ii) in storing auxiliary data representative of these data packets transferred through the first (GW1 ) and second (GW2) auxiliary communication equipments, these stored auxiliary data constituting proofs of transmission of the data packets by the first communication equipment (CE1 ) and of reception of at least some of these data packets by the second communication equipment (CE2).
摘要翻译：一种方法用于产生连接到通信网络（CN）的通信设备（CE1 -CE2）之间的数据传输的确认。该方法包括：当在第一通信设备（CE1）中运行的应用想要将数据分组传送到至少一个第二通信设备（CE2）时，i）在发送请求时，包括第一（CE1）和第二（CE2）通信设备并请求数据传输控制，分别作为通信网络（CN）和第一（CE1和第二（CE2）通信设备之间的接口的第一（GW1）和第二（GW2）辅助通信设备，以及ii）在存储表示通过第一（GW1）和第二（GW2）辅助通信设备传送的这些数据分组的辅助数据时，这些存储的辅助数据构成由第一通信设备（CE1）发送数据分组的证明和由第二通信设备（CE2）接收这些数据分组中的至少一些的至少一些。

2. 发明申请

WO2009027612A3 METHOD FOR CONSTRUCTING A VIRTUAL ENVIRONMENT IN A P2P NETWORK OF THE DELAUNAY TYPE BY DYNAMIC GROUPING OF NODES, ASSISTANCE DEVICE AND RELATED EQUIPMENT 审中-公开
标题翻译：通过动态分组，辅助设备和相关设备构建行星类型的P2P网络中的虚拟环境的方法
公开(公告)号：WO2009027612A3
公开(公告)日：2009-04-16
申请号：PCT/FR2008051517
申请日：2008-08-21
申请人： THOMSON LICENSING , VARVELLO MATTEO , DIOT CHRISTOPHE , BIERSACK ERNST W
发明人： VARVELLO MATTEO , DIOT CHRISTOPHE , BIERSACK ERNST W
IPC分类号： H04L29/06 , H04L29/08
CPC分类号： H04L67/104 , H04L41/0893 , H04L67/1055 , H04L67/1093 , H04L67/38
摘要： The invention relates to a method dedicated to the construction of a virtual environment in a peer-to-peer network of the Delaunay type for peer users associated with communication nodes (N8-N33) capable of mutually exchanging messages. The method comprises i) building node groups (G3) with neighbouring nodes of peer users having a maintenance cost higher than or equal to a selected threshold, and ii) calculating for each group (G3) the value of the surface occupied by the nodes as well as the co-ordinates of a virtual node (NV3) located at the centre of said surface, iii) transmitting to each node of a group (G3) at least the co-ordinates of the virtual node (NV3) of its group (G3) so that it communicates them to its neighbours which are not part of its group (G3) so that they now send to said virtual node (NV3) the messages addressed thereto, and iv) expanding the co-ordinates of each node in each group (G3) based on an expansion ratio particular to its group (G3) so as to reduce the density of this group (G3) proportionally to the corresponding expansion factor.
摘要翻译：本发明涉及一种专用于在与能够相互交换消息的通信节点（N8-N33）相关联的对等用户的Delaunay类型的对等网络中构建虚拟环境的方法。该方法包括：i）将具有维护成本高于或等于所选阈值的对等用户的相邻节点建立节点组（G3），以及ii）针对每个组（G3）计算由节点占据的表面的值以及位于所述表面中心的虚拟节点（NV3）的坐标，iii）至少向其组的虚拟节点（NV3）的坐标发送组（G3）的每个节点（ G3），使得它们将其传送给不属于其组（G3）的其邻居，使得它们现在向所述虚拟节点（NV3）发送寻址到其的消息，以及iv）扩展每个节点中的每个节点的坐标（G3），根据其组（G3）特有的扩张率，与对应的扩张因子成比例地降低该组（G3）的密度。

3. 发明申请

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系统内执行各种功能。

4. 发明申请

WO2010108886A3 DEVICE AND METHOD FOR CONTROLLING DISSEMINATION OF CONTENT DATA BETWEEN PEERS IN A P2P MODE, BY USING A TWO-LEVEL RANDOMIZED PEER OVERLAY AND A DYNAMIC UNCHOKE MECHANISM 审中-公开
标题翻译：通过使用两级随机对等体和动态消除机制来控制P2P模式中的对等体之间的内容数据的发送的装置和方法
公开(公告)号：WO2010108886A3
公开(公告)日：2011-04-07
申请号：PCT/EP2010053697
申请日：2010-03-22
申请人： THOMSON LICENSING , PICCONI FABIO , MASSOULIE LAURENT , VARVELLO MATTEO
发明人： PICCONI FABIO , MASSOULIE LAURENT , VARVELLO MATTEO
IPC分类号： H04L29/08
CPC分类号： H04L67/104 , H04L67/1059
摘要： A method is intended for controlling dissemination of content data in a peer-to- peer mode between peers (P1-P16) connected to different communication networks (N1-N3). This method comprises the steps of: i) building, for each peer, a first peer set comprising active peers that are primary connected neighbours close to this peer in terms of network cost and a second peer set comprising active peers that are secondary connected neighbours of this peer, chosen at random irrespectively of network cost, and ii) dynamically determining into each peer a capacity of content data it is ready to receive from peers of the second peer set, taking into account its current capacity to receive content data from peers of the first peer set, in order to optimize the peer-to-peer dissemination of the content data.
摘要翻译：一种方法用于控制连接到不同通信网络（N1-N3）的对等体（P1-P16）之间的对等模式中的内容数据的传播。该方法包括以下步骤：i）针对每个对等体，构建包括主动对等体的第一对等体，所述主动对等体是网络成本方面的靠近该对等体的主要连接的邻居;以及包括主动对等体的第二对等体，所述主动对等体是次要连接的邻居该对等体随机选择，而不考虑网络成本，以及ii）动态地确定每个对等体具有准备从第二对等体的对等体接收的内容数据的容量，同时考虑其当前接收来自对等体的内容数据的容量第一个对等设置，以便优化内容数据的点对点传播。

5. 发明申请

WO2010108886A2 DEVICE AND METHOD FOR CONTROLLING DISSEMINATION OF CONTENT DATA BETWEEN PEERS IN A P2P MODE, BY USING A TWO-LEVEL RANDOMIZED PEER OVERLAY AND A DYNAMIC UNCHOKE MECHANISM 审中-公开
标题翻译：通过使用两级随机对等体和动态消除机制来控制P2P模式中的对等体之间的内容数据的发送的装置和方法
公开(公告)号：WO2010108886A2
公开(公告)日：2010-09-30
申请号：PCT/EP2010/053697
申请日：2010-03-22
申请人： THOMSON LICENSING , PICCONI, Fabio , MASSOULIE, Laurent , VARVELLO, Matteo
发明人： PICCONI, Fabio , MASSOULIE, Laurent , VARVELLO, Matteo
IPC分类号： H04L29/08
CPC分类号： H04L67/104 , H04L67/1059
摘要： A method is intended for controlling dissemination of content data in a peer-to- peer mode between peers (P1-P16) connected to different communication networks (N1-N3). This method comprises the steps of: i) building, for each peer, a first peer set comprising active peers that are primary connected neighbours close to this peer in terms of network cost and a second peer set comprising active peers that are secondary connected neighbours of this peer, chosen at random irrespectively of network cost, and ii) dynamically determining into each peer a capacity of content data it is ready to receive from peers of the second peer set, taking into account its current capacity to receive content data from peers of the first peer set, in order to optimize the peer-to-peer dissemination of the content data.
摘要翻译：一种方法用于控制连接到不同通信网络（N1-N3）的对等体（P1-P16）之间的对等模式中的内容数据的传播。该方法包括以下步骤：i）针对每个对等体，构建包括主动对等体的第一对等体，所述主动对等体是网络成本方面的靠近该对等体的主要连接的邻居;以及包括主动对等体的第二对等体，所述主动对等体是次要连接的邻居该对等体随机选择，而不考虑网络成本，以及ii）动态地确定每个对等体具有准备从第二对等体的对等体接收的内容数据的容量，同时考虑其当前接收来自对等体的内容数据的容量第一个对等设置，以便优化内容数据的点对点传播。

6. 发明申请

WO2013015950A1 CONTENT POPULARITY EXTRACTION IN DISTRIBUTED HASH TABLE BASED PEER-TO-PEER NETWORKS 审中-公开
标题翻译：基于分布式HASH表的对等网络中的内容大众提取
公开(公告)号：WO2013015950A1
公开(公告)日：2013-01-31
申请号：PCT/US2012/045194
申请日：2012-07-02
申请人： ALCATEL LUCENT , VARVELLO, Matteo , STEINER, Moritz
发明人： VARVELLO, Matteo , STEINER, Moritz
IPC分类号： H04L29/08
CPC分类号： H04L67/1065 , H04L67/1093 , H04L67/22
摘要： Provided is a method for content popularity extraction from a distributed hash table (DHT). The method includes receiving (S420), by a first node (40a-d), a request message from a second node of a peer-to-peer network. Accessing (S425), by the first node, information associated with the request message, the information indicating a content item and a content demand. And determining (S445), by the first node, a content popularity of a plurality of content items based on the information.
摘要翻译：提供了一种从分布式散列表（DHT）中进行内容流行度提取的方法。该方法包括从第一节点（40a-d）接收来自对等网络的第二节点的请求消息（S420）。由第一节点访问（S425）与请求消息相关联的信息，指示内容项目的信息和内容需求。以及基于所述信息，由所述第一节点确定（S445）多个内容项目的内容流行度。

7. 发明申请

WO2012170194A1 ROUTING BY RESOLUTION 审中-公开
标题翻译：解决方案
公开(公告)号：WO2012170194A1
公开(公告)日：2012-12-13
申请号：PCT/US2012/038939
申请日：2012-05-22
申请人： ALCATEL LUCENT , VARVELLO, Matteo , MEMON, Ghulam , RIMAC, Ivica
发明人： VARVELLO, Matteo , MEMON, Ghulam , RIMAC, Ivica
IPC分类号： H04L12/56 , H04L29/08
CPC分类号： H04L45/306 , H04L29/1282 , H04L41/5058 , H04L45/745 , H04L45/7457 , H04L61/106 , H04L61/1541 , H04L61/6013 , H04L63/0272 , H04L63/0281 , H04L63/0407 , H04L67/28 , H04L67/327
摘要： Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving a request message, the request message including a pointer; determining whether the network node is associated with the pointer; and if the network node is associated with the pointer: determining a label associated with the pointer, modifying the request message to produce a modified message, the modified message including the label, and transmitting the modified message to at least one other network node. Various embodiments additionally or alternatively relate a method and related network node including one or more of the following receiving a publish message, wherein the publish message includes a pointer; generating a label to be associated with the pointer; modifying the publish message to produce a modified message, wherein the modified message includes the label; and transmitting the modified message to at least one other network node.
摘要翻译：各种示例性实施例涉及包括以下一个或多个的方法和相关网络节点：接收请求消息，所述请求消息包括指针; 确定所述网络节点是否与所述指针相关联; 并且如果所述网络节点与所述指针相关联：确定与所述指针相关联的标签，修改所述请求消息以产生修改的消息，所述修改的消息包括所述标签，以及将修改的消息发送到至少一个其他网络节点。各种实施例另外或替代地涉及包括以下中的一个或多个的方法和相关网络节点接收发布消息，其中所述发布消息包括指针; 生成与指针相关联的标签; 修改所述发布消息以产生修改的消息，其中所述修改的消息包括所述标签; 以及将修改的消息发送到至少一个其他网络节点。

8. 发明申请

WO2012099745A1 TRAFFIC LOCALIZATION IN PEER-TO-PEER NETWORKS 审中-公开
标题翻译：对等网络中的交通本地化
公开(公告)号：WO2012099745A1
公开(公告)日：2012-07-26
申请号：PCT/US2012/020779
申请日：2012-01-10
申请人： ALCATEL LUCENT , VARVELLO, Matteo , STEINER, Moritz
发明人： VARVELLO, Matteo , STEINER, Moritz
IPC分类号： H04L29/08 , H04L29/06
CPC分类号： H04L67/1061 , H04L67/1065 , H04L67/1068 , H04L67/1072 , H04L69/28
摘要： Provided is a method for localizing peer-to-peer traffic. The method includes transmitting, by a first node of a peer-to-peer network, a first message to one or more other nodes associated with the peer-to-peer network. The message includes a request for content and a deadline for when the content is to be received by the first node.
摘要翻译：提供了一种用于本地化对等流量的方法。所述方法包括由对等网络的第一节点向与所述对等网络相关联的一个或多个其他节点发送第一消息。该消息包括对内容的请求以及何时由第一节点接收内容的截止期限。

9. 发明申请

WO2012027055A1 PEER-TO-PEER TRAFFIC LOCALIZATION FOR CONTENT IN A DISTRIBUTED HASH TABLE 审中-公开
标题翻译：分布式HASH表中内容的对等交通本地化
公开(公告)号：WO2012027055A1
公开(公告)日：2012-03-01
申请号：PCT/US2011/045645
申请日：2011-07-28
申请人： ALCATEL LUCENT , STEINER, Moritz , VARVELLO, Matteo
发明人： STEINER, Moritz , VARVELLO, Matteo
IPC分类号： H04L29/08
CPC分类号： H04L67/104 , H04L67/1002 , H04L67/1021 , H04L67/1065
摘要： Provided is a method for localizing content in a peer-to-peer network. The method includes receiving a message announcing first content. Storing a pair in a table based on the message. The key represents content information and the value represents node information. The node information identifies a node announcing the content, and the content information identifying the content. Storing a plurality of first variation keys in the table. Each of the plurality of first variation keys being a variation of the stored first key. The method further includes intercepting a request message and sending a response to a sender of the request message. The response message including the list of nodes, the list of nodes based on a key based on a destination address of the request message and the table.
摘要翻译：提供了一种用于本地化对等网络中的内容的方法。该方法包括接收宣告第一内容的消息。根据消息在表中存储一个对。密钥表示内容信息，该值表示节点信息。节点信息识别通知内容的节点，以及识别内容的内容信息。在表中存储多个第一变化键。多个第一变化键中的每一个是存储的第一密钥的变体。该方法还包括截取请求消息并向请求消息的发送方发送响应。包括节点列表的响应消息，基于请求消息的目的地地址的基于密钥的节点列表和表。

10. 发明申请

WO2011032987A1 SYSTEM AND METHOD FOR AUTOMATICALLY VERIFYING STORAGE OF REDUNDANT CONTENTS INTO COMMUNICATION EQUIPMENTS, BY DATA COMPARISON 审中-公开
标题翻译：通过数据比较自动验证冗余内容进入通信设备的系统和方法
公开(公告)号：WO2011032987A1
公开(公告)日：2011-03-24
申请号：PCT/EP2010/063555
申请日：2010-09-15
申请人： THOMSON LICENSING , PICCONI, Fabio , VARVELLO, Matteo , DIOT, Christophe
发明人： PICCONI, Fabio , VARVELLO, Matteo , DIOT, Christophe
IPC分类号： G06F17/30 , H04L29/08 , G06F11/14
CPC分类号： H04L63/08 , H04L67/104
摘要： A method is intended for verifying storage of contents into communication equipments (CE1-CE3) connected to at least one communication network (CN). This method consists, when a first communication equipment (CE1) stores a content (F) and wants to verify that this content (F) is still stored into a second communication equipment (CE2): i) in transmitting a first request, comprising at least an identifier of this content (F) and first data representative of this content (F) and requiring verification of the storage of this content (F) into the second communication equipment (CE2), to an auxiliary communication equipment (GW2) acting as an interface between the communication network (CN) and the second communication equipment (CE2), ii) in transmitting a second request, comprising at least the content identifier, to the second communication equipment (CE2), to require transmission of second data representative of the content (F) to the auxiliary communication equipment (GW2), and in triggering a timeout having a chosen duration, and iii) if the auxiliary communication equipment (GW2) has received the second data before expiration of this timeout, in comparing these received second data, possibly after having processed them, to the received first data, and in transmitting a message representative of the result of this comparison to the first communication equipment (CE1).
摘要翻译：一种方法旨在验证内容对连接到至少一个通信网络（CN）的通信设备（CE1-CE3）的存储。该方法包括：当第一通信设备（CE1）存储内容（F）并且想要验证该内容（F）是否仍被存储到第二通信设备（CE2）中时：i）在发送第一请求时，包括：至少表示该内容（F）的标识符和表示该内容（F）的第一数据，并且需要将该内容（F）的存储验证到第二通信设备（CE2）中，以辅助通信设备（GW2）作为通信网络（CN）和第二通信设备（CE2）之间的接口，ii）在向第二通信设备（CE2）发送至少包含内容标识符的第二请求时，要求传输代表辅助通信设备（GW2）的内容（F），以及触发具有所选择的持续时间的超时，以及iii）如果辅助通信设备（GW2）在到期之前已经接收到第二数据这个超时在将这些接收到的第二数据（可能在处理它们之后）与接收到的第一数据进行比较之后，以及将代表该比较结果的消息发送给第一通信设备（CE1）。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式