Systems and methods are disclosed for identifying a set of internal edges on a representation of a network that satisfy a set of demands on the network. The disclosed systems and methods perform a multi-step process of selecting the internal edges. In a first step, an initial set of internal edges can be selected using a clique graph (or in another suitable manner). In a second step, a second set of internal edges can be selected using stream graph(s) (or in another suitable manner). The second set of internal edges can be used when determining network paths that satisfy the demands. When the representation of the network has a cut of two, the disclosed systems and methods can identify a set of internal edges providing a degree of protection against link failure.

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.

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.

During operation, a mesh network access point (MAP) may communicate, via multiple mesh paths in a mesh network with the one or more root access points (RAPs), uplink packets or frames to or from at least two electronic devices. Notably, at a given time, the MAP uses a first mesh path in the mesh paths to communicate a first subset of the uplink packets or frames associated with a first electronic device in the two electronic devices and uses a second (different) mesh path in the mesh paths to communicate a second subset of the uplink packets or frames associated with a second electronic device in the two electronic devices. Moreover, the MAP may dynamically distribute the first electronic device or the second electronic device over the multiple mesh paths, e.g., based at least in part on one or more communication-performance metrics of the mesh paths and/or the mesh network.

A method and apparatus for path computation includes generating a path computation element communication protocol (PCEP) message, whereby the PCEP message comprises a characteristic associated with a level of protection of a Protection Label Switch path (LSP) with a Working LSP; and transmitting the PCEP message for path computation.

A method and apparatus for path computation includes generating a path computation element communication protocol (PCEP) message, whereby the PCEP message comprises a characteristic associated with a level of protection of a Protection Label Switch path (LSP) with a Working LSP; and transmitting the PCEP message for path computation.

A data link error feedback signaling system includes a transmitting network device and a receiving network device. The receiving network device may be operable to receive a network data unit from the transmitting network device over a data link, detect an error in the network data unit, and provide data link integrity information based on the error to the transmitting network device. The receiving network device may provide the data link integrity information by marking the data link flawed in a routing protocol, transmitting the data link integrity information via an informational protocol, and so on. The transmitting network device may respond to the data link integrity information, such as by marking the data link less preferred, marking the data link down, transmitting an alarm regarding the data link to a network operator, omitting taking an action upon determining that errors are below an error threshold, and so on.

Systems and methods are disclosed for determining shared risk link group (SRLG) disjoint paths in a communications network. An original graph representing the communications network can be obtained. The original graph can include vertices and edges corresponding to nodes and communication links in the communication network. The vertices can include a source vertex and a target vertex and each edge can be associated with a set of SRLGs A reduced graph can be generated from the original graph. Generation of the reduced graph can include identification of a first edge of the edges as a dominating edge and removal of the first edge. Two SRLG-disjoint paths can then be identified on the reduced graph.

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.