gurfin RiveransRafting

BGP Path selection One of the most essential parts of BGP is its path selection algorithm. It dictates how BGP is to select which paths to promote to the RIB. Using the different Path attributes you can affect how routing of your prefixes is done within your network, in your peers network and even on the internet. The path selection is done in a ascending order, where the first unequal attribute will be the determinator of which path is selected.

Big Gaming Protocol The big bad Border Gateway Protocol (BGP) is, unlike the OSPF, EIGRP and ISIS, an eBGP designed to connect together large scale networks. Because BGP is built for scale, it is tuned to be a bit more stable than the IGPs. For example it does not allow for dynamic neighbor discovery, but rather each neighbor must be explicitly specified. The BGP hold timers are also a lot more generous than the IGP timers, with the default being 3 minutes.

OSPF version 3 To support IPv6 routing, OSPF version 3 (OSPFv3) was created. It has support for both IPv4 and IPv6, but is not backwards compatible with the version 2 standard. In fact, the protocol is designed to be independent on the address family type. The communication between routers is based entirely on IPv6 though, using link-local addresses. There is also support for multiple instances within a network, which allows you to configure which routers are able to form adjacencies.

Path selection for good old OSPF Path selection is based on the Shortest Path Tree (SPT) found using Dijkstra’s Shortest Path First (SPF) algorithm. Generally OSPF prefers intra-area routes, inter-area routes and external routes, ordered from most to least preferred. If two paths exists for a given route, within the same area, then the one with the lost total metric is injected into the RIB. If two routes have equal total metrics, then both are generally injected into the RIB.

Open Shortest Path First (OSPF) 🗺️ Areas are a way to divide an OSPF domain into smaller, logical chunks, which allows for less resources to be used by the OSPF process. Each interface on an OSPF router can only be member of a single area, however, an OSPF router can have interfaces in multiple areas, thus becoming an Area Border Router (ABR). A unique LSDB will be created for each area that a router is a member of.

The basics of routing When traffic needs to traverse different networks it must be routed. This is usually done in a router (hence the name). In order for a router to send a packet correctly, it must know which interface to route the packet out of, and in the case of non point-to-point links it also needs to know which L2 device to send the frame to. In order to do this the router will keep a table of all the currently active routes which will then be used to program the ASICs with.

Spanning tree is a system developed to prevent loops in layer two networks. Unlike on L3, frames do not have a TTL that decrements with each hop. To further complicate loop prevention on L2, the usage of broadcast frames is used very frequently. Although this is beneficial for the simplicity of the hosts on the L2 network, this does cause some added complication in loop prevention. Why? 🤷🏻‍♂️ As the need for redundancy in networking grew, the desire to run multiple links between switches needed to be addressed.

In the beginning of LANs the Layer 1 media was shared between all devices in said LAN. They all received and transmitted on the same wires, at the same time. This is whats known as half-duplex (only send or received, not both). In this configuration devices would sometimes send traffic at the same time, which causes interference on Layer 1. The resulting interference can be enough to disrupt the communications. The shared “area” in which devices are connected to is known as a “collision domain”.