Differences between the OSI and TCP/IP models

-

 

AspectOSI ModelTCP/IP Model
Number of Layers74
Layers1. Physical1. Network Interface
2. Data Link2. Internet
3. Network3. Transport
4. Transport4. Application
5. Session
6. Presentation
7. Application
DevelopmentDeveloped by ISODeveloped by ARPANET
UsageTheoretical model for understanding and designing networksPractical model for actual network communication
Example ProtocolsEthernet (Data Link), IP (Network), TCP (Transport), HTTP (Application)Ethernet (Network Interface), IP (Internet), TCP/UDP (Transport), HTTP/FTP (Application)
Layer FunctionsEach layer has a specific function and communicates with the layers directly above and below itLayers are more flexible and can combine functions from multiple OSI layers

Comments

Post a Comment

Popular posts from this blog

Error Detection in Data Link Layer

-
Image
 Sure! Error control in the data link layer ensures that data is transmitted accurately over a network. It involves both error detection and error correction techniques. Here’s a detailed explanation with examples: Error Detection Error detection involves identifying errors in the transmitted data. Common techniques include: Sure! Let’s dive into the different error detection methods used in the data link layer: VRC, LRC, CRC, and Checksum. 1. Vertical Redundancy Check (VRC) VRC , also known as Parity Check , involves adding a parity bit to each data unit (byte). This parity bit ensures that the total number of 1s in the byte (including the parity bit) is even (even parity) or odd (odd parity). Example: Data to be sent: 1010001 Even parity: Add a parity bit 1 to make the total number of 1s even: 10100011 Odd parity: Add a parity bit 0 to keep the total number of 1s odd: 10100010 At the receiver’s end, the parity of the received data is checked. If it doesn’t match the expected pa...
Read more

DS LAB 2 Program

-
  Program to insert, delete and traverse an element from an array // insert element in array # include < stdio.h > int insertSorted ( int arr [] , int n , int key , int capacity ) {     if ( n >= capacity )         return n ;     arr [ n ] = key ;     return ( n + 1 ); } int main () {     int arr [ 20 ] = { 12 , 16 , 20 , 40 , 50 , 70 };     int capacity = sizeof ( arr ) / sizeof ( arr [ 0 ]);     int n = 6 ;     int i , key = 26 ;     printf ( " \n Before Insertion: " ) ;     for ( i = 0 ; i < n ; i ++ )         printf ( " %d   " , arr [ i ]) ;     n = insertSorted ( arr , n , key , capacity ) ;     printf ( " \n After Insertion: " ) ;     for ( i = 0 ; i < n ; i ++ )         printf ( " %d   " , arr [ i ]) ;     return 0 ; } /...
Read more

DSA 3 DAYS Part 1

-
Image
 1) Algorithms          Definition-           Syntax- 2) Flow Chart           Definition-          Representation-            3) Basics Analysis on Algorithm      Complexity           a) Time Complexity                    Example-                          loop = On           b) Space Complexity                     Example-                         Pointer = O1     Type of Complexity           a) Best Case (  Ω )            ...
Read more