Unit_3 {14 Marks}

1) Explain Inter-Domain routing.

Ans:-
Inter-Domain routing:- It is the process of exchanging routing
information between different autonomous system.
Intra-Domain routing:- It is the process of exchanging rouing
information inside the autonomous system.
2) Explain distance vector routing with suitable example.
Ans:-
Distance Vector routing:-
- Distance Vector Routing is one of the dynamic routing
algorithm.
- It is suitable for packet switched network.
- In distance vector routing, each router maintains a routing
table.
- It contains one entry for each router in the subnet.
- It measure the distance by the number of routers a packet has
to pass, one router counts as one hop
- Routing tables are updated by exchanging information with
the neighbours.
Ex:-

3) Difference beyween RIP and OSPF routing protocol.

Ans:-
RIP OSPF
- RIP stands for Routing OSPF stands for Open
Information Protocol. Shortest Path.
- It works on Bellman-Ford It works on Dijkstra
algorithm. algorithm.
- It is used for smaller It is used for large size
sized organization. organization.
- It allows maximum There is no restrictions 15
hop counts. on the hop count .
- It uses UDP OSPF works for IP
- It's administrative It's administrative distance is 120.
distance is 110.
4) Explain Bellman Ford algorithm.
Ans:- Bellman Ford Algorithm:-
- Bellman ford algorithm is a single-source shortest path
algorithm.
- This algorithm is used to find the shortest distance from the
single vertex to all other vertices of a weightend graph.
- Various other algorithms are used to find the shortest path,like
the Dijkstra algorithm.
- If weweighted graph contains the negative weight values,then
the Dijkstra algorithm does notconfirm whether it produces the
correct answer or not.

5) Difference between Distance Vector routing and Link State

routing.
Ans:-
Distance Vector routing Link state routing
- -Slow coveregence Fast coveregence.
- Summerization is automatic Summerization manual
- Harder to configure Easier to configure.
- Count to infinity problem No count to infinity
problems.
-It uses Bellman Ford It uses Dijkstra algorithm
algorithm.
- It updates full routing table It updates only link state
6) Describe RIP (Routing Information Protocol) message
format.
Ans:- RIP:- It is a simple routing protocols used in smaller
networks.
- RIP is a routing based protocol on Distance Vector Routing
algorithm which is an intra-domain routing protocol used inside
an autonomous system.
- Infinity is defined as 16,which means that any route in an
autonomous system using RIP cannot have more than 15 hops.
 Fig. RIP message format
- Command:- 8-bit
The tupe of message :- request(1) or response(2).
- Version:-8-bit
Define the RIP version.
- Family:-
16-bit field defines the family of the protocol used. For
TCP/IP,value is 2.
- Distance:-
32-bit defines the hop count from the advertising router to the
destination network.

7) Explain OSPF (Open Shortest Path First) routing protocol.

Ans:-
Open Shortest Path First:-
- OSPF is link - state routing protocol used within a single
autonomous system.
- It is designed to be more efficent and scalable than distance
vector protocols like RIP.
- OSPF is an Interior Gateway Protocol(IGP),meaning it operates
within a single network domain.
- OSPF uses Shortest Path First algorithm to calculate the
shortest path to each destination.
- OSPF supports for hierarchical design,allowing for better
scalability and reduced routing traffic.
- Basically, It is well suited for large networks due to its efficient
use of bandwidth.

8) Distinguish between FTP and TFTP protocol

Ans:-
 FTP TFTP
- File Transfer Protocol Trivial FileTransfer Protocol
- It uses 2 connections It uses 5 connections
- Provides many commands Provides only 5 commands
- It uses TCP It uses UDP
- It is reliable It is unreliable
- Client must login to No login procedure.
the server

9) Write Stepwise Procedure to configure IP routing with RIP.

Ans:-

10) Use Bellman-Ford algorithm to find the shortest distance

for all nodes in the graphs.
Ans:-

11) Explain Functioning of multicast link State routing

protocol.
Ans:-
DVMRP - Disance Vector Multicast Routing Protocol:-
-
-
-
-
-
12) Explain 3 Intra-domain routing protocols.
Ans:-
Link State Routing:-
- Have a global view of network.
- Simpler to debug.
- Require global state
Link state strategy:-
- Each router shares the information of its neighbourhood with
every other router in the internetwork.
- Send to all nodes (not just neighbours).
Link state Packet(LSP):-
- ID of the node that created the LSP.
- Cost of link to each directly connected neighhbour.
(2) RIPv2:-
- It runs over UDP port 520.
- Limits networks to 15 hops.
- It depends on count infinity for loops.
- It supports split horizon,poison reverse.
(3) Multicast Distance Vector Routing (DVMRP):-
- DVMRP is an implementation of multicast distance vector
routing.
- It is a source based routing protocol,based on RIP.
- Unicast distance vector routing is very simple to extending it
to support , multicast routing is complicated.
- Multicast routing does not allow router to send its routing
table to its neighbor.
- When a router receives a multicast packet,it forward s the
packet as through it is consultiing a routing table.
13) Describe modern computer use dynamic routing. Explain
with example how distance vector routing is used to route the
packet & why count-to-infinity problem arises and how does it
get solved?
Ans:-
Dynamic routing:-
- In modern computer networks, dynamic routing is used to
automatically find the best path for data packets to travel from
the source to destination.
- Routers exchange informtion with each other to update their
routing tables when the network topology changes.
Distance Vector Routing:-
- Distance Vector Routing is one of the methods used in
dynamic routing.
- Each router in the network maintains a table that holds
information about the shortest distance to reach each
destination.
- Routers share their routing tables eith neighboring routers.
Count to infinity problem:-
- One of the importnt issue in Distance vector routing is count
to infinity problem.
- Count to infinity is just another name for a routing loop.
- Routing loops usually occurs when an interface goes down.
- It can also occur when two routers send updates to each other
at the same time.
14) Importance of routing table.
Ans:-
- Routing tables are essential inthe routing because they
maintain a map of networks,which ensures that the process of
forwarding packets is as efficient as possible
- Without the presence of routing tables, routers would have
no idea how to get packets to their intended destinations.
15) Describe Border Gateway Protocol 3 (BGP3) in detail.
Ans:-
- Border Gateway Protocol used by routers to exchange routing
information between different autonomous systems.
- An Autonomous System is a group of networks under a single
administrative control.
- BGP is used for inter-domain routing connecting different
Autonomous systems.
- BGP routers establish connections with each other.
- It is a complex protocol with various attributes and
mechanisms for path selection.
- Keepalive messages are periodically sent to ensure the
connection between BGP sspeakers remain active.
- Message Format:-

- Marker:- The marker can be used to detect loss of

synchronization between a pair of BGP peers and to
authenticate incoming BGP.
- Length:- This 2- bytes unsigned integer indicates the total
length of the message,including the header ,in bytes.
- Type:- This 1-byte unsigned integer indicates the type code of
the message.
The following type codes are defined:
1 - OPEN
2 - UPDATE
3 - NOTIFICATION
4 – KEEPALIVE