公开(公告)号：WO2008152035A1

公开(公告)日：2008-12-18

申请号：PCT/EP2008/057224

申请日：2008-06-10

Applicant: ALCATEL LUCENT

Inventor： STRAUSS, Thomas ,  DREWNIOK, Marc

IPC: H04L29/06

CPC classification number: H04L67/104 ,  H04L43/50 ,  H04L63/1416 ,  H04L63/1458 ,  H04L67/1048 ,  H04L67/1093

Abstract: A method for detecting misbehaviour of a peer node within a P2P network is proposed. The method comprises the step to choose a peer node from that network to act as a tester peer. Such a fester peer sends then a testing request message, that testing request message having as target the fester peer itself. The tester peer analyses the behaviour of the P2P network by collecting any possible response message rebted to the testing request message. The tester peer identifies any possible discrepancy with properties governed according to the predefined rules of the P2P network, in case a misbehaviour is found while being unable to identify the misbehaving peer node then a different peer node from the P2P network is chosen to act as a new tester peer till a misbehaving peer couid be identified, or all the peer nodes were tested. Sn the case a misbehaving peer node is identified then latter is isolated from the P2P network.

Abstract translation: 提出了一种用于检测P2P网络中对等节点的不当行为的方法。 该方法包括从该网络中选择对等节点作为测试对等体的步骤。 这样的fester对等体发送测试请求消息，该测试请求消息具有作为目标的测试请求消息。 测试对象通过收集任何可能的响应消息，分析P2P网络的行为。 测试者对等方根据P2P网络的预定义规则识别与属性管理的属性的任何可能的差异，以防在发现不正确的行为，而不能识别不良行为的对等体节点，则来自P2P网络的不同对等节点被选为充当 新的测试对等人，直到行为不正当的对等体被识别，或者所有对等节点都被测试。 在这种情况下，识别出行为不当的对等节点，后者与P2P网络隔离。

公开(公告)号：WO2007048694A2

公开(公告)日：2007-05-03

申请号：PCT/EP2006/067137

申请日：2006-10-06

Applicant: ALCATEL LUCENT ,  STRAUSS, Thomas ,  WAHL, Stefan ,  LAIBLE, Volker

Inventor： STRAUSS, Thomas ,  WAHL, Stefan ,  LAIBLE, Volker

IPC: G06F3/048

CPC classification number: G06F3/04855

Abstract: A method to navigate through content (3, 31 , 32, 33) displayable in a window (1 , 11 , 12, 13) and the like displayed on a screen by using at least one scroll bar (4, 41 , 42r 43, 44, 45, 46) that is movable arranged in a scroll track (5, 51 , 52, 53, 54, 55, 56) at a side (6, 61 , 62, 63) of said window (1 , 11 , 12, 13), is described, wherein by moving said scroll bar (4, 41 , 42, 43, 44, 45, 46) along said scroll track (5, 51 , 52, 53, 54, 55, 56) said content (3, 31 , 32, 33) displayed in said window (1 , 11 , 12, 13) changes, wherein the scroll track (5, 51 , 52, 53, 54, 55, 56) is divided into distinguishable sections (9, 91 , 92, 93, 93’, 93", 93'", 94, 95, 96, 97). Furthermore a computer program product for causing a computer to perform said method, plus a terminal and a server to be used to execute said method are described.

Abstract translation: 一种在通过使用至少一个滚动条（4,41,42r 43，...）显示在屏幕上的窗口（1,11,12,13）中可显示的内容（3,31,32,33）的方法， 44,45,46），其可移动地布置在所述窗（1,11,12,12）的一侧（6,61,62,63）上的涡卷轨道（5,51,52,53,54,55,56）中 ，13），其中通过沿着所述滚动轨道（5,51,52,53,54,55,56）移动所述滚动条（4,41,42,43,44,45,46），所述内容（ 在所述窗口（1,11,12,13）中显示的所述滚动轨迹（5,31,52,53,54,55,56）被分割成可区分的区域（9， 91,92,93,93'，93“，93”“，94,95,96,97）。 此外，描述了一种用于使计算机执行所述方法的计算机程序产品，以及要用于执行所述方法的终端和服务器。

