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 control and monitoring system orders a service chainan order of data flow through a plurality of network nodesbased on network node identifiers. The control and monitoring system provide a policy to networking nodes in order to enforce the order of the service chain. In some embodiments, features are implemented to improve the availability of service chains. Such features include load-balancing, fail-over, traffic engineering, and automated deployment of virtualized network functions at various stages of a service chain, among others.

Embodiments relate generally to systems and methods for transitioning a system from a tradition network to a Software Defined Network (SDN) enabled network. In some embodiments, the systems and methods may comprise the use of a Path Computation Element (PCE) as a central controller. Smooth transition between traditional network and the new SDN enabled network, especially from a cost impact assessment perspective, may be accomplished using the existing PCE components from the current network to function as the central controller of the SDN network is one choice, which not only achieves the goal of having a centralized controller to provide the functionalities needed for the central controller, but also leverages the existing PCE network components.

One embodiment provides a system that facilitates efficient management of a forwarding information base (FIB). During operation, the system receives, by an intermediate node, a first interest which includes a name and a condition for removing a first entry from a FIB, wherein a name is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level. In response to obtaining the first entry from the FIB based on the name for the first interest, the system adds to the first entry the condition included in the first interest as a lifetime value for the first entry. In response to determining that the lifetime value is satisfied, the system removes the first entry from the FIB, thereby facilitating the intermediate node to efficiently manage the FIB based on information provided by a content producing device.

When IGMP packets are relayed to a predetermined router (L3SW), first and second L2SWs update their own snooping tables by snooping. Also, the first L2SW acquires a correspondence relation retained in the snooping table of the second L2SW through a control plane and registers it to the snooping table of the first L2SW. Then, when the first L2SW receives a multicast packet whose destination is a multicast group, the first L2SW extracts corresponding IP addresses based on its own snooping table and converts the multicast packet into unicast packets whose destinations are the IP addresses.

Node devices of a mesh communications network are interconnected by links. Forwarding tables are initially built following a link-state routing protocol. Each node device performs, upon detecting a link failure or a link recovery, determining and transmitting. Each end-point, when receiving said message(s) representative of said link failure or said link recovery, records an indication of whether each data path identified in the received message(s) can be activated or not. When the received message(s) is(are) representative of a link failure, each end-point performs selecting and transmitting.

An object-forwarding device can block a malicious Content Object from being inserted into an Interest's reverse path over a named data network. During operation, the device can receive a Content Object via a first interface, and can perform a lookup operation in a Pending Interest Table (PIT) to identify a PIT entry for an Interest associated with the Content Object. The device then determines, from the PIT entry, an egress interface used to forward the Interest. If the device determines that the egress interface of the PIT entry matches the first interface for the Content Object, the device forwards the Content Object via a return interface specified in the PIT entry. On the other hand, if the egress interface of the PIT entry does not match the first interface for the Content Object, the device can block the Content Object.

An example method for segment routing based wide area network (WAN) orchestration in a network environment is provided and includes monitoring a segment routing (SR) enabled WAN environment in at least near real-time by a path computation element (PCE) located outside the WAN, receiving an event notification at the PCE, and performing traffic engineering using SR to reroute traffic off shortest paths. In one embodiment, where a current state of the WAN is not pre-computed, performing traffic engineering comprises optimizing routes to remove violation of any utilization policies, deploying the optimized routes in the WAN, re-optimizing routes for other parameters, and further deploying the re-optimized routes in the WAN. In another embodiment, performing traffic engineering comprises optimizing routes to remove violation of any utilization policies and for other parameters, and deploying the optimized routes in the WAN. In another embodiment, performing traffic engineering comprises deploying optimized routes in the WAN.

Provided is a data processing system, including: a plurality of line matching blocks each including a data processor configured to store predefined preliminary transmission tables corresponding to the respective events requiring change of a data path, to determine whether to change a transmission table based on information received through an internal communication device, and to select and activate a preliminary transmission table corresponding to an event from among the preliminary transmission tables, wherein the preliminary transmission tables include destination information on all the physical or logical paths; and a shared bus configured to enable information on an event requiring change of the data path to be transmitted and received between the plurality of line matching blocks.

A method for dynamic reaction to DIAMETER routing failures is disclosed. The method for dynamic reaction to DIAMETER routing failures includes receiving a DIAMETER message, calculating a statistic associated with the route of the message, testing if the message is an unable_to_deliver message type, and if it is, testing the calculated statistic against a criterion. In the event the statistic exceeds the criterion, an action pertinent to the route which had a delivery failure is taken. The method for dynamic reaction to DIAMETER routing failures provides for dynamic management of routes at the node level in response to delivery failures. The method for dynamic reaction to DIAMETER routing failures is particularly useful for overcoming bandwidth usage in terms of delivery failures known in the art.