A method for establishing a fully private, information secure interconnection between a source and a destination over a data network with at least a portion of a public infrastructure. The method comprising at the source creating n shares of a source data according to a predetermined secret sharing scheme, and encrypting the n shares using (n, k) secret sharing. Further, defining for at least one node vi a directed edge (Vi1, Vi2) that has a k−1 capacity. All outgoing links of vi are connected to vi2. Additionally, using a maximum flow algorithm to define the maximum number of shares outgoing from vi2, and therefore from vi, on each outgoing link. The number of shares forwarded by node vi does not exceed the number of maximum shares that were defined by the maximum flow algorithm.

An electronic device and a control method thereof are provided. The electronic device includes an Internet protocol (IP) address corresponding to a domain name of a web page when a user command inputting the domain name is received, identifies a number of hops included in a network path connecting a server corresponding to the obtained IP address and the electronic device to each other, and determines that a man-in-the-middle attack exists in a network when a communication connection with the server is established on the basis of a smaller number of hops than the identified number of hops.

Techniques for migrating a plurality of communications services in a data communication network are disclosed. Aspects include accessing a migration map for the plurality of communications services in the data communication network; identifying a communications dependency between a first service and a second service in the plurality of communications services, wherein according to the migration map the first service is configured to migrate from a first route to a second route, the second service is configured to migrate from a third route to a fourth route, and the third route overlaps with the second route; determining, based on the identified communications dependency, a migration sequence for migrating the plurality of communications services in the data communication network; and migrating the plurality of communications services from a first plurality of configurations to a second plurality of configurations according to the migration sequence.

A method and an apparatus for obtaining information about a forwarding path of a data packet in segment routing (SR) include, when a first path indicated by a plurality of path identifiers in initial information is a unique shortest path from a start node on the first path to an end node on the first path, the first path is indicated using a node-segment identifier (SID) of the end node on the first path instead of the path identifiers.

A path discovery process is provided for discovering a lowest cost combination of a plurality of paths from the source node to the destination node via links between pairs of nodes along the paths. A path discovery messages from a source node is forwarded through the network. Prior to forwarding the path discovery message a node tests one or more conditions for disabling the forwarding. Upon receiving an instance of the path discovery message, this may include testing whether no other instance of the path discovery message has both smaller cost and a previous path that contains only nodes that occur also in the path of the received instance. Furthermore, this may include testing whether a destination of the path discovery message was also a node to which a preceding node along the path has a further link, and a cost of the path from the preceding node to the next node via said further link is not larger than the cost of the path from the preceding node to the next node. Furthermore, this may include testing whether the node has a further link to the destination node and the cost associated with the link to the next node is not less than the cost associated with the further link to the destination node.

There is provided mechanisms for routing packets between a terminal device and a control system node via intermediate nodes on wireless paths in a wireless network. A method includes obtaining information on disturbances of wireless paths used for communicating packets of a traffic flow between the intermediate nodes in the wireless network. The method includes determining, based on the information on disturbances, mutual correlation between the disturbances of the wireless paths. The method includes routing the packets of the traffic flow between the terminal device and the control system node via some of the intermediate nodes and along disjoint wireless paths, whereby the packets are transmitted in parallel on the disjoint wireless paths, and wherein the disjoint wireless paths have mutual correlation not higher than a threshold correlation value.

A relay node within a network, the network further comprising at least one donor node coupled to the relay node, and a mobile termination coupled to the relay node and at least one donor node, the relay node comprising means for: receiving a configuration message; configuring the relay node, based on the configuration message, to perform at least one of: receiving packets from the mobile termination and originating from one of the donor nodes; and sending packets to one of the donor nodes by transmitting them to the mobile termination.

Networks comprising multiple non-overlapping communication topologies are presented. The networks can include a fabric of interconnected network nodes capable of providing multiple communication paths among edge devices. A topology manager constructs communication topologies according to restriction criteria based on required security levels (e.g., top secret, secret, unclassified, etc.). Established topologies do not have overlapping networking infrastructure to within the bounds of the restriction criteria as allowed by the security levels.

A method for multilane path discovery between a first node and a second node in a wireless mesh network, the method being performed by an intermediate node and comprising: receiving, by the intermediate node, a path request for establishing a path between the first and second nodes, wherein the path request comprises node count information related to the path between the first and second nodes; determining, by the intermediate node, that the received node count information is less than or equal to node count information, corresponding to a path between the first and second nodes, that is stored in a discovery table of the intermediate node; and updating, by the intermediate node, the stored node count information with the received node count information.

Networks comprising multiple non-overlapping communication topologies are presented. The networks can include a fabric of interconnected network nodes capable of providing multiple communication paths among edge devices. A topology manager constructs communication topologies according to restriction criteria based on required security levels (e.g., top secret, secret, unclassified, etc.). Established topologies do not have overlapping networking infrastructure to within the bounds of the restriction criteria as allowed by the security levels.