OPTIMISING DATA TRANSMISSION IN A HYPERCUBE NETWORK
    41.
    发明公开
    OPTIMISING DATA TRANSMISSION IN A HYPERCUBE NETWORK 有权
    超立方体网络数据传输的优化

    公开(公告)号:EP2759100A1

    公开(公告)日:2014-07-30

    申请号:EP12769367.9

    申请日:2012-09-25

    IPC分类号: H04L12/70

    摘要: A method of operating a hypercube network of processing devices includes determining that a plurality of the processing devices are storing data to be processed at a single processing device, obtaining the addresses of the plurality of processing devices storing the data to be processed, determining the most common number for each digit of the addresses of the plurality of processing devices storing the data to be processed, generating a new address comprising the determined most common number for each digit, and transferring the data to be processed to the processing device with the generated new address.

    Incentivizing information propagation in a social network
    42.
    发明公开
    Incentivizing information propagation in a social network 审中-公开
    Inzentivierung von Informationsverbreitung in einem sozialen Netzwerk

    公开(公告)号:EP2747006A1

    公开(公告)日:2014-06-25

    申请号:EP12306613.6

    申请日:2012-12-18

    申请人: Thomson Licensing

    IPC分类号: G06Q10/10 G06Q50/00 G06Q30/02

    摘要: Method for incentivizing information propagation in a social network (2) comprising a plurality of nodes (4) among which a receiving node (k) is able to receive information from a source node (s), said information being propagated from the source node (s) to the receiving node (k) through a path (6) of the network (2), said path (6) comprising at least one edge of the network (2) directly linking a first relaying node (i) and a second relaying node (j), wherein the method comprises a step of rewarding to the second relaying node (j) a score each time that the receiving node (k) receives a useful content from the source node (s) through said path (6), characterized in that the first relaying node (i) is able to receive information from the second relaying node (j) at a given rate, and in that the method further comprises a step of periodically updating said rate as a function of a sum of the scores rewarded to the second relaying node (j).

    摘要翻译: 用于激励社交网络中的信息传播的方法(2),包括多个节点(4),其中接收节点(k)能够从源节点接收信息,所述信息从源节点( s)通过网络(2)的路径(6)发送到接收节点(k),所述路径(6)包括网络(2)的至少一个边缘,直接链接第一中继节点(i)和第二中继节点 中继节点(j),其中所述方法包括每当所述接收节点(k)经由所述路径(6)从所述源节点接收到有用内容时,向所述第二中继节点(j)奖励分数的步骤, 其特征在于,所述第一中继节点(i)能够以给定的速率从所述第二中继节点(j)接收信息,并且所述方法还包括以下步骤:周期性地更新所述速率作为 得分奖励给第二中继节点(j)。

    Optimized dynamic bandwidth scheduler
    43.
    发明公开
    Optimized dynamic bandwidth scheduler 有权
    Optimierter Zeitplanerfürdynamische Bandbreite

    公开(公告)号:EP2487833A1

    公开(公告)日:2012-08-15

    申请号:EP11305131.2

    申请日:2011-02-09

    发明人: Rollet, Romain

    IPC分类号: H04L12/24 H04Q11/00

    摘要: The invention relates to a method for allocating timeslots for transmission of data packets and REPORT messages in a communication network, the network comprising a plurality of logical links managed by a terminal, the method comprising the steps implemented at each cycle by the terminal of receiving at least one REPORT message from at least one logical link LL i , the REPORT message comprising an updated queue length of the logical link LL i , the length being expressed in timeslots TQs and, upon reception of the REPORT message from the logical link LL i , updating the image queue length Q i based on the updated queue length. The method further comprises allocating to logical links LL i , for which image queue length is not zero, at least one timeslot TO in the next cycle k+1 based on the theoretical transmission time TTT i for transmitting data packets or REPORT messages and based on the fraction of overhead associated with the transmission, timeslots TQs being allocated until all timeslots TQs of the next cycle k+1 are allocated or until all image queue lengths are zero and incrementing the theoretical transmission time TTT i of each logical link LL i based on its required minimum bit rate b i and decrementing the image queue length Q i of the logical link LL i of the at least one timeslot TQ allocated to it.

    摘要翻译: 本发明涉及一种用于在通信网络中分配用于数据分组和REPORT消息传输的时隙的方法,所述网络包括由终端管理的多个逻辑链路,所述方法包括由终端在每个周期执行的步骤, 来自至少一个逻辑链路LL i的至少一个REPORT消息,所述REPORT消息包括所述逻辑链路LL i的更新的队列长度,所述长度在时隙TQ中表示,并且在从所述逻辑链路LL i接收到所述REPORT消息时, 基于更新的队列长度来更新图像队列长度Q i。 该方法还包括:基于用于传输数据分组或REPORT消息的理论传输时间TTT i,分配到图像队列长度不为零的逻辑链路LL i,在下一个周期k + 1中的至少一个时隙TO,并基于 与发送相关联的开销的一部分,被分配的时隙TQ直到下一个周期k + 1的所有时隙TQ被分配,或者直到所有图像队列长度为零,并且基于每个逻辑链路LL i的理论传输时间TTT i, 其所需的最小比特率bi并递减分配给它的至少一个时隙TQ的逻辑链路LL i的图像队列长度Q i。

    PACKET FORWARDING IN A NETWORK
    44.
    发明公开
    PACKET FORWARDING IN A NETWORK 审中-公开
    网络中的数据包转发

    公开(公告)号:EP2441216A1

    公开(公告)日:2012-04-18

    申请号:EP09775147.3

    申请日:2009-12-03

    IPC分类号: H04L12/56

    摘要: A method and apparatus routes packets through a network. A network node has outgoing links each associated with at least one link ID. At least one of the links is associated with link IDs. A received packet includes a state variable and routing information which encodes a set of link IDs associated with respective links forming a path through the network. The encoding forms a probabilistic data structure used to test whether a link ID is a member of the set of link IDs. For each of the plurality of outgoing links, the data structure is tested for membership of the link's associated link ID.

    摘要翻译: 提供了一种用于通过网络路由分组的方法和装置。 分组(P)在网络的节点(1)处被接收。 节点(1)具有可用的多个输出链路(20),多个链路(20)中的每一个与至少一个链路ID相关联。 多个链接(20)中的至少一个链接与多个链接ID相关联。 分组(P)包括状态变量和路由信息。 路由信息对与形成通过网络的路径的各个链路相关联的一组链路ID进行编码。 编码采用概率数据结构的形式,例如Bloom过滤器,用于测试链接ID是否为链接ID集的成员。 该测试有可能导致误报。 对于多个输出链路(20)中的每一个,测试数据结构的链路关联链路ID的成员资格。 在链路具有多个关联链路ID的情况下,来自所接收分组的状态变量用于确定将哪个链路ID用作关联链路ID。 至少部分地基于来自所接收的分组的状态变量来确定新的状态变量。 数据包沿着每个被确定为具有其关联链路ID的链路转发,作为数据结构的成员。 转发的数据包包含路由信息和新的状态变量。

    ROUTING IN A NETWORK
    45.
    发明授权
    ROUTING IN A NETWORK 有权
    在网络中路由

    公开(公告)号:EP2168325B1

    公开(公告)日:2010-12-15

    申请号:EP07786742.2

    申请日:2007-06-14

    发明人: NIKANDER, Pekka

    IPC分类号: H04L12/56

    摘要: A network comprises a plurality of Access Routers (13a-13f) arranged in one or more NetLMM domains. A domain comprises distributed routing information in the form of one or more Bloom filters or Bloom filter equivalents. In one embodiment, each Access Router (13a-13f) may have an associated Local Bloom filter or Bloom filter equivalent that provides information as to which mobile nodes (5) are currently behind the respective Access Router. Each Access Router sends its associated Local Bloom filter or Bloom filter equivalent to every other Access Router of the domain. An Access Router uses the Bloom filters or Bloom filter equivalents received from every other Access Router of the domain to determine to which Access Router to send a packet destined to a specified Mobile Node. Another embodiment uses partly-distributed routing information.

    摘要翻译: 网络包括布置在一个或多个NetLMM域中的多个接入路由器(13a-13f)。 域包括一个或多个布隆过滤器或布隆过滤器等价物形式的分布式路由信息。 在一个实施例中,每个接入路由器(13a-13f)可以具有关联的本地布隆过滤器或布隆过滤器等同物,其提供关于当前哪个移动节点(5)在相应接入路由器后面的信息。 每个访问路由器发送其相关的本地布隆过滤器或Bloom过滤器等效于该域的每个其他访问路由器。 接入路由器使用从域的每个其他接入路由器接收到的布隆过滤器或布隆过滤器等价物来确定向哪个接入路由器发送去往指定移动节点的分组。 另一个实施例使用部分分布的路由信息​​。

    TECHNIQUE FOR MULTIPLE PATH FORWARDING OF LABEL-SWITCHED DATA TRAFFIC
    46.
    发明公开
    TECHNIQUE FOR MULTIPLE PATH FORWARDING OF LABEL-SWITCHED DATA TRAFFIC 有权
    PROCESS FOR标签交换业务的多个路径转发

    公开(公告)号:EP2047645A2

    公开(公告)日:2009-04-15

    申请号:EP07810896.6

    申请日:2007-07-27

    发明人: SWALLOW, George

    IPC分类号: H04L12/56

    CPC分类号: H04L45/50 H04L45/00 H04L45/14

    摘要: A technique for multiple path forwarding of label-switched data traffic in a communication network across multiple paths such that traffic associated with a particular label-switched path (LSP) is forwarded on the same path in the network. An incoming label associated with a packet is used to select an Equal Cost Multiple. Path (ECMP) technique that is used to identify an interface among a plurality of interfaces on which the packet may be forwarded. An incoming label associated with the packet is used to identify an outgoing label for the packet as well as the plurality of interfaces on which the packet may be forwarded. A label in the packet's label stack is hashed to produce a hash value. The hash value is then used to identify an interface from the plurality of interfaces on which the packet is forwarded. The outgoing label is placed in the packet and the packet is forwarded on the identified interface.

    NETWORK TOPOLOGY FOR A SCALABLE MULTIPROCESSOR SYSTEM
    47.
    发明授权
    NETWORK TOPOLOGY FOR A SCALABLE MULTIPROCESSOR SYSTEM 有权
    网络STOP洛吉可伸缩多计算机系统

    公开(公告)号:EP1222557B1

    公开(公告)日:2007-04-18

    申请号:EP00967199.1

    申请日:2000-09-29

    IPC分类号: G06F15/16

    摘要: A system and method for interconnecting a plurality of processing element nodes within a scalable multiprocessor system is provided. Each processing element node includes at least one processor and memory. A scalable interconnect network includes physical communication links interconnecting the processing element nodes in a cluster. A first set of routers in the scalable interconnect network route messages between the plurality of processing element nodes. One or more metarouters in the scalable interconnect network route messages between the first set of routers so that each one of the routers in a first cluster is connected to all other clusters through one or more metarouters.

    SYSTEMS AND METHODS FOR PRE-PROCESSING NETWORK MESSAGES TO OPTIMIZE ROUTING

    公开(公告)号:EP3417410A1

    公开(公告)日:2018-12-26

    申请号:EP17706134.8

    申请日:2017-02-14

    摘要: A message routing and pre-processing (MRP) computing device is described herein. The MRP computing device is configured to receive an authorization request message associated with a transaction initiated by a cardholder with a merchant, the authorization request message including authorization parameters of the transaction, and retrieve a plurality of potential authorization routes for the authorization request message. Each potential authorization route includes routing parameters and is associated with a respective transaction processing network (TPN). The MRP computing device is also configured to compare the authorization parameters to the routing parameters of each potential authorization route to determine an optimized authorization route for the authorization request message. The optimized authorization route includes routing parameters that most closely match the authorization parameters. The optimized authorization route is associated with a first TPN. The MRP computing device is further configured to route the authorization request message to the first TPN for authorization processing.