Various example embodiments for supporting stateless multicast communications in a communication system are presented. Various example embodiments for supporting stateless multicast communications may be configured to support stateless multicast communications in a label switching network (e.g., a Multiprotocol Label Switching (MPLS) network, an MPLS—Traffic Engineered (TE) network, or the like) based on a network label space. Various example embodiments for supporting stateless multicast communications based on a network label space may be configured to support assignment, from a network label space of a network, of a set of labels for nodes of the network and for adjacencies of the network. Various example embodiments for supporting stateless multicast communications based on a network label space may be configured to support assignment of node labels from the network label space for nodes of the network and assignment of adjacency labels from the network label space for adjacencies of the network.

Systems, methods, and devices for routing operations in a network computing environment. A system includes a network topology comprising a plurality of spine nodes and a plurality of leaf nodes, wherein a link between a first spine node and a first leaf node is inactive. The first spine node includes one or more processors configurable to execute instructions stored in non-transitory computer readable storage media. The instructions include receiving a packet to be transmitted to the first leaf node. The instructions include identifying an alternative spine node at a same level in the network topology. The instructions include attaching a tunnel label to the packet, wherein the tunnel label indicates the packet should be transmitted to the alternative spine node.

A novel algorithm for packet classification that is based on a novel search structure for packet classification rules is provided. Addresses from all the containers are merged and maintained in a single Trie. Each entry in the Trie has additional information that can be traced back to the container from where the address originated. This information is used to keep the Trie in sync with the containers when the container definition dynamically changes.

In one embodiment, an apparatus includes a processing circuit and logic integrated with and/or executable by the processing circuit. The logic is configured to cause the processing circuit to handle Internet Group Membership Protocol (IGMP) messages received from other devices in a network. Also, the logic is configured to cause the processing circuit to create a general query solicit (GQS) message configured to solicit a general query (GQ) from a multicast snooping querier coupled with the apparatus. The GQS message causes the multicast snooping querier to send out a general query (GQ) message on all ports in response to receiving the GQS message. The GQ message is configured to solicit port information and group membership information from each IGMP switch in the network. Other systems, methods, and computer program products are described in more embodiments.

In one embodiment, a network device (e.g., a RPL router) executes fast local RPL recovery in a low power and lossy network (LLN). The network device, in response to becoming an orphan in a directed acyclic graph (DAG) topology, can utilize the data plane to maintain at least some data traffic by randomly forwarding the data traffic to identified neighbor devices, while eliminating children from the list of forwarders and by finding successors that can be used for re-parenting. Hence, when a RPL network device having lost its last feasible parent can avoid data loss and accelerate a re-parenting process using local repair in the data plane instead of the control plane of the routing protocol used to establish the DAG topology.

A rapid method for establishing communication routes between computers of a supercomputer is presented. In this method, a certain number of characteristics of the network are pre-calculated, which are then used for the calculation of the routes. The calculation is based on simple arithmetic operations which makes it possible to be particularly rapid while remaining deterministic.

Techniques for providing a backup network path using a standby wide area network (WAN) link with reducing monitoring. Packet loss and latency metrics are monitored for network paths in an adaptive private network (APN) connecting a first user and a second user according to control traffic operating at a first control bandwidth for each network path. A determination is made that a first network path uses a standby WAN link, has packet loss and latency metrics indicative of a good quality state, and has at least one characteristic that identifies the first network path as a backup network path. The control traffic is then reduced for the backup network path to a second control bandwidth substantially less than the first control bandwidth. The backup network path is made active when the number of active network paths is less than or equal to a minimum number.

A network node device and method of determining a communication route to one or more other network nodes through a network. The method includes sending current routing information to a network management server (NMS), and receiving new or supplemental routing information from the NMS, this supplemental routing information determined by the NMS based on the current routing information of the network node and the other network node(s). The supplemental routing information may include lateral route information identifying designated routing nodes that form lateral band(s) of nodes that span the network. Each lateral band may include gate node(s) as entrances/exits to the lateral band. The method further includes determining, based on the supplemental routing information, a route to one or more of the other network nodes, which may include an optimal path and/or alternate path(s) from the network node to one or more of the other network nodes.

Techniques for satisfying a plurality of service demands in a data communication network are disclosed. Aspects include identifying a first plurality of edges, each of which connects two of a plurality of nodes in the data communication network, wherein each of the first plurality of edges is associated with one of a plurality of unprotected service demands; generating a spanning tree comprising a second plurality of edges selected from the first plurality of edges, wherein the spanning tree connects all of the plurality of nodes that are connected by the first plurality of edges; and creating a set of service links based on the generated spanning tree.

A wireless sensor network node selection that efficiently manages active nodes using a Tabu heuristic coupled with minimum spanning tree routing protocol (TNS-MST) is presented. Nodal energy consumption is balanced to ensure all nodes are operating at the same energy level. To balance the energy consumption, nodes with high energy depletion are removed from routing by placing on them a Tabu list, which prevents the most used nodes, such as nodes close to a base station, from draining before their neighbors. The nodes in the Tabu lists are dynamically active according to the energy level of neighboring nodes. The Tabu list combined with Minimum Spanning Tree routing protocol, TNS-MST, greatly increases network lifetime by optimally balancing the energy of the sensor nodes.