IMP Differences of different topics.🤫.pdf

Imp difference.

1. 00:00:55
1) LAN Vs MAN Vs WAN:
Sr
No. Network)
1
3
4
5
LAN
6
(Local Area MAN (Metropolitan
Network)
Ownership is private.
It has low cost.
It has high speed.
It is easy to design.
It has less congestion.
Ownership can be private or public. Ownership can be private or public.
It has moderate cost.
It has moderate speed.
It is some difficult to design.
It has some more congestion.
Used in Colleges, Hospitals. Used in Small town, City.
Area WAN (Wide Area Network)
Student Remember it as: UDOS (C)2
It has high cost.
It has low speed.
It is difficult to design.
It has more congestion.
Used in Country.

2. 00:01:13II
2) Connection Oriented Vs Connection Less :
Sr No. Connection Oriented
1
2
3
4
5
6
It is feasible.
Congestion is not possible.
It is related to the telephone system.
It
It requires authentication.
Ex: TCP (Transmission Mission Protocol).
Connection Less
is preferred by long & steady It preferred by bursty communication.
communication.
Student Remember it as: PCEF (R)²
It is not feasible.
Congestion is possible.
It is related to the postal system.
It does not require authentication.
Ex: UDP (User Datagram Protocol).

3. 00:01:20 I|
3) Circuit Vs Packet Switching:
Sr No. Circuit Switching
1
2
3
4
5
6
It requires simple protocols for delivery.
Implemented at the physical layer.
Each packet follows the same route.
Call setup is required.
|Recording of packets is never possible.
Packet Switching
Student Remember it as: CIDFRS
It requires complex protocols for delivery.
Implemented at the datalink layer & network layer.
Packets can follow any route.
It does not support
store & forward It supports store & forward transmission.
transmission.
Call setup is not required.
Recording of packets is possible.

4. 00:01:26II
4)
1
2
3
Sr No. OSI Model
4
OSI Vs TCP/IP Model:
6
It has 7 layers.
It is low in usage.
It is vertically approached.
It is less reliable.
|Delivery of the package is guaranteed.
Replacement of tools & changes can easily
be done.
Student Remember it as: LUDA (R)²
TCP/IP Model
It has 4 layers.
It is mostly used.
It is horizontally approached.
It is more reliable.
Delivery of the package is not guaranteed.
Replacement of tools is not easy as it is in OSI Model.

5. 00:01:34II
5) TCP Vs UDP:
1
Sr No. TCP
2
3
4
5
6
TCP is heavy-weight.
TCP doesn't support Broadcasting.
TCP connection is a byte stream.
It is slower than UDP. (Speed)
It is less efficient.
It used by SMTP, HTTP, FTP.
Student Remember it as: EUW (S)3
UDP
UDP is lightweight.
UDP supports Broadcasting.
UDP connection is a message stream.
It is faster than TCP. (Speed)
It is more efficient.
It used by DNS, DHCP, RIP.

6. 00:01:42 I|
Sr
No.
1
2
6) SMTP Vs HTTP Vs FTP:
3
4
Parameter
Port number
Type of band transfer
No. of TCP connections
Type of TCP connection
State
HTTP
80
In-band
1
Persistent &
Non
persistent
Stateless
Student Remember it as: PNS (T)
FTP
20 and 21
Out-of-band
2 (Data & Control Connection)
Persistent
Control
Non-persistent
Data Connection
Maintains state
for
connection.
for
SMTP
25
In-band
1
Persistent

7. 00:01:53 |
7) IPv4 Vs IPv6:
1
2
3
Sr No. IPy4
4
5
6
IPv4 has a 32-bit address length.
Address representation is in decimal.
Checksum field is available.
It has a header of 20-60 bytes.
IPv4 can be converted to IPv6.
IPv6
Student Remember it as: HS (AC)²
IPv6 has a 128-bit address length.
Address representation is in hexadecimal.
Checksum field is not available.
It has a header of 40 bytes fixed.
Not all IPv6 can be converted to IPv4.
IPv4 supports VLSM(Variable Length subnet mask). IPv6 does not support VLSM.

8. 00:02:05II
|8) DV Vs LS Routing Algorithm:
Sr No. Direct Vector Routing Algorithm
1
2
3
4
5
6
Traffic is less.
Converges slowly.
Count of infinity problem.
Make use of Bellman Ford Algorithm.
Persistent looping problem.
Practical implementation is RIP & IGRP.
Student Remember it as: UT (PC)²
Link State Routing Algorithm
Traffic is more.
Converges faster.
No count of infinity problem.
Make use of Dijakstra's algorithm.
No persistent loops.
Practical implementation is OSPF and ISIS.

9. 00:02:11 |
9) Pure Vs Slotted Aloha:
Sr No. Pure Aloha
1
2
3
4
6
It doesn't reduce number of collisions to half.
Maximum efficiency = 18.4%.
Vulnerable time for Pure Aloha =2 x Tt.
Probability of successful transmission of the
data packet =Gx e-2G,
It is less efficient.
Slotted Aloha
Student Remember it as: PC (ET)²
It reduces the number of collisions to half.
Time is continuous & not globally Time is discrete & globally synchronized.
Maximum efficiency= 36.8% .
Vulnerable time for Slotted Aloha = Tt.
Probability of successful transmission of the data
packet =Gx eG,
It is more efficient.
synchronized.