Indian Institute of Information Technology Allahabad Mid
Semester Question Paper
Course Name: Computer Networks Course Instructor/ Coordinator: Dr. Vijay Chaurasiya/ Dr. N Mazumdar Course Code: PC-IT-2007
Program Name(s): B. Tech 2nd year Exam Date: 07/03/2025 Time: 2.0 Hrs Marks: 100
Attempt Any Five (05) questions
1. a. Describe at least three responsibilities and three protocols for each layer of TCP/IP reference 2.5
model. How OSI reference model is different from TCP/IP reference model?
b. Compare checksums and CRCs as a means of detecting errors. Discuss the tradeoffs between 2.5
checksums and CRCs. Suppose a network uses CRC (Cyclic Redundancy Check) for error
detection with a generator polynomial x 4 + x +1 . Find the CRC for the message 101101.
2. a. Define latency (end to end delay) and throughput in networking. How do they impact network 1
performance? What are the components of latency (end to end delay) in the network?
b. Suppose that the spectrum of a channel is between 10 MHz and 12 MHz, and an intended 2
capacity of 8 Mbps.
i. What should be the SNR in order to obtain this capacity?
ii. What would be the capacity if the environment starts suffering lesser noise and the SNR goes
up to 27 dB.
c. Perform Manchester and Differential Manchester Encoding for the given bit stream: 10110010. 2
3. a. Explain the sliding window protocol with cumulative ARQ and compare it with Selective Repeat 2
ARQ.
b. A sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames are of 2
size 1000 bytes and the transmission rate at the sender is 80 Kbps (1Kbps = 1000 bits/second).
Size of an acknowledgement is 100 bytes and the transmission rate at the receiver is 8 Kbps. The
one-way propagation delay is 100 milliseconds. Assuming no frame is lost, what is the sender
throughput in bytes/second?
c. Define Transmission Delay and Propagation delay. A link has a data rate of 50 Mbps, and the 1
round-trip time (RTT) is 40 milliseconds and frame size of 1024 bits. Calculate the bandwidth
delay product for this link. Suppose a sliding window protocol (SWP) has to be implemented for
the above link then what sender’s window size and the number of bits for the sequence number
should be used for the SWP implementation?
4. a. Define the frame format and significance of the fields present in the header of Ethernet protocol. 3
b. A network operates using CSMA/CD with a data rate of 100 Mbps. The maximum propagation 2
delay in the network is 25 microseconds. Determine the minimum frame size required to ensure
efficient collision detection.
5. a. Describe the difference between a packet switched network and a circuit switched network, and 2.5
indicate when it is more advantageous to use each.
b. Precisely describe (i.e., give the flowchart) of 1- persistent CSMA/CD with binary exponential 2.5
back off protocol as used in IEEE 802.3 (Ethernet) and explain it.
6. a. What is the orphan packet and stray packet problems in the Token ring? How is it addressed? 1
b. Explain the concept of token holding time in a token ring network. How does it impact network 2
performance?
c. Consider a token ring network with 15 stations and a ring length of 3 km. The propagation speed 2
is 2 × 10^8 m/s, and each station holds the token for 3 μsec. Calculate the minimum time required
for the monitoring station to detect token loss.
SOLUTION: Marked answers after multiplying given marks by 4
1.
a. Describe at least three responsibilities and three protocols for each layer of TCP/IP
reference model. How OSI reference model is different from TCP/IP reference model? [2.5]
Responsibilities and Protocols for Each Layer of the TCP/IP Reference Model
1. Application Layer
Responsibilities:
1. Provides network services to applications.
2. Ensures data formatting, encoding, and transmission.
3. Handles user authentication and encryption.
4. Supports different communication models (e.g., client-server, peer-to-peer).
5. Manages session establishment, maintenance, and termination.
Protocols:
HTTP, HTTPS, SMTP, POP3, IMAP, FTP, SFTP, DNS, SNMP
2. Transport Layer
Responsibilities:
1. Provides reliable or unreliable communication between devices.
2. Segments and reassembles messages into smaller packets.
3. Controls data flow to prevent congestion.
4. Detects and corrects errors in data transmission.
5. Establishes and maintains end-to-end communication sessions.
Protocols:
TCP, UDP, SCTP, DCCP, TLS, SSL
3. Internet Layer
Responsibilities:
1. Handles logical addressing and packet routing.
2. Determines the best path for data transmission.
3. Supports fragmentation and reassembly of packets.
4. Provides error reporting and diagnostics.
5. Facilitates network interoperability between devices.
Protocols:
IP, IPv4, IPv6, ICMP, ARP, RARP, IGMP
4. Network Access Layer (Link Layer)
Responsibilities:
1. Defines how data is transmitted over physical media.
2. Encapsulates packets into frames for transmission.
3. Manages MAC addresses for data forwarding.
4. Provides error detection at the physical level.
5. Controls access to the network medium.
Protocols:
Ethernet, Wi-Fi, PPP, MAC, L2TP, MPLS, ARP
Differences Between OSI and TCP/IP Models
Feature OSI Model TCP/IP Model
Number of Layers 7 (Application, Presentation, Session, Transport, 4 (Application, Transport,
Network, Data Link, Physical) Internet, Network Access)
Standardization Theoretical model used for reference Practical model used in real-
world networking
Protocol Independent of specific protocols Based on internet protocols
Dependency (TCP, IP)
Layer Merging Separate Presentation and Session layers Merged into the Application layer
Flexibility More generalized and adaptable Designed specifically for the
internet
b. Compare checksums and CRCs as a means of detecting errors. Discuss the tradeoffs between
checksums and CRCs. Suppose a network uses CRC (Cyclic Redundancy Check) for error
detection with a generator polynomial x^4+x+1. Find the CRC for the message 101101. [2.5]
Comparison of Checksums and CRCs for Error Detection
Feature Checksum CRC (Cyclic Redundancy Check)
Error Detection Detects most errors but weaker against Highly effective in detecting burst errors
Strength burst errors
Computation Simple addition and complement operation Uses polynomial division (more complex)
Complexity
Efficiency Faster but less reliable Slightly slower but more robust
Use Cases Used in simpler protocols like UDP, TCP Used in high-reliability networks like
Ethernet, HDLC
Finding the CRC for Message 101101 with Generator Polynomial x4 + x + 1
The generator polynomial x4 + x + 1 corresponds to the binary divisor:
G(x)=10011G(x) = 10011
Step 1: Append Zero Bits
The original message is 101101 (6 bits). Since the generator is 4th-degree, append 4 zeros:
1011010000
Step 2: Perform Binary Division (Modulo-2 Division)
We divide 1011010000 by 10011 using XOR (similar to long division, but without borrowing).
The final remainder (last 4 bits) is 1110.
Step 3: Append CRC to the Original Message
The final transmitted message is:
1011011000
Thus, CRC = 1110.
2.
a. Define latency (end to end delay) and throughput in networking. How do they impact network
performance? What are the components of latency (end to end delay) in the network? [1]
● Latency (End-to-End Delay):
Latency refers to the total time taken for a packet to travel from the source to the destination across a
network. It is measured in milliseconds (ms).
● Throughput:
Throughput is the rate at which data is successfully transmitted over a network in a given period. It is usually
measured in bits per second (bps), such as Mbps or Gbps.
Impact of Latency and Throughput on Network Performance
Factor Effect on Network Performance
High Latency Causes delays in real-time applications (e.g., VoIP, gaming, video streaming). Makes networks
feel "slow."
Low Latency Improves responsiveness and performance for interactive applications.
High Increases data transfer speed, enabling efficient file transfers and streaming.
Throughput
Low Throughput Reduces network efficiency, causing buffering and slow loading times.
Components of End-to-End Delay:
End-to-End Delay = Processing Delay + Queuing Delay + Transmission Delay + Propagation Delay
b.
Suppose that the spectrum of a channel is between 10 MHz and 12 MHz, and an intended capacity of 8
Mbps.
i. What should be the SNR in order to obtain this capacity?
ii. What would be the capacity if the environment starts suffering lesser noise and the SNR goes up to 27 dB.
[2]
c. Perform Manchester and Differential Manchester Encoding for the given bit stream: 10110010.
[2]
Mention rules
3.
a. Explain the sliding window protocol with cumulative ARQ and compare it with Selective Repeat ARQ.
[2]
Sliding Window Protocol with Cumulative ARQ
● Sender transmits multiple frames before waiting for an acknowledgment (ACK).
● Receiver ACKs only the last in-order received frame (cumulative acknowledgment).
● If a frame is lost, all subsequent frames must be retransmitted.
Comparison: Go-Back-N ARQ vs. Selective Repeat ARQ
Feature Go-Back-N ARQ (Cumulative) Selective Repeat ARQ
ACK Type Cumulative (ACK last in-order frame) Individual ACK per frame
Retransmissio Resends all frames after error Resends only lost frames
n
Efficiency Less efficient (redundant retransmissions) More efficient (minimizes retransmissions)
Buffering Low (no out-of-order storage) High (stores out-of-order frames)
Use Case Simpler, used in TCP Used in high-reliability networks (e.g., wireless)
Go-Back-N is simpler but wastes bandwidth, while Selective Repeat is efficient but needs more memory. 🚀
b. A sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames are of size
1000 bytes and the transmission rate at the sender is 80 Kbps (1Kbps = 1000 bits/second). Size of an
acknowledgement is 100 bytes and the transmission rate at the receiver is 8 Kbps. The one-way
propagation delay is 100 milliseconds. Assuming no frame is lost, what is the sender throughput in
bytes/second? [2]
c. Define Transmission Delay and Propagation delay. A link has a data rate of 50 Mbps, and the round-
trip time (RTT) is 40 milliseconds and frame size of 1024 bits. Calculate the bandwidth delay product
for this link. Suppose a sliding window protocol (SWP) has to be implemented for the above link then
what sender’s window size and the number of bits for the sequence number should be used for the
SWP implementation? [1]
4.
a. Define the frame format and significance of the fields present in the header of Ethernet protocol.
[3]
Ethernet frames are used for data transmission in LAN networks, following IEEE 802.3 standards.
Ethernet Frame Format (IEEE 802.3)
Field Size Description
(Bytes)
Preamble 7 Synchronization pattern (101010… sequence) to prepare the
receiver.
Start Frame Delimiter 1 Marks the beginning of the frame (10101011).
(SFD)
Destination MAC 6 Identifies the receiver’s MAC address.
Address
Source MAC Address 6 Identifies the sender’s MAC address.
EtherType / Length 2 Indicates the payload type (IPv4, IPv6, etc.) or frame length.
Payload (Data) 46 - Carries the actual data (IP packet, ARP message, etc.).
1500
Frame Check Sequence 4 Contains CRC (Cyclic Redundancy Check) for error detection.
(FCS)
Significance of Ethernet Header Fields
1. Preamble & SFD Synchronize sender & receiver.
2. MAC Addresses Ensure proper delivery of frames within LAN.
3. EtherType/Length Identifies protocol or frame size.
4. Payload Contains actual data being transmitted.
5. FCS Detects errors in transmission.
This structure ensures reliable and efficient data transmission in Ethernet networks.
b. A network operates using CSMA/CD with a data rate of 100 Mbps. The maximum propagation delay
in the network is 25 microseconds. Determine the minimum frame size required to ensure efficient
collision detection. [2]
5.
a. Describe the difference between a packet switched network and a circuit switched network, and indicate
when it is more advantageous to use each. [2.5]
b. Precisely describe (i.e., give the flowchart) of 1- persistent CSMA/CD with binary exponential back off
protocol as used in IEEE 802.3 (Ethernet) and explain it. [2.5]
{Both diagrams are correct}
• Binary Exponential Back Off Algorithm:
If a collision occurs:
– Set a local counter L=0 for every frame.
• If a collision occurs:
1. Choose from slots randomly for retransmission.
2. Increment local counter L for every subsequent collision of same frame and repeat step 1-2.
Binary exponential backoff: wait for a random number Î [0, 2 i -1] of slots before transmitting. After ten collisions
the randomization interval is frozen to max 1023. After 16 collisions the controller throws away the frame.
6.
a. What is the orphan packet and stray packet problems in the Token ring? How is it addressed? [1]
1. Orphan Packet Problem
● Occurs when a sending station fails after transmitting a frame but before removing it from the ring.
● The packet keeps circulating indefinitely, wasting bandwidth and causing congestion.
Solution:
● Monitor Station (Active Monitor): A designated station removes old or unacknowledged frames.
● Timeout Mechanism: A station adds a timestamp, and if a packet exceeds a time limit, it is discarded.
2. Stray Packet Problem
● Happens when a corrupted packet (due to transmission errors) remains on the ring.
● These packets consume bandwidth and cause misinterpretation by other stations.
Solution:
● Cyclic Redundancy Check (CRC): Detects errors, and the receiver discards corrupted frames.
● Monitor Station Cleanup: Detects and removes malformed packets.
Key Takeaway:
Both issues are addressed using an active monitor station, timeout mechanisms, and error-checking methods like
CRC to ensure network efficiency.
b. Explain the concept of token holding time in a token ring network. How does it impact network
performance? [2]
Token Holding Time (THT) is the maximum duration a station can hold the token and transmit data before passing it
to the next station.
Impact on Network Performance:
1. Fairness & Efficiency:
o Ensures fair access by preventing a single station from monopolizing the network.
o If THT is too long, some stations may wait too long for their turn.
o If THT is too short, stations may not send enough data, leading to inefficiency.
2. Throughput:
o A higher THT allows larger data transfers per turn, increasing efficiency in high-load networks.
o A lower THT increases token circulation speed, benefiting networks with frequent small packets.
3. Latency:
o If THT is too long, delays increase, affecting time-sensitive applications.
o A properly tuned THT ensures low latency and smooth traffic flow.
THT balances fairness, efficiency, and delay in a Token Ring network, optimizing throughput and latency based
on traffic patterns.
c. Consider a token ring network with 15 stations and a ring length of 3 km. The propagation speed is 2 ×
10^8 m/s, and each station holds the token for 3 μsec. Calculate the minimum time required for the
monitoring station to detect token loss. [2]
-------------------------------------------------------------------X----------------------------------------------------------
