Abstract: A network device may receive a border gateway protocol (BGP) flow specification route associated with creation of an overlay network slice in a network, and may create a new routing instance based on the BGP flow specification route. The network device may associate interfaces defined by the BGP flow specification route with virtual private network (VPN) members, and may determine VPN parameters based on the BGP flow specification route. The network device may advertise the VPN parameters within the network to cause the network to generate the overlay network slice.

Abstract: In some implementations, a first network device may determine a route distinguisher (RD) and a route target (RT) associated with an address prefix that is to be included in a global routing and forwarding table. The first network device may send an advertisement that includes the address prefix, the RD, and the RT, wherein: the RT indicates that the address prefix is to be included in a global routing and forwarding table of a receiving network device.

Abstract: A network device may receive an MPLS packet destined for a destination via a label-switched path (LSP), and may determine whether to apply a first special purpose label (SPL) option or a second SPL option for a label stack of the MPLS packet. The network device may apply, when the first SPL option is determined to be applied, one of a first type of the first SPL option for the label stack via a policy data indicator (PDI) and policy data (PD), or a second type of the first SPL option for the label stack via the PDI and the PD. The network device may forward the MPLS packet to a hop of the LSP based on the first type of the first SPL option or the second type of the first SPL option applied to the MPLS packet.

Abstract: This disclosure describes techniques that include determining, at an egress node in an SRm6 network, how to process a packet that may arrive without a segment routing header and/or a compressed routing header. In one example, this disclosure describes a method that includes receiving, by an egress node of a segment routing network, segment routing advertisements; configuring, by the egress node and based on the segment routing advertisements, information enabling the egress node to recognize encapsulated packets arriving at the egress node without a compressed routing header; receiving, by the egress node, a packet that does not have a compressed routing header; and de-encapsulating, by the egress node and based on the stored information, the packet.

Abstract: The techniques describe network slicing in computer networks. For example, a node receives a slice policy definition. The slice policy definition comprising a slice selector to identify packets belonging to one or more network slices, referred to as a “slice aggregate,” and one or more network resource requirements for the slice aggregate to meet one or more Service Level Objectives (SLOs). The node configures, based on the slice policy definition, a path for the slice aggregate that complies with the one or more network resource requirements. In response to receiving a packet, the node determines whether the packet is associated with the slice aggregate and, in response to determining that the packet is associated with the slice aggregate, forwards the packet along the path for the slice aggregate.

Abstract: This disclosure describes techniques that include determining, at an egress node in an SRm6 network, how to process a packet that may arrive without a segment routing header and/or a compressed routing header. In one example, this disclosure describes a method that includes receiving, by an egress node of a segment routing network, segment routing advertisements; configuring, by the egress node and based on the segment routing advertisements, information enabling the egress node to recognize encapsulated packets arriving at the egress node without a compressed routing header; receiving, by the egress node, a packet that does not have a compressed routing header; and de-encapsulating, by the egress node and based on the stored information, the packet.

Abstract: Techniques are described for using route target constraint to filter routes advertised to a node in a seamless Multiprotocol Label Switching (MPLS) network. For example, a first router of a first network may generate a first border gateway protocol (BGP) message to advertise routing information for a first node of the first network, the first BGP message indicating a transport class and specifying an address-specific route target, the transport class comprising one or more tunnels to the first node that share common characteristics. In response to receiving a second BGP message originated by second node of a second network, the second BGP message comprising the address-specific route target, the first router sends the first BGP message to a second router of the second network for sending to the second node to cause the second node to import the routing information.

Abstract: Techniques are described by which a routing protocol, such as border gateway protocol (BGP), is extended to control propagation and importation of information using route targets (RTs) specified as bitmasks that encode link administrative group information. For example, a network control device (e.g., controller) is configured to allocate one or more subset of resources (e.g., nodes or links) of an underlay network to each of one or more virtual networks established over the underlay network. The controller generates a bitmask encoded with link administrative group information of the one or more links. The controller then outputs, to a plurality of provider edge (PE) routers that are participating in a respective virtual network, a routing protocol message to advertise the one or more subset of resources, wherein the routing protocol message includes a route target specified as the bitmask.

Abstract: In general, this disclosure describes a network device that checks consistency between routing objects in a routing information base (RIB), a forwarding information base (FIB), and packet forwarding engine (PFE) forwarding tables. A method includes generating a marker that causes a routing protocol daemon, a control plane kernel, and PFEs of a network device to calculate zonal checksums for a plurality of zones using consistency values for each routing object within a RIB, a FIB, and corresponding forwarding tables respectively. The method includes performing a consistency check on the RIB, the FIB, and the forwarding tables to determine whether the routing objects in each of the RIB, the FIB, and the forwarding tables are consistent with each other. The method includes, when the RIB, the FIB, and the forwarding tables are not consistent, performing an action related to at least one of RIB, the FIB, or the forwarding tables.

Abstract: In general, this disclosure describes a network device that checks consistency between routing objects in a routing information base (RIB), a forwarding information base (FIB), and packet forwarding engine (PFE) forwarding tables. A method includes generating a marker that causes a routing protocol daemon, a control plane kernel, and PFEs of a network device to calculate zonal checksums for a plurality of zones using consistency values for each routing object within a RIB, a FIB, and corresponding forwarding tables respectively. The method includes performing a consistency check on the RIB, the FIB, and the forwarding tables to determine whether the routing objects in each of the RIB, the FIB, and the forwarding tables are consistent with each other. The method includes, when the RIB, the FIB, and the forwarding tables are not consistent, performing an action related to at least one of RIB, the FIB, or the forwarding tables.

Abstract: The use and processing of update messages (e.g., BGP UPDATEs) that bind (e.g., MPLS) labels to address prefixes is improved such that labels are used more efficiently, and/or such that such update messages can be processed more efficiently. A distance vector control signaling protocol (e.g., BGP) peer device receives a control plane message (e.g., BGP Update) from a downstream peer device, the control plane message including (1) a network address of the downstream device as a next hop value, (2) a prefix value, and (3) at least one label associated with the prefix value. Responsive to receiving the control plane message, the peer device generates a new control plane message including (1) a network address of the peer device as a next hop value, (2) the prefix value from the control plane message, and (3) a label stack including (i) the at least one label from the control plane message, and (ii) a local label associated with the peer device.

Abstract: A method for a router having a routing table and a forwarding table. In an embodiment, the method includes creating an entry for use in the forwarding table, the entry corresponding to multiple entries of the routing table. The entry may correspond to a set of entries of the routing table which specify overlapping IP addresses and a same next hop router, in one example. In another example, the entry may be an aggregate entry corresponding to a set of entries of the routing table which specify the same next hop router.

Abstract: A method for a router having a routing table and a forwarding table. In an embodiment, the method includes creating an entry for use in the forwarding table, the entry corresponding to multiple entries of the routing table. The entry may correspond to a set of entries of the routing table which specify overlapping IP addresses and a same next hop router, in one example. In another example, the entry may be an aggregate entry corresponding to a set of entries of the routing table which specify the same next hop router.

Abstract: A method for a router having a routing table and a forwarding table. In an embodiment, the method includes creating an entry for use in the forwarding table, the entry corresponding to multiple entries of the routing table. The entry may correspond to a set of entries of the routing table which specify overlapping IP addresses and a same next hop router, in one example. In another example, the entry may be an aggregate entry corresponding to a set of entries of the routing table which specify the same next hop router.