Sunday, January 25, 2015

CCIE OCG: EIGRP (Chapter 8), Part V

Router ID

  • A single 4-byte number representing a particular router instance.
  • Each address family instance has its own independent RID. The same RID can be used.
  • Originally, the primary use of the RID was to prevent routing loops in EIGRP environments using redistribution.
  • If an external route is received with the same RID as the local router, the route is discarded.
  • The RID was not originally advertised with internal routes.
  • In recent IOS releases, both internal and external routes carry the RID of the router that injected it into EIGRP.
  • A router will discard every received route carrying the router's own RID.
  • The rules of RID value selection:
  1. Manual configuration by eigrp router-id.
  2. The highest IP address among non-shutdown loopback interfaces.
  3. The highest IP address among all other non-shutdown interfaces.
  • After chosen, the RID will not be reinitialized until the EIGRP process is removed, the RID manually configured or a manually configured RID is removed.
  • For manual configuration, the values 0.0.0.0 and 255.255.255.255 are disallowed.
  • If a router's RID changes, it drops and reestablishes its adjacencies.
  • When interface IP addresses of a running router are changed without restarting it, the EIGRP RID will remain unchanged.
  • This can cause issues when a new router is introduced into the network, retaking the other router's addresses and tasks, while the old router is renumbered without restarting it.
  • As a result, it is possible that these two routers have the same EIGRP RID and they will not learn routes injected into EIGRP by each other.
  • There is no logging message to point to this phenomenon.
  • Before only show ip eigrp topology and show ipv6 eigrp topology showed the RID.
  • Now show eigrp protocols and show ip protocols will also display the RID.

Unequal-Cost Load Balancing

  • Distributing traffic load across multiple unequal-cost paths.
  • The key element is the presence of Feasible Successors.
  • Feasible Successors provide a guaranteed loop-free path to the destination, although not necessarily the shortest one.
  • Enabled through the variance <multiplier> command.
  • The multiplier essentially defines how many times worse than the best path a route through a Feasible Successor can be to be still used by EIGRP.
  • For multiplier V, the router checks whether a Feasible Successor meets the following condition:
    CD via Successor < CD via Feasible Successor < V x CD via Successor
  • If the route passes the condition, it is installed into the routing table.
  • A multiplier of 1, the default, implies that no unequal-cost load balancing is performed.
  • If multiple unequal-cost paths are installed into the routing table, the router will forward proportionally less traffic over the worse paths, and vice versa.
  • The traffic flow over a particular path can be computed as this ratio: Highest Installed Path Metric / Path Metric.
  • For paths with metrics 1100, 1100, 2000, and 4000, the traffic amount over these paths would be 4000/1100 = 3, 4000/1100 = 3, 4000/2000 = 2, and 4000/4000 = 1.
  • The true traffic share ration would be 3:3:2:1 (recall that IOS routers perform integer division).
  • Routers that do not meet the Feasibility Condition, i.e. non-Feasible Successors, are not considered in unequal-cost load balancing.
  • The unequal-cost paths installed into the routing table also count toward the maximum number of parallel paths (maximum-paths).

Add-Path Support

  • Allows a hub router to advertise multiple equal-cost routes to the same destination.
  • The routes must first be installed in the hub's routing table.
  • Might require tuning the metrics and the maximum-paths value.
  • The hub router must have the Split Horizon feature deactivated.
  • Can be configured only in named mode, and is controlled on a per-interface basis using the add-paths <path-count> command.
  • The add-paths command allows advertising additional path-count equal-cost routes in addition to the route that would be advertised nonetheless.
  • The path-count is a mandatory argument in the range of 1 to 4.
  • In total, the spokes can learn about five different equal paths to a particular destination.
  • Spokes routers do not need to be specifically configured for the Add-Path feature, apart from possible tuning of the maximum-paths command to be able to insert multiple equal-cost paths into their routing tables.
  • The Variance and Add-Path features are not compatible with each other.
  • When using Add-Path, always be sure to set the variance to 1.

router eigrp CCIE
  address-family ipv4 unicast autonomous-system 1
    topology base
      variance 1
      maximum-paths 6
      exit
    af-interface Tunnel0
      no split-horizon
      no next-hop-self
      add-paths 4


  • The no-ecmp-mode command deactivates EIGRP's internal optimization and forces EIGRP to always walk over all equal-cost paths to a destination recorded in the topology table, making sure that if any of these routes' Successors can be reached over the interface on which the route is going to be readvertised, the no next-hop-self command will be honored and the Successor's address will be retained in the advertisement.
  • The use of no-ecmp-mode is recommended with the Add-Path feature if the hub uses multiple tunnel interfaces to reach the spoke sites.

Stub Routing

  • Primarily designed to improve network scalability and stability.
  • Most commonly used in hub-and-spoke networks.
  • Only configured on spoke routers.
  • When configured on a spoke router, the router announces its stub router status using and additional TLV in its EIGRP Hello messages.
  • The results of a stub router are multifold:
  1. A stub router does not propagate routes learned through EIGRP to its neighbors, with the exception of EIGRP-learned routes that are explicitly selected using a so-called leak-map construct. The router cannot be considered as a Feasible Successor and cannot become a transit router.
  2. A stub router advertises only a subset of its own EIGRP-enabled networks to its neighbors. Defined in the eigrp stub command with summary, connected, static, redistributed, and receive-only keywords.
  3. Neighbors will never send a Query packet to a stub router. The neighbors cannot converge through a stub router to reach networks that are remote to the stub router.
  • How a stub router handles Query packets:
  1. Originating Query packets is not modified in any way. Rules for entering the Active state and sending Queries are precisely the same.
  2. Processing received Query packets depends on what network was queried for. If the network is a network that the stub router is allowed to advertise (summary, connected, static, or redistributed), the route will process the Query normally. The same is valid for an EIGRP-learned network that is allowed to be further advertised using a leak-map. If the Query contains a network that the stub router knows about but is not allowed to advertise, it will be processed in the usual way as described earlier, but the Reply will always indicate infinite distance, regardless of what the stub router truly knows about the network.
  3. Receiving a Query for an unknown network will immediately cause the router to respond with a Reply and an infinite distance; however, this is regular EIGRP behavior not related to the stub feature.
  • There are two primary reasons why a stub router might receive a Query: 1) The neighbor might run an old IOS that does not recognize the stub TLV, and 2) if there are multiple stub routers on a common segment and if any of these stub routers need to send a Query, it will also send it to all its stub neighbors.
  • On a common segment with all routers configured as stubs, Queries are sent as usual.
  • In multiaccess segments with mixed neighbors, EIGRP solves the problem of sending Queries only non-stub neighbors in two ways: 1) send the Queries as unicasts, or 2) use the Conditional Receive mode.
  • While mixing stub and non-stub routers on a common segment is not a recommended practice, it is inevitable, for example, when the hubs and spokes are interconnected by a DMVPN or a VPLS service.
  • Benefits of stub routing in hub-and-spoke networks:
  1. Prevents suboptimal routing.
  2. Prevents stub routers with low-speed links from being used as transit routers.
  3. Significantly limits the number of Query packets and the depth of their propagation, allowing EIGRP to converge faster and avoid the SIA states.

  • receive-only: The stub router does not advertise any prefixes. It only receives prefixes advertised to it by its neighbors. This keyword cannot be used with any other keywords.
  • leak-map <name>: The stub router can advertise selected EIGRP-learned routes that would not be ordinarily advertised. The <name> references a route-map that matches one or more access-lists or prefix-lists that permit the matched subnets or addresses to be leaked.
  • connected: The stub router will advertise directly connected networks. The interfaces must still be added to EIGRP using the network command.
  • static: The stub router will advertised static routes. The static routes must be redistributed into EIGRP to be advertised.
  • summary: The stub router will advertise summary routes if configured on interfaces.

  • By default, when the eigrp stub command is enabled without additional keywords, both connected and summary are assumed.
  • Use show ip protocols and show ip eigrp neighbors details for information about stub routers.
  • Activating, deactivating, or modifying the stub feature settings will cause the router to drop and reestablish adjacencies with its neighbors.
  • The stub router feature has no impact on what the hub router will advertise. Therefore, the stub feature is usually combined with route filtering and summarization on the hub router. The hub router can be configured to advertise only a default route to the spoke router(s).

