Error

Lecture: Week 3 Detection

IT3L and
Recovery
 Routing Protocol

Dynamic Routing
ü Routing Information Protocol (RIP)
ü Open Shortest Path First (OSPF)

Static Routing
ü NextHop
ü ExitInterface

2
Routing Protocol

3
 Routing Information Protocol (RIP)

🖥 A distance vector routing protocol which employ the hop

count as a routing metric.
Prevents routing loops by implementing a limit on the
number of hops allowed in a path from source to
destination.

The maximum number of hops allowed is 15 which limits

the size RIP can support.

A hop count of 16 is considered infinite distance and the

router is considered unreachable.

4
 RIP Configuration
RIP Syntax
Router(Config)# router rip
Router(Config)# network <NID>

Example:

Router(Config)# router rip

Router(Config-router)# network 192.168.1.0
Router(Config-router)# network 10.0.0.0

5
• Errors, Error Detection, and Error
Correction 6
 Objective

• Identify the different types of noise commonly

found in computer networks, its prevention and
correction techniques

Data Communications and Computer Networks: A Business User's Approach, Sixth Edition 7
What is your reaction if you are talking to
someone in a noise environment?

8
 What happens if you can’t get the entire
information during the conversation?

Data Communications and Computer Networks: A Business User's Approach, Sixth Edition 9
Noise is always present

10
Not only in our environment …

11
But also in a network…

12
Noise in a network…

q refers to unwanted electrical or

electromagnetic energy that degrades the
quality of signals and data.

q Occurs in digital and analog systems.

13
Data Communications and Computer Networks: A Business User's Approach, Sixth Edition 14
What are the causes of these noise?

15
If a communications line experiences too much
noise, the signal will be lost or corrupted

16
Communication systems should check for
transmission errors

Once an error is detected, a system may

perform some action
17
Some systems perform no error control,
but simply let the data in error be discarded

18
Types of Noise

19
 White Noise
• A type of noise that is produced by combining
sounds of all different frequencies together.

20
 Impulse Noise

q One of the most disruptive forms of noise

q Random spikes of power that can destroy one

or more bits of information

qImpulse noise can damage more bits if the bits

are closer together (transmitted at a faster rate)

21
Impulse Noise (continued)

22
Impulse Noise (continued)

23
 Crosstalk

• Unwanted coupling between two different signal

paths
– For example, hearing another conversation while
talking on the telephone

• Relatively constant and can be reduced with

proper measures

24
Crosstalk (continued)

25
 Echo

• The reflective feedback of a transmitted signal

as the signal moves through a medium
• Most often occurs on coaxial cable
• If echo bad enough, it could interfere with
original signal
• Relatively constant, and can be significantly
reduced

Data Communications and Computer Networks: A Business User's Approach, Sixth Edition 26
 Echo (continued)

Data Communications and Computer Networks: A Business User's Approach, Sixth Edition 27
 Delay Distortion

This means that all signals do not arrive at the

same time, resulting in distortion of the signal.

Data Communications and Computer Networks: A Business User's Approach, Sixth Edition 28
29
 Attenuation

• The continuous loss of a signal’s strength as it

travels through a medium
• Loss of energy of the signal transmitted through
the medium

30
 Jitter
• in networking, refers to small intermittent
delays during data transfers. It can be
caused by a number of factors including
network congestion, collisions, and signal
interference.

31
 Before this Noise can cause problems in data
transmission, the system must prevent that
error…

32
 Error Prevention
• To prevent errors from happening, several
techniques may be applied:
– Proper shielding of cables to reduce interference
– Telephone line conditioning or equalization
– Replacing older media and equipment with new,
possibly digital components
– Proper use of digital repeaters and analog
amplifiers
– Observe the stated capacities of the media

33
Error Prevention (continued)

34
Once an error is detected, a system may
perform an action

Error Detection

ü Refers to a class of techniques for detecting

garbled messages

35
 Error Detection
• Despite the best prevention techniques, errors
may still happen
• To detect an error, something extra has to be
added to the data/signal
– This extra is an error detection code

• Three basic techniques for detecting errors:

parity checking, arithmetic checksum, and cyclic
redundancy checksum

36
 Parity Checks

• To detect and correct the errors, additional bits

are added to the data bits at the time of
transmission.

