A method, apparatus and computer readable medium for reducing traffic loss when bringing up a switch within a multi chassis switch cluster without using dedicated intra cluster links is presented. A first network device in a cluster discovers at least one path to a second network device in the cluster, wherein the cluster utilizes at least one virtual IST between the first network device and the second network device. The first network device starts an Inter Switch Trunk (IST) synchronization process with the second network device. The first network device installs redirection rules, wherein the redirection rules are used for datapath traffic and are not used for control channel traffic. The first network device determines that the IST synchronization process between the first network device and the second network device has completed, and removes the redirection rules.

Various exemplary embodiments relate to a method of offline traffic matrix aware segment routing. The method may include receiving a traffic matrix based upon all the traffic between nodes i and j that is routed in the network; and determining the amount of traffic between nodes i and j will be routed through node k, based on minimizing a maximum link utilization for the traffic matrix by determining that the total amount of flow on a link e in the network is less than the link's capacity.

Disclosed in the present invention is a method for end station address distribution information (ESADI) protocol fast convergence, comprising: when a change occurs in network topology, TRILL (transparent interconnection over lots of links) calculates a unicast encapsulation table; when a designated forwarder for a remote VLAN of a remote routing bridge (RB) included in the unicast encapsulation table is reachable, and when a local RB receives from said remote RB an LSP enabling ESADI function information, the local RB and the remote RB establish a neighbour relationship within a local VLAN, thus achieving ESADI protocol fast convergence. Also disclosed is a device for ESADI protocol convergence and a storage medium.

Method of and a compiler for controlling a network based on a logical network model. The compiler determines physical and/or virtual resources, comprising of physical nodes and physical links, against which the logical model can be compiled. The network has known physical nodes, unknown physical nodes and logical nodes. The known physical nodes are “physical nodes” which are existing or still to be setup (virtual) nodes in the network. The known physical nodes are interconnected by physical links in accordance with a physical network layout. The logical network model has logical nodes indicated with a logical node name which refers to at least one known physical node or one unknown physical node in the network. The method uses a depth-mapping relation defining how the logical nodes are mapped to the known physical nodes and the unknown physical nodes. The term “unknown physical node” is used to define an imaginary physical node to which logical nodes can be mapped through depth-mappings and which are to be substituted by a physical node of the network of which the physical node name is stored. The method includes creating logical links between the logical nodes in dependence on the paths between the known physical nodes and/or the unknown physical nodes and on the depth-mapping relation. Known physical nodes are determined for unknown physical nodes and known physical paths are determined for unknown physical paths between unknown physical nodes by performing a search. The method uses edge-relationships between logical link, logical path, physical link, physical path and depth-mapping relations. Logical paths in the logical network are transformed into a physical path comprising of physical links between the physical nodes through recursive calculation and forwarding instructions are created for the physical nodes, in dependence on the edge-relationships and point-of-attachment names between physical links and physical nodes.

This disclosure provides systems and methods for routing and topology management of computer networks with steerable beam antennas. A network controller can generate an input graph for a first time period. The input graph can have a plurality of vertices each representing a respective moving node and a plurality of edges each representing a possible link between a pair of moving nodes. The input graph also can include corresponding location information for each of the moving nodes during the first time period. A solver module can receive information corresponding to the input graph, a maximum degree for each vertex in the input graph, and a set of provisioned network flows. The solver module can determine a subgraph representing a network topology based on the input graph, the maximum degree for each vertex in the input graph, and the set of provisioned network flows, such that a number of edges associated with each vertex in the subgraph does not exceed the maximum degree for each vertex.

A routing system may include a primary message group to be used for synchronizing stored information. The primary message group may include multiple primary network devices. The multiple primary network devices may be configured with a first configuration regarding synchronizing the stored information. The primary message group may form a ring network topology. The routing system may include a secondary message group to be used for synchronizing the stored information. The secondary message group may include a single primary network device, of the multiple primary network devices, and multiple secondary network devices. Each secondary network device, of the multiple secondary network devices, may be included in a single secondary message group. The multiple secondary network devices may be configured with a second configuration regarding synchronizing the stored information. The secondary message group may form a different ring network topology.

A plurality of network nodes are configured to form a virtual logical network over a plurality of broadcast domains. Configuring the virtual logical network includes configuring at least one of the nodes in the plurality of nodes to broadcast routes to IP addresses hosted on nodes in the plurality of network nodes between nodes in the plurality of broadcast domains. A primary workload hosted on a first node in the plurality of nodes is configured to share ownership of an IP address with a secondary workload hosted on a second node in the plurality of nodes. In response to detecting a failure indication associated with the primary workload, an IP address failover procedure for the shared IP address is performed between the primary workload and the secondary workload.

A method for distributed multi-choice voting/ranking in a network with a plurality of nodes associated to a set of choices is disclosed. The method includes setting a plurality of value sets for a plurality of nodes, setting a plurality of collections of memory sets for the plurality of nodes, and updating the plurality of value sets. In addition, the method includes updating the plurality of collections of memory sets, calculating a majority vote for the set of choices, and calculating a rank set for the set of choices.

Various embodiments set forth a method for automatically configuring a multi-chassis link aggregation group (MLAG), including receiving first system information associated with the MLAG, receiving a first discovery packet via a first uplink port associated with a first switch that is included in the MLAG, where the first discovery packet includes second system information associated with the MLAG, determining whether the first system information matches the second system information, where if the first system information matches the second system information, then concluding that the first uplink port is included in an inter peer link connecting the first switch to a second switch that also is included in the MLAG, and if the first system information does not match the second system information, then concluding that the first uplink port is not included in the inter peer link. Advantageously, the method avoids requiring a user to enter hundreds of commands manually.

A software-defined network (SDN) may include a controller that causes data an flow to be routed at least partially based on an application associated with the flow. The controller may identify an application associated with a flow and may determine desired transmission characteristics associated with the application. The controller may then dynamically identify an appropriate path for the flow data based on the desired transmission characteristics. The controller may further identify a quality of service value associated with a source or destination device associated with the flow data and may adjust the quality of service value based on the desired transmission characteristics associated with the application.