The various Unicast Routing

protocols with focus on OSJF

and Distance Vector Routing
Presented by –
Sourav Sasmal

Name – Sourav Sasmal

STD – BWU/MCA/23/131
Course name –Data Communication and
Computer Network
Course Code – MCA204
 Table of Contains

Unicast Routing
Link State Routing
Transmission Control Protocol(TCP)
HTTP
Distance Vector Routing (DVR)
Open Shortest Path First (OSPF)

2 Sourav , MCA
 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. There are various
unicast protocols such as TCP, HTTP, etc.
 TCP is the most commonly used unicast protocol. It is a connection-oriented protocol
that relies on acknowledgment from the receiver side.
 HTTP stands for HyperText Transfer Protocol. It is an object-oriented protocol for
communication.
 Major Protocols of Unicast Routing :-

1. Distance Vector Routing: Distance-Vector routers use a distributed algorithm to compute

their routing tables.
2. Link-State Routing: Link-State routing uses link-state routers to exchange messages that
allow each router to learn the entire network topology.
3. Path-Vector Routing: It is a routing protocol that maintains the path that is updated
dynamically.
3 Sourav , MCA
 Link State Routing
Link state routing is the second family of routing protocols. While distance-vector routers use a distributed
algorithm to compute their routing tables, link-state routing uses link-state routers to exchange messages that
allow each router to learn the entire network topology. Based on this learned topology, each router is then
able to compute its routing table by using the shortest path computation.
 Features of Link State Routing Protocols :-
 Link State Packet: A small packet that contains routing information.
 Link-State Database: A collection of information gathered from the link-state packet.
 Shortest Path First Algorithm (Dijkstra algorithm): A calculation performed on the database results in the shortest
path
 Routing Table: A list of known paths and interfaces.
 Characteristics of Link State Protocol : -
 It requires a large amount of memory.
 Shortest path computations require many CPU circles.
 If a network uses little bandwidth; it quickly reacts to topology changes
 All items in the database must be sent to neighbors to form link-state packets.
 All neighbors must be trusted in the topology.
 Authentication mechanisms can be used to avoid undesired adjacency and problems.
 No split horizon techniques are possible in the link-state routing.
 OSPF Protocol.
 Protocols of Link State Routing :-
1. Open Shortest Path First (OSPF)
2. Intermediate System to Intermediate System (IS-IS)
4 Sourav , MCA
 Transmission Control Protocol (TCP)
Transmission Control Protocol is a connection-oriented protocol for communications that
helps in the exchange of messages between different devices over a network. The Internet
Protocol (IP), which establishes the technique for sending data packets between computers,
works with TCP.
 Internet Protocol (IP):-Internet Protocol is a method that is useful for sending data from
one device to another from all over the internet. Every device contains a unique IP
Address that helps it communicate and exchange data across other devices present on
the internet.
 Working of Transmission Control Protocol (TCP) :- To make sure that each message
reaches its target location intact, the TCP/IP model breaks down the data into small
bundles and afterward reassembles the bundles into the original message on the opposite
end. Sending the information in little bundles of information makes it simpler to maintain
efficiency as opposed to sending everything in one go. After a particular message is
broken down into bundles, these bundles may travel along multiple routes if one route is
jammed but the destination remains the same.

5 Sourav , MCA
 Features of TCP/IP
Some of the most prominent features of Transmission control protocol are mentioned below.

 Segment Numbering System: TCP keeps track of the segments being transmitted or received by assigning
numbers to each and every single one of them. A specific Byte Number is assigned to data bytes that are to be
transferred while segments are assigned sequence numbers. Acknowledgment Numbers are assigned to received
segments.
 Connection Oriented: It means sender and receiver are connected to each other till the completion of the process.
The order of the data is maintained i.e. order remains same before and after transmission.
 Full Duplex: In TCP data can be transmitted from receiver to the sender or vice – versa at the same time. It
increases efficiency of data flow between sender and receiver.
 Flow Control: Flow control limits the rate at which a sender transfers data. This is done to ensure reliable delivery.
The receiver continually hints to the sender on how much data can be received (using a sliding window).
 Error Control: TCP implements an error control mechanism for reliable data transfer. Error control is byte-oriented.
Segments are checked for error detection. Error Control includes – Corrupted Segment & Lost Segment
Management, Out-of-order segments, Duplicate segments, etc.
 Congestion Control: TCP takes into account the level of congestion in the network. Congestion level is determined
by the amount of data sent by a sender.

6 Sourav , MCA
 Advantages/Disadvantages of TCP
 Advantages of TCP : -
 It is a reliable protocol.
 It provides an error-checking mechanism as well as one for recovery.
 It gives flow control.
 It makes sure that the data reaches the proper destination in the exact order that it was sent.
 Open Protocol, not owned by any organization or individual.
 It assigns an IP address to each computer on the network and a domain name to each site thus
