公开(公告)号：US20110116381A1

公开(公告)日：2011-05-19

申请号：US13003040

申请日：2008-07-09

申请人： Pekka Nikander ,  Mikko Sarela

发明人： Pekka Nikander ,  Mikko Sarela

IPC分类号： H04L12/26

CPC分类号： H04L63/08 ,  H04L12/1868 ,  H04L63/1458 ,  H04L67/2819

摘要： A method of controlling traffic flow through a service node located within a packet network, which traffic flow originates at a plurality of sending nodes and is destined for a receiving node. The service node is one of a multiplicity of service nodes configured in a tree or other acyclic structure, e.g. of an overlay network. The method comprises receiving a challenge from said receiving node or a downstream service node, generating and caching a further challenge, and combining that further challenge with the received challenges to generate a modified challenge. The modified challenge is then sent to a sending node or to an upstream service node. Subsequently, a request is received, destined for said receiving node and originating at a sending node. A solution accompanying said request is validated using the cached further challenge, and the request forwarded towards said receiving node only if the solution is valid. Otherwise, the request is dropped.

摘要翻译： 控制通过位于分组网络内的服务节点的业务流的方法，所述业务流在多个发送节点发起并且发往接收节点。 服务节点是以树或其他非循环结构配置的多个服务节点之一，例如， 的覆盖网络。 所述方法包括从所述接收节点或下游服务节点接收挑战，产生和缓存进一步的挑战，以及将所述进一步的挑战与所接收的挑战结合以产生经修改的挑战。 然后将修改的挑战发送到发送节点或上游服务节点。 随后，接收到发往所述接收节点并发送在发送节点的请求。 伴随所述请求的解决方案使用缓存的进一步的挑战来验证，并且仅当该解决方案有效时才向所述接收节点转发该请求。 否则，请求被删除。

公开(公告)号：US08547848B2

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

申请号：US13003040

申请日：2008-07-09

申请人： Pekka Nikander ,  Mikko Sarela

发明人： Pekka Nikander ,  Mikko Sarela

IPC分类号： H04L12/26 ,  H04L9/00 ,  H04L9/32 ,  H04M1/66

CPC分类号： H04L63/08 ,  H04L12/1868 ,  H04L63/1458 ,  H04L67/2819

摘要： A method of controlling traffic flow through a service node located within a packet network, which traffic flow originates at a plurality of sending nodes and is destined for a receiving node. The service node is one of a multiplicity of service nodes configured in a tree or other acyclic structure, e.g. of an overlay network. The method comprises receiving a challenge from said receiving node or a downstream service node, generating and caching a further challenge, and combining that further challenge with the received challenges to generate a modified challenge. The modified challenge is then sent to a sending node or to an upstream service node. Subsequently, a request is received, destined for said receiving node and originating at a sending node. A solution accompanying said request is validated using the cached further challenge, and the request forwarded towards said receiving node only if the solution is valid. Otherwise, the request is dropped.

摘要翻译： 控制通过位于分组网络内的服务节点的业务流的方法，所述业务流在多个发送节点发起并且发往接收节点。 服务节点是以树或其他非循环结构配置的多个服务节点之一，例如， 的覆盖网络。 所述方法包括从所述接收节点或下游服务节点接收挑战，产生和缓存进一步的挑战，以及将所述进一步的挑战与所接收的挑战结合以产生经修改的挑战。 然后将修改的挑战发送到发送节点或上游服务节点。 随后，接收到发往所述接收节点并发送在发送节点的请求。 伴随所述请求的解决方案使用缓存的进一步的挑战来验证，并且仅当该解决方案有效时才向所述接收节点转发该请求。 否则，请求被删除。

公开(公告)号：US20110202761A1

公开(公告)日：2011-08-18

申请号：US13123953

申请日：2008-10-23

申请人： Mikko Sarela ,  Pekka Nikander

发明人： Mikko Sarela ,  Pekka Nikander

IPC分类号： H04W12/06 ,  H04W4/06 ,  H04W36/18

CPC分类号： H04L12/189 ,  H04L45/16 ,  H04L45/48 ,  H04W40/36