公开(公告)号：WO2009156352A1

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

申请号：PCT/EP2009/057702

申请日：2009-06-19

Applicant: ALCATEL LUCENT ,  SCHWAN, Nico ,  STRAUSS, Thomas ,  TOMSU, Marco

Inventor： SCHWAN, Nico ,  STRAUSS, Thomas ,  TOMSU, Marco

IPC: H04L29/08

CPC classification number: H04L41/0836 ,  H04L12/437 ,  H04L45/28 ,  H04L67/104 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1053

Abstract: The invention concerns a method of providing a successor list (L) for routing in a peer-to-peer overlay network (N), and a network node and a computer program product to execute this method. The peer-to-peer overlay network (N) comprises a plurality of nodes (0, 20, 60, 87, 112, 140, 179, 200, 211, 223, 240), The successor list (L) specifies identifiers of at least two successor nodes (211, 223) subsequently succeeding a first node (200) of the pfurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) with regard to a topoiogy structure of the peer-to-peer overlay network, it is determined whether the at least two successor nodes (211, 223) listed in the successor list (L) run on the same physical hardware, if the at least two successor nodes (211, 223) run on the same physical hardware, an identifier of at least one additional node (240) of the plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) which succeeds the at least two successor nodes (211, 223) with regard to the topoiαgy structure of the peer-to-peer overlay network (N) and runs on a different physical hardware than the at least two successor nodes (211, 223) is added to the successor list (L).

Abstract translation: 本发明涉及一种提供在对等覆盖网络（N）中路由的后继列表（L）的方法，以及用于执行该方法的网络节点和计算机程序产品。 对等覆盖网络（N）包括多个节点（0,20,60,87,112,140,​​179,200,211,223,240），后继列表（L）指定at 至少两个后继节点（211,223）随后在节点（0,20,50,87,112,140,​​179,200,211,223,240）的第一节点（200）之后相对于拓扑结构 所述对等覆盖网络的结构，如果所述至少两个后继节点（211）被确定，则在所述后继列表（L）中列出的所述至少两个后继节点（211,223）是否在同一物理硬件上运行 ，223）在相同的物理硬件上运行，多个节点（0,20,50,97,112,140,​​179,200,211,223,240,240）中的至少一个附加节点（240）的标识符，其中 对于对等覆盖网络（N）的拓扑结构，至少两个后继节点（211,223）成功，并且在与至少两个后继节点（211,223）相同的物理硬件上运行。 加成了成功 或列表（L）。

公开(公告)号：WO2009156263A1

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

申请号：PCT/EP2009/057043

申请日：2009-06-08

Applicant: ALCATEL LUCENT ,  SCHWAN, Nico ,  STRAUSS, Thomas ,  TOMSU, Marco

Inventor： SCHWAN, Nico ,  STRAUSS, Thomas ,  TOMSU, Marco

IPC: H04L29/14 ,  H04L29/08

CPC classification number: H04L67/104 ,  G06F11/2094 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1065 ,  H04L67/1095 ,  H04L69/40

Abstract: Embodiments of the invention concern a method of redundant data storage in a peer-to-peer overlay network (N), and a network node (211) and a computer program product to execute said method. The peer-to-peer overlay network (N) comprises a plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240). A physical hardware on which a first node (211) of said plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) runs is identified. At least one second node (240) of said plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) which runs on a different physical hardware than the first node (211) is determined. A replica (203) of data for which the first node (211) is responsible is stored on the at least one second node (240) in addition to or instead of storing a replica (203) of the data on a next logical node (223) of the first node, whereby said next logical node (223) is a node of the plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) neighbouring the first node (211) with regard to a topology structure of the peer-to-peer overlay network (N).

