Professional Documents
Culture Documents
1) Single-Bit Error
Only 1 bit of a given data is changed →
from 1 to 0 or
→ from 0 to 1 (Figure 10.1a).
2) Burst Error
Two or more bits in the data have changed →
from 1 to 0 or
→ from 0 to 1 (Figure 10.1b).
A burst-error occurs more than a single-bit error.
This is because:
Normally, the duration of noise is longer than the duration of 1-bit. When
noise affects data, the noise also affects the bits.
The no. of corrupted-bits depends on → data-
rate and → duration of noise.
3.1.2 Redundancy
• The central concept in detecting/correcting errors is redundancy.
• Some extra-bits along with the data have to be sent to detect/correct errors. These extra bits are called
redundant-bits.
• The redundant-bits are
→ added by the sender and
→ removed by the receiver.
• The presence of redundant-bits allows the receiver to detect/correct errors.
3.1.3 Error Detection vs. Error Correction
• Error-correction is more difficult than error-detection.
1) Error Detection
Here, we are checking whether any error has occurred or not. The answer is a simple
YES or NO.
We are not interested in the number of corrupted-bits.
2) Error Correction
Here, we need to know
3-3
DATA COMMUNICATION
3-4
DATA COMMUNICATION
ii) However, if the code-word is corrupted but the received code-word still matches a
valid codeword, the error remains undetected.
• An error-detecting code can detect only the types of errors for which it is designed; other types of errors may
remain undetected.
Example 3.1
3-5
DATA COMMUNICATION
¤ Let us assume that the sent code-word x is at the center of a circle with radius s. ¤ All received
code-words that are created by 0 to s errors are points inside the circle or on the perimeter of the
circle.
¤ All other valid code-words must be outside the circle
• For example: A code scheme has a Hamming distance dmin = 4.
This code guarantees the detection of upto 3 errors (d = s + 1 or s = 3).
3.2.1.2 Linear Block Codes
• Almost all block codes belong to a subset of block codes called linear block codes.
• A linear block code is a code in which the XOR of 2 valid code-words creates another valid code-word.
(XOR Addition modulo-2)
• The code in Table 10.1 is a linear block code because the result of XORing any code-word with any other
code-word is a valid code-word.
For example, the XORing of the 2nd and 3rd code-words creates the 4th one.
3.2.1.2.1 Minimum Distance for Linear Block Codes
• Minimum Hamming distance is no. of 1s in the nonzero valid code-word with the smallest no. of 1s.
• In Table 10.1,
The numbers of 1s in the nonzero code-words are 2, 2, and 2. So the
minimum Hamming distance is dmin = 2.
3-6
DATA COMMUNICATION
3-7
DATA COMMUNICATION
The checker performs the same operation as the generator with one exception: The addition is done
over all 5 bits. The result is called the syndrome bit
(so).
Syndrome bit = 0 when the no. of 1s in the received code-word is even; otherwise, it is 1. The
syndrome is passed to the decision logic analyzer.
1) If s0=0, there is no error in the received code-word. The data portion of the received
code-word is accepted as the data-word.
2) If s0=1, there is error in the received code-word. The data portion of the received code-
word is discarded. The data-word is not created.
Example 3.2
3-8
DATA COMMUNICATION
3-9
DATA COMMUNICATION
3-10
DATA COMMUNICATION
Example 3.3
3.3.2 Polynomials
• A pattern of 0s and 1s can be represented as a polynomial with coefficients of 0 and 1 (Figure 10.8).
• The power of each term shows the position of the bit; the coefficient shows the value of the bit.
3-11
DATA COMMUNICATION
3-12
DATA COMMUNICATION
Standard Polynomials
3-13
DATA COMMUNICATION
3-14
DATA COMMUNICATION
3-15
DATA COMMUNICATION
3.4.1.3 Algorithm
3-16
DATA COMMUNICATION
3-17
DATA COMMUNICATION
• We divide a packet into N chunks, create the exclusive OR of all the chunks and send N + 1 chunks.
• If any chunk is lost or corrupted, it can be created at the receiver site.
• If N = 4, it means that we need to send 25 percent extra data and be able to correct the data if only one out of
four chunks is lost.
3.5.3 Chunk Interleaving
• Another way to achieve FEC in multimedia is to allow some small chunks to be missing at thereceiver.
• We cannot afford to let all the chunks belonging to the same packet be missing. However, we can
afford to let one chunk be missing in each packet.
• In Figure 10.21, each packet is divided into 5 chunks (normally the number is much larger).
• Then, we can create data chunk-by-chunk (horizontally), but combine the chunks into packets vertically.
• In this case, each packet sent carries a chunk from several original packets.
• If the packet is lost, we miss only one chunk in each packet.
• Normally, missing of a chunk is acceptable in multimedia communication.
3.5.4 Combining Hamming Distance and Interleaving •
Hamming distance and interleaving can be combined.
• Firstly, we can create n-bit packets that can correct t-bit errors.
• Then, we interleave m rows and send the bits column-by-column.
• In this way, we can automatically correct burst-errors up to m×t bit errors.
3-18
DATA COMMUNICATION
3-19
DATA COMMUNICATION
When a message is divided into smaller frames, a single-bit error affects only that small frame.
(Our postal system practices a type of framing. The simple act of inserting a letter into an envelope separates
one piece of information from another; the envelope serves as the delimiter. In addition, each envelope defines
the sender and receiver addresses since the postal system is a many-to-many carrier facility).
3.6.1.1 Frame Size • Two types
of frames: 1) Fixed Size
Framing
There is no need for defining boundaries of frames; the size itself can be used as a delimiter. For
example: ATM WAN uses frames of fixed size called cells.
2) Variable Size Framing
We need to define the end of the frame and the beginning of the next frame. Two
approaches are used: 1) Character-oriented approach 2) Bit-oriented approach.
3.6.1.2 Character Oriented Framing
• Data to be carried are 8-bit characters from a coding system such as ASCII (Figure 11.1).
• The header and the trailer are also multiples of 8 bits.
1) Header carries the source and destination-addresses and other control information. 2) Trailer
carries error-detection or error-correction redundant bits.
• To separate one frame from the next frame, an 8- bit (I-byte) flag is added at the beginning and the end of a
frame.
• The flag is composed of protocol-dependent special characters.
• The flag signals the start or end of a frame.
• Problem:
Character-oriented framing is suitable when only text is exchanged by the data-link-layers.
However, if we send other type of information (say audio/video), then any pattern used for the flag
can also be part of the information.
If the flag-pattern appears in the data-section, the receiver might think that it has reached the end of
the frame.
Solution: A byte-stuffing is used.
(Byte stuffing character stuffing)
• In byte stuffing, a special byte is added to the data-section of the frame when there is a character with the
same pattern as the flag.
• The data-section is stuffed with an extra byte. This byte is called the escape character (ESC), which has a
predefined bit pattern.
• When a receiver encounters the ESC character, the receiver → removes ESC character from the data-section
and → treats the next character as data, not a delimiting flag.
• Problem:
What happens if the text contains one or more escape characters followed by a flag?
3-20
DATA COMMUNICATION
The receiver removes the escape character, but keeps the flag, which is incorrectly interpreted
as the end of the frame. Solution:
Escape characters part of the text must also be marked by another escape character (Fig 11.2).
• In short, byte stuffing is the process of adding one extra byte whenever there is a flag or escape character in
the text.
3.6.1.3 Bit Oriented Framing
• The data-section of a frame is a sequence of bits to be interpreted by the upper layer as text, audio, video,
and so on.
• However, in addition to headers and trailers, we need a delimiter to separate one frame from theother.
• Most protocols use a special 8-bit pattern flag 01111110 as the delimiter to define the beginning and the end
of the frame (Figure 11.3).
• Problem:
If the flag-pattern appears in the data-section, the receiver might think that it has reached the end of
the frame.
Solution: A bit-stuffing is used.
• In bit stuffing, if a 0 and five consecutive 1 bits are encountered, an extra 0 is added. This extra stuffed bit
is eventually removed from the data by the receiver. (Figure 11.4).
• This guarantees that the flag field sequence does not inadvertently appear in the frame.
3-21
DATA COMMUNICATION
• In short, bit stuffing is the process of adding one extra 0 whenever five consecutive 1s follow a 0 in the data,
so that the receiver does not mistake the pattern 0111110 for a flag.
3.6.2 Flow Control and Error Control
• One of the responsibilities of the DLC sublayer is flow and error control at the data-link layer.
• At the sending node, the data-link layer tries to push frames toward the data-link layer at the receiving node
(Figure 11.5).
• If the receiving node cannot process and deliver the packet to its network at the same rate that theframes
arrive, it becomes overwhelmed with frames.
• Here, flow control can be feedback from the receiving node to the sending node to stop or slow down pushing
frames.
3.6.2.1.1 Buffers
• Flow control can be implemented by using buffer.
• A buffer is a set of memory locations that can hold packets at the sender and receiver.
• Normally, two buffers can be used. 1) First buffer at the sender.
2) Second buffer at the receiver.
• The flow control communication can occur by sending signals from the consumer to the producer.
• When the buffer of the receiver is full, it informs the sender to stop pushing frames.
3-22
DATA COMMUNICATION
3-23
DATA COMMUNICATION
3.7.1.1 Design
• Here is how it works (Figure 11.7):
1) At Sender
¤ The data-link-layer
→ gets data from its network-layer →
makes a frame out of the data and →
sends the frame.
3-24
DATA COMMUNICATION
2) At Receiver
¤ The data-link-layer
→ receives a frame from its physical layer →
extracts data from the frame and
→ delivers the data to its network-layer.
Data-link-layers of sender & receiver provide transmission services for their network-layers.
Data-link-layers use the services provided by their physical layers for the physical transmission
of bits.
3.7.1.2 FSMs
• Two main requirements:
1) The sender-site cannot send a frame until its network-layer has a data packet to send.
2) The receiver-site cannot deliver a data packet to its network-layer until a frame arrives.
• These 2 requirements are shown using two FSMs.
• Each FSM has only one state, the ready state.
3-25
DATA COMMUNICATION
Example 3.6
3-26
DATA COMMUNICATION
3.7.2.2 FSMs
3-27
DATA COMMUNICATION
Example 3.7
3-28
DATA COMMUNICATION
The acknowledgment-numbers always announce the sequence-number of the next frame expected
by the receiver.
For example,
If frame-0 has arrived safely, the receiver sends an ACK-frame with acknowledgment-1
(meaning frame-1 is expected next).
Example 3.8
3.7.3 Piggybacking
• A technique called piggybacking is used to improve the efficiency of the bidirectional protocols.
• The data in one direction is piggybacked with the acknowledgment in the other direction.
• In other words, when node A is sending data to node B, Node A also acknowledges the data received from
node B.
3.8 High-Level Data Link Control (HDLC)
• HDLC is a bit-oriented protocol for communication over point-to-point and multipoint links.
• HDLC implements the ARQ mechanisms.
3.8.1 Configurations and Transfer Modes
• HDLC provides 2 common transfer modes that can be used in different configurations: 1) Normal response
mode (NRM)
2) Asynchronous balanced mode (ABM). NRM
• The station configuration is unbalanced (Figure 11.14).
• We have one primary station and multiple secondary stations.
• A primary station can send commands, a secondary station can only respond.
• The NRM is used for both point-to-point and multiple-point links.
3-29
DATA COMMUNICATION
ABM
• The configuration is balanced (Figure 11.15).
• Link is point-to-point, and each station can function as a primary and a secondary (acting as peers).
• This is the common mode today.
3.8.2 Framing
• To provide the flexibility necessary to support all the options possible in the modes andconfigurations,
HDLC defines three types of frames:
1) Information frames (I-frames): are used to transport user data and control information relating to user
data (piggybacking).
2) Supervisory frames (S-frames): are used only to transport control information.
3) Unnumbered frames (U-frames): are reserved for system management.
Information carried by U-frames is intended for managing the link itself.
• Each type of frame serves as an envelope for the transmission of a different type of message.
3.8.2.1 Frame Format
3-30
DATA COMMUNICATION
This field can be 1 byte or several bytes long, depending on the needs of the network.
3) Control Field
This field is one or two bytes used for flow and error control.
4) Information Field
This field contains the user's data from the network-layer or management information. Its
length can vary from one network to another.
5) FCS Field
This field is the error-detection field. (FCS Frame Check Sequence) This
field can contain either a 2- or 4-byte standard CRC.
3.8.2.1.1 Control Fields of HDLC Frames
• The control field determines the type of frame and defines its functionality (Figure 11.17).
3-31
DATA COMMUNICATION
3-32
DATA COMMUNICATION
3-33
DATA COMMUNICATION
This field is byte-stuffed if the flag-byte pattern appears in this field. Padding is needed if the
payload-size is less than the maximum size. 6) FCS
This field is the PPP error-detection field.
This field can contain either a 2- or 4-byte standard CRC.
3.9.1.1 Byte Stuffing
• Since PPP is a byte-oriented protocol, the flag in PPP is a byte that needs to be escaped whenever it appears
in the data section of the frame.
• The escape byte is 01111101, which means that every time the flag like pattern appears in the data, this extra
byte is stuffed to tell the receiver that the next byte is not a flag.
• Obviously, the escape byte itself should be stuffed with another escape byte.
3.9.2 Transition Phases
• The transition diagram starts with the dead state (Figure 11.21). 1) Dead
State
In dead state, there is no active carrier and the line is quiet.
2) Establish State
When 1 of the 2 nodes starts communication, the connection goes into the establish state. In
establish state, options are negotiated between the two parties.
3) Authenticate State
If the 2 parties agree that they need authentication,
Then the system needs to do authentication;
Otherwise, the parties can simply start communication.
4) Open State
Data transfer takes place in the open state.
5) Terminate State
When 1 of the endpoints wants to terminate connection, the system goes to terminate state.
3-34
DATA COMMUNICATION
MODULE-WISE QUESTIONS
3-35