Route Summarization

  • Reduces the amount of routing information that routers must exchange, process, and maintain.
  • Faster convergence and less router load within the network.
  • Restricts the size of an area that is affected by network changes by hiding details behind a single advertised summary route.
  • Creates a boundary for Query propagation.
  • If a router receives a Query for a network it does not have in its topology table, it will immediately send back a Reply indicating an unreachable destination, without itself going active and propagating the Query further.
  • When a Query asking for a particular component route is forwarded to the summarizing router's neighbor, this neighbor has no knowledge of the component, so it immediately responds with a Reply containing an infinite distance.
  • Two types of summarization: automatic summarization and manual summarization.
  • Automatic Summarization: A subnet of a particular major network is advertised as the major network itself if the subnet is to be advertised out an interface that lies in a different major network.
  • Automatic summarization does not apply to external routes unless there is also an internal network that belongs to the same major network.
  • Automatic summarization is practically unusable in today's networks, and in fact, starting with IOS Release 15.0(1)M, it is deactivated by default.
  • Manual summarization allows summarizing routes at any chosen router and its interface in the network.
  • As opposed to RIP that does not allow supernetting in summarization, EIGRP poses no limitations on the summary address/netmask combination.
  • You can summarize even into a default route.
  • Configuring multiple overlapping summary address on an interface is also supported. EIGRP will advertise each configured summary address for which at least one component route exists.
  • Manual summarization is configured on a per-interface basis.
  • The optional leak-map allows more specific components of the summary route to be selectively advertised as unsummarized along with the summary route.
  • The router generating the summary route installs a so-called discard route for the summary route into its routing table.
  • The network and netmask in this discard route are identical to the network and netmask of the advertised summary, and the outgoing interface is set to Null0.
  • For presently unknown destinations within an advertised summary, the discard route makes sure that the traffic is dropped rather than routed over a possibly unrelated route.
  • A discard route's AD is 5 by default.
  • For example, when summarizing into the default route, the router will attempt to install a discard route to 0.0.0.0/0 into its routing table. If there already is a default route with an AD higher than 5, the discard route will replace it.
  • In EIGRP named, the AD for a discard route can be changed only in the topology base section.
  • In recent IOS releases, setting the AD of a discard route to 255 not only prevents the router from installing the discard route into its routing table, but it also causes it to stop advertising the summary route altogether.
  • By default, EIGRP uses the lowest metric of a component route as the metric of the summary route itself.
  • EIGRP summary route must adapt to metric changes.
  • The summary-metric command can be used to define a static metric for a particular summary route.

! The 172.20.63.0/24 prefix is leaked unsummarized.
!
ip prefix-list LEAK-PREFIX permit 172.20.63.0/24
!
route-map EIGRP-LEAK permit 10
  match ip address prefix-list LEAK-PREFIX

!
! The prefix is advertised unsummarized along with the summary route.
!
router eigrp CCIE
  address-family ipv4 unicast autonomous-system 1
    af-interface FastEthernet0/0
      summary-address 172.20.32.0/19 leak-map EIGRP-LEAK

!
! The metric of the summary route is manually defined.
! The administrative distance of the summary route is set to 10.
!
router eigrp CCIE
  address-family ipv4 unicast autonomous-system 1
    topology base
      summary-metric 172.20.32.0/19 1000000 1 255 1 1500 distance 10
      exit-af-topology



R2# do show ip protocols | section Summarization
Automatic Summarization: disabled
Address Summarization:
172.20.32.0/19 for Fa0/0
Summarizing 32 components with metric 1310720

R2#show ip route eigrp | i Null
D 172.20.32.0/19 is a summary, 00:31:34, Null0

R2#show eigrp address-family ipv4 topology 172.20.32.0/19
EIGRP-IPv4 VR(CCIE) Topology Entry for AS(1)/ID(10.255.255.2) for 172.20.32.0/19
State is Passive, Query origin flag is 1, 1 Successor(s), FD is 1310720, RIB is
10240
Descriptor Blocks:
0.0.0.0 (Null0), from 0.0.0.0, Send flag is 0x0
Composite metric is (1310720/0), route is Internal
Vector metric:
Minimum bandwidth is 1000000 Kbit
Total delay is 10000000 picoseconds
Reliability is 255/255
Load is 1/255
Minimum MTU is 1500
Hop count is 0
Originating router is 10.255.255.2



Passive Interfaces

  • When EIGRP is enabled for a network, the router begins to send out Hello packets and process incoming EIGRP packets on all interfaces that fall within the specified network range.
  • This default behavior is unnecessary, even dangerous for loopback interfaces and interfaces connected to end hosts.
  • A passive interface does not send or process EIGRP packets, but the network configured on the interface is still advertised.
  • Two options: 1) use passive-interface default and no passive-interface on selected interfaces or 2) passive-interface only on selected interfaces.

Graceful Shutdown

  • A long-implemented feature that cannot, in fact, be controlled - it is only used, mostly not even knowing it is there.
  • Allows a router to advertise that it is being deactivated, thereby allowing its neighbors to react immediately, rather than wait for the Hold timer to expire.
  • Accomplished by a Goodbye message = a normal Hello packet with all K values set to 255.
  • In classic mode for IPv6: shutdown command.
  • In classic mode for IPv4: the Goodbye message was usually sent when shutting down interfaces, configuring them as passive, removing related network or IPv6 EIGRP commands, or removing the entire EIGRP process or restarting the router.
  • In named mode, the shutdown command can be used in various places:
  1. Directly in the router eigrp mode, causing all configured address family instances under that process name to be deactivated.
  2. In the address family mode, causing the entire address family instance to be deactivated.
  3. In the af-interface section, causing the EIGRP to cease all operations on that interface.

Securing EIGRP with Authentication

  • MD5 hashing to ensure the integrity of EIGRP messages and to prevent the injection of false routing information has always been supported.
  • Since 15.1(2)S and 15.2(1)T, SHA-256 has been supported.
  • MD5 can be configured in both classic and named mode; SHA can only be configured in named mode.
  • Essentially, a two-part configuration:
  1. Define a key chain to hold the key IDs, key strings, and optional time ranges.
  2. Activate the authentication on selected interfaces.
  • The key ID and key string must match between two neighbors.
  • The key chain names are locally significant.
  • With SHA authentication, the password can be configured directly in the interface, without creating key chains.
  • Simpler but makes a seamless rollover to a new key impossible, as there can always be only a single per-interface key configured.
  • In classic mode, there is no way to configure EIGRP authentication for all interfaces at once; each EIGRP-enabled interface must be configured individually.
  • In named mode, the af-interface default settings apply automatically to all EIGRP-enabled interfaces; these can be overridden later on selected interfaces using the appropriate af-interfac section.

key chain EIGRP-KEYS
  key 1
    key-string EIGRPRocks
!
router eigrp CCIE
  address-family ipv4 autonomous-system 1
    af-interface default
      authentication mode md5
      authentication key-chain EIGRP-KEYS
    af-interface FastEthernet0/0
      authentication mode hmac-sha-256 PhonyPassword
    af-interface FastEthernet0/1
      authentication mode hmac-sha-256 BigPASSword
      no authentication key-chain
    af-interface Serial1/0
      no authentication mode

R1#show eigrp address-family ipv4 int detail fa0/0
! Lines omitted for brevity
Authentication mode is HMAC-SHA-256, key-chain is "EIGRP-KEYS"

R1#show eigrp address-family ipv4 int detail fa0/1
! Lines omitted for brevity
Authentication mode is HMAC-SHA-256, key-chain is not set

R1#show eigrp address-family ipv4 int detail s1/1
! Lines omitted for brevity
Authentication mode is md5, key-chain is "EIGRP-KEYS"

R1#show eigrp address-family ipv4 int detail s1/0
! Lines omitted for brevity
Authentication mode is not set


  • Each key can be time limited in its usability to sign sent packets (send-lifetime) and to authenticate received packets (accept-lifetime).
  • If multiple keys are eligible to sign egress packets, the key with the lowest key ID is used.
  • To authenticate received packets, EIGRP will try to use the key indicated by its ID in the received packet if the key is still valid.
  • A seamless key rollover procedure:
  1. On all routers, add a new key with a higher key ID into the key chain.
  2. Configure the old key on all routers with a send-lifetime that is already in the past. The routers will start using the new key. Neighbors will accept either key because the key ID is carried in the packet, and both old and new keys are still valid.
  3. Remove the old key completely from the key chains, completing the migration.

Default Routing Using EIGRP.

  • No dedicated command to inject a default route.
  • Other techniques:
  1. Redistributing the default route from another routing source into EIGRP.
  2. Using manual summarization to summarize all advertised routes into a default route.
  • If a static route is pointing only to the egress interface, IOS treats it as being directly connected. As a result, the network command can be used to advertise such a directly connected static route. If a default route is pointing to an exit interface, it can be advertised in EIGRP with network 0.0.0.0.
  • Configuring network 0.0.0.0 is almost never a good idea:
  1. It will cause all IPv4 interfaces on the router to be enabled for EIGRP. EIGRP will start advertising all directly connected IPv4 networks, and try to establish adjacencies on those interfaces.
  2. If the default route is not a directly connected static route, the network 0.0.0.0 command has no effect, defeating the entire purpose of configure it to advertise a default route.

Split Horizon

  • A route must not be advertised over an interface used to reach it.
  • EIGRP uses Split Horizon with Poisoned Reverse, advertising each learned network out the interface towards its Successor with an infinite metric.
  • Sometimes necessary to deactivate, specifically for hub-and-spoke topologies.
  • If possible, better to advertise a default route from the hub to all spokes.
  • Deactivated on a per-interface basis.

