Routing basics

Routing Table The routes to a given network are stored in the memory of the router and are referred to as a routing table. On a Router there is an entry for each network and its corresponding network interface kept in memory. The table allows the router to properly forward frames out the correct interface. If the destination address of a packet cannot be matched to any route table entry, the packet is dropped and a destination unreachable ICMP message is sent to the source address. In standard routing, the route table is consulted every time a frame is received and so it plays a fundamental role in the proper delivery of data. A routing table only maintains the best possible route to a destination, not all possible routes. Routing table entries have the following fields:
Network destination Netmask Gateway / Interface Metric

Routing algorithm The task of populating the routing table is accomplished by the routing algorithm. It is that part of network layer software that is responsible for deciding which output line an incoming packet should be routed on.
Static routing or Non adoptive routing

Static routing requires manual route table entries. Does not take traffic condition, bandwidth or delay into account, for path selection. Need manual updation for changes in network. Suitable for small networks or less capable routers. Considered to be most reliable and allows greater control over the network configuration. The choice of path to reach from point I to point J is computed in advance, off-line and downloaded to all routers when the network is booted Command for cisco routers is
ip route <destination> <subnet mask> <next hop router or interface type of this router>

Administrative Distance

Administrative distance is a numeric value showing how trust worthy a route is. The default administrative distance for static routes is 1; 0 for connected networks. Directly Connected networks need not be entered while configuring static routes.
Dynamic or adaptive routing

Dynamic routing uses routing protocols to build route tables automatically. Change their routing decisions to reflect changes in traffic and topology.
Optimality principle

Sub-path of a shortest path is also the shortest path. For example: If a router J is on the optimal path from router I to K then the optimal path J to K also fall along the same route.
Sink Tree

Shortest path from a node to every other node, form a tree called a sink tree.
Convergence Time: The time between losing a route and finding its working replacement

is called convergence time.

Routing protocols (vs Routing Algorithm)

fgfor static routes is 1; 0 for connected networks. Directly Connected netwo

Routing Protocol Intra-domain Routing Distance Vector Routing Link State Routing Inter-domain Routing

Path Vector Routing