Abstract: Methods and apparatuses for fast convergence in Layer 2 overlay network are described. Forwarding of Layer 2 (L2) traffic addressed to one or more remote L2 destinations is performed according to a remote L2 (RL2) instance, where the RL2 instance identifies a primary path for forwarding the traffic towards the remote L2 destinations, and a provider edge service label (PESL) instance associated with a broadcast domain including one or more network devices for forwarding the L2 traffic towards the L2 destination, and where the PESL instance is identified with a unique immutable PESL instance label. In response to a network event, an update of the RL2 instance is performed. The update results in an update of a data plane for forwarding the L2 traffic without necessitating an update of forwarding table entries for each one of the one or more remote L2 destination.

Abstract: Exemplary methods include a first network device participating in an election process to determine a designated bit forwarding router (D-BFR). The methods include in response to determining the first network device is elected to be the D-BFR, performing D-BFR operations comprising assigning one or more bitmask positions (BMPs) to one or more bit forwarding egress routers (BFERs) and advertising the assigned one or more BMPs. The method may further include one or more of determining an elected bitmask (BM) length based on maximum local BM lengths advertised by other BFRs and determining an elected tree type based on supported tree types advertised by other BFRs.

Abstract: Methods and apparatuses for fast convergence in Layer 2 overlay network are described. Forwarding of Layer 2 (L2) traffic addressed to one or more remote L2 destinations is performed according to a remote L2 (RL2) instance, where the RL2 instance identifies a primary path for forwarding the traffic towards the remote L2 destinations, and a provider edge service label (PESL) instance associated with a broadcast domain including one or more network devices for forwarding the L2 traffic towards the L2 destination, and where the PESL instance is identified with a unique immutable PESL instance label. In response to a network event, an update of the RL2 instance is performed. The update results in an update of a data plane for forwarding the L2 traffic without necessitating an update of forwarding table entries for each one of the one or more remote L2 destination.

Abstract: A method is implemented by a network device functioning as a provider edge (PE) device to determine a designated forwarder (DF) for sending broadcast, unknown unicast or multicast (BUM) traffic to a customer edge (CE) device, which is connected to a plurality of PE devices in an Ethernet virtual private network (EVPN) instance on a given Ethernet segment. The method reduces a time for DF determination and loss of traffic for the CE device. The method determines whether a number of active links from the network device to the CE device is greater than an active link minimum. The method also determines that the network device is the DF in response to determining that the number of active links is greater than the active link minimum.

Abstract: Exemplary methods include a first network device participating in an election process to determine a designated bit forwarding router (D-BFR). The methods include in response to determining the first network device is elected to be the D-BFR, performing D-BFR operations comprising assigning one or more bitmask positions (BMPs) to one or more bit forwarding egress routers (BFERs) and advertising the assigned one or more BMPs. The method may further include one or more of determining an elected bitmask (BM) length based on maximum local BM lengths advertised by other BFRs and determining an elected tree type based on supported tree types advertised by other BFRs.

Abstract: Exemplary methods performed by a first network device (ND) include generating first and second prefix entries associating incoming Internet Protocol (IP) traffic to first and second data structures (DSs), respectively. Generating the first DS includes generating a first proxy including forwarding information causing incoming IP traffic to be forwarded to a second ND, and generating a second proxy referencing a third DS. Generating the second DS includes generating a first proxy including forwarding information causing incoming IP traffic to be forwarded to the second ND, and generating a second proxy referencing the third DS. The methods include generating the third DS including forwarding information causing the incoming IP traffic to be forwarded to a third ND, the third DS further including first state information indicating whether the forwarding information included in the first proxies of the first and second DSs should be used for forwarding the incoming IP traffic.

Abstract: Exemplary methods include generating a first fast reroute (FRR) next hop (NH) comprising of a first primary next hop (PNH), a first secondary next hop (SNH), and a first attribute, wherein the first PNH and first SNH include forwarding information that causes traffic to be forwarded towards a second and third network device, respectively. The methods include sending a first request to a forwarding plane to generate a second FRR NH comprising of a second PNH, a second SNH, and a second attribute. The methods include updating contents of the first FRR NH, and sending a second request to the forwarding plane to update the second FRR NH, wherein the second request causes the forwarding plane to determine whether to revert back to using the second PNH based on whether the first attribute included in the second request is different from the second attribute of the second FRR NH.

Abstract: Exemplary methods include a first network device participating in an election process to determine a designated bit forwarding router (D-BFR). The methods include in response to determining the first network device is elected to be the D-BFR, performing D-BFR operations comprising determining an elected bitmask (BM) length of a BM based on maximum local BM lengths advertised by other BFRs in the network, wherein each bit of the BM will correspond to a bit forwarding egress router (BFER), and advertising the determined elected BM length to other BFRs. The methods may further include one or more of determining an elected tree type based on supported tree types advertised by other BFRs in the network, assigning one or more BM positions (BMPs) to one or more BFERs, and advertising the elected determined tree type and/or the assigned one or more BMPs.

Abstract: A network device executes a method to forward a packet that is encoded using an explicit list encoding of sparse multicast group membership information with Bit Index Explicit Replication. The method includes receiving a packet that includes a bitstring having a list of Bit Forwarding Router IDs (BFR-ids). The method further includes selecting a BFR-id identifying a destination Bit Forwarding Router (BFR) from the list for processing, looking up a forwarding bitmask for the destination BFR and a next-hop to reach the destination BFR in a bit index forwarding table, creating a copy of the packet, clearing the selected BFR-id from the packet, clearing BFR-ids from the packet and the copy of the packet based on the forwarding bitmask, and forwarding the copy of the packet to the next-hop neighbor.