EIGRP Over the ToP

  • aka OTP
  • Allows creating ovelay multipoint VPNs between customer edge routers running EIGRP without any special cooperation with the service provider.
  • The key: Locator/Identifier Separation Protocol, or LISP.
  • IP address consists of the network prefix and the host suffix, where the network ID identifies the location and the host ID identifies the host itself. If a host moves to a different network, its entire IP address changes.
  • LISP aims at decoupling the location of a host from its identity. LISP represents each of them as a complete address, and provides a mapping service so that the address representing the identity of a host can be resolved into the address that represents its location.
  • Tunneling is used to encapsulate packets to end hosts with the addresses representing the end host locations.
  • In LISP, a host has an Endpoint ID (EID) that identifies its identity that never needs to change.
  • This EID can be an IPv4/IPv6 address.
  • To reach the end hosts, the packets must be tunneled to the router behind which the host is currently located.
  • The outside address of the router effectively represents the location of the EID and is denoted as Routing Locator, or RLOC.
  • Many EIDs can be located behind a single RLOC.


  • LISP has both a control and a data plane.
  • LISP control plane: registration protocol and procedures to map EIDs into RLOCs.
  • LISP data plane: the actual tunnel encapsulation between routers.
  • In OTP, EIGRP serves as the replacement for LISP control plane.
  • EIGRP OTP routers create targeted sessions, use the public IP addresses as RLOCs, and exchange routes as EIDs.
  • R2 would learn R1's network 10.0.1.0/24 through EIGRP, treat the network as an EID prefix, and take the advertising next hop 192.0.2.31 as the RLOC for this EID prefix.
  • The LISP data plane is reused in OTP and does not change; however, the native LISP mapping and resolving mechanisms are replaced by EIGRP.
  • OTP is based on fully customer-controlled targeted EIGRP sessions.
  • Closely resembles Dynamic Multipoint VPN (DMVPN).
  • The key differences are:
  1. DMVPN uses multipoint GRE tunnels, encapsulating both data and control plane traffic. As a result, certain priming in DMVPN is necessary for it to start (for example, creating the tunnel interfaces and manual mappings). In LISP, no tunnel interface configuration is required, and the only mandatory static configuration is specifying the remote static neighbor. Optionally, the entire OTP traffic can be protected using GETVPN.
  2. DMVPN also depends on running the Next Hop Resolution Protocol (NHRP) to provide mappings between multipoint tunnel interfaces and real router addresses.

! Changing the LISP interface bandwidth from its default of 56 kbps.
!
interface LISP0
  bandwidth 1000000
!
interface GigabitEthernet0/0
  ip address 192.0.2.31 255.255.255.0
!
ip route 0.0.0.0 0.0.0.0 192.0.2.2
!
! The neighbor command refers to the remote neighbor reachable through GigabitEthernet0/0
! The lisp-encap command activates LISP-based OTP functionality.
! The network command is required to form static neighbors over the interface.
!
router eigrp CCIE
  address-family ipv4 unicast autonomous-system 64512
    neighbor 198.51.100.62 GigabitEthernet0/0 remote 100 list-encap
    network 10.0.1.0 0.0.0.255
    network 192.0.2.31 0.0.0.0


  • Running OTP does not require a route toward the remote neighbor.
  • Because the neighbor command specifies the interface toward the remote neighbor, EIGRP in fact places its packets on the interface queue directly, bypassing the routing table.
  • For large implementations, OTP has a special router role, a so-called route reflector.
  • The route reflector allows collapsing the full mesh of OTP neighbors to a hub-and-spoke model of neighbor configuration, with the route reflector collecting learned networks from its clients and readvertising them back to individual clients, optionally maintaining the original next-hop value.

R1#
router eigrp CCIE
 !
 address-family ipv4 unicast autonomous-system 64512
  !
  af-interface GigabitEthernet0/0
   no next-hop-self
   no split horizon
  exit-af-interface
  !
  topology base
  exit-af-topology
  remote-neighbors source GigabitEthernet0/0 unicast-listen lisp-encap
  network 10.0.1.1 0.0.0.0
  network 192.0.2.31 0.0.0



EIGRP Logging and Reporting

  • The eigrp event-logging configuration is the default, and enables the router to store a log of EIGRP events.
  • Viewed by show eigrp address-family {ipv4 | ipv6} events.
  • By default, the EIGRP event log stores up to 500 lines of events.
  • The eigrp log-neighbor-changes and eigrp log-neighbor warnings are also enabled by default.

EIGRP Route Filtering

  • EIGRP updates can be filtered at any interface or for the entire EIGRP address family instance in either direction.
  • By the distribute-list command.
  • In classic mode, the command is applied directly in the EIGRP process.
  • In named mode, the command is configured under the topology base.
  • EIGRP allows ACLs, prefix-lists, and route-maps to be used for route filtering in the distribute-list command.
  • In general, the use of prefix-lists is recommended, as they are specifically designed to match ranges of networks and netmasks.
  • For distribute-lists in the out direction: All outgoing Updates, Queries, Replies, SIA-Queries, and SIA-Replies will indicate the correct metric for permitted prefixes and infinite metric for denied prefixes.
  • For distribute-lists in the in direction: In all incoming Updates, Replies, and SIA-Replies, permitted prefixes are processed normally while denied prefixes are ignored. Receive Queries and SIA-Queries are not influenced by the distribute-list and are processed without modification.

EIGRP Offset-Lists

  • Allows EIGRP to add to a route's metric, either before sending an update or for routes received in an update.
  • Refers to an access-list to match the routes; any matched routes have the specified offset, or extra metric, added to their Delay metric component.
  • Any routes not matched by the offset-list are unchanged.
  • Also specify a in or out direction and optionally an interface.
  • If the interface is omitted, all updates for the chosen direction will be examined.

Clearing the IP Routing Table

  • clear ip route *
  • Does not cause EIGRP to send any messages or learn any new topology information.
  • The router simply refills the IP routing table with the best routes from the existing topology table.
  • The clear eigrp address-family {ipv4 | ipv6} neighbors command clears all neighbor relationships and has the router establish them from scratch.
  • A soft keyword allows for a graceful restart, the databases are resynchronized but the adjacencies are not torn down.

Thursday, January 22, 2015

CCIE OCG: EIGRP (Chapter 8), Part IV

EIGRP Named Mode

  • Starting with IOS Release 15.0(1)M.
  • Earlier implementation configured EIGRP processes directly by their AS numbers separately for IPv4 and IPv6, also called the classic mode or the autonomous system mode.
  • The named mode is preferred.
  • The classic mode remains for backwards compatibility.
  • The reason for the update was to produce a better unified and more consistent configuration interface.
  • A single EIGRP process configuration consists of one or more address family sections, each of them specifying details of EIGRP operation for the particular address family.
  • Even former per-interface commands are within the context of the named mode.
  • The entire EIGRP configuration is located in a single place.
  • If an EIGRP instance is configured in named mode, all EIGRP commands outside the named mode will be ignored.
  • The classic mode and named mode are just two different ways of how EIGRP is configured. They do not constitute two different versions of EIGRP.
  • Three building blocks:
  1. Address Family (AF) section: Mandatory section that specifies the particular address family for which an EIGRP instance shall be started. The autonomous system number is part of the AF section.
  2. Per-AF-interface section: Optional section holds EIGRP settings pertaining to the specified interface and AF. One per-AF-interface section can be created for each routed interface or subinterface. In case both af-interface default and a specific af-interface define the same setting, the interface-specific section is preferred.
  3. Per-AF-topology section: A section presented inside a particular AF, related to the support of Multi Topology Routing (MTR) in EIGRP. The topology base will always be present in the configuration, even if the IOS has no support for multiple routing topologies.

router eigrp CCIE
 address-family ipv4 unicast autonomous-system 1
   af-interface default
     hello-interval 1
     hold-time 3
   exit-af-interface
   af-inteface Loopback0
     passive-interface
   exit-af-interface
   topology base
     maximum-paths 6
     variance 4
   exit-af-topology
   network 10.0.0.1 0.0.0.0
   network 10.255.255.1 0.0.0.0
 exit-address-family
!
 address-family ipv6 unicast autonomous-system 1
   af-interface default
     shutdown
     exit-af-interface
   af-interface Loopback0
     no shutdown
     exit-af-interface
   af-interface FastEthernet0/0
     no shutdown
     exit-af-interface
   topology base
     timers active-time 1
     exit-af-topology
   exit-address-family


  • As soon as the IPv6 EIGRP address family is configured, it immediately runs on all IPv6-enabled interfaces.
  • The named mode is entered using the router eigrp <name> command, where <name> is an arbitrary text name (a virtual instance name) of the EIGRP process.
  • The process name is not sent in EIGRP messages; it is locally significant value and is never compared to process names on other routers.
  • Each named EIGRP process can hold only a single instance for an address family.
  • If it is necessary to run two IPv4 EIGRP instances (for example, AS number 1 and AS number 64512), each of them must be placed into a separate EIGRP process with a unique name.
  • Also, two or more distinct named EIGRP processes cannot run the same address family instance with the same AS number.
  • One-to-one correspondence between an EIGRP named process and an address family instance with a particular AS number.
  • The AS numbers for individual address families in the same EIGRP process do not need to match.
  • In the classic mode, an IPv6 EIGRP process was shut down by default after configuring it, and no shutdown was necessary to actually start it.
  • In the named mode, the opposite is true. As soon as IPv6 address family is configured, it automatically adopts all interfaces on which IPv6 has been enabled (even link-local addresses).
  • Typically, use the af-interface default to first keep the IPv6 address family instance off all interfaces, and only activate it on selected interfaces later.
  • Notice the difference between passive-interface default and af-interface default shutdown.
  • passive-interface: no EIGRP adjacencies will be formed, but its global prefixes will still be advertised over other interfaces.
  • shutdown: completely igonored by EIGRP, not forming any adjacencies over it and also not advertising any of its prefixes.

