Skip to main content

Posts

Showing posts with the label internetworkexpert

Understanding Third-Party Next-Hop

source:    Petr Lapukhov Abstract This publication briefly covers the use of 3rd party next-hops in OSPF, RIP, EIGRP and BGP routing protocols. Common concepts are introduced and protocol-specific implementations are discussed. Basic understanding of the routing protocol function is required before reading this blog post. Overview Third-party next-hop concept appears only to distance vector protocol, or in the parts of the link-state protocols that exhibit distance-vector behavior. The idea is that a distance-vector update carries explicit next-hop value, which is used by receiving side, as opposed to the “implicit” next-hop calculated as the sending router’s address – the source address in the IP header carrying the routing update. Such “explicit” next-hop is called “third-party” next-hop IP address, allowing for pointing to a different next-hop, other than advertising router. Intitively, this is only possible if the advertising and receiving router are on a shared ...

Understanding STP convergence

I've been trying to find a good explanations on some of the Internetwork Expert tasks and why they decided to use the solutions they used in some of the tasks. I tagged all posts related to the labs with tag "ccienotes". The one bellow is related to IE lab 11; task 1.3. 1) General overview of STP convergence process 2) How STP converges if a directly connected link fails 3) How STP converges when it detects indirect link failure 4) Topology changes and their effect See more detailed overview at: http://blog.ine.com/wp-content/uploads/2010/04/understanding-stp-rstp-convergence.pdf STP Convergence in General As we know, STP protocol follows certain simple procedure to calculate the loop-free subset of the network topology. STP protocol could be compared to RIP in some sense. Both execute a version of Bellman-Ford iterative algorithm, which could be described as “gradient” (meaning it iteratively looks for the optimal solution, selecting the “closest” candidate every time). ...