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.

One of the embodiments of the present invention relates to a method for operating a routing device in a network. The method comprises: receiving, during routing table calculation for a first topology change associated with a first routing device, a message indicative of a second topology change associated with a second routing device; determining a time duration of a hold time period based on a running time required for performing shortest path first calculations for a shortest path between the routing device and the second routing device, wherein the running time is retrieved from a running time database and the running time database is configured to store plural values each of which is indicative of a running time required for performing shortest path first calculations for a shortest path between the routing device and each of other routing devices in the network, wherein during the hold time period, the routing device does not perform any further routing table calculation. The present invention also relates to corresponding routing device.

Technologies for identifying a cache line of a network packet for eviction from an on-processor cache of a network device communicatively coupled to a network controller. The network device is configured to determine whether a cache line of the cache corresponding to the network packet is to be evicted from the cache based on a determination that the network packet is not needed subsequent to processing the network packet, and provide an indication that the cache line is to be evicted from the cache based on an eviction policy received from the network controller.

The present disclosure discloses an Intermediate System to Intermediate System (ISIS)-based route computation method and apparatus. Herein, the method includes that: a route computation unit acquires a Link State Protocol Data Unit (LSP) packet from each Intermediate System (IS) of a network (S102); the route computation unit computes a route table of each IS according to the above-mentioned LSP packet, and sends the above-mentioned route table to each IS (S104). The problem in the existing technology that a route computation manner for an ISIS occupies considerable computation resources and is easily attacked is solved, the computation resources occupied by the route computation manner for the ISIS are reduced, and the opportunities of attacking the ISIS are reduced since it is unnecessary to perform mutual flooding and synchronization among various ISs and to save LSPs of other ISs, thereby improving the stability and reliability of a system.