Address Family Section

  • Configurations specific to the EIGRP process itself.
  • Commonly used commands include network and neighbor statements.

Address Family configuration commands:
  • af-interface: enter Address Family interface configuration.
  • default: set a command to its defaults.
  • eigrp: EIGRP Address Family specific commands.
  • exit-address-family:exit Address Family configuration mode.
  • help: description of the interactive help system.
  • maximum-prefix: maximum number of prefixes acceptable in aggregate.
  • metric: modify metrics and parameters for advertisement.
  • neighbor: specify an IPv4 neighbor router.
  • network: enable routing on an IP network.
  • shutdown: shutdown address family.
  • timers: adjust peering based timers.
  • topology: topology configuration mode.

Per-AF-interface Configuration Section

  • EIGRP interface-specific commands are applied, except bandwidth and delay.
  • No summary-address command under the default interface.

Address Family Interfaces configuration commands:
  • add-paths: advertise add paths.
  • authentication: authentication subcommands.
  • bandwidth-percent: set percentage of bandwidth percentage limit.
  • bfd: enable Bidirectional Forwarding Detection.
  • dampening-change: percent interface metric must change to cause update.
  • dampening-interval: time in seconds to check interface metrics.
  • default: set a command to its defaults.
  • exit-af-interface: exit from Address Family Interface configuration mode.
  • hello-interval: configure hello interval.
  • hold-time: configure hold time.
  • next-hop-self: configure EIGRP next-hop-self.
  • no: negate a command or set its defaults.
  • passive-interface: suppress address updates on an interface.
  • shutdown: disable Address-Family on interface.
  • split-horizon: perform split horizon.
  • summary-address: perform address summarization.

Per-AF-Topology Section

  • Relates to the support of multiple routing topologies in EIGRP.
  • Outside the scope of CCIE Routing and Switching certification.
  • A topology is defined as a subset of routers and links in a network for which a separate set of routes is calculated.
  • The base topology is the default routing environment that exists prior to enabling MTR.
  • Any additional topologies are known as class-specific topologies and are a subset of the base topology.
  • Each class-specific topology carries a class of traffic and is characterized by an independent set of Network Layer Reachability Information (NLRI) that is used to maintain separate routing tables and FIB databases.
  • The router can perform independent route calculation and forwarding for each topology.
  • Multiple topologies can be used to segregate traffic classes (for example, route data, voice, and video over different links).
  • MTR is not equivalent to VRF, because they share the common address space, and they are not intended to provide address conservation or reuse.
  • On routers without MTR support, only the topology base will be available.

Address Family Topology configuration commands:
  • auto-summary: enable automatic network number summarization.
  • default: set a command to its defaults.
  • default-information: control distribution of default information.
  • default-metric: set metric of redistributed routes.
  • distance: define an administrative distance.
  • distribute-list: filter entries in EIGRP updates.
  • eigrp: EIGRP specific commands.
  • exit-af-topology: exit from Address Family Topology configuration mode.
  • maximum-paths: forward packets over multiple paths.
  • metric: modify metrics and parameters for advertisement.
  • no: negate a command or set its defaults.
  • offset-list: add or subtract offset from EIGRP metrics.
  • redistribute: redistribute IPv4 routes from another routing protocol.
  • snmp: modify SNMP parameters.
  • summary-metric: specify summary to apply metric/filtering.
  • timers: adjust topology specific timers.
  • traffic-share: how to compute traffic share over alternate paths.
  • variance: control load balancing variance.

  • show commands have also been updated.
  • Instead of show ip eigrp ..., the new syntax show ip eigrp address-family ipv4 is used.
  • The older show commands are still acceptable for named mode.


Monday, January 19, 2015

CCIE OCG: EIGRP (Chapter 8), Part III

Diffusing Update Algorithm (DUAL)

  • A convergence algorithm that replaces the Bellman-Fordman algorithm used by other distance-vector protocols.
  • DUAL uses a concept of diffusing computations to perform distributed shortest-path computation while maintaining freedom from loops during those calculations.
  • DUAL is at the center of the EIGRP routing protocol.

Topology Table

  • The central data store of an EIGRP process.
  • Unconvetional naming because EIGRP has no information about the network's topology per se.
  • EIGRP stores its entire routing information in the topology table, including:
  1. The prefix of each known destination network (address/netmask).
  2. Feasible Distance of the destination network
  3. Address of each neighboring router that advertised the destination network, including the egress interface toward the neighbor.
  4. Metrics of the destination network as advertised by each neighbor, and the resulting metrics of the path through that neighbor
  5. State of the destination network
  6. Additional information about the network (various internal flags, network type and origin, and others)
  • Populated and updated by locally injected networks (directly connected EIGRP interfaces, routes redistributed locally) and by contents of received EIGRP messages.
  • The least total cost and loop-free paths are installed into the routing table.
  • Each network in the topology table is associated with a state.
  • Passive meaning that the shortest path to the network has already been found, and EIGRP is satisfied with it.
  • Active meaning that EIGRP is currently actively involved in a search for a new shortest path.
  • In a stable topology, all routes shall be in the Passive state.
  • The Active state is always related to the router sending Query packets, asking its neighbors for cooperation in the search for a new path.
  • While in an Active state, the router is prohibited from modifying the routing table entry (not removed or its next-hop changed).
  • Whenever a router needs to select a new shortest path and the neighbor providing that path can be proven not to create a routing loop, the route stays in the Passive state because the router already has all the information to make a correct choice.
  • If the neighbor providing the least-cost path cannot be guaranteed not to create a routing loop, or if no such neighbor exists, the route will need to enter the Active state.

Computed, Reported, and Feasible Distances, and Feasibility Condition

R1# show ipv6 eigrp topology all-links
IPv6-EIGRP Topology Table for AS(1)/ID(10.255.255.1)
Codes: P - Passive, A - Active, U - Update, Q - Query, R - Reply,
r - reply Status, s - sia Status
P 2001:DB8:CC1E::/64, 1 successors, FD is 2560, serno 4
via FE80::2 (2560/256), Serial1/0
via FE80::3 (5120/1280), Serial1/1
via FE80::4 (4096/3072), Serial1/2


  • The "via" lines describe a possible route to the destination through a particular neighbor.
  • Contains the next-hop's IPv6 address, egress interface, and two numbers enclosed in parentheses.
  • The number after the slash sign is called Reported Distance (RD).
  • RD is the neighbor's distance to the destination as reported in an EIGRP packet received from that neighbor.
  • The number before the slash sign is called the Computed Distance (CD).
  • CD shows the total metric of reaching the destination over the particular neighbor.
  • The CD is computed as the RD of neighbor plus the cost of the link between R1 and the neighbor.
  • The Feasible Distance (FD) is a record of the lowest known distance since the last transition from the Active to Passive state.
  • In other words, FD is a historical record, or a historical copy, of the smallest known CD toward a particular destination since the last Active-to-Passive transition.
  • FD is an internal value that is used by EIGRP to select loop-free paths, but its value is never advertised in any EIGRP packets.
  • FD describes the metric of the best path to the destination this router has known (the smallest known distance to a destination since the last time the route went Passive).
  • Any neighbor whose Reported Distance is strictly smaller than this router's Feasible Distance cannot form a routing loop.
  • The Feasibility Condition states that every neighbor satisfying the inequality RD < FD provides a loop-free path, also sometimes called the Source Node Condition.
  • The FC is a sufficient condition, not a necessary condition.
  • Every neighbor satisfying the FC provides a loop-free path, but not every loop-free path satisfies the FC.
  • The FC basically splits all neighbors into two groups: 1) neighbors that are guaranteed to provide a loop-free path, and 2) all other neighbors about which the router cannot be sure.
  • Feasible Successor: all neighbors that pass the FC and thus are safe to use as next-hops.
  • Successor: the Feasible Successor with the least CD to the destination.
  • show ip eigrp topology displays Successors and Feasible Successor.
  • show ip eigrp topology all-links displays all EIGRP routes.

 