Abstract translation: 本发明的实施例涉及一种在对等覆盖网络（N）中的冗余数据存储的方法，以及执行所述方法的网络节点（211）和计算机程序产品。 对等覆盖网络（N）包括多个节点（0,20,50,78,112,140,​​177,200,211,223,240,237,2200,211,223,240）。 识别所述多​​个节点（0,20,50,97,112,140,​​177,200,22.1,223,240）中的第一节点（211）在其上运行的物理硬件。 在与第一节点（211）不同的物理硬件上运行的所述多个节点（0,20,50,97,112,140,​​179,200,211,223,240）中的至少一个第二节点（240） 决心，决意，决定。 除了或代替在下一个逻辑节点上存储数据的副本（203）之外，第一节点（211）负责的数据的副本（203）被存储在至少一个第二节点（240）上 223），由此所述下一个逻辑节点（223）是与第一节点相邻的多个节点（0,20,50,78,112,140,​​177,200,211,223,240）的节点 （211）关于对等覆盖网络（N）的拓扑结构。

公开(公告)号：WO2008155262A2

公开(公告)日：2008-12-24

申请号：PCT/EP2008/057223

申请日：2008-06-10

Applicant: ALCATEL LUCENT

Inventor： STRAUSS, Thomas ,  TOMSU, Marco ,  DREWNIOK, Marc

IPC: H04L29/06

CPC classification number: H04L67/16 ,  H04L67/104 ,  H04L67/1048 ,  H04L67/1065 ,  H04L69/40

Abstract: The application concerns a method for invoking a communication service that is realized by means of a peer of a peer-to-peer system, the method comprising the step of identifying a peer hosting the communication service and invoking the communication service by means of a distributed directory, where the distributed directory carrying entries that enable a client to invoke the communication service, the method further comprising the step of identifying an alternative peer hosting an alternative communication service in case the identified peer or the communication service is unavailable, where the distributed directory carrying entries that enable a client to invoke the alternative communication service. And the application concerns a computer software product and a telecommunication system for providing communication services corresponding to the method.

Abstract translation: 该应用涉及一种用于调用通过对等系统的对等体实现的通信服务的方法，该方法包括识别承载通信服务的对等体并通过分布式调用通信服务来调用通信服务的步骤 目录，其中所述分发目录携带使客户端能够调用所述通信服务的条目，所述方法还包括以下步骤：识别所识别的对等体或所述通信服务不可用的情况下识别替代通信服务的替代对等体，其中所述分发目录 携带使客户端能够调用替代通信服务的条目。 该应用涉及一种用于提供与该方法对应的通信服务的计算机软件产品和电信系统。

公开(公告)号：WO2014060193A1

公开(公告)日：2014-04-24

申请号：PCT/EP2013/069760

申请日：2013-09-24

Applicant: ALCATEL LUCENT

Inventor： FÖRSTER, Christopher ,  STRAUSS, Thomas

IPC: H04L29/08 ,  H04L29/14 ,  H04L29/06

CPC classification number: H04L67/20 ,  H04L67/2828 ,  H04L69/14 ,  H04L69/40

Abstract: The present invention concerns a method for automatic integration of content from third-party providers in client-server arrangements comprising at least one client and at least one server. The method comprises downloading by a server data from one or more data sources (3) external to both of the client and the server, filtering the data downloaded from the one or more external data sources (3) and providing a first (1) and a second set (2) of data for a client application (4), the first set of data (1) comprising a copy of the initial data from the external data source (3) and the second set of data (2) comprising a clone of the external data source (3). The present invention concerns further a data management system (100) adapted to implement steps of the method for automatic integration of content from third-party providers in client-server arrangements.