– The additional bits are called parity bits. It allow

detection or correction of the errors.
– The data bits along with the parity bits form a
code word.

37
 Parity Checks (continued)
• Even parity – means that the number of 1’s in
the given word including the parity bit should be
even

• Odd parity – means that the number of 1’s in

the given word including the parity bit should be
odd

Ø Application: applied in sending 8-bit octets or the smallest units

of a communication protocol. This can also
be applied separately to an entire message breaking it in to a
string of bits.
38
Parity Checks (continued)

39
 Parity Checks (continued)

1101011 1 40
Parity
Checks

How Does Error

Detection Take 41
Place?
 Arithmetic Checksum

• Used in TCP and IP on the Internet

• Characters to be transmitted are converted to
numeric form and summed
• Sum is placed in some form at the end of the
transmission

42
 Arithmetic Checksum

• Receiver performs same conversion and

summing and compares new sum with sent sum.

43
 Example
Suppose the following block of 16 bits is to send
using a checksum of 8 bits.
W - 10101001 E - 00111001
The numbers are added using one’s complement
W - 10101001
E - 00111001
Sum 11100010
Checksum 00011101 (1’s complement)

The pattern in 10101001 00111001 00011101

44
 Now if the receiver receives the pattern:
• How to detect if there is no error?
• Received: 10101001 00111001 00011101

• Add the three sections, it will get all 1’s, which after
complementing, it becomes 0’s, which indicates that
there is no error.
10101001
00111001
00011101
Sum 11111111
Complement 00000000 means the pattern is OK
45
 Cyclic Redundancy Checksum

• CRC error detection method treats the packet of

data to be transmitted as a large polynomial
• Transmitter takes the message polynomial and
using polynomial arithmetic, divides it by a given
generating polynomial
• Quotient is discarded but the remainder is
“attached” to the end of the message

46
Cyclic Redundancy Checksum (continued)

• The message (with the remainder) is transmitted

to the receiver
• The receiver divides the message and
remainder by the same generating polynomial
• If a remainder not equal to zero results, there
was an error during transmission
• If a remainder of zero results, there was no error
during transmission

47
48
Sender Receiver
49
 Example

Message = 1101101
Polynomial = 10101

Step 1: Append 0’s to the word (1 bit less than the

divisor)

Polynomial size is 5-1 = 4. Append 4 zeros to the

message

Message= 11011010000
50
 Example

Message = 11011010000
Polynomial = 10101 (check value)

Step 2: Divide the message by the polynomial

11011010000 / 10101
Note: Perform XOR operation, then follow normal
division operation
11011010000 / 10101 = 1110111 remainder =1011
CRC

51
 Example – cont.

To send to receiver: Message + CRC

11011011011
Step 3: If the remainder is not zero, append the
remainder to the word, then proceed to division.
11011011011 / 10101

Note: again perform XOR operator, then follow

normal division operation.

11011011011 / 10101 = 1110111 remainder = 00000

This means that there is no error.
52
 Example – cont.
Step 3: If the remainder is not zero, append the
remainder to the word, then proceed to division.

11011011011 / 10101

Note: again perform XOR operator, then follow

normal division operation.

11011011011 / 10101 = 1110111 remainder = 00000

This means that there is no error.

Data Communications and Computer Networks: A Business User's Approach, Sixth Edition 53
Perform Cyclic Redundancy Checksum

Message = 100100
Polynomial = 1101

Data Communications and Computer Networks: A Business User's Approach, Sixth Edition 54
Sender Receiver
55
 Laboratory Activity

Data Communications and Computer Networks: A Business User's Approach, Sixth Edition 56
 Routing Protocol

Dynamic Routing
ü Routing Information Protocol (RIP)
ü Open Shortest Path First (OSPF)

Static Routing
ü NextHop
ü ExitInterface

57
 Open Shortest Path First (OSPF)

🚖 OSPF is designated by the Internet

Engineering Task Force (IETF) as one of
several Interior Gateway Protocols (IGPs) --
that is, protocols aimed at traffic moving
around within a larger autonomous
system network like a single enterprise's
network
🚖 uses a link state routing algorithm operating
within a single autonomous system.

58
 OSPF Configuration

Router(config)# router ospf <process ID>

Router(config-router)# network <NID>
<Wildcard> area <process ID>

59
60