摘要:
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.
摘要:
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).
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
There is provided mechanisms for handling acknowledgements from nodes in a wireless radio ad-hoc network. A method is performed by a gateway of the wireless radio ad-hoc network. The method comprises transmitting radio signalling to nodes in the wireless radio ad-hoc network. The transmitted radio signalling is addressed to, and requiring acknowledgement from, at least one node in the wireless radio ad-hoc network. The method comprises receiving radio signalling from a node in the wireless radio ad-hoc network. The received radio signalling comprises one in-packet Bloom Filter comprising acknowledgement of the transmitted radio signalling from at least one of the nodes.
摘要:
The document discloses a method for invoking a routing algorithm, an SDN-OAF, and an SDN controller. The method includes pre-configuring a customized routing algorithm; an SDN controller receiving a path computation request from an application, invoking a corresponding customized routing algorithm according to information about the customized routing algorithm carried in the path computation request to compute a service path.