Inter networks:

A collection of interconnected networks is called an internetwork or

internet. These terms will be used in a generic sense, in contrast to the
worldwide Internet (which is one specific internet). The Internet uses ISP
networks to connect enterprise networks, home networks, and many other
networks.
Subnets, networks, and internetworks are often confused. The term
‘‘subnet’’ makes the most sense in the context of a wide area network,
where it refers to the collection of routers and communication lines owned
by the network operator. A network is formed by the combination of a
subnet and its hosts.
🡺 Defense Advanced Research Projects Agency (DARPA) had funded
research projects in this direction. ARPA net – a project of DARPA –
introduced the world of networking to protocol suite concepts
🡺 DARPA was well-known for it’s pioneering of packet switching over
radio networks and satellite channels and ARPAnet was declared’ an
operational network with responsibility of administering it to Defense
Communications Agency (DCA) in 1975.
🡺 The first real implementations of the Internet may be cited from the
time when DARPA started converting the machines of its research
network ARPAnet to use the new TCP/IP protocols. After this transition
which started in 1980 and finished in 1983, DARPA demanded that all
computers willing to connect to its ARPAnet must use TCP/IP.
🡺 The success of ARPAnet was more than the expectations of its own
founders and TCP/IP internetworking became widespread rapidly. As a
result, new wide area networks (WAN) were created in the USA and
connected to ARPAnet using TCP/IP protocol.
🡺 In 1990, ARPAnet was eliminated, and the Internet was declared as
the formal global network.

Datagram Approach
A packet-switching technology in which a packet exists is called a datagram.
It is treated as a separate entity. Each packet includes data about the
destination, and the switch helps this data forward the packet to the right
destination. It is also known as connectionless switching.
Virtual Circuit
Virtual Circuit is also referred to as connection-oriented switching. A fixed,
consistent direction through the transmitter’s network is settled in the
virtual circuit method earlier any packets are transmitted. This direction
remains constant for the session period.

Differences
The major differences between the datagram approach and virtual circuit
are as follows −

Datagram Approach Virtual Circuit

There is no dedicated transmission There is also no dedicated

path. transmission path.

There is a network responsible for There is a network responsible for

individual packets. packet sequences.

The route is established for each table. The route is established for the
entire conversation.

It is suitable for a few packets in data It is suitable for longer data

communication. transmission.

There is no connection established. Connection is established.

Datagram approaches are not It provides a dependable

dependable because the communication function to provide
connectionless property creates data that each group appears correctly
packets that reach the destination. It and the sets remain in the original
is different from the order in which order in which they were
they were transmitted. transmitted.

It is frequently used in the IP network It can be used by the ATM

which can be used for data service (Asynchronous Transfer Mode)
such as the internet. Network, which can be used for
mobile calls.

The packets arrive at their intended The packets continually reach their
destination in a multiple order in which destined destination in the similar
they were transmitted. order in which they were
transmitted.

Ethernet Cabling:
 Generally, some people use the term “Ethernet” or ether refers
to cable. Ethernet was the original product designed by Xerox PARC based
on Bob Metcalfe’s idea. It was later upgraded to 10 Mbps by Xerox, Intel
and DEC.
This formed the basis for the IEEE 802.3 standard, which then became an
ISO standard. Actually, the Ethernet was the implementation of standard
802.3.
Cabling for 802.3: The term Ethernet refers to a network of cables.
Various types of cables are being used in different 802.3 implementations.
The following four cable types are the most common among them:

1. 10Base5 cable. 10Base5 cable or “Thick Ethernet” or Thicknet is the