Local and Diffusing Computations in EIGRP

  • A topology change occurs whenever the distance to a network changes or a new neighbor comes online that advertises the network.
  • The distance change can be detected either through receiving an EIGRP packet, or because a local interface metric has changed.
  • Also, a neighbor failure is processed by setting the CD/RD of all networks reachable through that neighbor to infinity.

  • Convergence after a topology change:
  1. The Feasible Successor providing the least CD is made the new Successor.
  2. If the CD over the new Successor is less than the current FD, the FD will be updated to the new CD; otherwise it stays as its current value.
  3. The routing table is updated to point toward the new Successor.
  4. If the current distance to the destination has changed as a result of the new Successor, an Update packet is sent to all neighbors, advertising the router's updated distance.
  • This is a local computation, performed solely by using information already stored in the topology table, and not involving neighbors. The route has remained in the Passive state.

  • If, after detecting a topology change, the router finds out that the new shortest path is provided by a neighbor that is not a Feasible Successor, the router cannot use this neighbor right away because it could cause a routing loop.
  • The router performs a diffusing computation:
  1. The entry in the routing table is locked. It must not be removed nor its next-hop changed until the diffusing computation is finished and the route has been moved to the Passive state again.
  2. The FD is set to the current (possibly increased) CD through the current unchanged Succesor. If the router ever needs to advertise its distance to the network while in the Active state, it will use the current CD.
  3. The network is put into the Active state and the router sends out a Query packet to all its neighbors. This Query packet contains the Active network's prefix and the router's current CD toward it.

  • Each neighbor receiving a Query packet will process it by updating its own topology table using the distance information advertised in the Query and reevaluating its own choice of Successors and Feasible Successors.
  • Two possibilities: 1) the neighbor still has its own Successor or Feasible Success, or 2) the information in the Query causes the neighbor to stop considering the path through its current Successor the shortest path available and it has no Feasible Successors.
  • 1) When the neighbor still has a Successor, it will simply send back a Reply packet, indicating the neighbor's current distance to the destination (performing its local computation if necessary). The neighbor did not become engaged in the diffusing computation, and did not need to put the network in the Active state itself.
  • 2) The neighbor will itself join the diffusing computation, send out its own Query packet, and advertise its own current distance through its current Successor. As a result, the wave of Query messages propagates through the part of the network that is affected by the change. (EIGRP marketing term "partial, bounded updates": partial = only the changed information, bounded = only in the affected part of the network).

  • In the Active state, a router must wait for a Reply packet from each Queried neighbors.
  • Until then, the route remains in the Active state, and its routing table is unchanged.
  • Only after all Reply packets are received, the router can put the route back in the Passive state, simply choose the shortest path neighbor skipping the FC check, and reinitialize the FD to the CD of the selected neighbor.
  • The crucial information is simply the sender's current distance to the destination, informing its receiver about the packet originator's distance to the destination.
  • Whether the packet causes its receiver to go Active depends exclusively on how the information in the message impacts the receiver's choice of the shortest path and FC check.

  • Whenever EIGRP detects a topology change, it first records the change into the topology table and updates the RD and CD of the neighbor that advertised the change (received EIGRP message) or was influenced by it (link metric change).
  • From among all neighbors that advertise the network, EIGRP identifies the on that provides the least CD, taking into account the updated CDs. Note that the FC is not invoked at this point.
  • Only after identifying the neighbor offering the least CD, EIGRP verifies whether this neighbor meets the FC and is a Feasible Successor. If it is, EIGRP will promote it to the Successor and start using it right away. If the neighbor does not meet the FC, EIGRP will put the route into the Active state and send out Queries.

Before convergence.
R1# show ipv6 eigrp topology all-links
! Legend removed for brevity
P 2001:DB8:CC1E::/64, 1 successors, FD is 2048, serno 9
via FE80::2 (2560/256), Serial1/0
via FE80::3 (5120/1280), Serial1/1
via FE80::4 (4096/3072), Serial1/2



After convergence.
R1# show ipv6 eigrp topology
! Legend removed for brevity
P 2001:DB8:CC1E::/64, 1 successors, FD is 4096
via FE80::4 (4096/3072), Serial1/2
via FE80::3 (5120/1280), Serial1/1


R1# show ipv6 route eigrp
! Legend removed for brevity
D 2001:DB8:CC1E::/64 [90/4096]
via FE80::4, Serial1/2



DUAL FSM

  • Assuming a router to efficiently compute a new path to a destination with no other topological changes taking place is a strong assumption.
  • EIGRP uses a control mechanism called the Diffusing Update Algorithm, or DUAL, to take care of handling multiple topology changes occurring during a single diffusing computation.

  • A0: Local Origin with Distance Increase
  • A1: Local Origin
  • A2: Multiple Origins
  • A3: Successor Origin
  • CD = Computed Distance
  • FC = Feasibility Condition

Summarization of DUAL FSM:
  • Unless a change in distance occurs such that the least CD neighbor fails to meet the FC, the route remains Passive.
  • If a Query is received from the current Successor and the least-cost CD neighbor fails to meet the FC, the route will enter the A3 active state (Successor Origin Active state). The router will send out Queries and wait for Replies. The last Reply allows the router to transition back to the Passive state, reinitialize the FD, and choose the least-cost CD neighbor as the new Successor.
  • If a distance change is not caused by a Query from a Successor (receiving an Update, changing an interface metric, or losing a neighbor) and the least CD neighbor does not meet the FC, the route will enter A1 active state (Local Origin Active state). The router will send out Queries and wait for Replies. The last reply allows the router to transition back to the Passive state, reinitialize the FD, and choose the least-cost CD neighbor as the new Successor.
  • If during the stay in the A 3 (Successor Origin) or A 1 (Local Origin) active states, another distance increase caused by other means than the Successor’s Query is detected, another topology change during the diffusing computation has occurred. Because the router cannot advertise this updated distance while it is in the Active state, other routers might not be informed about it and their Replies might not take this new increased distance into account. The state is changed from A3 (Successor Origin) to A2 (called Multiple Origins ), or from A1 (Local Origin) to A0 (no official name; we will call it Local Origin with Distance Increase ) states. In A2 or A0 states, the router waits to receive all remaining Replies. When the last Reply arrives, the router will first check whether the neighbor providing the least Computed Distance passes the Feasible Condition check using the Feasibility Distance value set when the route entered the Active state. If it does, the route becomes Passive again, and the neighbor is chosenas the Successor. If it does not, however, the route will return from A0 (Local Origin with Distance Increase) to A1 (Local Origin) or from A2 (Multiple Origins) to A3(Successor Origin) and the router will commence another diffusing computation by again sending a Query. 
  • If during the stay in A 1 (Local Origin) or A 0 (Local Origin with Distance Increase) active states a Query from the Successor is received, another topology change during the diffusing computation has occurred. Because the router cannot advertise this updated distance while it is in the Active state, other routers might not be informed about it and their Replies might not take this new increased distance into account. The state is changed to A2 (Multiple Origins) and then proceeding from that state just like in the previous case.

Stuck-In-Active State

  • In the Active state, EIGRP must wait for all its neighbors to send back a Reply before it can conclude the diffusing computation itself, make a new best-path selection, and start sending its own Replies.
  • A route in the Active is dependent on the entire chained sequence of routers that have become Active as a result of its Query.
  • There are several reasons why a neighbor might not respond to a Query:
  1. The CPU is overloaded and the router cannot respond or even process the Query.
  2. Quality issues on the link are causing packets to be lost.
  3. Low-bandwidth links are congested and packets are being delayed or dropped.
  4. The network is excessively large or complex, either requiring the Query to propagate to a significant depth or causing an inordinate number of prefixes to be impacted by a single link or node failure.
  • Active timer: starts when the first Query is sent out. By default, 3 minutes (1-65535 minutes). Set to infinity using timers active-timer.
  • If all expected Replies are not received before the Active timer expires, the route in question will be designated as Stuck-In-Active (SIA).
  • The neighbor(s) that did not Reply will be removed from the neighbor table and their adjacencies torn down.
  • Instability ensues. All networks learned from that neighbor will be flushed and possibly learned again after the neighbor comes back up within the Hello interval time.
  • Difficult to located the problem origin.
  • If the neighbor does not respond to a Query message with its Reply within half of the Active timer time, the router will send the neighbor a SIA-Query message.
  • The SIA-Query: "Are you still working on my Query?"
  • If the neighbor is able to receive and process this SIA-Query, it will immediately respond with the SIA-Reply message.
  • SIA-Reply: "Yes, I'm still waiting for my own neigbors to send me Replies." or "No, the computation is finished. This is my current metric to the destination."
  • Receiving an SIA-Reply allows the Active timer to be reset, giving the diffusing computation additional time to complete.
  • At most three SIA-Queries can be sent, each after half of the Active timer.
  • If the diffusing computation is not finished by the time the third SIA-Query was replied to by an SIA-Reply and half of the Active timer expired again, the adjacency to the neighbor will be dropped.
  • The same will happen if an SIA-Query is not responded to by an SIA-Reply within the next half of the Active timer.
  • With the default settings, the maximum time for SIA = 4 x 90 = 360 seconds (90 seconds for the first SIA-Query, plus each SIA-Query buying another 90 seconds).

  • It is possible for a router to receive a Query for a destination while it is Active for that destination.
  • Some sources claim that this situation causes the SIA states. In reality, this is a gross misunderstanding.
  • When a router enters the Active state, it sends out a Query indicating its current distance to the destination after the topology change that triggered the transition to the Active state.
  • If, during the Active state, the router receives another Query for this destination, it simply sends back a Reply packet immediately, claiming exactly the same distance as originally advertised in its own Query packet.
  • Any deadlock scenario is thereby averted.
  • Proper hierarchical network design coupled with judicious use of passive interfaces, appropritate route filtering and/or summarization and the EIGRP Stub feature are the key tools that help limit the probability of an SIA state occurrence to an absolute minimum.

