The present invention is directed to a system and a method for facilitating the consistent update of routing tables across the routers of a routing layer in a distributed messaging system. The routers are configured to send together with the outbound message the routing table version used to route the outbound message, which is compared, at the level of the enqueue layer, with the latest deployed routing table version and/or the latest routing table version used to route messages to the requested message queue. If the routing table version of the outbound message is older than the latest deployed routing table version and/or the latest routing table version used to route messages to the requested message queue, then the outbound message is rejected, otherwise, the message is enqueued to the requested message queue.

The present invention is directed to a system and a method for facilitating the consistent update of routing tables across the routers of a routing layer in a distributed messaging system. The routers are configured to send together with the outbound message the routing table version used to route the outbound message, which is compared, at the level of the enqueue layer, with the latest deployed routing table version and/or the latest routing table version used to route messages to the requested message queue. If the routing table version of the outbound message is older than the latest deployed routing table version and/or the latest routing table version used to route messages to the requested message queue, then the outbound message is rejected, otherwise, the message is enqueued to the requested message queue.

Automated topology-discovery processes, wherein topology-related information is exchanged among the nodes of a network using data-plane headers of transmitted packets, and without relying on conventional control-plane topology-discovery protocols. For such “control-plane-less” topology discovery, a discovery-enabling Topology Discovery Header (TDH) may be encoded as an extension of the data-plane header. Such TDH can be used, e.g., to carry various types of pertinent information typically relied-upon by the relevant network entities for topology-discovery purposes. In some embodiments, topology discovery is fully migrated from the control plane to the data plane and is substantially integrated into the corresponding Packet Switching Technology. Due to this migration, some features of some conventional control protocols may not be critically needed in the corresponding communication networks. As a result, adaptation, streamlining, replacement, and/or elimination of some of such control protocols may beneficially be implemented, e.g., to meet the needs of the network operator in a cost-effective manner.

A method of providing a path between bridges of a first network segment. The first network segment is configured using a Spanning Tree Protocol (‘STP’). The method includes providing a second network segment interconnecting first and second bridges of said first network segment. The second network segment is operable to transmit frames adherent to a High-availability Seamless Redundancy (‘HSR’) network control protocol and to discard the STP control data frames. The method also includes modifying at a first Redundancy Box (‘RedBox’) STP control data frames to form modified data frames adherent to the HSR protocol. The method also includes modifying at a second RedBox, the modified data frames to re-form the STP control data frames.

A method of providing a path between bridges of a first network segment. The first network segment is configured using a Spanning Tree Protocol (‘STP’). The method includes providing a second network segment interconnecting first and second bridges of said first network segment. The second network segment is operable to transmit frames adherent to a High-availability Seamless Redundancy (‘HSR’) network control protocol and to discard the STP control data frames. The method also includes modifying at a first Redundancy Box (‘RedBox’) STP control data frames to form modified data frames adherent to the HSR protocol. The method also includes modifying at a second RedBox, the modified data frames to re-form the STP control data frames.

A method for anticipatory bidirectional packet steering involves receiving, by a first packet steering module of a network, a first encapsulated packet traveling in a forward traffic direction. The first encapsulated packet includes a first encapsulating data structure. The network includes two or more packet steering modules and two or more network nodes. Each of the packet steering modules includes a packet classifier module, a return path learning module, a flow policy table, and a replicated data structure (RDS). The return path learning module of the first packet steering module generates return traffic path information associated with the first encapsulated packet and based on the first encapsulating data structure. The first packet steering module updates the RDS using the return traffic path information and transmits the return traffic path information to one or more other packet steering modules.

A method for anticipatory bidirectional packet steering involves receiving, by a first packet steering module of a network, a first encapsulated packet traveling in a forward traffic direction. The first encapsulated packet includes a first encapsulating data structure. The network includes two or more packet steering modules and two or more network nodes. Each of the packet steering modules includes a packet classifier module, a return path learning module, a flow policy table, and a replicated data structure (RDS). The return path learning module of the first packet steering module generates return traffic path information associated with the first encapsulated packet and based on the first encapsulating data structure. The first packet steering module updates the RDS using the return traffic path information and transmits the return traffic path information to one or more other packet steering modules.

In one illustrative example, a network node connected in a network fabric may identify that it is established as part of a multicast distribution tree for forwarding multicast traffic from a source node to one or more host receiver devices of a multicast group. In response, the network node may propagate in the network fabric a message for advertising the network node as a candidate local source node at which to join the multicast group. The message for advertising may include data such as a reachability metric. The propagation of the message may be part of a flooding of such messages in the network fabric. The network node serving as the candidate local source node may thereafter “locally” join a host receiver device in the multicast group at the network node so that the device may receive the multicast traffic from the source node via the network node.

In one illustrative example, a network node connected in a network fabric may identify that it is established as part of a multicast distribution tree for forwarding multicast traffic from a source node to one or more host receiver devices of a multicast group. In response, the network node may propagate in the network fabric a message for advertising the network node as a candidate local source node at which to join the multicast group. The message for advertising may include data such as a reachability metric. The propagation of the message may be part of a flooding of such messages in the network fabric. The network node serving as the candidate local source node may thereafter “locally” join a host receiver device in the multicast group at the network node so that the device may receive the multicast traffic from the source node via the network node.

Systems and methods include obtaining a table having a plurality of addresses each having a plurality of attributes and classifications; responsive to a requirement to reduce a size of the table, reducing a number of the plurality of addresses based on one or more reduction approaches that use any of the plurality of attributes and classifications; and obtaining an output table having some or all of the plurality of addresses for a table receiver. The table can be obtained via control plane components including one or more of Interior Gateway Protocol (IGP) and Border Gateway Protocol (BGP). The requirement to reduce the size is based on a size of the table and a size of memory associated with the table receiver.