Scribd
Upload
58 views5 pages

Data Transmission Chapter 2

Uploaded by

o0mgiamp0o
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
58 views5 pages

Data Transmission Chapter 2

Uploaded by

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

Data Transmission Chapter 2

Activity 2.1

1. Potential Problems in Video and Sound Quality and Causes

i. Potential problems:

 Lag or delay in audio and video.


 Distorted or pixelated video.
 Audio cutting out or becoming garbled.
 Loss of synchronization between audio and video.

ii. Causes:

 Network congestion leading to delays in packet delivery.


 Packets arriving out of order, causing synchronization issues.
 Packet loss resulting in missing audio or video segments.
 Insufficient bandwidth to handle the data volume.

2. Packet Switching for Downloading a Large Web Page

 The web page is broken into small packets, each containing a portion of the data.
 Each packet is assigned a sequence number and routed independently through the network.
 Packets may take different routes based on network conditions.
 Once all packets reach the destination, they are reassembled in the correct order using sequence
numbers.
 Any missing packets are requested again from the source.

3. Error Checking and Cyclic Redundancy Check (CRC)

a. Cyclic Redundancy Check (CRC):

 CRC is a form of error-checking that involves adding a checksum value (calculated using polynomial
division) to the trailer of the packet.
 The receiving device re-computes the checksum using the same polynomial and compares it with the
received checksum.
 If the two values match, the data is error-free; otherwise, errors are detected.

b. Verifying Payload:
Payload data: 11110000 10000011 00110011 00111111 11111110 11100011

 Apply the CRC polynomial to the data at both sending and receiving ends.
 Ensure the computed CRC value at the receiver matches the transmitted CRC in the trailer.

4. Packet Loss and Mitigation

a. How packets are lost:

 Packets may be dropped due to network congestion.


 Faulty hardware or transmission errors may cause packet loss.
 Packets can be discarded if they exceed a time-to-live (TTL) value.

b. Dealing with lost packets:


 Use acknowledgments (ACK) to confirm receipt of packets. If no ACK is received, resend the packet.
 Use forward error correction (FEC) to reconstruct lost data.
 Implement timeout mechanisms to detect and recover missing packets.

c. How packet switching improves security:

 Packets take independent routes, making it harder for attackers to intercept the full data stream.
 Data is fragmented into small packets, reducing the risk of full data exposure if intercepted.
 Encryption can be applied to packets individually, adding another layer of security.

Activity 2.2

1. Definitions

i. Serial, half-duplex data transmission:

 Data is sent one bit at a time over a single channel.


 Communication occurs in both directions, but only one direction at a time (not simultaneously).

ii. Parallel, full-duplex data transmission:

 Multiple bits are sent simultaneously using multiple channels.


 Communication occurs in both directions at the same time.

iii. Serial, simplex data transmission:

 Data is sent one bit at a time over a single channel.


 Communication occurs in only one direction.

2. Types of Data Transmission

i. Data is sent one bit at a time in one direction only:

 Serial, simplex.

ii. Data is being sent 8 bits at a time in one direction only:

 Parallel, simplex.

iii. Data is being sent 16 bits at a time in both directions simultaneously:

 Parallel, full-duplex.

iv. Data is sent one bit at a time in both directions simultaneously:

 Serial, full-duplex.

v. Data is sent 16 bits at a time in one direction only:

 Parallel, simplex.
Activity 2.3

Statement True False


Packets have a header which contains the IP address of the sender and receiver ✓
Packets don’t require any form of error checking ✓
USBs use a protocol that allows for error-free data transmission between device
✓
and computer
Serial data transmission suffers from data skewing ✓
The longest cable length supported by USB is 5 metres or less ✓
Simplex data transmission occurs when data is transmitted one bit at a time ✓
Full-duplex data transmission involves sending 8 bits of data at a time ✓
USB uses serial data transfer ✓
Packet switching prevents loss of any data packets ✓
USB connections can transfer data using half-duplex or full-duplex ✓

Activity 2.4

1. 1 1 0 1 1 0 1 (even parity): Count of 1s = 5 (odd), parity bit = 1.


2. 0 0 0 1 1 1 1 (even parity): Count of 1s = 4 (even), parity bit = 0.
3. 0 1 1 1 0 0 0 (even parity): Count of 1s = 3 (odd), parity bit = 1.
4. 1 1 1 0 1 0 0 (odd parity): Count of 1s = 4 (even), parity bit = 1.
5. 1 0 1 1 0 1 1 (odd parity): Count of 1s = 5 (odd), parity bit = 0.
6. 1 1 1 1 1 1 0 (even parity): Count of 1s = 6 (even), parity bit = 0.
7. 1 1 1 1 1 1 0 (odd parity): Count of 1s = 6 (even), parity bit = 1.
8. 1 1 0 1 0 0 0 (odd parity): Count of 1s = 3 (odd), parity bit = 0.
9. 0 0 0 0 1 1 1 (even parity): Count of 1s = 3 (odd), parity bit = 1.
10. 1 1 1 1 1 1 1 (odd parity): Count of 1s = 7 (odd), parity bit = 0.

Activity 2.5
1. Checking Received Bytes for Errors:

Byte Parity Type Count of 1s Parity Check Error?


11101101 Even 6 Valid No
01001111 Even 5 Invalid Yes
00111000 Even 3 Invalid Yes
11110100 Odd 4 Invalid Yes
11011011 Odd 6 Invalid Yes
11111111 Odd 8 Invalid Yes
00000000 Even 0 Valid No
11100000 Odd 3 Valid No
01010101 Even 4 Valid No
11100011 Odd 5 Valid No

2. Identifying Changed Bits:

For bytes with errors:

 0 1 0 0 1 1 1 1 (Even parity):
An additional 1 bit was introduced; likely, the 4th bit was flipped.
 0 0 1 1 1 0 0 0 (Even parity):
A 1 bit was added or flipped; likely the 6th bit was changed.
 1 1 1 1 0 1 0 0 (Odd parity):
A 1 bit was removed or changed; likely the 7th bit.
 1 1 0 1 1 0 1 1 (Odd parity):
A 1 bit was added; likely the 3rd bit was changed.
 1 1 1 1 1 1 1 1 (Odd parity):
All bits are 1, suggesting a single bit was altered; likely the 8th bit.

Activity 2.6

Activity 2.7

Activity 2.8

Activity 2.9
Exam Style Question

You might also like