Thursday, January 15, 2015

CCIE OCG: EIGRP (Chapter 8), Part II

EIGRP Packet Format

  • Carried directly in IP packets, using protcol number 88.
  • The maximum length of an EIGRP packet is derived from the maximum IP MTU on the particular interface - typically 1500 bytes for the entire IP packet, leaving 1480 bytes for the EIGRP packet itself.
  • Each EIGRP packet carries a 20-byte header, followed by a variably sized body (TLVs).
  • There is no clearly delineated RTP header.
  • Instead, the Flags, Sequence Number, and Acknowledgement number fields provide most of the RTP functionality (also specific TLVs).

Version: 4-bit field used to indicate the protocol version of the originating EIGRP process. Has not changed since its release and is set to 2.
Opcode: 4-bit field that specifies the EIGRP packet type. 1 = Update, 3 = Query, 4 = Reply, 5 = Hello/Ack, 10 = SIA-Query, 11 = SIA-Reply.
Checksum: 24-bit field used to run a sanity check on the EIGRP packet, excluding the IP header.
Flags: 32-bit field indicating specific flags. 0x1 = Init (used during initial adjacency buildup), 0x2 = Conditional Receive (used by RTP to allow this message to be received only by a subset of receivers), 0x4 = Restart (indicates that a router has restarted), 0x8 = End-of-Table (indicates that the transmission of the entire EIGRP database is complete).
Sequence: 32-bit field that contains a sequence number used by RTP for orderly delivery of reliable packets.
Acknowledgement: 32-bit field used by RTP that contains the sequence number of the last packet heard from the neighbor. A Hello packet with a non-zero ACK field is an ACK rather than a Hello. Acknowledgements are never multicasted.
Virtual Router ID: 16-bit field identifying the virtual router this packet is associated with. 0x1 = Unicast Address Family, 0x2 = Multicast Address Family, 0x8000 = Unicast Service Address Family.
Autonomous System Number: 16-bit field that identifies the number of the EIGRP domain.
Type-Length-Value: Field used to carry route entries as well as provide EIGRP DUAL information. Several different types:
  • 0x0001 EIGRP Parameters ( General TLV Types )
  • 0x0002 Authentication Type ( General TLV Types )
  • 0x0003 Sequence ( General TLV Types )
  • 0x0004 Software Version ( General TLV Types )
  • 0x0005 Next Multicast Sequence ( General TLV Types ) 
  • 0x0102 IPv4 Internal Routes ( IP-Specific TLV Types )
  • 0x0103 IPv4 External Routes ( IP-Specific TLV Types )
  • 0x0402 IPv6 Internal Routes ( IP-Specific TLV Types )
  • 0x0403 IPv6 External Routes ( IP-Specific TLV Types )
  • 0x0602 Multi Protocol Internal Routes ( AFI-Specific TLV Types )
  • 0x0603 Multi Protocol External Routes ( AFI-Specific TLV Types )

EIGRP Packets

  • EIGRP uses seven different packet types:
  1. Hello
  2. Acknowledgement
  3. Update (RTP) 
  4. Query (RTP)
  5. Reply (RTP)
  6. SIA-Query (RTP)
  7. SIA-Reply (RTP)
  • The RTP marked packets are also called reliable packets because EIGRP makes sure that they are all reliably delivered and in proper order.
  • Statistics about all sent and received EIGRP packets can be obtained using the show ip eigrp traffic command.

Hello

  • Periodic Hellos sent once EIGRP is enabled on an interface.
  • Used to identify neighbors, verify compatible configuration (common IP subnet, the same AS number, K values, and optional authentication), and serve as a keepalive mechanism between neighbors.
  • Sent to 224.0.0.10 in IPv4, and FF02::A in IPv6.
  • If static neighbors are configured, Hello packets are sent as unicasts to the neighbors explicitly configured address.
  • The default Hello interval is 5 seconds.
  • On NBMA with 1544 kbps or less, the default Hello interval is 60 seconds.
  • Opcode of 5, and not acknowledged.

Acknowledgement

  • ACK packet is used to acknowledge selected received EIGRP packets to facilitate their reliable delivery.
  • Sent in response to Update, Query, Reply, SIA-Query, and SIA-Reply.
  • Unicasted to the sender of the acknowledged packet.
  • ACK is essentially a Hello packet with an empty body (no TLVs), and having a non-zero Acknowledgement number field who value is set to the Sequence number of the reliable packet being acknowledged.
  • The same Opcode as the Hello packet, i.e. 5.
  • If both an ACK and a reliable packet are waiting to be sent to the same neighbor, EIGRP can put the acknowledgment number into the reliable packet’s Acknowledgment number field, saving the need to send a standalone ACK.
  • Only unicast packets can also be used to carry acknowledgement numbers.

Update

  • Contains routing information updates and is used to convey the reachability of destinations.
  • Can be both unicasted and multicasted.
  • Rules:
  1. During a new adjacency buildup, Update packets are unicasted between the newly discovered neighbors. In specific cases, like DMVPN, EIGRP might choose to synchronize neighbors using multicasts. The choice only impacts the efficiency of the initial synchronization process, and has no influence on the actual contents of exchanged information.
  2. After routers have fully synchronized, further Updates are sent as multicasts.
  3. If a neighbor does not acknowledge the arrival of an Update packet, EIGRP will retransmit the Update as unicast to the unresponsive neighbor.
  4. On point-to-point interfaces and for statically configured neighbors, EIGRP always uses unicast.
  • Delivered reliably; always acknowledged and retransmitted if no acknowledgement is heard.
  • Opcode of 1.

Query

  • Used to involve neighbors in the task of searching for the best route toward a destination.
  • Delivered reliably.
  • Both unicasted and multicasted.
  • By default, on multiaccess interfaces with only dynamic neighbors, Queries are sent as multicasts.
  • If not acknowledged in proper time, a Query is retransmitted to the unresponsive neighbor as unicast.
  • On point-to-point interfaces and toward statically configured neighbors, Queries are always sent as unicasts.
  • While each received Query must be acknowledged with an ACK, this ACk does not constitute a response to the Query message, only an acknowledgement that the Query has been received.
  • The Reply is used for that purpose.
  • Opcode of 3.

Reply

  • Sent in response to Query packets and carry their sender's current distance to the destination after taking into account the topology change that prompted the Query.
  • Always unicasted to the originator of the Query message, and delivered reliably.
  • Opcode of 4.

SIA-Query and SIA-Reply

  • Used during a prolonged diffusing computation to verify whether a neighbor that has not yet sent a Reply to a Query is truly reachable and still engaged in the corresponding diffusing computation.
  • The SIA-Query is used to ask a neighbor to confirm that it is still working on the original Query.
  • If the neighbor is reachable and still engaged in the diffusing computation, it will immediately respond with an SIA-Reply.
  • The maximum diffusing computation timer is reset.
  • Both SIA-Query and SIA-Reply are unicast, and reliably delivered.
  • SIA-Query uses an Opcode of 10.
  • SIA-Reply uses an Opcode of 11.

Reliable Transport Protocol

  • Manages the delivery and reception of EIGRP packets.
  • Reliably delivered packets: Update, Query, Reply, SIA-Query, and SIA-Reply (both unicast and multicast).
  • A non-zero Sequence number is carried in the packet header.
  • The Sequence number is a global value maintained per each EIGRP process instance on a router and is incremented whenever one of these packets is originated by the instance, regardless of which EIGRP-enabled interface the packet is going to be sent from.
  • Hello and ACK packets (non-reliable) set their Sequence number to zero and do not cause the global Sequence number to increase.
  • Conditional Receive: EIGRP partitions its neighbors into two groups: 1) well-behaved neighbors that have been able to acknowledge all multicast messages sent so far, and 2) "lagging" routers that have failed to acknowledge at least one EIGRP packet.
  • For in-parallel operation, EIGRP has to send the in-order multicast packets with a special flag saying "this packet is only for those routers who have received all multicast packets so far".
  • Sequenced Hello with two specific TLVs: the Sequence TLV and the Next Multicast Sequence TLV.
  • The Next Multicast Sequence TLV contains the upcoming sequence number of the next reliable multicasted message.
  • The Sequence TLV contains a list of all lagging neighbors by their IP address, in effect saying "whoever finds himself in this list, ignore the next multicast message with the indicated sequence number".
  • A neighbor receiving the Sequenced Hello and not finding itself in the Sequence TLV will know that it is expected to receive the upcoming multicast packet, and will put itself into a so-called Conditional Receive mode (CR-mode).
  • The next multicast packet is sent with the CR flag set.
  • Routers in CR-mode will process this packet as usual and then exit the CR-mode; other routers will ignore it.
  • As a result, the router is able to continue using multicast with those routers that have no issues receiving and acknowledging it, while making sure that the lagging neighbors won't process the multicasts until they are able to cacth up.
  • The time to wait for an ACK before declaring a neighbor as lagging and switching from multicast to unicast is specified by the multicast flow timer.
  • The time between the subsequent unicasts is specified by the retransmission timeout (RTO).
  • Both the multicast flow timer and the RTO are calculated for each neighbor from the smooth round-trip time (SRTT).
  • The SRTT is the average elapsed time in milliseconds between the transmission of a reliable packet to the neighbor and the receipt of an acknowledgement.