Abstract: A method is implemented by a network device functioning as a provider edge (PE) device to determine a designated forwarder (DF) for sending broadcast, unknown unicast or multicast (BUM) traffic to a customer edge (CE) device, which is connected to a plurality of PE devices in an Ethernet virtual private network (EVPN) instance on a given Ethernet segment. The method reduces a time for DF determination and loss of traffic for the CE device. The method determines whether a number of active links from the network device to the CE device is greater than an active link minimum. The method also determines that the network device is the DF in response to determining that the number of active links is greater than the active link minimum.

Abstract: A method and system provides for path maximum transmission unit (PMTU) discovery (PMTUD) for a multicast distribution implemented in a network using bit indexed explicit replication (BIER) architecture. The network has a set of bit forwarding routers (BFRs) that form a BIER domain including at least one ingress BFR (BFIR) and a set of egress BFRs (BFERs). The method improves efficiency of the PMTUD by limiting probe packet traffic. The method includes selecting a BFER from the set of BFERs in the BIER domain to be processed, generating a probe packet to the selected BFER using a current MTU, sending the probe packet to the selected BFER, and updating the current MTU and adding BFERs identified by a response to the probe packet to the set of BFERs in the BIER domain to be processed.

Abstract: A method and system provides for path maximum transmission unit (PMTU) discovery (PMTUD) for a multicast distribution implemented in a network using bit indexed explicit replication (BIER) architecture. The network has a set of bit forwarding routers (BFRs) that form a BIER domain including at least one ingress BFR (BFIR) and a set of egress BFRs (BFERs). The method improves efficiency of the PMTUD by limiting probe packet traffic. The method includes selecting a BFER from the set of BFERs in the BIER domain to be processed, generating a probe packet to the selected BFER using a current MTU, sending the probe packet to the selected BFER, and updating the current MTU and adding BFERs identified by a response to the probe packet to the set of BFERs in the BIER domain to be processed.

Abstract: Exemplary methods include generating a first fast reroute (FRR) next hop (NH) comprising of a first primary next hop (PNH), a first secondary next hop (SNH), and a first attribute, wherein the first PNH and first SNH include forwarding information that causes traffic to be forwarded towards a second and third network device, respectively. The methods include sending a first request to a forwarding plane to generate a second FRR NH comprising of a second PNH, a second SNH, and a second attribute. The methods include updating contents of the first FRR NH, and sending a second request to the forwarding plane to update the second FRR NH, wherein the second request causes the forwarding plane to determine whether to revert back to using the second PNH based on whether the first attribute included in the second request is different from the second attribute of the second FRR NH.

Abstract: Exemplary methods performed by a first network device (ND) include generating first and second prefix entries associating incoming Internet Protocol (IP) traffic to first and second data structures (DSs), respectively. Generating the first DS includes generating a first proxy including forwarding information causing incoming IP traffic to be forwarded to a second ND, and generating a second proxy referencing a third DS. Generating the second DS includes generating a first proxy including forwarding information causing incoming IP traffic to be forwarded to the second ND, and generating a second proxy referencing the third DS. The methods include generating the third DS including forwarding information causing the incoming IP traffic to be forwarded to a third ND, the third DS further including first state information indicating whether the forwarding information included in the first proxies of the first and second DSs should be used for forwarding the incoming IP traffic.

Abstract: A network device executes a method to forward a packet that is encoded using an explicit list encoding of sparse multicast group membership information with Bit Index Explicit Replication. The method includes receiving a packet that includes a bitstring having a list of Bit Forwarding Router IDs (BFR-ids). The method further includes selecting a BFR-id identifying a destination Bit Forwarding Router (BFR) from the list for processing, looking up a forwarding bitmask for the destination BFR and a next-hop to reach the destination BFR in a bit index forwarding table, creating a copy of the packet, clearing the selected BFR-id from the packet, clearing BFR-ids from the packet and the copy of the packet based on the forwarding bitmask, and forwarding the copy of the packet to the next-hop neighbor.

Abstract: Exemplary methods for optimizing a source code base includes generating a dependencies database for a source code base comprising of a plurality of source files, wherein one or more of the plurality of source files comprises a hierarchy of include files, wherein the dependencies database includes dependencies information for each source file and include file, wherein the dependencies information identifies all files that are included by a respective file. In one embodiment, the methods further include modifying the source code base using the dependencies information, wherein the modified code base is more optimized than the source code base, and in response to determining a predetermined optimization threshold has not been reached, repeating the dependencies database generation operation and the source code base modification operation, wherein each time the operations are repeated, the dependencies database generation is performed based on a modified code base from a previous iteration.

Abstract: Exemplary methods include a first network device participating in an election process to determine a designated bit forwarding router (D-BFR). The methods include in response to determining the first network device is elected to be the D-BFR, performing D-BFR operations comprising determining an elected bitmask (BM) length of a BM based on maximum local BM lengths advertised by other BFRs in the network, wherein each bit of the BM will correspond to a bit forwarding egress router (BFER), and advertising the determined elected BM length to other BFRs. The methods may further include one or more of determining an elected tree type based on supported tree types advertised by other BFRs in the network, assigning one or more BM positions (BMPs) to one or more BFERs, and advertising the elected determined tree type and/or the assigned one or more BMPs.