making each device site to be distinguishable over the network.
 Disadvantages of TCP: -
 TCP is made for Wide Area Networks, thus its size can become an issue for small networks with
low resources.
 TCP runs several layers so it can slow down the speed of the network.
 It is not generic in nature. Meaning, it cannot represent any protocol stack other than the TCP/IP
suite. E.g., it cannot work with a Bluetooth connection.
 No modifications since their development around 30 years ago.

7 Sourav , MCA
 HTTP
HTTP stands for HyperText Transfer Protocol. Tim Berner invents it. HyperText is the type of text that is specially coded with
the help of some standard coding language called HyperText Markup Language (HTML)
 Working of HTTP:-
 First of all, whenever we want to open any website then first open a web browser after that we will type the URL of that
website (e.g., www.facebook.com ). This URL is now sent to the Domain Name Server (DNS). Then DNS first check
records for this URL in their database, then DNS will return the IP address to the web browser corresponding to this URL.
Now the browser is able to send requests to the actual server.
 After the server sends data to the client, the connection will be closed. If we want something else from the server we
should have to re-establish the connection between the client and the server.
 Characteristics of HTTP:-
 HTTP is IP based communication protocol that is used to deliver data from server to client or vice-versa.
 The server processes a request, which is raised by the client, and also server and client know each other only during the
current bid and response period.
 Any type of content can be exchanged as long as the server and client are compatible with it.
 Once data is exchanged, servers and clients are no longer connected.
 It is a request and response protocol based on client and server requirements.
 It is a connection-less protocol because after the connection is closed, the server does not remember anything about the
client and the client does not remember anything about the server.
 It is a stateless protocol because both client and server do not expect anything from each other but they are still able to
communicate.

8 Sourav , MCA
 Distance Vector Routing (DVR)
Protocol
A distance-vector routing (DVR) protocol requires that a router inform its neighbors of topology changes
periodically. Historically known as the old ARPANET routing algorithm (or known as Bellman-Ford algorithm).
 Distance Vector Algorithm –
 A router transmits its distance vector to each of its neighbors in a routing packet.
 Each router receives and saves the most recently received distance vector from each of its neighbors.
 A router recalculates its distance vector when:
 It receives a distance vector from a neighbor containing different information than before.
 It discovers that a link to a neighbor has gone down.
 Advantages of Distance Vector routing –
 It is simpler to configure and maintain than link state routing.
 Disadvantages of Distance Vector routing -
 It is slower to converge than link state.
 It is at risk from the count-to-infinity problem.
 It creates more traffic than link state since a hop count change must be propagated to all routers and
processed on each router. Hop count updates take place on a periodic basis, even if there are no changes
in the network topology, so bandwidth-wasting broadcasts still occur.
 For larger networks, distance vector routing results in larger routing tables than link state since each router
must know about all other routers. This can also lead to congestion on WAN links.
 Note – Distance Vector routing uses UDP(User datagram protocol) for transportation.

9 Sourav , MCA
 Open Shortest Path First (OSPF)
Protocol
Open shortest path first (OSPF) is a link-state routing protocol that is used to find the best path between the source
and the destination router using its own shortest path first (SPF) algorithm. A link-state routing protocol is a protocol
that uses the concept of triggered updates, i.e., if there is a change observed in the learned routing table then the
updates are triggered only, not like the distance-vector routing protocol where the routing table is exchanged at a
period of time.
 Criteria –  OSPF supports/provides/advantages –
To form a neighborship in OSPF, there is a criterion
 Both IPv4 and IPv6 routed protocols
for both routers:
 It should be present in the same area.  Load balancing with equal-cost routes for the
 The router I’d be unique. same destination
 The subnet mask should be the same.  VLSM and route summarization
 Hello, and the dead timer should be the same.  Unlimited hop counts
 The stub flag must match.  Trigger updates for fast convergence
 Authentication must match.  A loop-free topology using SPF algorithm.
 OSPF supports NULL, plain text, MD5  Run-on most routers
 Classless protocol
authentication.

10
Sourav , MCA
 references
1. Data Communications and Networking with TCPIP Protocol Suite| 6th Edition-
by Behrouz A. Forouzan (Author).
2. www.javatpoint.com/features-of-java
3. www.tutorialspoint.com/java/java-features
4. www.geeksforgeeks.org/java-platform-independent

11
Sourav , MCA
 Thanks!
Do you have any questions?
[email protected]
+91 974 976 6930 | Jointeamsourav.com

12 Sourav , MCA