Abstract translation: 本发明涉及一种用于在包括至少一个客户端和至少一个服务器的客户机 - 服务器布置中自动整合来自第三方提供商的内容的方法。 该方法包括通过服务器从客户端和服务器外部的一个或多个数据源（3）下载数据，对从一个或多个外部数据源（3）下载的数据进行过滤，并提供第一（1）和 用于客户端应用（4）的第二组数据（2），所述第一组数据（1）包括来自外部数据源（3）的初始数据和第二组数据（2）的副本，包括 克隆外部数据源（3）。 本发明还涉及一种数据管理系统（100），适用于实现在客户机 - 服务器装置中从第三方提供商自动整合内容的方法的步骤。

公开(公告)号：WO2014005867A1

公开(公告)日：2014-01-09

申请号：PCT/EP2013/063102

申请日：2013-06-24

Applicant: ALCATEL LUCENT

Inventor： FOERSTER, Christopher ,  STRAUSS, Thomas

IPC: H04L29/06 ,  H04W4/00 ,  G06F21/10

CPC classification number: H04L63/102 ,  G06F21/10 ,  G06F21/335 ,  H04L63/0884 ,  H04L63/104 ,  H04L67/10 ,  H04L2463/101

Abstract: The present invention relates to a method for granting access from a cloud server (2) to a client device (3, 4), comprising the steps of authorizing a user of a first client device (3), receiving an authorization voucher request from the first client device (3), generating an authorization voucher for accessing the cloud server (2), providing the authorization voucher to the first client device (3), receiving the authorization voucher from a second client device (4), granting access to the second client device (4) based on the authorization voucher. The present invention also relates to a cloud server (2) adapted to perform the above method. The present invention further relates to a method for requesting access to a cloud server (2), comprising the steps of authorizing a user using a first client device (3) to the cloud server (2), sending an authorization voucher request from the first client device (3) to the cloud server (2), receiving an authorization voucher for accessing the cloud server (2) at the first client device (3), transmitting the authorization voucher from the first client device (3) to a second client device (4), transmitting the authorization voucher from the second client device (4) to the cloud server (3), and accessing the cloud server (2) from the second client device (4).

Abstract translation: 本发明涉及一种用于授权从云服务器（2）到客户端设备（3,4）的访问的方法，包括以下步骤：授权第一客户端设备（3）的用户，从所述客户端设备（3）接收授权凭证请求 第一客户端设备（3），生成用于访问云服务器（2）的授权凭单，向第一客户端设备（3）提供授权凭证，从第二客户端设备（4）接收授权凭证，授权访问 第二客户端设备（4）基于授权凭证。 本发明还涉及适于执行上述方法的云服务器（2）。 本发明还涉及一种用于请求访问云服务器（2）的方法，包括以下步骤：向云服务器（2）授权使用第一客户端设备（3）的用户，从第一服务器（2）发送授权凭单请求 客户端设备（3）发送到云服务器（2），接收用于在第一客户端设备（3）访问云服务器（2）的授权凭证，将授权凭证从第一客户端设备（3）发送到第二客户端 将所述授权凭证从所述第二客户端设备（4）发送到所述云服务器（3）的设备（4），以及从所述第二客户端设备（4）访问所述云服务器（2）。

公开(公告)号：WO2013056919A1

公开(公告)日：2013-04-25

申请号：PCT/EP2012/068088

申请日：2012-09-14

Applicant: ALCATEL LUCENT ,  FOERSTER, Christopher ,  STRAUSS, Thomas ,  SCHREIBER, Alexander ,  KIRCHMANN, Marc

Inventor： FOERSTER, Christopher ,  STRAUSS, Thomas ,  SCHREIBER, Alexander ,  KIRCHMANN, Marc

IPC: H04L29/06 ,  H04L29/08 ,  H04L12/24

CPC classification number: H04L41/0266 ,  H04L41/0843 ,  H04L41/0893 ,  H04L67/02 ,  H04L67/125 ,  H04L67/42

Abstract: Method of managing a network of clients, the method comprising the steps of maintaining a plurality of commands on a server and, in response to receiving a request from a client, composing, based on a property of the client, a command file from the plurality of commands and submitting the command file to the client.

