Techniques are described for computing lists of segment identifiers (SIDs) that satisfy each path in a multipath solution for a segment routing (SR) policy. In an example, a method includes obtaining, by a computing device, a plurality of paths through a network comprising one or more network nodes, each path of the plurality of paths representing a different sequence of links connecting pairs of the network nodes from a source to a destination; computing, by the computing device, one or more lists of segments identifiers (SIDs) that satisfy each path of the plurality of paths; and programming the network to forward network traffic based at least on the one or more lists of SIDs.

Techniques are described for computing lists of segment identifiers (SIDs) that satisfy each path in a multipath solution for a segment routing (SR) policy. In an example, a method includes obtaining, by a computing device, a plurality of paths through a network comprising one or more network nodes, each path of the plurality of paths representing a different sequence of links connecting pairs of the network nodes from a source to a destination; computing, by the computing device, one or more lists of segments identifiers (SIDs) that satisfy each path of the plurality of paths; and programming the network to forward network traffic based at least on the one or more lists of SIDs.

A parallel flooding topology repair method performed by a node for repairing a flooding topology. The parallel flooding topology repair method detects a failed link and/or a failed node on a flooding topology, determines whether the failed link and/or failed node results in a flooding topology split, and repair the flooding topology by performing a local flooding topology repair process when the flooding topology is split.

A parallel flooding topology repair method performed by a node for repairing a flooding topology. The parallel flooding topology repair method detects a failed link and/or a failed node on a flooding topology, determines whether the failed link and/or failed node results in a flooding topology split, and repair the flooding topology by performing a local flooding topology repair process when the flooding topology is split.

An aspect of the invention provides a method of performing a distributed task over a network comprising a plurality of nodes. The method comprises: a plurality of network nodes observing (300) data; applying a first linear code function to the data observed by at least one network node of the plurality of network nodes to obtain (302) at least one function output; applying errors (304) to the at least one function output; a query node selected from the network nodes performing (308) a mixing procedure to aggregate node observations to obtain a first set of aggregated values until a stopping criteria (306) is satisfied; applying (312) a second linear code function to the set of aggregated values to obtain a second set of aggregated values returned to their observed domain; and the query node outputting (314) the second set of aggregated values.

An aspect of the invention provides a method of performing a distributed task over a network comprising a plurality of nodes. The method comprises: a plurality of network nodes observing (300) data; applying a first linear code function to the data observed by at least one network node of the plurality of network nodes to obtain (302) at least one function output; applying errors (304) to the at least one function output; a query node selected from the network nodes performing (308) a mixing procedure to aggregate node observations to obtain a first set of aggregated values until a stopping criteria (306) is satisfied; applying (312) a second linear code function to the set of aggregated values to obtain a second set of aggregated values returned to their observed domain; and the query node outputting (314) the second set of aggregated values.

A system and method for generating and representing a consolidated resolution tree of a network are provided. The method includes receiving a target fully qualified domain name (FQDN); creating at least one tentative equivalence class (TEC) containing all the internet root domain name servers (DNS); processing the at least one TEC to determine respective consolidated edges and vertices; retrieving nameservers from domain registration records; determining whether additional TECs are to be generated for the retrieved nameserver(s); processing all new TECs to determine respective consolidated edges and vertices, when it is determined that new TECs are to be generated; and generating a resolution tree for display based on the consolidated edges and vertices.

Systems and methods for supporting efficient virtualization in a lossless interconnection network. An exemplary method can provide, one or more switches, including at least a leaf switch, a plurality of host channel adapters, wherein each of the host channel adapters comprise at least one virtual function, at least one virtual switch, and at least one physical function, a plurality of hypervisors, and a plurality of virtual machines, wherein each of the plurality of virtual machines are associated with at least one virtual function. The method can arrange the plurality of host channel adapters with one or more of a virtual switch with prepopulated local identifiers (LIDs) architecture or a virtual switch with dynamic LID assignment architecture. The method can assign each virtual switch with a LID. The method can calculate one or more linear forwarding tables based at least upon the LIDs assigned to each of the virtual switches.

Systems and methods for supporting efficient virtualization in a lossless interconnection network. An exemplary method can provide, one or more switches, including at least a leaf switch, a plurality of host channel adapters, wherein each of the host channel adapters comprise at least one virtual function, at least one virtual switch, and at least one physical function, a plurality of hypervisors, and a plurality of virtual machines, wherein each of the plurality of virtual machines are associated with at least one virtual function. The method can arrange the plurality of host channel adapters with one or more of a virtual switch with prepopulated local identifiers (LIDs) architecture or a virtual switch with dynamic LID assignment architecture. The method can assign each virtual switch with a LID. The method can calculate one or more linear forwarding tables based at least upon the LIDs assigned to each of the virtual switches.

Techniques are disclosed for developing spanning trees at devices that are interconnected in a rendering network. According to the techniques, a change in connectivity between two devices in the rendering network may be detected at a first one of the devices, information representing a cost of connectivity may be stored in a data record at the first device. A spanning tree may then be calculated from a candidate set of communication links that interconnect the devices of the rendering network according to cost information representing those communication links. A device may exchange information, such as information regarding the rendering network, to another device of the rendering network according to communication links identified for the spanning tree. The data record may be of a conflict-free replicated data type.