Provided is an intermediate system to intermediate system routing protocol based notification method. The method includes: within a delay period since an intermediate system (IS) establishes a new neighbor, notifying the outside through a link state protocol (LSP) data packet that a METRIC for traffic of the IS reaching the new neighbor is a preset value; after the delay period expires, restoring the METRIC to a normal value, where the preset value is greater than the normal value. Further provided are an intermediate system to intermediate system routing protocol based notification apparatus, a storage medium and a processor.

Among other things, a node is enabled to participate, with other nodes, in forming and using transport layer features in a communication network, the transport layer features being extensible to support ten million or more simultaneous reliable conversations between or among applications running on respective participant nodes.

A method for operating an Ethernet virtual private network includes advertising, by a peer of the Ethernet virtual private network, virtual local area network routing information based on an integrated routing and bridging interface of the peer; making a determination that an Ethernet segment directly connecting a multi-homed host and the peer has failed; in response to the determination: withdrawing, by the peer, a first route of a first type of route associated with the Ethernet segment; maintaining, by the peer, a first route of a second type of route associated with the multi-homed host for a predetermined time after the Ethernet segment has failed; and forwarding, by the peer, a packet while the Ethernet segment has failed.

A method for withdrawing programmed routes in network devices. The method includes receiving instructions to withdraw at least one route of a set of programmed routes, where the set of programmed routes is stored in a forwarding information base (FIB), removing the at least one route from a set of routes stored in a routing information base (RIB), notifying at least one peer network device of a set of peer network devices about the at least one route to be withdrawn, initializing a timer with a timeout value and starting the timer, before the time expires, processing a packet that uses the at least one route to be withdrawn, and after the timer expires, removing the at least one route from the FIB.

An approach for a dynamic provisioning of multiple RSS engines is provided. In an embodiment, a method comprises monitoring a CPU usage of hardware queues implemented in a plurality of RSS pools, and determining whether a CPU usage of any hardware queue, implemented in a particular RSS pool of the plurality of RSS pools, has increased above a threshold value. In response to determining that a CPU usage of a particular hardware queue, implemented in the particular RSS pool, has increased above the threshold value, it is determined whether the particular RSS pool includes an unused hardware queue (a queue with light CPU usage). If such an unused hardware queue is presented, then an indirection table that is associated with the particular RSS pool is modified to remap one or more data flows from the particular hardware queue to the unused hardware queue.

Some embodiments provide a method for a managed forwarding element that processes packets through a set of packet processing tables by matching rules in the tables. The method receives an update that requires modification to at least one of the packet processing tables. Each rule in the packet processing tables is assigned a range of packet processing table versions in which the rule is valid for processing packets. The method modifies the packet processing tables according to the received update by at least one of (i) modifying the range of packet processing table versions in which an existing rule is valid to end after a current packet processing table version and (ii) adding a new rule with a range of valid packet processing table versions that begins with a next packet processing table version. The method increments the current version of the packet processing tables to commit the modifications.

A method operates a software defined network that has a number of data plane elements having flow table entries that define forwarding functions of the data plane elements; and at least one control plane element for programming the forwarding functions of the data plane elements by instructing the data plane elements to install appropriate flow table entries. The method includes: obtaining, by the data plane elements, flow table entry installation time information and making this information available directly or indirectly to the at least one control plane element; and using, by the at least one control plane element, the flow table entry installation time information for deciding on which of the data plane elements to install a particular flow table entry and/or when to transmit an instruction to one or more of the data plane elements to install a particular flow table entry.

Examples disclosed herein relate to reducing flooding of route updates of a dynamic routing protocol. In an example, number of route updates received by a router from each neighbor router may be determined, wherein the router may be present in a network using a dynamic routing protocol. Each neighbor router may be classified into one of a plurality of groups of neighbor routers in such a manner that number of route updates originating from each group of neighbor routers is approximately same. A first route update interval may be determined for each group of neighbor routers for sending a respective first set of future route updates therefrom to the router. The respective first route update interval for sending the respective first set of future route updates may be notified to the respective member routers of each group of neighbor routers.

A method and apparatus of a network element that processes network data in an equal cost multi-path (ECMP) group is described. In an exemplary embodiment, the network element receives the network data, where the network data is part of network data flow. In addition, the network element detects that the network data flow is a new network data flow and selects a transmitting nexthop from a plurality of nexthops of the ECMP group. The network element further maps the new network flow to a slot of a table in an ECMP group and transmits the network data using the transmitting nexthop.

An apparatus which transfers information addressed to a master node, comprises a generation unit configured to generate an assessment value representing logical proximity to the master node; a transmit unit that sends/receives the assessment value to/from other apparatuses; and a communication unit that, when this apparatus is an apparatus that is logically closest to the master node within a communication range, receive information addressed to the master node from other apparatuses, otherwise, transmit information addressed to the master node to the logically closest apparatus, wherein the communication unit is configured to generate a delay time based on the assessment value when transferring the information received from the other apparatuses to yet another apparatus.