Abstract translation: 管理客户端网络的方法，所述方法包括以下步骤：在服务器上维护多个命令，并且响应于接收到来自客户端的请求，基于所述客户端的属性来组合来自所述多个客户端的命令文件 的命令并将命令文件提交给客户端。

公开(公告)号：WO2009156353A1

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

申请号：PCT/EP2009/057704

申请日：2009-06-19

Applicant: ALCATEL LUCENT ,  SCHWAN, Nico ,  STRAUSS, Thomas ,  TOMSU, Marco

Inventor： SCHWAN, Nico ,  STRAUSS, Thomas ,  TOMSU, Marco

IPC: H04L12/56 ,  H04L29/08

CPC classification number: H04L67/104 ,  H04L45/00 ,  H04L45/64 ,  H04L67/1053

Abstract: The invention concerns a method of determining a routing path in a peer-to- peer overlay network (H), and a network node (20) and a computer program product to execute said method. The peer-to-peer overlay network (N) comprises a plurality of nodes (O, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240), A physical hardware on which a first node (20) of said plurality of nodes (0, 20, 50, 87, 112, 140, 179, 200, 211, 223, 240) runs is identified. At least one second node (112, 211) of said plurality of nodes (0, 2O, 50, 87, 112, 140, 179, 200, 211, 223, 240) which runs on the same physical hardware as the first node (20) is identified. A data set specifying an identifier of said at least one second node (112, 211 ) is generated. Said data set is stored as a zero-path table associated with the first node (20). When determining said routing path, said data set is accessed and a link (ZL1, ZL2) between said first node (20) and said at least one second node (112, 211) based on said zero-path table is selected.

Abstract translation: 本发明涉及一种确定对等覆盖网络（H）中的路由路径的方法以及执行所述方法的网络节点（20）和计算机程序产品。 对等覆盖网络（N）包括多个节点（O，20,50,87,112,140,​​179,200,211,223,240），物理硬件，第一节点（20） ）所述多个节点（0,20,50,97,112,140,​​179,200,211,223,240）的运行被识别。 在与第一节点相同的物理硬件上运行的所述多个节点（0,20.0,57,112,140,​​179,200,211,223,240）中的至少一个第二节点（112,211） 20）。 生成指定所述至少一个第二节点（112,211）的标识符的数据集。 所述数据集存储为与第一节点（20）相关联的零路径表。 当确定所述路由路径时，访问所述数据集，并且选择基于所述零路径表的所述第一节点（20）和所述至少一个第二节点（112,211）之间的链路（ZL1，ZL2）。

公开(公告)号：WO2008003596A1

公开(公告)日：2008-01-10

申请号：PCT/EP2007/056200

申请日：2007-06-21

Applicant: ALCATEL LUCENT

Inventor： SCHWAN, Nico ,  STRAUSS, Thomas ,  TOMSU, Marco ,  SIENEL, Jürgen ,  KESSLER, Marcus

IPC: H04L29/06 ,  G06F17/30

CPC classification number: G06F17/3033 ,  G06F17/30545 ,  H04L67/104 ,  H04L67/1046 ,  H04L67/1048 ,  H04L67/1065

Abstract: The invention concerns a method for retrieving content of a distributed directory of a telecommunication system comprising a plurality of nodes (900,..., 2200) arranged in a directed ring topology, the method comprising the steps of identifying a storage location of said content by means of a distributed hashing function, where the hashing function maps an element onto a node, where the node (1300) is responsible carrying elements with a hash value between the node and its successor node. The invention further concerns a corresponding computer software product, telecommunication device, and a telecommunication system.

Abstract translation: 本发明涉及一种用于检索电信系统的分布式目录的内容的方法，包括以定向环形拓扑布置的多个节点（900，...，2200），该方法包括以下步骤：识别所述内容的存储位置 借助于分散哈希函数，其中散列函数将元素映射到节点上，其中节点（1300）负责承载具有节点和其后继节点之间的散列值的元素。 本发明还涉及相应的计算机软件产品，电信设备和电信系统。