cable which is the oldest in the category. it is called as thicknet because of
the use of thick coaxial cable. The cable is marked after each 2.5 meters.
The thicknet uses bus topology. These marks are provided for attaching tap
points. The connections to this cable are made by “Vampire Taps”. In this
type of connection, a pin is carefully forced half a way into the coaxial cable
core. The cable operates at 10Mbps and it can support a maximum segment
length of 500 meters. It supports 100 nodes per segment. 10Base5
cable allows, at maximum, five segments (each of max of 500 meter) to be
connected. These segment are connected with the help of repeaters.
Therefore four repeaters are allowed to be used providing the effective
length of2.5 km.
It make use of transceiver (transmitter/receiver) connected via a vampire
tap. The transceiver is responsible for transmitting, receiving and detecting
collisions. This transceiver is connected to the station via a transceiver cable
that provides separate path for sending and receiving.
2. 10Base2 Cable. 10Base2 cable also called “Thin Ethernet” or Thinnet
or cheapnet or cheapernet, was designed after the thick Ethernet cable.
This type of cable is usually thin, flexible and bends easily. It also make use
of bus topology. It is also a coaxial cable that is having a smaller diameter
than the 10Base5 cable. The connections to this cable are made by
BNC(Bounced Network Connection) connectors or UTP(Unshielded
twisted pair) connectors. The connections are created by forming T
junctions. These are easier to use and more reliable than vampire
connections. The Ethernet based on this type of cables is cheaper and easy
to install but it can run for 200 meters and it supports 30 nodes per
segment. In both of these network cables, detecting cable breaks, bad taps
or loose connections can be a major problem. Here, a special technique,
called “Time Domain Reflectometry” is used to detect such kind of
errors.
3. 10BaseT Cable. l0BaseT cable or “Twisted Pair” Cable is cheapest and
easiest to maintain. This type of cabling is most popular among local area
networks. It make use of unshielded twisted pair and provides maximum
segment length of 100 m. It make use of start topology. In this type of
network, every station is having a wired link to a central device, called
“Hub”. Telephone company twisted pair cable of category 5 is used in this
type of network. This is an older and known technology of connections. It
can support 1024 nodes per cable segment. The maximum length of a
segment from hub to station can be 150 meters. This type of networks
involves the extra cost of hubs.

4. 10BaseF Cable. 10BaseF cable or “Fiber Optics Cable” is the most

efficient and fastest cable in the category of cables for 802 LANs. The fiber
optic cable is very expensive as compared to above discussed cables but it
offers a very high data transmission speed and noise immunity. This type of
cabling is preferred for running networks between buildings or widely
separated hubs. It has the highest length per cable segment i.e. 2000
meters and it can support 1024 nodes per cable segment.

Routers IP Addressing:
An IP address represents an Internet Protocol address. A unique address
that identifies the device over the network. An IP address is the identifier
that enables your device to send or receive data packets across the internet.
It holds information related to your location and therefore making devices
available for two-way communication. The internet requires a process to
distinguish between different networks, routers, and websites.
IP address structure: IP addresses are displayed as a set of four digits-
the default address may be 192.158.1.38. Each number on the set may
range from 0 to 255. Therefore, the total IP address range ranges from
0.0.0.0 to 255.255.255.255.
IP address is basically divided into two parts: X1. X2. X3. X4
1. [X1. X2. X3] is the Network ID
2. [X4] is the Host ID
How do IP addresses work?
An IP address is part of the TCP/IP suite of protocols. It works behind the
scenes, helping devices and websites connect with each other on the
internet.

Every time a request is made to access a website, the requesting computer

needs to know where the website resides and how to reach it. This is where
the IP address comes into play. The requesting computer connects to the
network router, which connects to the web server where the website lives.
The web server then pulls the website information and sends it back to the
requesting computer. Each device in this process -- including the computer,
router and web server -- carries a uniquely identifiable IP address, without
which the transfer of information will not take place.
Version of IP address:
Currently there are 2 versions of IP addresses are in use i.e IPV4 and IPV6
1. IPV4 (Internet Protocol Version 4): It is the first version of Internet
Protocol address. The address size of IPV4 is 32 bit number. In this
Internet Protocol Security (IPSec) with respect to network security is
optional. It is having 4,294,967,296 number of address still we are seeing
a shortage in network addresses as the use of network & virtual devices
are increasing rapidly.
2. IPV6 (Internet Protocol Version 6): It is the recent version of
Internet Protocol address. The address size of IPV6 is 128 bit number. In
this Internet Protocol Security (IPSec) with respect to network security is
mandatory. It allows 3.4 x 10^38 unique IP addresses which seems to be
more than sufficient to support trillions of internet devices present now or
coming in future.

Types of IP addresses
Here is a list of the five most common types of IP addresses:

1. Private IP addresses
Each device connected to a home network or a private network carries
a private IP address. Private IP addresses are non-internet facing and are
only used on an internal network. Devices with private IP addresses might
include computers, tablets, smartphones, Bluetooth devices, smart TVs and
printers. With the increasing popularity of internet of things products, the
use of private IP addressing is likely to keep growing.

