There is disclosed a node for routing data packets in a flow. The node generally comprises a receiver which is configured to receive a command to reroute the flow from a first source route to a second source route. The node also includes a processor for determining that a period of time between first and second consecutive data packets of the flow exceeds a threshold value and a transmitter configured to transmit the second data packet on the second source route in response to the determination. Alternatively, the determination of a period of time between first and second consecutive data packets of the flow can be made by a network controller which can instruct a given node to perform the rerouting of the flow in a manner to route only the second and following consecutive data packets along the second source route.

Systems, methods, and computer-readable media for flushing of Customer Media Access Control (C-MAC) addresses in a PBB-EVPN network are disclosed. A first provider edge (PE) device can maintain a plurality of service instances configured on a first interface. The first PE device can detect at least one failed ethernet virtual circuit (EVC) on the first interface and identify at least one service instance from the plurality of service instances that is associated with the at least one failed EVC. The PE device can send, to a second PE device, a C-MAC flush notification message that identifies the at least one service instance and the message can cause the second PE device to remove C-MAC addresses corresponding to the at least one service instance and the B-MAC address for the first interface.

An example network device includes a set of physical network interfaces and a control unit that executes a routing protocol and a traffic impact prediction module. The traffic impact prediction module determines, prior to occurrence of a topology-changing device fault, that one or more operating characteristics of the network device are indicative of a possible fault, wherein the network device is one of a plurality of network devices in a network, determines a probability of traffic loss associated with the possible fault, and determines an adjusted routing metric for routes impacted by the possible fault based at least in part on the probability of the traffic loss. The routing protocol sends, via at least one of the set of physical network interfaces, one or more interior gateway protocol update messages specifying the adjusted routing metric to at least one other network device in the network.

In general, techniques are described for reducing or otherwise preventing micro-loops in network using Source Packet Routing in Networking (SPRING). In some examples, a method includes detecting a failure of a communication by a network device that implements a Source Packet Routing in Networking (SPRING) protocol to forward network packets using node labels according to an initial network topology. Responsive to detecting the failure of the communication link, the network device may apply, for a defined time duration, one or more adjacency labels to network packets to define a set of one-hop tunnels corresponding to a backup sub-path that circumvents the failed communication link. Upon expiration of the defined time duration, the network device may forward, according to a new network topology that is not based on applying the one or more adjacency labels that define the set of one-hop tunnels, network packets destined for the destination network device.

A method of path computation in a segment routing network, the network comprising a set of nodes. The method comprises receiving a request for computation of a path between end nodes in the network, the request including a constraint. The method further comprises determining a segment identifier-optimised path defined by a stack of one or more segment identifiers, wherein the segment identifier-optimised path meets the constraint. The determining of the segment identifier-optimised path comprises analyzing a topology of the network comprising: at least a sub-set of the nodes, links between adjacent nodes indicative of possible paths between the nodes, and virtual links between pairs of nodes indicative of possible paths between the pairs of nodes. The method further comprises outputting at least one segment identifier which defines the determined path.

The present disclosure provides a method and apparatus for learning a MAC address of a TRILL network. The method comprises: learning, by a routing bridge connected to an end system, a MAC address of the end system; encapsulating the MAC address in a link-state packet, sending the link-state packet to a neighbor routing bridge; after the neighbor routing bridge receives the link-state packet, judging whether the MAC address in the link-state packet is locally present; if not, learning the MAC address in the link-state packet and setting a local confidence to a confidence of the MAC address in the link-state packet; if yes, updating a confidence of a local MAC address to the confidence of the MAC address in the link-state packet, increasing the confidence of the MAC address in the link-state packet by 1, and sending the link-state packet to all neighbor routing bridges except a receiving end.

A route selection system includes a hub controller in communication with multiple network hubs of a first network domain in which each of the hubs are in communication with a corresponding multiple routers of a second network domain. The hub controller is executed to obtain at least one performance measurement associated with a route terminating at the network hub, generate a border gateway protocol (BGP) advertisement with a preference value that is proportional to the received performance measurement, and transmit the generated advertisement to the network hub, the network hub forwarding the advertisement to the router configured in the other network domain. Upon receipt of the advertisements, the second network domain selects one of the routers for processing the route through the second network domain according to the performance measurement included in the advertisement.

Aspects of the subject technology relate to systems for arbitrating direct forwarder (“DF”) instantiation between VPC peers used to facilitating the transport of bidirectional multicast traffic over a L2/L3 network boundary. In some aspects, arbitration of DF instantiation on a given VPC peer can include determining a first set of metrics for a first VPC switch, determining a second set of metrics for a second VPC switch, and determining, at the first VPC switch, whether to instantiate a designated forwarder (DF) operation based on a comparison of the first set of metrics and the second set of metrics. Methods and machine-readable media are also provided.

Methods and systems are provided for determining a shortest path with a constraint in an optical network. The method includes identifying a permitted number of events defined by the constraint. The method further includes creating virtual nodes for each node in the optical network, the virtual nodes corresponding with the permitted number of events. The method also includes traversing the virtual nodes from a source node to a destination node with a shortest path algorithm, wherein traversing the virtual nodes comprises creating virtual links between the virtual nodes when the constraint is not violated, the virtual link corresponding with a physical link; and identifying a shortest path between the source node and the destination node from the virtual links, the shortest path not violating the constraint.

Embodiments of the present invention provide for continuity of “stateful” routing sessions in the presence of source network address translation (NAT). Specifically, a stateful routing session may be moved from one routing path to another routing path, e.g., due to a routing change in the communication network, where the routing paths have different source NAT status. For example, the stateful routing session may be moved from a path having no source NAT to a path having source NAT, from a path having source NAT to a path having no source NAT, or from paths having different source network address translations. When a stateful routing session is moved from an existing routing path to a new routing path, the routers detect the routing change based on the change in source NAT status using a special link monitoring protocol. Upon detecting the change in source NAT status, session metadata is included in at least the first packet forwarded following detection of the change in source NAT status so that the stateful routing session can continue without interruption.