Scribd
Upload
7 views

Computer Network Note-5 (3L)

Uploaded by

manab
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

Computer Network Note-5 (3L)

Uploaded by

manab
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

SKFGI/CSE MKD

Network Routing

When a device has multiple paths to reach a destination, it always selects one path by preferring it over
others. This selection process is termed as Routing. Routing is done by special network devices called
routers. Router is responsible to forward a packet to proper destination with the help of proper routing
algorithm by maintaining the information into a routing table.

1. Unicast routing
Routing unicast data over the internet is called unicast routing. It is the simplest form of routing
because the destination is already known. Hence the router just has to look up the routing table and
forward the packet to next hop.

2. Broadcast routing

A router creates a data packet and then sends it to each host one by one. In this case, the router creates
multiple copies of single data packet with different destination addresses. This method consumes lots of
bandwidth as here the entire router in the network system receives a packet that is to be broad casted, it
simply floods those packets out of all interfaces.
SKFGI/CSE MKD

3. Multicast Routing
Multicast routing is special case of broadcast routing. But in Multicast routing, the data is sent to only
nodes which wants to receive the packets. Here a group of receiver receives packets from one specific
sender.

Packet forwarding and routing technique in Network Layer:

Packet forward: Packet forwarding means to place the packet in its route to its destination. In this
technique when a router has received a packet to be forwarded, it looks at this table to find the route to the
final destination. Several technique use to manage the size of routing table and also provide the security.

Next-Hop Method: In this technique, the routing table holds only the address of the next hop instead of
information about the complete route (route method). The entries of a routing table must be consistent
with one another.
SKFGI/CSE MKD

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. The routing table can be either static or dynamic.
There are two type of routing table.

i. Static Routing Table


ii. Dynamic Routing Table

i. Static Routing Table


A static routing table contains information entered manually. The administrator enters the route
for each destination into the table. When a table is created, it cannot update automatically when
there is a change in the Internet. The table must be manually altered by the administrator. A static
routing table can be used in a small internet that does not change very frequently. It is poor
strategy to use a static routing table in a big internet.

ii. Dynamic Routing Table


A dynamic routing table is updated periodically by using one of the dynamic routing protocols
such as RIP, OSPF, or BGP. Whenever there is a change in the Internet, such as a shutdown of a
router or breaking of a link, the dynamic routing protocols update all the tables in the routers
automatically.
Routing Protocols
SKFGI/CSE MKD

Different Types of Routing Algorithm

i. The Distance-Vector (DV) Routing Algorithm (Bellman-Ford Algorithm)


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. It is distributed process. In the distributed
process each node receives some information from one or more of its directly attached neighbour,
performs a calculation, and then distributes the results of its calculation back to its neighbour.

ii. Link-State (LS) Routing Algorithm (Dijkstra’s algorithm)


In link state routing, if each node in the domain has the entire topology of the domain the list
of nodes and links, how they are connected including the type, cost (metric), and condition of
the links (up or down)-the node can use Dijkstra's algorithm to build a routing table. Here
formation of a shortest path tree for each node is required.
SKFGI/CSE MKD

iii. Path Vector Routing:


Path vector routing proved to be useful for inter domain routing. The principle of path
vector routing is similar to that of distance vector routing. In path vector routing one node
in each autonomous system acts as a communicating node on behalf of the entire
autonomous system (AS). Let us call it the speaker node. The speaker node in an AS
creates a routing table and advertises it to speaker nodes in the neighboring ASs. The idea
is the same as for distance vector routing except that only speaker nodes in each AS can
communicate with each other. A speaker node advertises the path, not the metric of the
nodes, in its autonomous system or other autonomous systems.

You might also like