Router Adjacencies

  • EIGRP routers establish and maintain neighbor adjacencies.
  • By default, EIGRP discovers neighbors dynamically but neighbors can also be manually defined.
  • Dynamic neighbor discovery is performed by sending EIGRP Hellos to 224.0.0.10 or FF02::A as soon as as EIGRP is activated on an interface.
  • Static neighbors are typically deployed across media that does not natively support broadcast or multicast packets, such as Frame Relay.
  • After a static neighbor is defined, all EIGRP multicasts on the interface, through which the neighbor is reachable, will be disabled.
  • EIGRP neighbors must agree on the following parameters:
  1. EIGRP authentication parameters (if configured)
  2. EIGRP K values
  3. EIGRP Autonomous System (AS) number
  4. use of primary addresses for EIGRP neighbor relationships
  5. use of the common IP network address on a single subnet
  • If two routers differ in any of these parameters, they will not become EIGRP neighbors.
  • The Hello and Hold timers do not need to match between the neighbors.
  • The Hold time is the maximum time a router should wait to receive subsequent valid EIGRP packets from a neighbor.
  • If the Hold timer expires, the neighbor is declared unreachable and DUAL is informed.
  • By default, the Hold time is three times the Hello time, equaling either 15 or 180 seconds, depending on the interface type.
  • Changing the Hello interval does not result in automatic recalculation of the Hold time.
  • The timers can be changed at the interface level: ip hello-interval eigrp as-num sec and ip hold-time eigrp as-num sec.

EIGRP Neighbor Table

  • Records information about each detected neighbor with whom this router has established an adjacency.
  • The H (Handle) number is used to internally identify neighbors in an address-family independent way.
  • The Address and Interface columns hold the neighbor's IP address and this router's interface toward the neighbor.
  • The Hold time is derived from the value advertised by the neighbor and decremented each second; reset every time an acceptable EIGRP packet from that neighbor is received.
  • The Uptime shows the time the neighbor has been up.
  • The SRRT estimates the turnover time between sending a reliable packet to the neighbor and receiving an appropriate acknowledgement.
  • The RTO is the time that the router will wait for an acknowledgement of a retransmitted unicast packet before sending another copy.
  • SRRT and RTO are shown in milliseconds.
  • The Q Cnt indicates the number of enqueued reliable packets for which no ACK has been received yet.
  • In a stable network, the Q Cnt value must be zero.
  • Non-zero values are normal during initial router database synchronization or during network convergence.
  • The Sequence number shows the sequence number of the last reliable packet received from a neighbor.
  • The Sequence number is a per-process variable.
  • It is normal to see the sequence number increase by more than 1, as long as the value is ascending.

Tuesday, January 13, 2015

CCIE OCG: EIGRP (Chapter 8), Part I

EIGRP Basics and Evolution

Basic EIGRP is no longer a closed, proprietary protocol. In 2013, Cisco opened up the EIGRP specification and published it as an IETF Internet Draft, a precursor to an RFC.

EIGRP Feature Summary

  • Transport: IP, protcol type 88 (does not use UDP or TCP). Implements its own Reliable Transport Protocol, providing reliable unicast and multicast packet delivery.
  • Metric: Based on constrained bandwidth and cumulative delay by default, and optionally load and reliability.
  • Hello interval: Interval at which routers send EIGRP Hello messages on an interface.
  • Hold timer: Timer used to determine when a neighboring router has failed, based on a router not receiving any EIGRP messages, including Hellos, in this timer period.
  • Update destination address: Normally sent to 224.0.0.10 or FF02::A, with retransmissions being sent to each other's unicast IP address.
  • Full or partial updates: Full updates are used when new neighbors are discovered; otherwise, partial updates are used.
  • Authentication: Supports MD5 and SHA-based authentication.
  • VLMS/Classless: EIGRP includes the mask with each route, also allowing it to support discontigous networks and VLSM.
  • Route Tags: Enables EIGRP to tag and filter internal and external routes using distribute-lists and route-maps.
  • Next-hop field: Supports the advertisement of routes with a different next-hop router than the advertising router.
  • Manual route summarization: Allows route summarization at any point in the EIGRP network.
  • Multiprotocol: Supports the advertisement of IPv4 and IPv6. Former implementations also supported IPX and AppleTalk routes.

EIGRP Roots: Interior Gateway Routing Protocol

  • IGRP is a dead protocol that was an immediate predecessor to EIGRP.
  • IGRP was developed to eliminate RIPv1's working but naive hop count metric and the network diameter limit of 15.
  • IGRP relied on a composite metric made up of a variety of route variables.
Benefits of IGRP over RIPv1:
  1. wider network diameter, up to 255 hops
  2. complex multivariate metric
  3. unequal-cost load sharing
  4. an update period of 90 seconds, three times longer than RIP
  5. a more efficient update packet format
  • IGRP was designed to interoperate with multiple routed protocols, including IPv4, IPX, and AppleTalk.
  • IGRP broadcasted a Request packet out all IGRP-enabled interfaces at startup and performed a sanity check on received Update packets to verify that the source address of the packet belonged to the same subnet on which the Update was received.
  • Update packets were sent periodically every 90 seconds.
  • Like RIPv1, a classful distance-vector protocol.
  • Also relied on Split Horizon, triggered updates, Invalid after, Holddown, and Flushed after timers for functional stability.
  • IGRP summarized advertised addresses at network boundaries.
  • Overall, IGRP was better than RIP for larger networks, but it still had many of the fundamental limitations of RIP.

Moving From IGRP to EIGRP

Most significant IGRP weaknesses and detractors of IGRP include:
  1. sending full routing updates periodically
  2. the lack of VLSM support
  3. slow convergence
  4. the lack of adequate loop-prevention mechanisms
  • There is, in fact, very little left of the original IGRP in EIGRP - even though EIGRP is still a distance-vector routing protocol, albeit an advanced one.
  • In IGRP and RIP, the periodic Updates provided two separate and unrelated functions: 1) detecting neighbors and their liveliness, and 2) carrying routing information.
  • EIGRP decouples the building and maintaining of adjacencies from exchanging routing information.
  • The first task is accomplished by using a Hello protocol.
  • It is no longer necessary to periodically send Update packets to announce a router's continuous presence on a network. The Hello protocol is used to build and maintain neighbor adjacencies.
  • To send triggered updates, EIGRP implements the Reliable Transport Protocol (RTP; do not confuse with Real-time Transport Protocol), which is a Layer 3-independent transport protocol capable of reliable unicast and multicast delivery.
  • The use of RTP allows routers to initially exchange the complete routing information when synchronizing for the first time, and afterward, advertise changed routes only.
  • EIGRP completely abandons the periodic updating process and operates in an event-driven, incremental fashion.
  • To maintain a loop-free operation at every instant, EIGRP uses a so-called Feasibility Condition. 
  • So-called diffusing computations work in tandem with the Feasibility Condition. 
  • The current least-cost path can become ineligible, and EIGRP queries its neighbors to update their own best path selection in relation to the topology change and reply with their updated distances. Neighbors that are not adversely affected will simply respond right away; neighbors that are adversely affected will propagate the query further and can respond only after receiving all replies and making a choice themselves.
  • EIGRP implements a finite state machine called Diffusing Update Algorithm (DUAL) that controls the run of a diffusing computation, processing the replies and eventually inserting the gathered information into the routing table or commencing an additional computation.
  • The DUAL is not the diffusing computation algorithm itself; it is a control mechanism on top of diffusing computations.
  • EIGRP has a default hop-count limitation of 100 (can be manually adjusted with metric maximum-hops <1-255>).
  • EIGRP makes a distinction between internal and external routes.
  • Internal routes are those injected into EIGRP by the network command (AD of 90 by default).
  • External routes are redistributed into EIGRP from a different routing source (AD of 170 by default).
  • Changing the default AD values:  distance eigrp int ext.