2. Public IP addresses
An ISP assigns these addresses, which enable a router to communicate with
the internet or an outside network. Public IP addresses cover the entire
network, meaning multiple devices sharing the same internet connection will
also share the same public IP address.

3. Dynamic IP addresses
These IP addresses are constantly changing and a new dynamic IP
address is assigned to a device every time it connects to the internet. ISPs
buy large pools of IP addresses to assign to their customers automatically.
They revolve and reuse these addresses between different customers to
generate cost savings and to provide easier network management. A
dynamic IP address also offers security benefits, as it's harder for
cybercriminals to hack into a network interface if its IP is constantly
changing.
4. Static IP addresses
Unlike dynamic IP addresses, static IP addresses never change once they're
assigned by the network. While most internet users and businesses don't
require static IP addresses, they're a requirement for businesses that wish to
host their own web servers. A static IP address ensures that all websites and
email addresses associated with a certain web server will always have a
consistent IP address so it can be reached on the internet.

5. Website IP addresses
These are IP addresses for website owners who don't host their websites on
their own servers but rely on a hosting company to do so. Website IP
addresses are composed of the following two types:

● Shared. This IP address is shared among many different websites and is

mostly used by small businesses that use a managed hosting service,
such as WordPress.
● Dedicated. This is a unique IP address assigned to an individual website.
Dedicated IP addresses help website owners avoid getting blocked or
blacklisted, something that owners of shared IP addresses might face
when malicious behavior is exhibited by other websites sharing the same
IP. Owners of dedicated IP addresses can access their websites while
waiting for a domain transfer.
Difference between IEEE 802.3,4 and 5:
IEEE 802 specifies to a group of IEEE standards. IEEE standards 802 are
used for controlling the Local Area Network and Metropolitan Area Network.
The user layer in IEEE 802 is serviced by the two layers- the data link layer
and the physical layer. The generally uses specifications of IEEE 802 are:
IEEE 802.3 Standard
The IEEE 802.3 standard is popularly called as Ethernet or CSMA/CD
(Carrier Sense Multiple Access/Collision Detect). Ethernet is a LAN
architecture developed by XEROX and extended by DEC, IC and Xerox. It is
specified by IEEE 802.3, and it defines two categories such as Baseband and
Broadband.
Standard Ethernet network facilitates CSMA/CD. When a station needs to
send, it listens to the wire. If the wire is busy, the station waits just before it
goes idle, otherwise, it sends directly.
If two or more stations together begin sending on an idle cable, they will
collide. All colliding stations then remove their transmission, wait a random
time, and continue the whole process all over again.
● IEEE 802.4 IEEE 802.4 describes a token bus LAN standards. In token
passing methods, stations connected on a bus are arranged in a logical
ring. In this method only the station having token(token holder)is being
permitted to transmit frames.
IEEE 802.5 Standard
Token ring is the IEEE 802.5 standard for a token-passing ring in
transmission networks. In a token ring, a special bit pattern, known as a
token, circulates around the ring when all the stations are idle. Token Ring is
formed by the nodes connected in ring format.
The principle used in the token ring network is that a token is circulating in
the ring, and whichever node grabs that token will have the right to transmit
the data.
The token ring is the most convenient network in the workstation
environment. All the stations are connected in the structure of a ring.
Therefore, the token is deleted from the network by adjusting a single bit in
the token. After finishing the transmission, the station restores the tokens
and inserts them into the network.
Let’s see the difference between IEEE 802.3, 802.4 and 802.5 :-

S.No
. IEEE 802.3 IEEE 802.4 IEEE 802.5

Topology used in Topology used in

Topology used in IEEE
1. IEEE 802.3 is Bus IEEE 802.4 is Bus
802.5 is Ring Topology.
Topology. or Tree Topology.

Size of the frame Size of the frame

Frame format in IEEE
format in IEEE 802.3 format in IEEE
2. 802.5 standard is of
standard is 1572 802.4 standard is
the variable size.
bytes. 8202 bytes.

There is no priority It supports

In IEEE 802.5 priorities
3. given in this priorities to
are possible
standard. stations.

Size of the data

Size of the data field No limit is on the size
4. field is 0 to 8182
is 0 to 1500 bytes. of the data field.
bytes.
S.No
. IEEE 802.3 IEEE 802.4 IEEE 802.5

