Data Communications and Computer
Networks
Module 3
Dr. SHAKTI KUNDU
AUGUST 2024
Module wise CONTENTS: proposed 2023 CSE batch
Module 1 - Introduction: Data communication & its components, types of data communication and
communication channels. Key components of computer network; network devices; types of computer
networks; network topology; reference models (Network Architectures) – OSI & TCP/IP.
Module 2 - Physical Layer: Introduction and functions; types of transmission media – guided and
unguided; integrated services digital network (ISDN); asynchronous transfer mode (ATM).
Module 3 - Data Link Layer: Overview; sliding window protocols - Stop-&-Wait; Go-Back-N,
Selective Repeat; Error detection and correction; Hamming Code, LRC, VRC, CRC, Checksum, Round
Trip Time, Latency (Delay); Medium Access Sublayer: medium access control (MAC) Addresses;
Switching techniques - circuit, message & packet; Random Access Protocols - Pure ALOHA, Slotted
ALOHA, CSMA / CD, CSMA / CA; Ethernet (802.3 IEEE standard), Wireless Links, Wireless LAN -
WiFi (802.11).
Module 4 - Network Layer: Introduction; address resolution protocol (ARP); internet protocol (IP);
internet control message protocol (ICMP); internet group management protocol (IGMP); IPv4
addressing, representation of IPv6; IPv4 vs IPv6; Conversion IPv4 to IPv6; Routing Protocols - routing
information protocol (RIP), open shortest path first (OSPF); border gateway protocol (BGP); Enhanced
Interior Gateway Routing Protocol (EIGRP).
Module 5 - Transport Layer: Introduction; transport layer protocols - UDP & TCP, TCP connection
establishment; TCP connection termination; TCP congestion control. Application Layer: Introduction –
features & functions; application layer protocols; Web and HTTP, Email, P2P network, its types &
applications.
Module 3 - Data Link Layer: Overview; sliding window protocols - Stop-&-
Wait; Go-Back-N, Selective Repeat; Error detection and correction; Hamming
Code, LRC, VRC, CRC, Checksum, Round Trip Time, Latency (Delay);
Medium Access Sublayer: medium access control (MAC) Addresses;
Switching techniques - circuit, message & packet; Random Access Protocols -
Pure ALOHA, Slotted ALOHA, CSMA / CD, CSMA / CA; Ethernet (802.3
IEEE standard), Wireless Links, Wireless LAN - WiFi (802.11).
Data Link Layer
The data link layer is the second layer from the bottom in the OSI (Open
System Interconnection) network architecture model.
It is responsible for the node-to-node delivery of data. Its major role is to
ensure error-free transmission of information.
DLL is also responsible for encoding, decoding, and organizing the outgoing
and incoming data.
This is considered the most complex layer of the OSI model as it hides all the
underlying complexities of the hardware from the other above layers.
Sub-layers of Data Link Layer
Flow Control
Flow Control
Flow Control
Flow Control
Flow Control
Flow Control
Stop and wait ARQ
Stop and wait ARQ
Sliding Window Protocol
Sliding Window Protocol
Go Back N
Go Back N
Go Back N
Go Back N
Practice Problem 1 on “Go Back N”
Practice Problem 1 on “Go Back N”
Practice Problem 1 on “Go Back N”
Practice Problem 1 on “Go Back N”
Practice Problem 2 on “Go Back N”
Practice Problem 2 on “Go Back N”
Practice Problem 2 on “Go Back N”
Practice Problem 2 on “Go Back N”
Selective Repeat
Selective Repeat
In SR protocol, only the required frame is transmitted not the entire window.
Practice Problem 1 on Selective Repeat
Here, 3 4 0 5 1 2 6 are the packets that has not been acknowledged by the receiver.
Hence the answer as outstanding packet's in sender window.
Practice Problem 2 on Selective Repeat
Error detection and correction
Round Trip Time
Round Trip Time
Calculate Propagation Time
Latency (Delay)
Latency (Delay)
Latency (Delay)
Latency (Delay)
Latency (Delay)
Transmission Delay
Propagation Delay
Speed of Light is 3 x 108 m/s but optical fiber speed is 70% of light speed. So,
the Velocity (v) will be = 3 x 108 x 0.7 = 2.1 x 108 m/s.
Practice Problem on Transmission Delay and
Propagation Delay
Parity Generators / Parity Bit – Odd Parity
Odd
Parity Generators / Parity Bit – Even Parity
Even
Odd & Even Parity Checker
CASE 1: Due to some noise, if bits get flipped at the receiver end, then following
cases will occur with ERROR:
Even Parity Checker
CASE 2: Due to some noise, if 2 bits get flipped at the receiver end, then following
cases will occur with NO ERROR:
CASE 3: Due to some noise, if 3 (odd) bits get flipped at the receiver end, then
following cases will occur with ERROR:
Odd Parity Checker
CASE 4: Due to some noise, if we have 2 bits of error at the receiver end, then
following cases will occur with NO ERROR:
CASE 5: Due to some noise, if we have 3 bits of error at the receiver end, then
following cases will occur with ERROR:
Hamming Code
Hamming Code
Hamming Code – error detection
Hamming Code – error correction
Hamming Code – error correction
Error detection and correction
Error detection and correction
Error detection and correction
Error detection and correction
Vertical redundancy check
Vertical redundancy check
Vertical redundancy check
Longitudinal redundancy check
Longitudinal redundancy check
Longitudinal redundancy check
VRC & LRC – Practice Problem 1
The following bit stream is encoded using VRC, LRC and even parity.
Locate and correct the error if it is present.
11000011 11110011 10110010 00001010
00101010 00101011 10100011 01001011
11100001
Checksum
Checksum
Checksum
Checksum
Checksum
Cyclic redundancy check
Cyclic redundancy check
Cyclic redundancy check
Cyclic redundancy check
Here, the Divisor is common for both the sender and the receiver.
In the below mentioned case, there is NO ERROR in the data transmission.
Cyclic redundancy check
Cyclic redundancy check – Practice Problem 1
Cyclic redundancy check – Practice Problem 1
Cyclic redundancy check – Practice Problem 2
A bit stream 10011101 is transmitted using the standard CRC method.
The generator polynomial is x3 + 1. Show the actual bit string transmitted.
Suppose the third bit from left is inverted during transmission. Show that
this error is detected at the receiver end.
Medium Access Control Sublayer (MAC sublayer)
Functions of MAC Layer
Medium access control (MAC) Addresses
Medium access control (MAC) Addresses
Medium access control (MAC) Addresses
How to see the Medium MAC address?
How to see the Medium MAC address?
How to see the Medium MAC address?
Addressing in Networking
Addressing in Networking
IP addresses are 32 bits – IPv4 and 128 bits – IPv6 but MAC addresses are 48
bits.
Classful Addressing
Classful Addressing
Class E, B, C, D
Classful Addressing
Classful Addressing – Subnet Mask
Classful Addressing – Subnet Mask example
Here, different cases highlighting whether the switch may communicate
among the below mentioned devices:
Classful Addressing – Subnet Mask 1 example
Classful Addressing – Subnet Mask 1 example
Classful Addressing – Subnet Mask 2 example
Switching Techniques
Switching Techniques - Circuit
Switching Techniques - Circuit
Switching Techniques - Message
Switching Techniques - Packet
Switching Techniques - Packet
Switching Techniques - Packet
Switching Techniques - Packet
Practice Problem on Packet Switching - 1
Consider the store and forward packet switched network given below. Assume
that the bandwidth of each link is 106 bytes / sec. A user on Host A sends a file
of size 103 bytes to host B through routers R1 and R2 in three different ways.
In the first case, a single packet containing the complete file is transmitted
from A to B. In the second case, the file is split into 10 equal parts, and these
packets are transmitted from A to B. In the third case, the file is split into 20
equal parts and these packets are sent from A to B. Each packet contains 100
bytes of header information along with the user data. Consider only
transmission time and ignore processing, queuing and propagation delays.
Also assume that there are no errors during transmission. Let T1, T2 and T3
be the times taken to transmit the file in the first, second and third case
respectively. Compute the final time taken in all 3 cases?
Practice Problem on Packet Switching - 1
Practice Problem on Packet Switching - 2
Comparison of Message, Circuit and Packet
Switching
Multiple Access Protocols
ALOHA
Pure ALOHA
Background of Pure ALOHA
Pure ALOHA
Example of Pure ALOHA
Slotted ALOHA
Slotted ALOHA
Slotted ALOHA
Slotted ALOHA
Slotted ALOHA
Here, slot 1, 4, 5 and 6 - NO COLLISSIONS.
Slotted ALOHA
CSMA
CSMA
CSMA
CSMA
CSMA
CSMA – Types comparison
CSMA / CD
CSMA / CD
CSMA / CD
Efficiency of CSMA / CD
CSMA / CA
RTS/CTS (Request to Send/Clear to Send) is a mechanism in wireless networks that
helps to reduce frame collisions and the hidden node problem. It's an optional part of
the IEEE 802.11 standard's Distributed Coordination Function (DCF).
Channelization Protocols
Channelization Protocols - FDMA
Channelization Protocols - FDMA
Here, multiple stations are transmitting the data at the same time without
collision and without overlapping of data.
Channelization Protocols - TDMA
Channelization Protocols - TDMA
TDMA is time shared approach. Here, at particular time, only 1 station is
using the entire bandwidth of the channel.
Channelization Protocols - CDMA
Channelization Protocols - CDMA
This is the case of multiplexing, here multiple signals are converted into single
signal.
Control Access Protocols - Reservation
Just contemplate the scenario, suppose you have very important meeting at
New Delhi. You are actually in Bengaluru and you prefer Tain for your travel.
What if you don’t reserve your seat and while searching you found free seat
and at the same time some another guy is looking for the same free seat. This
situation will result in collision.
Control Access Protocols - Reservation
Control Access Protocols - Reservation
Here, in first time interval - station 1, 3, and, 4 are making reservation whereas
station 2, 5 are not making any reservation.
In next time interval, station 1 alone is doing reservation, i.e. sending data.
In last time interval, no station is doing reservation, so nobody is sending data.
This is how the common channel or shared medium is accessed by more than
1 station without collision.
Control Access Protocols - Polling
Control Access Protocols - Polling
Control Access Protocols - Polling
Control Access Protocols - Polling
Control Access Protocols – Token Passing
Control Access Protocols – Token Passing
Control Access Protocols – Token Passing
Control Access Protocols – Token Passing
Control Access Protocols – Token Passing
Ethernet (802.3 IEEE standard) – Wired LAN
technologies
Ethernet (802.3 IEEE standard) - Wired LAN
technologies
Ethernet (802.3 IEEE standard)
Ethernet – Practice Problems
Ethernet – Practice Problems - 1
Ethernet – Practice Problems - 2
Ethernet – Practice Problems – 3 & 4
Wireless LAN - WiFi (802.11)
Wireless LAN - WiFi (802.11)
Ethernet uses CSMA / CD whereas Wi-Fi uses CSMA / CA
Wireless LAN - WiFi (802.11)
Wireless LAN - WiFi (802.11)
Wireless LAN - WiFi Frame Format
Wireless LAN - WiFi Frame Format
Wireless LAN - WiFi Frame Format
Wireless LAN - WiFi Frame Format
Wireless LAN - WiFi Frame Format
Dr. SHAKTI KUNDU
Data Communications and Computer Networks
2024