Scribd
Upload
15 views6 pages

Week - 02 - Exercises On The Link Layer

The document covers exercises related to the Link Layer in computer networking, focusing on Cyclic Redundancy Check (CRC) for error detection and error correction schemes. It includes specific problems to determine CRC bits, total bits sent, and performance comparison of two error correction schemes. Additionally, it discusses the Address Resolution Protocol (ARP) and the behavior of an ARP table during keyword searches by a student.

Uploaded by

Eli Bright Semaha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views6 pages

Week - 02 - Exercises On The Link Layer

The document covers exercises related to the Link Layer in computer networking, focusing on Cyclic Redundancy Check (CRC) for error detection and error correction schemes. It includes specific problems to determine CRC bits, total bits sent, and performance comparison of two error correction schemes. Additionally, it discusses the Address Resolution Protocol (ARP) and the behavior of an ARP table during keyword searches by a student.

Uploaded by

Eli Bright Semaha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

COE 475: Computer Networking

Exercises on Link Layer


22.01.2025
Link Layer: Cyclic Redundancy Check
● Consider the Cyclic Redundancy Check (CRC) algorithm discussed in class. Suppose that
the 4-bit generator (G) is 1001, that the data payload (D) is 10011001. Determine the
CRC bits(R) associated with the payload.

● Consider the Cyclic Redundancy Check (CRC) algorithm. Suppose that the 4-bit generator
(G) is 1001, that the data payload (D) is 10011001. Determine the total bits sent from
the sender to the receiver.
Link Layer: Error Correction
Consider the following two code schemes:

Data Scheme 1 Scheme_2


00 v1 = 00000 v1 = 00000
01 v2 = 01011 v2 = 00011
10 v3 =10101 v3 = 01100
11 v4 = 11110 v4 = 11011

● Which of the two schemes has better performance for error correction? Justify
your answer.
● Assume that an invalid codeword v= 00111 is received. How is it decoded at the
receiver when scheme 1 is used?
ARP : Address Resolution Protocol
A final year KNUST student is using her laptop (Host A) to look up technical terms for her project
thesis research. The PC queries a KNUST server(Host D) for each search, with a time lapse of about
8 minutes between consecutive keyword searches. If she searches for five words in total, what
happens to her PC's ARP table over the duration of these activities ?

Host A 137.192.7.7
1A-2F-BB-76-09-AD
137.192.7.23
Host A’s ARP table is shown below:
137.192.7.14
IP Address MAC Address TTL
Host D 137.192.7.14 58-23-D7-FA-20-B0 20m
LAN Host B
137.192.7.8 0C-C4-11-6F-E3-98 20m
71-65-F7-2B-08-53 58-23-D7-FA-20-B0 137.192.7.23 71-65-F7-2B-08-53 20m

0C-C4-11-6F-E3-98
Host C 137.192.7.8

4
B is sending a datagram to A via R.
Give the source and destination MAC addresses, as well as the source and destination IP addresses of the
datagram at points 1,2,3 and 4

1
4

3 2
Thank you

You might also like