A method of and a node device for determining location addresses of node devices (21, 22 . . . 26) of a network (10). The node devices (21, 22 . . . 26) are arranged along an elongated track (12) and geographically distanced from each other by an inter-node distance “d”. Each node device (21, 22 . . . 26) comprises a short range communication interface (20). A node device (22) receives a message (27) from an immediate neighbouring node device (21) having a known location address comprised in the message (27). The receiving node device (21) determines its own location address based on the location address received in the message (27). The receiving node device (22) then may transmit a further message (28) comprising its determined location address to a further node device (23), allowing the further node device (23) to determine its location address as well.

A method of and a node device for determining location addresses of node devices (21, 22 . . . 26) of a network (10). The node devices (21, 22 . . . 26) are arranged along an elongated track (12) and geographically distanced from each other by an inter-node distance “d”. Each node device (21, 22 . . . 26) comprises a short range communication interface (20). A node device (22) receives a message (27) from an immediate neighbouring node device (21) having a known location address comprised in the message (27). The receiving node device (21) determines its own location address based on the location address received in the message (27). The receiving node device (22) then may transmit a further message (28) comprising its determined location address to a further node device (23), allowing the further node device (23) to determine its location address as well.

A method (100) of route selection in a wireless communication system and a control system (40) is provided. The method includes selecting a route between a first node (1) and a second node (2) and comprises: —evaluating (110) a plurality of possible routes (R1, R2, R3, R4), at least one route (R2, R3, R4) including a third node (3, 4) between the first and the second node; and —selecting (160) the route that has the lowest latency among the possible routes. Especially the method (100) includes: —selecting (120) parameter settings for each link of the possible routes, said selecting (120) comprising; —selecting (130) the length of the cyclic prefix, —evaluating (140) combinations of the selected cyclic prefix and different settings of the at least one further parameter of the physical layer; —selecting (150) the parameter settings that has lowest estimated latency and fulfils at least one communication quality criterion.

A method (100) of route selection in a wireless communication system and a control system (40) is provided. The method includes selecting a route between a first node (1) and a second node (2) and comprises: —evaluating (110) a plurality of possible routes (R1, R2, R3, R4), at least one route (R2, R3, R4) including a third node (3, 4) between the first and the second node; and —selecting (160) the route that has the lowest latency among the possible routes. Especially the method (100) includes: —selecting (120) parameter settings for each link of the possible routes, said selecting (120) comprising; —selecting (130) the length of the cyclic prefix, —evaluating (140) combinations of the selected cyclic prefix and different settings of the at least one further parameter of the physical layer; —selecting (150) the parameter settings that has lowest estimated latency and fulfils at least one communication quality criterion.

Some embodiments of the invention provide a method of facilitating routing through a software-defined wide area network (SD-WAN) defined for an entity. A first edge forwarding node located at a first multi-machine site of the entity, the first multi-machine site at a first physical location and including a first set of machines, serves as an edge forwarding node for the first set of machines by forwarding packets between the first set of machines and other machines associated with the entity via other forwarding nodes in the SD-WAN. The first edge forwarding node receives configuration data specifying for the first edge forwarding node to serve as a hub forwarding node for forwarding a set of packets from a second set of machines associated with the entity and operating at a second multi-machine site at a second physical location to a third set of machines associated with the entity and operating at a third multi-machine site at a third physical location. The first edge forwarding node serves as a hub forwarding node to forward the set of packets from the second set of machines to the third set of machines.

Some embodiments of the invention provide a method of facilitating routing through a software-defined wide area network (SD-WAN) defined for an entity. A first edge forwarding node located at a first multi-machine site of the entity, the first multi-machine site at a first physical location and including a first set of machines, serves as an edge forwarding node for the first set of machines by forwarding packets between the first set of machines and other machines associated with the entity via other forwarding nodes in the SD-WAN. The first edge forwarding node receives configuration data specifying for the first edge forwarding node to serve as a hub forwarding node for forwarding a set of packets from a second set of machines associated with the entity and operating at a second multi-machine site at a second physical location to a third set of machines associated with the entity and operating at a third multi-machine site at a third physical location. The first edge forwarding node serves as a hub forwarding node to forward the set of packets from the second set of machines to the third set of machines.

A solution for route selection includes receiving, by a network repository, from a first network function (NF), a query related to a target NF; querying, by the network repository, a route selection node for a shortest path to the target NF; receiving, by the network repository, from the route selection node, an indication of the shortest path to the target NF; and based on at least receiving the indication of the shortest path to the target NF, transmitting, by the network repository, to the first NF, a route to the target NF. In some examples, the shortest path has at least one of: a minimum number of hops, a minimum latency, a minimum jitter, and a minimum weighted transport score. In some examples, the route selection node is co-located with the network repository, which may be a network repository function (NRF).

A computer implemented method of identifying anomalous behavior of a computer system in a set of intercommunicating computer systems, each computer system in the set being uniquely identifiable, the method including monitoring communication between computer systems in the set for a predetermined baseline time period to generate a baseline vector representation of each of the systems; monitoring communication between computer systems in the set for a subsequent predetermined time period to generate a subsequent vector representation of each of the systems; comparing baseline and subsequent vector representations corresponding to a target computer system using a vector similarity function to identify anomalous behavior of the target system in the subsequent time period compared to the baseline time period, wherein a vector representation of the target system for a time period is generated based on a deterministic walk of a graph representation of communications between the computer systems in which nodes of the graph correspond to computer systems in the set and weighted directed edges between nodes of the graph correspond to a characteristic of communication between pairs of computer systems in the set.

A computer implemented method of identifying anomalous behavior of a computer system in a set of intercommunicating computer systems, each computer system in the set being uniquely identifiable, the method including monitoring communication between computer systems in the set for a predetermined baseline time period to generate a baseline vector representation of each of the systems; monitoring communication between computer systems in the set for a subsequent predetermined time period to generate a subsequent vector representation of each of the systems; comparing baseline and subsequent vector representations corresponding to a target computer system using a vector similarity function to identify anomalous behavior of the target system in the subsequent time period compared to the baseline time period, wherein a vector representation of the target system for a time period is generated based on a deterministic walk of a graph representation of communications between the computer systems in which nodes of the graph correspond to computer systems in the set and weighted directed edges between nodes of the graph correspond to a characteristic of communication between pairs of computer systems in the set.

Packet routers route data packets based on existing topology files. The packet routers hash the existing topology files into content-addressed objects and exchange the content-addressed objects. One of the routers modifies its topology file into a new topology file, hashes the new topology file into a new content-addressed object, and transfers the new content-addressed object to the other packet routers. The packet routers exchange the content-addressed objects, and in response, exchange the topology files. The routers establish a consensus on the new topology file based on the existing topology files. The one packet router routes additional data packets based on the new topology file in response to the consensus. In some examples, the content-addressed objects comprise Inter-Planetary File System (IPFS) objects.