Chapter 1 - starting
1. dynamic routing
they relies on updates to discover changes in network topology.
The two algorithms are distance vector and link state.
a. DV algorithms
routers broadcasts routing information to all neighboring routers. DV algorithms are also described as “routing by rumor”.
b. LS algorithm
each router constructs its own topology map of the entire network. Based on updates from neighbors. They use Dijkstra’s algorithm to compute the shortest path to each destination in this graph.
2. a network under a single administrative authority is described as an “autonomous system” in routing parlance.
a. interior gateway protocols are described to support the task of routing internal to an AS. IGP has no concept of political boundaries between Ass or the metrics that may be used to select paths between Ass.
IGP : RIP, IGRP, EIGRP, OSPF
b. exterior gateway protocols are described to support routing between Ass. EGP deploys metrics to select one inter-AS path over another.
EGP : BGP
3. routing architectures maybe broadly classified as flat or hierarchical.
a. flat routing implies that all routers are known to all peers – all router in the network are equal, possessing the same routing information.
b. hierarchical routing implies that some routers possess only local routers, whereas others possess a little bit more information, and still others possess even more.
4. routing table
Fundamental paradigm of IP routing: hop-by-hop routing. A router does NOT know the full path to a destination, but only the next hop to reach the destination.
So routing table must contain at least 2 pieces of information: the destination network and the next hop toward that destination.
5. administrative distances
Each source of routing information has an attached measure of its trust worthiness, called administrative distance (in Cisco parlance).
The lower the administrative distance, the more trustworthy the source.
AD WILL BE USED ONLY WHEN A ROUTE IS LEARNED VIA MORE THAN ONE SOURCE.
By default
Connected interface 0
Static route 1
EIGRP 5
External BGP 20
I EIGRP 90
IGRP 100
OSPF 110
IS-IS 115
RIP 120
BGP 140
E EIGRP 170
I BGP 200
Unknown 255 (Unreachable)