It can handle
Minimum frame It supports both short
5. short minimum
required is 64 bytes. and large frames.
frames.

Efficiency decreases
when speed Throughput &
Throughput &
increases and efficiency at very
6. efficiency at very high
throughput is high loads are
loads are outstanding.
affected by the outstanding.
collision.

Modems are Like IEEE 802.4,

Modems are not
7. required in this modems are also
required.
standard. required in it.

Protocol is
Protocol is very Protocol is moderately
8. extremely
simple. complex.
complex.

It is not applicable
It can be applied for
on Real time
Real time applications
applications,
It is applicable to and interactive
9. interactive
Real time traffic. applications because
Applications and
there is no limitation
Client-Server
on the size of data.
applications.

Distance-vector routing:
In distance-vector routing (DVR), each router is required to inform the
topology changes to its neighboring routers periodically. Historically it is
known as the old ARPNET routing algorithm or Bellman-Ford algorithm.
How the DVR Protocol Works
● In DVR, each router maintains a routing table. It contains only one
entry for each router. It contains two parts − a preferred outgoing line
to use for that destination and an estimate of time (delay). Tables are
updated by exchanging the information with the neighbor’s nodes.
 ●Each router knows the delay in reaching its neighbors (Ex − send echo
request).
● Routers periodically exchange routing tables with each of their
neighbors.
● It compares the delay in its local table with the delay in the neighbor’s
table and the cost of reaching that neighbor.
● If the path via the neighbor has a lower cost, then the router updates
its local table to forward packets to the neighbor.
Example − Distance Vector Router Protocol
In the network shown below, there are three routers, A, B, and C, with the
following weights − AB =2, BC =3 and CA =5.
Step 1 − In this DVR network, each router shares its routing table with
every neighbor. For example, A will share its routing table with neighbors B
and C and neighbors B and C will share their routing table with A.

Form A A B C

A 0 2 3

Form B A B C

A
B 2 0 1

Form C A B C

C 3 1 0

Step 2 − If the path via a neighbor has a lower cost, then the router
updates its local table to forward packets to the neighbor. In this table, the
router updates the lower cost for A and C by updating the new weight from
4 to 3 in router A and from 4 to 3 in router C.

Form A A B C

A 0 2 3

Form B A B C

B 2 0 1

C
Form C A B C

C 3 1 0

Step 3 − The final updated routing table with lower cost distance vector
routing protocol for all routers A, B, and C is given below −
Router A
Form A A B C

A 0 2 3

B 2 0 1

C 3 1 0

Router B
Form B A B C

A 0 2 3

B 2 0 1

C 3 1 0

Router C
Form C A B C

A 0 2 3

B 2 0 1
 C 3 1 0

Link State Routing

Link state routing is a technique in which each router shares the knowledge
of its neighborhood with every other router in the internetwork.
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.

Key steps in Link State Routing Algorithm:

1. Prepare link state table with neighbour nods
2. Flooding
3. Global knowledge about the neighborhood nodes
4. Information sharing
5. Route calculation by Dijstra's algorithm
6. Prepare final routing table
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.

Reliable Flooding
Initial state: Each node knows the cost of its neighbors.
Final state: Each node knows the entire graph.
Route Calculation:
Each node uses Dijkstra's algorithm on the graph to calculate the optimal
routes to all nodes.
The Link state routing algorithm is also known as Dijkstra's algorithm which
is used to find the shortest path from one node to every other node in the
network.
The Dijkstra's algorithm is an iterative, and it has the property that after kth
iteration of the algorithm, the least cost paths are well known for k
destination nodes.
Notations used in link state algorithm:
c( i , j): Link cost from node i to node j. If i and j nodes are not directly linked, then c(i , j) = ∞.

D(v): It defines the cost of the path from source code to destination v that has the least cost currently.

P(v): It defines the previous node (neighbor of v) along with current least cost path from source to v.

N: It is the total number of nodes available in the network.

Example:

Step 1:

The first step is an initialization step. The currently known least cost path
from A to its directly attached neighbors, B, C, D are 2,5,1 respectively.
The cost from A to B is set to 2, from A to D is set to 1 and from A to C
is set to 5. The cost from A to E and F are set to infinity as they are not
directly linked to A.

Step N D(B),P( D(C),P( D(D),P( D(E),P( D(F),P(

B) C) D) E) F)

1 A 2,A 5,A 1,A ∞ ∞

