Disclosed embodiments include a method of operation of a distributed network system. The method includes nodes of the network system that send messages over a protocol-independent message bus, and other nodes that receive the messages. Content from the received messages can be stored in a database distributed among nodes of the network system. At least some of the content stored in the database is published. The published content can be accessed by one or more applications to perform one or more functions.

In general, the invention relates to a method for programming a network element. The method includes detecting an addition of a first route in a routing information base (RIB) on the network element, adding, in response to detecting the addition, a first route network prefix associated with the first route to a network prefix trie (NPT), identifying, based on the adding, a first parent network prefix for the first route network prefix using the NPT, making a first determination that the first route network prefix and the first parent network prefix are reachable via a first common next hop connected to the network element, and waiving, based on the first determination, a creation of a forwarding information base (FIB) entry associated with the first route network prefix in a FIB on the network element.

The present invention provides a packet forwarding method and device. The method comprises: a first node receiving a packet for forwarding, wherein a destination address of the packet is a second node; the first node identifying, from topologies generated in advance, a target topology corresponding to the packet, wherein the topologies generated in advance comprise a first topology and a second topology generated according to an MRT algorithm, and a third topology obtained according to an SPF algorithm, wherein the first topology, the second topology and the third topology are different from one another; and the first node identifying, from the target topology, a next hop node for forwarding to the second node, and forwarding the packet to the next hop node. The present invention achieves an object of combining a segmented routing network and an MRT function.

Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.

Methods and network devices are disclosed for multicast traffic steering in a communications network. In one embodiment, a method includes receiving, at a node in a network, a multicast message comprising an incoming message bit array and a tree identifier value. The embodiment further includes selecting a bit indexed forwarding table stored at the node and corresponding to the tree identifier value, accessing within the selected forwarding table an entry corresponding to an intended destination node for the message, and forwarding, to a neighboring node identified in the accessed entry, a copy of the message comprising a forwarded message bit array in place of the incoming message bit array. An embodiment of a network device includes one or more network interfaces and a processor adapted to perform steps of the method.

An energy-efficient traffic scheduling algorithm based on multiple layers of virtual sub-topologies is provided. First, a mathematical optimization model for an energy-efficient traffic scheduling problem is established, to minimize network energy consumption while ensuring the capability of bearing all network data flows. Then, the mathematical optimization model is resolved using an energy-efficient traffic scheduling algorithm based on a multi-layer virtual topology, to obtain an energy-efficient scheduling scheme of the data flows. The virtual topology and switch ports in an upper layer are made dormant to save energy. The method can dynamically adjust the working state of the virtual sub-topology in the upper layer according to current link utilization. A path with a minimum number of hops and lowest maximum link utilization can be found in the booted sub-topology, to route the data flow, solving the problem that a “rich-connection” data center network has low energy resource utilization at low load.

Systems and methods for using InfiniBand routing algorithms for Ethernet fabrics in a high performance computing environment. The method can provide, at a computer comprising one or more microprocessors, a plurality of switches, a plurality of hosts, a topology provider (TP) module, a routing engine (RE) module, and a switch initializer (SI) module. The method can perform a discovery sweep, by the TP, of the plurality of hosts and the plurality of switches and assigns an address to each of the plurality of hosts and the plurality of switches. The method can calculate, by the routing engine, a routing map, based upon a routing scheme, for the plurality of hosts and the plurality of switches, the routing map comprising a plurality of forwarding tables. The method can configure, each of the plurality of switches with a forwarding table of the plurality of forwarding tables calculated by the routing engine.

A first information handling system may detect a reboot condition for the first information handling system. The first information handling system may transmit a first notification to a second information handling system, notifying the second information handling system that the first information handling system is going to reboot. The first information handling system may transmit a second notification to a third information handling system, instructing the third information handling system to age out old root information. The first information handling system may then reboot.

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.

Techniques are disclosed for seamless integration between a multicasting Virtual Private Network and an edge replicated multicast network. For example, a controller (e.g., software defined networking (SDN) controller) may facilitate the integration between a multicasting VPN network and an edge replicated multicast network through the selection of a multicast bridge node from virtual routers specified in the multicast replication tree, and sending information identifying the multicast bridge node to a provider edge (PE) device for the source VPN such that the PE device may use the information to steer multicast traffic from the source VPN site across the Layer 3 VPN network to the multicast bridge node of the receiver VPN site. When the multicast bridge node receives the multicast traffic, the multicast bridge node determines from the information that it is to receive the multicast traffic and to perform the edge replicated multicast using the edge replicated multicast tree.