Difference Between Circuit Switching and

Packet Switching
Circuit switching and packet switching are the two switching methods that
are used to connect the multiple communicating devices with one
another. Circuit Switching was particularly designed for voice
communication and it was less suitable for data transmission. So, a better
solution evolved for data transmission called Packet switching. The main
difference between circuit switching and packet switching is that Circuit
Switching is connection oriented whereas, Packet
Switching is connectionless.

Key Differences Between Circuit Switching and Packet

Switching
1. Circuit Switching is connection oriented that means a path is
established between source and destination before the transmission
occurs. On the other hand, Packet Switching is Connectionless that
means a dynamic route is decided for each packet while
transmission.
2. Circuit Switching was originally designed for voice communication
whereas, Packet Switching was originally designed for data
communication.
3. Circuit Switching is inflexible as once a path is established for
transmission, it doesn’t change while the duration of the session. On
the other hand, Packet Switching is flexible as each packet may
travel through a different route to reach its destination.
4. In packet switching, as each packet travels a different path hence,
the packet are received out of order at the receiver side and later
arranged in order. On the other hand, in circuit switching the entire
message is received as it is as sent from a sender to receiver.
5. Space Division Switching or Time-Division Switching can be used to
implement Circuit Switching whereas, Packet Switching can be
implemented using two approaches Datagram Approach and Virtual
Circuit Approach.
6. Circuit Switching is always implemented at physical layer whereas,
Packet Switching is implemented on the network layer.
Conclusion:

For Data transmission, Packet Switching is the more efficient than Circuit
Switching whereas, when it comes to voice transmission Circuit switching
is more efficient than packet switching.

Static and dynamic routing

Routing is the process of transferring the packets from one network to

another network and delivering the packets to the hosts.

Key Differences Between Static and Dynamic Routing

1. The routers are configured manually, and the table is also created
manually in static routing whereas in dynamic routing the
configuration and table creation is automatic and router driven.
2. In static routing, the routes are user-defined while in dynamic
routing the routes are updated as topology changes.
3. Static routing does not employ complex algorithms. As against,
dynamic routing uses the complex algorithm for calculating shortest
path or route.
4. Dynamic routing is suitable for large networks where the number of
hosts is high. Conversely, static routing can be implemented in a
small network.
5. When a link fails in static routing, the rerouting is discontinued and
requires manual intervention to route traffic. In contrast, link failure
in dynamic routing does not disrupt rerouting.
6. The message broadcast and multicast in dynamic routing makes it
less secure. On the other hand, static routing does not involve
advertisement which makes it more secure.
7. Dynamic routing involves protocols such as RIP, EIGRP, BGP, etc.
Inversely, static routing does not require such protocols.
8. Static routing does not need any additional resources while dynamic
routing requires additional resources such as memory, bandwidth,
etc.

Advantages 
  Easily implemented in a small network.
 Secure because the routes are managed statically.
 Bandwidth usage is not required between routers.

Disadvantages 

 Unsuitable for complex topologies and large networks.

 Link failure can hinder traffic rerouting.

Advantages and Disadvantages of Dynamic Routing

Advantages

 Suitable for all the topologies.

 Network size doesn’t affect the router operations.
 Topologies are adapted automatically to reroute the traffic.

Disadvantages

 Initially, it could be complicated to implement.

 The broadcasting and multicasting of routing updates make it less
secure.

Links state routing and vector routing

Difference Between Distance Vector

Routing and Link State Routing

Ro
uting is the mechanism of transferring information from a source to
destination across an internetwork. The distance vector routing and link
state routing are the two of routing algorithms, categorised depending on
the way the routing tables are updated.

Definition of Distance Vector Routing

In distance vector routing, a router need not know the entire path to
every network segment; it only requires to know the direction or vector in
which to send the packet. The technique determines the direction (vector)
and distance (hop count) to any network in the internetwork.

RIP and IGRP is a commonly used distance vector protocol that uses hop
counts or its routing metrics.

Definition of Link State Routing

In link-state routing, each router attempt to construct its own internal
map of the network topology. At the initial stage of start-up, when a router
becomes active, it sends the messages into the network and collects the
information from the routers to which it is directly connected. It also
provides information about whether the link to reach the router is active or
not. This information is used by other routers to build a map of network
topology. Then the router uses the map to choose the best path.

This flooding of the update message is needed to ensure that all routers
update their database before creating an update routing table that reflects
the new technology. OSPF protocol is the example link state routing.

Key Differences Between Distance Vector Routing and

Link State Routing
1. Bellman-Ford algorithm is used for performing distance vector routing
whereas Dijsktra is used for performing the link state routing.
2. In distance vector routing the routing share, the information of the
entire autonomous system and the information is shared only with
neighbours. On the other hand, in link state routing the routers share
the knowledge only about their neighbours and the information is
shared with all routers.
3. Distance vector routing calculates the best route based on the distance
(fewest number of hops). As against, Link state routing calculates the
best route on the basis of least cost.
4. Link state routing updates only the link state while Distance vector
routing updates full routing table.
5. The frequency of update in both routing technique is different distance
vector update periodically whereas link state update frequency employs
triggered updates.
6. The utilization of CPU and memory in distance vector routing is lower
than the link state routing.
7. The distance vector routing is simple to implement and manage. In
contrast, the link state routing is complex and requires trained network
administrator.
8. The convergence time in distance vector routing is slow, and it usually
suffers from count to infinity problem. Conversely, the convergence
time in link state routing is fast, and it is more reliable.
9. Distance vector doesn’t have hierarchical structure while in link state
routing the nodes can have a hierarchical structure.