Step 2:

In the above table, we observe that vertex D contains the least cost path
in step 1. Therefore, it is added in N. Now, we need to determine a
least-cost path through D vertex.
a) Calculating shortest path from A to B

1. v = B, w = D

2. D(B) = min( D(B) , D(D) + c(D,B) )

3. = min( 2, 1+2)>

4. = min( 2, 3)

5. The minimum value is 2. Therefore, the currently shortest path from A to B

is 2.

b) Calculating shortest path from A to C

1. v = C, w = D

2. D(C) = min( D(C) , D(D) + c(D,C) )

3. = min( 5, 1+3)

4. = min( 5, 4)

5. The minimum value is 4. Therefore, the currently shortest path from A to C

is 4.</p>

c) Calculating shortest path from A to E

1. v = E, w = D

2. D(E) = min( D(E) , D(D) + c(D,E) )

3. = min( ∞, 1+1)

4. = min(∞, 2)
 5. The minimum value is 2. Therefore, the currently shortest path from A to E

is 2.

Note: The vertex D has no direct link to vertex E. Therefore, the value of D(F) is infinity.

Step N D(B),P( D(C),P( D(D),P( D(E),P( D(F),P(

B) C) D) E) F)

1 A 2,A 5,A 1,A ∞ ∞

2 AD 2,A 4,D 2,D ∞

Step 3:

In the above table, we observe that both E and B have the least cost
path in step 2. Let's consider the E vertex. Now, we determine the least
cost path of remaining vertices through E.

a) Calculating the shortest path from A to B.

1. v = B, w = E

2. D(B) = min( D(B) , D(E) + c(E,B) )

3. = min( 2 , 2+ ∞ )

4. = min( 2, ∞)

5. The minimum value is 2. Therefore, the currently shortest path from A to B

is 2.

b) Calculating the shortest path from A to C.

 1. v = C, w = E

2. D(C) = min( D(C) , D(E) + c(E,C) )

3. = min( 4 , 2+1 )

4. = min( 4,3)

5. The minimum value is 3. Therefore, the currently shortest path from A to C

is 3.

c) Calculating the shortest path from A to F.

1. v = F, w = E

2. D(F) = min( D(F) , D(E) + c(E,F) )

3. = min( ∞ , 2+2 )

4. = min(∞ ,4)

5. The minimum value is 4. Therefore, the currently shortest path from A to F

is 4.

Step N D(B),P( D(C),P( D(D),P( D(E),P( D(F),P(

B) C) D) E) F)

1 A 2,A 5,A 1,A ∞ ∞

2 AD 2,A 4,D 2,D ∞

3 ADE 2,A 3,E 4,E

Step 4:
In the above table, we observe that B vertex has the least cost path in
step 3. Therefore, it is added in N. Now, we determine the least cost
path of remaining vertices through B.

a) Calculating the shortest path from A to C.

1. v = C, w = B

2. D(C) = min( D(C) , D(B) + c(B,C) )

3. = min( 3 , 2+3 )

4. = min( 3,5)

5. The minimum value is 3. Therefore, the currently shortest path from A to C

is 3.

b) Calculating the shortest path from A to F.

1. v = F, w = B

2. D(F) = min( D(F) , D(B) + c(B,F) )

3. = min( 4, ∞)

4. = min(4, ∞)

5. The minimum value is 4. Therefore, the currently shortest path from A to F

is 4.

Step N D(B),P( D(C),P( D(D),P( D(E),P( D(F),P(

B) C) D) E) F)

1 A 2,A 5,A 1,A ∞ ∞

2 AD 2,A 4,D 2,D ∞

3 ADE 2,A 3,E 4,E

4 ADEB 3,E 4,E

Step 5:

In the above table, we observe that C vertex has the least cost path in
step 4. Therefore, it is added in N. Now, we determine the least cost
path of remaining vertices through C.

a) Calculating the shortest path from A to F.

1. v = F, w = C

2. D(F) = min( D(F) , D(C) + c(C,F) )

3. = min( 4, 3+5)

4. = min(4,8)

5. The minimum value is 4. Therefore, the currently shortest path from A to F

is 4.

Step N D(B),P( D(C),P( D(D),P( D(E),P( D(F),P(

B) C) D) E) F)

1 A 2,A 5,A 1,A ∞ ∞

2 AD 2,A 4,D 2,D ∞