EIGRP Classic Metrics

  • EIGRP uses several metric components: bandwidth, delay, reliability, load, MTU, and hop count.
  • The first four are combined together using a well-known formula to produce a single number, i.e. the composite metric, which is used by EIGRP to choose the best path toward a destination.
  • EIGRP shipped with recent IOS versions also supports a so-called Wide Metrics, which expand the allowable range of existing Classic Metrics.

Bandwidth

  • A static metric assigned to each router interface using the bandwidth command.
  • Obviously, describes the transmission speed of an interface.
  • Expressed in kilobits per seconds.
  • If no bandwidth is specified, the IOS assigns an implicit bandwidth value to each interface, depending on its hardware type and operational characteristics.
  • With Ethernet interfaces, the implicit bandwidth value reflects the true speed negotiated by the interface with its links partner.
  • On other interface types, the value has no realistic relation to the interface capabilities.
  • EIGRP considers the minimum bandwidth along the route.
  • This is done by comparing the bandwidth as advertised by neighboring router to the bandwidth of the interface toward the advertising neighbor, and taking the lower value of these two.
  • With Classic Metrics, EIGRP is capable of describing the bandwidth in the range of 1 kbps up to 10 Gbps.

Delay

  • A static metric assigned to each interface using the delay command.
  • Estimates the serialization delay incurred by the interface.
  • Not related to any true characteristic of an interface.
  • Inconvenient units: tens of microseconds.
  • Configuring a delay of 123 defines the delay to be 1230 microseconds.
  • The show interface command output reports the interface delay directly in microseconds.
  • Therefore, the show interface output will always display a value ten times higher than the configured value.
  • If the delay is not configured explicitly, IOS assigns an implicit delay value to each interface, depending on the interface hardware type.
  • When calculating the composite metric, EIGRP takes the total delay into account.
  • This is done by taking the delay as advertised by a neighboring router and summing it with the delay of the interface toward the advertising neighbor.
  • With Classic Metrics, EIGRP is capable of describing the delay in the range of 10 to 167,772,140 microsends.
  • The maximum value is used to indicate an infinite distance.
  • Split Horizon with Poisoned Reverse, Route Poisoning, withdrawing a route - all these techniques in EIGRP use the maximum delay to indicate an unreachable route.

Reliability

  • A dynamically estimated metric of an interface that evaluates its ratio between successfully received and all received packets.
  • The ratio is expressed as a fraction of 255.
  • A reliability of 255 expresses a 100 percent reliability.
  • EIGRP takes the minimal reliability into account.
  • This is done by comparing the reliability as advertised by a neighboring router to the reliability of the interface toward the advertising neighbor, and taking the lower value of these two.
  • A change in interface reliability value does not trigger sending EIGRP updates.
  • Currently just a relic carried over from its predecessor, with no particular usability.

Load

  • A dynamically estimated metric that measures the amount of traffic flowing through the interface in relation to its maximum capacity.
  • Also expressed as a fraction of 255, with the load of 1 representing an emptry interface and the load of 255 representing a fully utilized interface.
  • IOS actually computes an exponentially weighted average over the momentary load that smooths out short-lived load swings.
  • Two independent load metric counters: the Txload for outgoing traffic and Rxload for incoming traffic.
  • EIGRP takes the maximal Txload into account.
  • This is done by comparing the load as advertised by a neighboring router to the Txload of the interface toward the advertising neighbor, and taking the higher value of these two.
  • The changes in the Txload values on interfaces do not trigger EIGRP updates.
  • Also a relic from IGRP with no particular usability in EIGRP.

MTU

  • EIGRP advertises the minimum MTU along the route to the destination.
  • However, the MTU is completely unused in the best-path selection process.
  • Not factored into the composite metric, nor is it used as any kind of a tiebreaker.

Hop Count

  • Simply a counter of routers (hops) in the path toward the destination.
  • It is just a fallback security measure: routes reaching over a predefined threshold are advertised as unreachable, thereby breaking any potential routing loops.
  • By default, the limit is 100, configurable in the range of 1 to 255.
  • Not factored into the composite metric calculation and does not impact the best-path selection in any way.

Calculating the Composite Metric

  • Because EIGRP treats each metric component differently (delay is summed, bandwidth and reliability are minimized, load is maximized), EIGRP routers exchange these component metrics as separate values.
  • Each router independently computes the resulting composite metric on its own.
  • This composite metric is used locally on a router, and is never advertised as a single number in EIGRP messages.
  • The only exception to this rule is when a route is redistributed from one EIGRP process to another.
  • Even in this case, the composite metric of the redistributed route is retaken only for diagnostic purposes and carried separately from the seed metric.
  • EIGRP computes the composite metric value using the following formula.

  • The constants K1 through K5, commonly called K values, are weight constants in the range 0-255 that can be tweaked to influence the impact of individual metric components on the overall composite metric.
  • It is crucial that all EIGRP routers in the same domain compute the composite metric in the same way.
  • Therefore, K values on all routers must match.
  • If K values do not match, two routers will not be able to establish an adjacency.
  • By default, K1 and K3 are set to 1, and all other K values are set 0, causing EIGRP to take only bandwidth and delay into account.
  • The multiplication by 256 is the result of expanding the former IGRP 24-bit metric into a 32-bit metric used by EIGRP.

EIGRP Wide Metrics

  • EIGRP Classic Metric faced issues with interfaces faster than 1 Gbps.
  • The Bandwidth component is unable to differentiate between 10 Gbps and faster interfaces.
  • The Delay component is already set to the lowest value of 1 (microseconds) on 1 Gbps interfaces, and cannot be made smaller.
  • Cisco routers perform integer arithmetic.
  • To verify support of Wide Metric, issue show eigrp tech-support and look for Wide Metrics in the output.
  • show ip protocols: the presence of the K6 constant, the rib-scale of 128 and 64-bit metric version all indicate that Wide Metrics are supported.

EIGRP Wide Metrics consist of the following components:
  • Throughput: Analogous to the classic Bandwidth component. Calculation: 65536x10^7/Interface Bandwidth in kbps. Effectively tells how many times slower the interface is than a 655.36 Tbps link.
  • Latency: Analogous to the classic Delay component. Calculation: 65536xInterface Delay/10^6. The interface delay is expressed in picoseconds. The computation of per-interface delay metric differs based on its physical capability and configuration.
  • If < 1 Gbps without bandwidth and delay commands, the interface delay is simply its IOS-based default delay converted to picoseconds.
  • If > 1 Gbps without bandwidth and delay commands, the interface delay is computed as 10^13/interface default bandwidth.
  • With explicit bandwidth but without delay, regardless of their physical operating speed, the interface delay is the IOS-based default delay converted to picoseconds.
  • With explicit delay, regardless of the physical operating speed and the bandwidth setting, the interface delay is computed as its specified delay value converted to picoseconds.
  • Reliability: Identical to the classic Reliability component, and has not changed in Wide Metrics.
  • Load: Identical to the classic Load component, and has not changed in Wide Metrics.
  • MTU: Identical to the classic MTU, and is advertised but not used.
  • Hop Count: Identical to the classic Hop Count, and is advertised but unused in path selection; it only prevents potential routing loops.
  • Extended Metrics: Considered as placeholders for future extensions to the composite metric computation. Three extended metrics are defined: Jitter, Energy, and Quiescent Engergy. K6 was introduced to incorporate these metric components. Not usually used or supported.

Wide Metric formula.


  • The Wide Metric support is available when EIGRP is configured in named mode, and is automatically activated (no command to control the activation).
  • EIGRP automatically detects if their neighbors also support Wide Metrics, and use the appropriate metric type when talking to them.
  • Wide Metrics are preferred.
  • In the case of mixed neighbors on a common interface, EIGRP will use both metric formats, allowing each neighbor to process the metric format it supports.
  • The Wide Metrics composite value can result in a number wider than 32 bits, which is the maximum supported by the the RIB.
  • The value must be downscaled before the route can be passed down to the RIB.
  • This is done by dividing the value by a factor configured in the metric rib-scale command.
  • The default value is 128 and can be configured in the range 1-255.
  • The downscaled value is not used by EIGRP in any way.
  • EIGRP makes all its path selections based on the Wide Metrics composite value; only after a best path toward a destination is selected, its composite metric value is downscaled as the route is installed to the RIB.

Tweaking Interface Metrics to Influence Path Selection

  • Only Bandwidth and Delay can be manually influenced.
  • Do not use Bandwidth for traffic engineering. The change will only affect path selection if the configured value is the lowest bandwidth over the entire path. Further, changing the bandwidth can have an impact beyond affecting the EIGRP metrics (for example, QoS).
  • By default, EIGRP throttles to use 50 percent of the configured bandwidth. Lowering the value can starve EIGRP neighbors from getting packets. An excessively high bandwidth can lead EIGRP to consume more bandwidth than physically available, leading to packet drops.
  • The delay does not impact other protocols nor does it cause EIGRP to throttle back, and as the sum of all delays, it has a direct effect on path selection.
  • Bandwidth should always be configured to the true bandwidth of the interface and should never be used to influence EIGRP's path selction.