Scribd
Upload
11 views3 pages

TCP and Error Detection in Networking

The document contains answers to tutorial questions related to networking concepts, including TCP's role in reliable delivery, CRC checksums, two-dimensional parity matrices, and multiple access protocols. It discusses the implications of error detection and correction in data transmission, particularly in shared medium networks. Additionally, it addresses specific scenarios involving CSMA/CD protocol and collision detection between nodes A and B.

Uploaded by

joelkalaivanan1
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
11 views3 pages

TCP and Error Detection in Networking

The document contains answers to tutorial questions related to networking concepts, including TCP's role in reliable delivery, CRC checksums, two-dimensional parity matrices, and multiple access protocols. It discusses the implications of error detection and correction in data transmission, particularly in shared medium networks. Additionally, it addresses specific scenarios involving CSMA/CD protocol and collision detection between nodes A and B.

Uploaded by

joelkalaivanan1
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

National University of Singapore

School of Computing

CS2105 Tutorial 7 Answer paper

1. [KR, Chapter 6, R2] If all the links in the Internet were to provide reliable delivery service,
would the TCP reliable delivery service be redundant? Why or why not?
IP datagrams in the same TCP connection can take different routes in the network, and
therefore arrive at receiving host out of order. TCP is still needed to sort out received
data in the correct order before passing them to application.
Also, IP datagrams can be lost due to routing loops, equipment failures, etc. For example,
what if a router holding a frame crashes?

2. [KR, Chapter 6, P5, P6] Consider a 4-bit generator 𝐺𝐺 with value 1001, what is the CRC
checksum 𝑅𝑅 if data 𝐷𝐷 has the following value?
a) 11000111010
110
b) 01101010101
011
c) 11111010101
011
d) 10001100001
110

3. Consider the following two-dimensional parity matrix of data.


𝟎𝟎 𝟏𝟏 𝟎𝟎 𝟏𝟏
𝟏𝟏 𝟎𝟎 𝟏𝟏 𝟎𝟎
𝟎𝟎 𝟏𝟏 𝟎𝟎 𝟏𝟏
𝟏𝟏 𝟎𝟎 𝟏𝟏 𝟎𝟎
a) Compute row sums, column sums and parity bit.

Page 1 of 3
𝟎𝟎 𝟏𝟏 𝟎𝟎 𝟏𝟏 𝟎𝟎
𝟏𝟏 𝟎𝟎 𝟏𝟏 𝟎𝟎 𝟎𝟎
𝟎𝟎 𝟏𝟏 𝟎𝟎 𝟏𝟏 𝟎𝟎
𝟏𝟏 𝟎𝟎 𝟏𝟏 𝟎𝟎 𝟎𝟎
𝟎𝟎 𝟎𝟎 𝟎𝟎 𝟎𝟎 𝟎𝟎

b) Give an example of a 1-bit error that can be detected and corrected.


𝟎𝟎 𝟏𝟏 𝟏𝟏 𝟏𝟏
𝟏𝟏 𝟎𝟎 𝟏𝟏 𝟎𝟎
𝟎𝟎 𝟏𝟏 𝟎𝟎 𝟏𝟏
𝟏𝟏 𝟎𝟎 𝟏𝟏 𝟎𝟎
c) Give an example of a 2-bits error that can be detected but cannot be corrected.
𝟎𝟎 𝟏𝟏 𝟎𝟎 𝟎𝟎
𝟏𝟏 𝟎𝟎 𝟏𝟏 𝟎𝟎
𝟎𝟎 𝟏𝟏 𝟎𝟎 𝟎𝟎
𝟏𝟏 𝟎𝟎 𝟏𝟏 𝟎𝟎
d) Give an example of a 4-bits error that cannot be detected.
𝟎𝟎 𝟏𝟏 𝟎𝟎 𝟏𝟏
𝟏𝟏 𝟎𝟎 𝟏𝟏 𝟎𝟎
𝟏𝟏 𝟏𝟏 𝟎𝟎 𝟎𝟎
𝟎𝟎 𝟎𝟎 𝟏𝟏 𝟏𝟏

4. There are many nodes in a shared medium network and most nodes are likely to transmit
frequently. Which of the following multiple access protocol(s) is (are) suitable? (1) TDMA;
(2) CSMA; (3) Token passing.
TDMA and token passing are suitable because there is sufficient work to do to utilize the
“fixed” resources allocated.
CSMA is not because many nodes competing for the shared channel can result in lots of
collision. Utilization will be low.

5. Nodes 𝐴𝐴 and 𝐵𝐵 are accessing a shared medium using CSMA/CD protocol, with propagation
delay of 245 bit times between them (i.e., propagation delay equals to the amount of time
to transmit 245 bits onto the link). Minimum frame size is 64 bytes. Suppose node 𝐴𝐴 begins
transmitting a frame at 𝑡𝑡 = 0 bit time. Before 𝐴𝐴 finishes, node 𝐵𝐵 begins transmitting a
frame. Assume no other nodes are active.
Write down your answers to the following 2 questions in the unit of bit time(time taken
to transmit one bit).

Page 2 of 3
a) When is the latest time, by which 𝐵𝐵 can begin its transmission?
The latest time B can begin transmission is before the signal from A reaches B, which
is when 𝒕𝒕 = 𝟐𝟐𝟐𝟐𝟐𝟐 bit time.
b) Suppose 𝐵𝐵 begin its transmission at the time computed in a), can 𝐴𝐴 detects that 𝐵𝐵 has
transmitted before it finishes transmission?
Suppose 𝑩𝑩 begin transmission at 𝒕𝒕 = 𝟐𝟐𝟐𝟐𝟐𝟐 bit time. Signal propagates to 𝑨𝑨 at 𝒕𝒕 =
𝟐𝟐𝟐𝟐𝟐𝟐 + 𝟐𝟐𝟐𝟐𝟐𝟐 = 𝟒𝟒𝟒𝟒𝟒𝟒 bit time. 𝑨𝑨 is able to detect collision before it finishes
transmission (at 𝒕𝒕 = 𝟓𝟓𝟓𝟓𝟓𝟓 bit time).

Page 3 of 3

You might also like