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 for establishing a fully private, information theoretically 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 v.sub.i a directed edge (v.sub.i1, v.sub.i2) that has a k1 capacity. All outgoing links of v.sub.i are connected to v.sub.i2. Additionally, using a maximum flow algorithm to define the maximum number of shares outgoing from v.sub.i2, and therefore from v.sub.i, on each outgoing link. The number of shares forwarded by node v.sub.i does not exceed the number of maximum shares that were defined by the maximum flow algorithm.

A communication node, such as a line replaceable unit and/or a sensor for use in a distributed communication network in a vehicle, particularly an aircraft, is provided. The communication node includes, but is not limited to a communication module and a processor unit. The communication module is configured to communicate with a target communication module of a target communication node of a plurality of communication nodes in the distributed communication network in the vehicle. The processor unit is configured to automatically and dynamically determine an optimum communication path through the communication network for communication between the particular communication node and a target communication node and to configure the communication module to exchange data with the target communication node over the optimum communication path through the distributed communication network.

A method for acquiring a cross-domain separation path includes: when receiving a cross-domain separation path computation request, acquiring K pairs of candidate separation domain sequences according to a cross-domain network abstraction topology; traversing the K pairs of sequences, generating corresponding intra-domain path computation requests for various domains through which candidate separation domain sequences in the network pass to transmit; when receiving at least one pair of intra-domain paths for the request, configuring each of the at least one pair of intra-domain paths to a corresponding position in the K pairs of sequences, to form K pairs of candidate cross-domain separation paths; and determining one pair of cross-domain separation paths from the K pairs of paths as a computation result of the cross-domain separation path computation request to transmit. There are also disclosed another method for acquiring a cross-domain separation path, a path computation element, and a computer storage medium.

A method in a source node establishing independent network paths including a first and second router nodes connected to the source node over a first and second mutually independent networks. The source node includes a first interface towards the first network, associated with a path identifier for a first network path; a second interface towards a second network associated with a path identifier for a second network path, and is configured to select which of the first and second router nodes should be used for sending data from the source node to the destination node via the first and second network paths, wherein the source node is configured to select different router nodes for the first and second network paths.

A method for establishing a fully private, information theoretically secure interconnection between a source and a destination, over an unmanaged data network with at least a portion of a public infrastructure. Accordingly, n shares of the source data are created at the source according to a predetermined secret sharing scheme and the shares are sent to the data network, while encrypting the sent data using (n,k) secret sharing. A plurality of intermediating nodes are deployed in different locations over the network, to create a plurality of fully and/or partially independent paths in different directions on the path from the source to the destination, and with sufficient data separation. Then, the shares are sent over the plurality of fully and/or partially independent paths while forcing shares' carrying packets to pass through selected intermediate nodes, such that no router at any intermediating nodes intercepts k or more shares.

A method and apparatus for routing the same data through independent routes between stations in a mesh network to increase the robustness of communications. The disclosed feature allows transmission of the same data stream via multiple routes from a source station (STA) to a destination station (STA). An extended routing request (RREQ) and routing reply (RREP) are utilized which provide a primary and secondary flag indication, which is utilized in combination with advanced programming for setting path cost metrics to assure independence of primary and secondary routes.

A method of controlling frame transmissions includes determining, at a first device, a frame erasure rate for a communication session between the first device and at least a second device. The method also includes comparing the frame erasure rate to an erasure threshold. The method further includes discarding an active speech frame if the frame erasure rate satisfies the erasure threshold.

Techniques are described for reusing downstream-assigned labels when establishing a new instance of a label switched path (LSP) prior to tearing down an existing instance of the LSP using make-before-break (MBB) procedures for RSVP. The techniques enable a routing engine of any non-ingress router along a path of the new LSP instance to reuse a previously allocated label for the existing LSP instance as the downstream assigned label for the new LSP instance when the paths of the existing LSP instance and the new LSP instance overlap. In this way, the non-ingress router does not need to update a label route in its forwarding plane for the reused label. When the new LSP instance completely overlaps the existing LSP instance, an ingress router of the LSP may avoid updating an ingress route in its forwarding plane for applications that use the LSP.

A method in a source node establishing independent network paths including a first and second router nodes connected to the source node over a first and second mutually independent networks. The source node includes a first interface towards the first network, associated with a path identifier for a first network path; a second interface towards a second network associated with a path identifier for a second network path, and is configured to select which of the first and second router nodes should be used for sending data from the source node to the destination node via the first and second network paths, wherein the source node is configured to select different router nodes for the first and second network paths.