摘要： A method of handling mobility of a sender in a multicast packet sending scenario. The method comprises firstly establishing a multicast tree across a packet data network and transmitting multicast packets from the sender to a plurality of receivers via said multicast tree. Prior to a mobility event in respect of said sender, a suitable transfer anchor node is identified within said network, and the tree re-rooted to that transfer anchor node. Subsequently, multicast packets are transmitted from said sender to said transfer anchor node and injected into the multicast tree at said transfer anchor node. Following said mobility event, said sender continues to send multicast packets to said transfer anchor node for injection into the multicast tree.

摘要翻译： 一种在多播包发送场景中处理发送方的移动性的方法。 该方法包括首先在分组数据网络上建立多播树，并经由所述多播树将多播分组从发送方发送到多个接收机。 在关于所述发送者的移动性事件之前，在所述网络内识别合适的传输锚点节点，并且所述树根据所述传输锚点节点重建。 随后，多播分组从所述发送方发送到所述传输锚点节点，并被注入到所述传输锚点节点的多播树中。 在所述移动性事件之后，所述发送者继续向所述传输锚点节点发送多播分组以便注入到多播树中。

公开(公告)号：US08583919B2

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

申请号：US13123953

申请日：2008-10-23

申请人： Mikko Sarela ,  Pekka Nikander

发明人： Mikko Sarela ,  Pekka Nikander

IPC分类号： H04L29/06

CPC分类号： H04L12/189 ,  H04L45/16 ,  H04L45/48 ,  H04W40/36

摘要： A method of handling mobility of a sender in a multicast packet sending scenario. The method comprises firstly establishing a multicast tree across a packet data network and transmitting multicast packets from the sender to a plurality of receivers via said multicast tree. Prior to a mobility event in respect of said sender, a suitable transfer anchor node is identified within said network, and the tree re-rooted to that transfer anchor node. Subsequently, multicast packets are transmitted from said sender to said transfer anchor node and injected into the multicast tree at said transfer anchor node. Following said mobility event, said sender continues to send multicast packets to said transfer anchor node for injection into the multicast tree.

摘要翻译： 一种在多播包发送场景中处理发送方的移动性的方法。 该方法包括首先在分组数据网络上建立多播树，并经由所述多播树将多播分组从发送方发送到多个接收机。 在关于所述发送者的移动性事件之前，在所述网络内识别合适的传输锚点节点，并且所述树根据所述传输锚点节点重建。 随后，多播分组从所述发送方发送到所述传输锚点节点，并被注入到所述传输锚点节点的多播树中。 在所述移动性事件之后，所述发送者继续向所述传输锚点节点发送多播分组以便注入到多播树中。

公开(公告)号：US08788705B2

公开(公告)日：2014-07-22

申请号：US13520301

申请日：2010-01-04

申请人： Karl Norrman ,  Jukka Ylitalo ,  Mats Näslund ,  Pekka Nikander

发明人： Karl Norrman ,  Jukka Ylitalo ,  Mats Näslund ,  Pekka Nikander

IPC分类号： G06F15/173

CPC分类号： H04L45/00 ,  H04L63/04 ,  H04L63/06

摘要： Methods and arrangements for supporting a forwarding process in routers when routing data packets through a packet-switched network, by employing hierarchical parameters in which the hops of a predetermined transmission path between a sender and a receiver are encoded. A name server generates and distributes router-associated keys to routers in the network which keys are used for computing the hierarchical parameters.

摘要翻译： 通过采用编码发送器和接收器之间的预定传输路径的跳的层次参数来支持通过分组交换网络路由数据分组时在路由器中的转发过程的方法和装置。 名称服务器生成并将与路由器相关的密钥分发给网络中用于计算分层参数的密钥的路由器。

公开(公告)号：US20110149973A1

公开(公告)日：2011-06-23

申请号：US13059958

申请日：2008-10-10

申请人： Christian Esteve Rothenberg ,  Petri Jokela ,  Jimmy Kjällman ,  Pekka Nikander ,  Teemu Rinta-Aho ,  Jukka Ylitalo

发明人： Christian Esteve Rothenberg ,  Petri Jokela ,  Jimmy Kjällman ,  Pekka Nikander ,  Teemu Rinta-Aho ,  Jukka Ylitalo

IPC分类号： H04L12/56

CPC分类号： H04L45/00 ,  H04L45/16 ,  H04L45/34 ,  H04L45/566 ,  H04L45/745

