Routing

Routing in network
• A computer network is made of many machines, called nodes,
and paths or links that connect those nodes.
• Routing is the process of path selection in any network.
Unicast routing:
• Unicast means the transmission from a single sender to a single
receiver. It is a point-to-point communication between the sender
and receiver.
Routing table
• A host or a router has a routing table with an entry for each
destination, or a combination of destinations, to route IP packets.
• A routing table can be either static or dynamic.
• A static table is one with manual entries. A dynamic table, on the
other hand, is one that is updated automatically when there is a
change somewhere in the internet.
• A routing protocol is a combination of rules and procedures that lets
routers in the Internet inform each other of changes.
• The sharing of information allows a router in Texas to know about the
failure of a network in San Francisco.
Optimization
• A router receives a packet from a network and passes it to another
network. One approach is to assign a cost for passing through a
network. We call this cost a metric.
• However, the metric assigned to each network depends on the type
of protocol. Some simple protocols, such as the Routing Information
Protocol (RIP), treat all networks as equals.
• The cost of passing through a network is the same; it is one hop
count. So if a packet passes through 10 networks to reach the
destination, the total cost is 10 hop counts.
Intra- and Inter-domain Routing
• An internet can be so large that one routing protocol cannot handle
the task of updating the routing tables of all routers.
• For this reason, an internet is divided into autonomous systems. An
autonomous system (AS) is a group of networks and routers under
the authority of a single administration.
• Routing inside an autonomous system is referred to as intradomain
routing.
• Routing between autonomous systems is referred to as interdomain
routing
Intra- and Inter-domain Routing
Routing protocols
• Several intradomain and interdomain routing protocols are in use.
• Two intradomain routing protocols: Distance vector and link state.
• One Interdomain routing protocol: path vector.
• Routing Information Protocol (RIP) is an implementation of the
distance vector protocol. Open Shortest Path First (OSPF) is an
implementation of the link state protocol. Border Gateway Protocol
(BGP) is an implementation of the path vector protocol.
Routing protocols
1. Distance Vector Routing (RIP)
Distance Vector Routing (RIP)
• In distance vector routing, the least-cost route between any two
nodes is the route with minimum distance.
• In this protocol, as the name implies, each node maintains a vector
(table) of minimum distances to every node.
• The table at each node also guides the packets to the desired node by
showing the next stop in the route (next-hop routing).
• The table for node A shows how we can reach any node from this
node. For example, our least cost to reach node E is 6. The route
passes through C.
Distance Vector Routing (RIP)
• Routing Information Protocol (RIP) is a distance vector protocol that
uses hop count as its primary metric.
• RIP defines how routers should share information when moving
traffic among an interconnected group of local area networks.
2. Link State Routing
• Link state protocols are also called shortest-path-first protocols. Link
state routing protocols have a complete picture of the network
topology. Hence they know more about the whole network than any
distance vector protocol.
• The three keys to understand the Link State Routing algorithm:
• Knowledge about the neighborhood: Instead of sending its routing table, a
router sends the information about its neighborhood only. A router broadcast
its identities and cost of the directly attached links to other routers.
• Flooding: Each router sends the information to every other router on the
internetwork except its neighbors. This process is known as Flooding. Every
router that receives the packet sends the copies to all its neighbors. Finally,
each and every router receives a copy of the same information.
• Information sharing: A router sends the information to every other router
only when the change occurs in the information.
Dijkstra’s algorithm
• Dijkstra’s algorithm is a graph traversing algorithm. It finds the shortest
path traversed to carry the message from sender to receiver.
• During the first stage, we need to find the shortest node from the neighbor
nodes of the source node.
• During the second stage, we need to look for the second shortest path
node, which can be a neighbor node of the source node or to the node
found in the first stage.
• During the third stage, the algorithm looks for the third shortest path node
from the source node. This node can be the neighbor of the source node or
the nearest node found from the first stage or second stage.
• The process is repeated until all nodes are visited at least once and if all
nodes are visited once, then we can find the shortest path from the source
node to the destination.
Calculation of Shortest Path
Calculation of Shortest Path
Calculation of Shortest Path
Calculation of Shortest Path
Path Vector Routing
• Distance vector and link state routing are both intradomain routing
protocols. They can be used inside an autonomous system, but not
between autonomous systems.
• These two protocols are not suitable for interdomain routing mostly
because of scalability. Both of these routing protocols become intractable
when the domain of operation becomes large. Distance vector routing is
subject to instability if there are more than a few hops in the domain of
operation. Link state routing needs a huge amount of resources to
calculate routing tables. It also creates heavy traffic because of flooding.
• There is a need for a third routing protocol which we call path vector
routing.
Path Vector Routing
• Path vector routing proved to be useful for interdomain routing. The
principle of path vector routing is similar to that of distance vector
routing.
• In path vector routing, we assume that there is one node in each
autonomous system that acts on behalf of the entire autonomous
system.
Path Vector Routing
Path Vector Routing
Border Gateway Protocol (BGP) Meaning
• Border Gateway Protocol (BGP) refers to a gateway protocol that
enables the internet to exchange routing information between
autonomous systems (AS).