3 ADE 2,A 3,E 4,E

4 ADEB 3,E 4,E

5 ADEBC 4,E

Final table:

Step N D(B),P( D(C),P( D(D),P( D(E),P( D(F),P(

B) C) D) E) F)

1 A 2,A 5,A 1,A ∞ ∞

2 AD 2,A 4,D 2,D ∞

3 ADE 2,A 3,E 4,E

4 ADEB 3,E 4,E

5 ADEBC 4,E

6 ADEBCF

Disadvantage:

Heavy traffic is created in Line state routing due to Flooding. Flooding

can cause an infinite looping, this problem can be solved by using
Time-to-leave field.
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
What is BGP?
BGP (Border Gateway Protocol) is an exterior gateway protocol (EGP) that
determines the best path for data transmission between Autonomous
Systems (AS). This happens through the exchange of routing information in
the form of BGP messages, which contain information on the network
topology, the availability of various routes, and the policies used to
determine the best path.
● BGP is a path-vector protocol, which means it considers a variety of
features, including network policies, routing metrics, and other
considerations, to select the best path
● BGP operates on top of the TCP/IP protocol and communicates
between routers through TCP port 179. When a BGP router becomes
online, it establishes a TCP connection with its neighbour routers and
shares network topology information. This data is used to build a BGP
routing table, which consists of a list of all possible routes to various
destinations as well as the attributes associated with each route.
● One of BGP's important features is its ability to support various
route selection policies. These policies can be used to manage traffic
flow between ASes and ensure that traffic is routed through the most
efficient path. BGP policies can be based on factors such as a
preference for a particular network path, the availability of backup
routes, and transmission costs.
● BGP also supports several types of BGP messages, including
update, keep-alive, and notification messages. Keep-alive messages
are used to keep the TCP connection between routers alive, while
update messages are used to announce new routes or modify existing
routes. Notification messages are used to notify issues or to terminate
a BGP session.
What is OSPF?
OSPF (Open Shortest Path First) is a protocol for exchanging routing
information on a computer network within a single autonomous system
(AS). It is a popular interior gateway protocol (IGP) in large industrial
networks.
● OSPF uses link-state routing, which means that routers share
network topology information, such as the availability and cost of
multiple routes. This data is used to create a network map, which
allows routers to find the shortest path between any two points on the
network. OSPF gives comprehensive data about the entire path to a
destination, as opposed to distance vector protocols, which just provide
information about the next hop.
● OSPF uses a hierarchical network structure, with routers divided
into areas. Each area has its own link-state database, which provides
information about the area's routers and links. Routers within an area
share connection information with one another, but they do not
exchange information with routers in other areas unless they are
designated as area border routers (ABRs) or backbone routers.
● ABRs are responsible for exchanging routing information between
areas. They maintain a summary of the routes in their area and
distribute it to other ABRs and backbone routers. This allows routers in
different areas within the AS to determine the fastest route to a
destination.
● OSPF supports multiple types of routers, including internal routers
that are placed within an area and backbone routers that are located
within the network's backbone area. OSPF also supports other OSPF
message types, such as hello messages, link-state advertisement (LSA)
messages, and SPF (Shortest Path First) calculation messages. Hello
messages are used to discover and maintain adjacencies between
routers, whereas LSA messages are utilized for transmitting network
topology information. The shortest path to a destination is calculated
using SPF calculation messages.
● OSPF also supports multiple metrics for determining route costs,
including bandwidth, delay, reliability, load, and MTU (Maximum
Transmission Unit). These measures are used to determine the shortest
path between two network points.
Difference between BGP and OSPF
The following table highlights the major differences between BGP and OSPF
−

Characteristics BGP OSPF

Border Gateway Open Shortest Path First

Full Form
Protocol (BGP) (OSPF)
 Exterior Gateway Interior Gateway Protocol
Protocol
Protocol (EGP) (IGP)

Method of Path-Vector Protocol Link-state protocol

Routing

BGP supports flat or OSPF supports hierarchical

Network
hierarchical network network topologies.
Topology
topologies.

Convergence Slow Fast

BGP port number is OSPF port number is 89

Port Number
179.

It uses the best path It uses the Dijkstra algorithm.

SW
algorithm.

It uses update It uses hello messages,

messages, keep-alive link-state advertisement
Messages
messages, and messages, and SPF
notification messages. calculation messages.