摘要： A method of providing packet routing information comprises: encoding routing information from a source node to one or more destination nodes into a compact representation of set membership; and putting the compact representation of sets into a header of a packet that is to be sent from the source node to the destination node(s). The compact representation may be obtained by: generating d representations of a set of identifiers; generating d candidate compact representations of set membership from the d representations of the identifiers; and selecting one of the candidate compact representation of set membership. The selection may be made on the basis of which of the candidate compact representations has the lowest rate of returning false positives.

摘要翻译： 提供分组路由信息的方法包括：将来自源节点到一个或多个目的地节点的路由信息​​编码为集合隶属的紧凑表示; 并将集合的紧凑表示放在要从源节点发送到目标节点的分组的报头中。 紧凑表示可以通过以下方式获得：生成一组标识符的d表示; 从标识符的d表示生成集合隶属的d候选紧凑表示; 并选择集合隶属的候选紧凑表示中的一个。 可以基于哪个候选紧凑表示具有最低的返回误报率来进行选择。

公开(公告)号：US20080187137A1

公开(公告)日：2008-08-07

申请号：US11883879

申请日：2006-02-10

申请人： Pekka Nikander ,  Jari Arrko ,  Mats Naslund

发明人： Pekka Nikander ,  Jari Arrko ,  Mats Naslund

IPC分类号： H04L9/30 ,  H04L9/22 ,  H04L9/28

CPC分类号： H04L63/0414 ,  H04L9/0844 ,  H04L63/0272 ,  H04L63/164 ,  H04L2209/38 ,  H04L2209/80 ,  H04W12/02 ,  H04W12/04

摘要： A method of improving privacy by hiding, in an ordered sequence of messages M[x(1), D(1)], M[x(2), D(2)], etc, communicated between a first and at least one second party sharing a key k, metadata x(i) descriptive of message processing, wherein D(i) denotes payload data. The method comprises the first and the second party agreeing on a pseudo random mapping depending on a shared key k, Fk, mapping at least x(i) to y(i), and the first party modifying the messages by replacing x(i) by y(i) in each message M(x(i), D(i)). The first party then transmits the modified messages maintaining their original order, and on reception of a message M(y(m), D), the second party uses a mapping Gk to retrieve position m of received value and the original value x(m).

摘要翻译： 一种通过以有序的消息M [x（1），D（1）]，M [x（2），D（2）]等的顺序隐藏来提高隐私的方法，在第一和至少一个 共享密钥k的第二方，元数据x（i）描述消息处理，其中D（i）表示有效载荷数据。 该方法包括第一方和第二方根据共享密钥k至少映射至少x（i）至y（i）的伪随机映射，并且第一方修改 通过在每个消息M（x（i），D（i））中将x（i）替换y（i）的消息。 第一方然后发送修改的消息维持其原始顺序，并且在接收消息M（y（m），D）时，第二方使用映射G 来检索所接收的位置m 值和原始值x（m）。

公开(公告)号：US6029151A

公开(公告)日：2000-02-22

申请号：US989927

申请日：1997-12-12

申请人： Pekka Nikander

发明人： Pekka Nikander

IPC分类号： G07F19/00 ,  G06Q20/00 ,  G07F7/08 ,  G07F7/10 ,  G09C1/00 ,  H04L29/06 ,  H04L29/08 ,  H04L9/00

CPC分类号： H04L63/0281 ,  G06Q20/02 ,  G06Q20/04 ,  G06Q20/065 ,  G06Q20/0855 ,  G06Q20/10 ,  G06Q20/102 ,  G06Q20/12 ,  G06Q20/16 ,  G06Q20/24 ,  G06Q20/32 ,  G06Q20/363 ,  G06Q20/381 ,  G07F7/0866 ,  H04L67/28 ,  H04L67/2823 ,  H04L67/327 ,  H04M15/68 ,  H04L2463/102 ,  H04M2215/0196

摘要： The present invention relates to electronic monetary systems in general, and in particular to measures for making their use easier for an average user. The present invention is based on the idea that the use of electronic money is greatly simplified for a non-expert user, if the Internet Service Provider of the user takes care of the payments, and adds corresponding charges on the user's telephone bill. Such functionality requires the intervention of the ISP in the transmissions between a user and a third party, i.e. intercepting the electronic payment requests sent by a merchant. According to the present invention, the ISP uses electronic money on behalf of the user, and charges the payments on the user's telephone bill. The ISP can take care of all technical details necessary for obtaining different forms of electronic money in a centralized manner, and all users of the ISP can use the electronic money obtained by the ISP simply by allowing the ISP to add corresponding charges to their telephone bills. Further, the ISP can obtain all major forms of electronic money, whereafter a user can choose the most economical way of payment, if a merchant accepts payments in more than one form of electronic money.

摘要翻译： 本发明一般涉及电子货币系统，特别涉及一般使用者使其更容易使用的措施。 本发明基于以下思想：如果用户的因特网服务提供商负责支付，并且在用户的电话账单上增加相应的费用，则非专业用户大大简化了电子货币的使用。 这样的功能需要ISP在用户和第三方之间的传输中的干预，即拦截商家发送的电子支付请求。 根据本发明，ISP代表用户使用电子货币，并对用户电话账单支付费用。 互联网服务提供商可以全面掌握以集中的方式获取不同形式的电子货币所需的所有技术细节，ISP的所有用户都可以使用ISP获取的电子货币，只需通过允许ISP将相应的费用加入电话账单 。 此外，ISP可以获得所有主要形式的电子货币，之后如果商家以多种形式的电子货币接受付款，则用户可以选择最经济的付款方式。

公开(公告)号：US09154571B2

公开(公告)日：2015-10-06

申请号：US12816442

申请日：2010-06-16

申请人： Petri Jokela ,  Pekka Nikander ,  Teemu Rinta-Aho ,  Mikko Särelä

发明人： Petri Jokela ,  Pekka Nikander ,  Teemu Rinta-Aho ,  Mikko Särelä

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

CPC分类号： H04L67/2823 ,  H04L67/28 ,  H04L69/08

摘要： A method of making data, published on a first publication/subscribe (pubsub) network, available to hosts within a second publication/subscribe network where the networks are interconnected via the Internet. The method comprises registering a publication identity of said data within a rendezvous system located within the Internet, forwarding Subscribe requests associated with said publication identity from said second network to said rendezvous system and, at the rendezvous system, identifying a location of said data within said first network. The Subscribe request can then be forwarded to said first network, and said data delivered from said first network to said second network via the Internet.

摘要翻译： 在第一发布/订阅（pubsub）网络上发布的制作数据的方法可用于通过因特网互连网络的第二发布/订阅网络内的主机。 该方法包括在位于因特网内的会合系统内注册所述数据的发布标识，将与所述发布身份相关联的订阅请求从所述第二网络转发到所述会合系统，并且在所述会合系统处，识别所述数据在所述 第一网络 然后可以将订阅请求转发到所述第一网络，并且所述数据经由因特网从所述第一网络传送到所述第二网络。

公开(公告)号：US08559434B2

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

申请号：US13059958

申请日：2008-10-10

申请人： Christian Esteve Rothenberg ,  Petri Jokela ,  Jimmy Kjällman ,  Pekka Nikander ,  Teemu Rinta-Aho ,  Jukka Ylitalo

发明人： Christian Esteve Rothenberg ,  Petri Jokela ,  Jimmy Kjällman ,  Pekka Nikander ,  Teemu Rinta-Aho ,  Jukka Ylitalo

IPC分类号： H04L12/28

CPC分类号： H04L45/00 ,  H04L45/16 ,  H04L45/34 ,  H04L45/566 ,  H04L45/745

摘要： A method of providing packet routing information comprises: encoding routing information from a source node to one or more destination nodes into a compact representation of set membership; and putting the compact representation of sets into a header of a packet that is to be sent from the source node to the destination node(s). The compact representation may be obtained by: generating d representations of a set of identifiers; generating d candidate compact representations of set membership from the d representations of the identifiers; and selecting one of the candidate compact representation of set membership. The selection may be made on the basis of which of the candidate compact representations has the lowest rate of returning false positives.

摘要翻译： 提供分组路由信息的方法包括：将来自源节点到一个或多个目的地节点的路由信息​​编码为集合隶属的紧凑表示; 并将集合的紧凑表示放在要从源节点发送到目的地节点的分组的报头中。 紧凑表示可以通过以下方式获得：生成一组标识符的d表示; 从标识符的d表示生成集合隶属的d候选紧凑表示; 并选择集合隶属的候选紧凑表示中的一个。 可以基于哪个候选紧凑表示具有最低的返回误报率来进行选择。