Scribd
Upload
1K views

Data Link Layer Design Issue

The document discusses various design issues and services provided by the data link layer, including framing, error control, and flow control. It describes different framing methods, types of services, and how error control and flow control are implemented.

Uploaded by

Rekha V R
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
1K views

Data Link Layer Design Issue

The document discusses various design issues and services provided by the data link layer, including framing, error control, and flow control. It describes different framing methods, types of services, and how error control and flow control are implemented.

Uploaded by

Rekha V R
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 28

The Data Link Layer

Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011
Data Link Layer Design Issues

• Services provided to the Network layer


• Framing
• Error control
• Flow control
Data Link Layer Design Issues
• Physical layer delivers bits of information to and from data link
layer. The functions of Data Link Layer are:
1. Providing a well-defined service interface to the network layer.
2. Dealing with transmission errors.
3. Regulating the flow of data so that slow receivers are not swamped
by fast senders.

• To accomplish these task, data link layer


– Takes the packets from Physical layer, and
– Encapsulates them into frames for transmission.
• Each frame has a
– frame header – a field for holding the packet, and
– frame trailer.
• Frame Management is what Data Link Layer does.
Packets and Frames

Relationship between packets and frames.

Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011
Services Provided to the Network Layer
• Principal Service Function of the data link layer is to transfer the
data from the network layer on the source machine to the network
layer on the destination machine.

– Job of data link layer is to transmit the bits to the destination


machine so they can be handed over to the network layer there.
Network Layer Services

(a) Virtual communication. (b) Actual communication.

Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011
Possible Services Offered

1. Unacknowledged connectionless service.


2. Acknowledged connectionless service.
3. Acknowledged connection-oriented service.

Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011
Unacknowledged Connectionless
Service
• It consists of having the source machine send independent
frames to the destination machine without having the destination
machine acknowledge them. No logical connections.

• If a frame is lost due to noise on the line, no attempt is made to


detect the loss or recover from it in the data link layer.

• This service is appropriate when the error rate is very low.

• Appropriate for real-time traffic, such as voice in which late data


are worse than bad data.

• Most LAN uses this service


Acknowledged Connectionless Service
• Here also no logical connection.

• Each frame send by the Data Link layer is acknowledged and the
sender knows if a specific frame has been received or lost.

• If the ack has not arrived within a specific time interval, it can be
sent again.

• This service is useful over unreliable channels such as wireless


systems

• Network layer does not know frame size of the packets and other
restriction of the data link layer. Hence it becomes necessary for
data link layer to have some mechanism to optimize the
transmission.
Acknowledged Connection Oriented
Service
• Source and Destination establish a connection first.

• Each frame sent is numbered


– Data link layer guarantees that each frame sent is indeed received.
– It guarantees that each frame is received only once and that all frames
are received in the correct order.

• Examples:
– Satellite channel communication,
– Long-distance telephone communication, etc.
Acknowledged Connection Oriented
Service
• Three distinct phases:

1. Connection is established by having both side initialize


variables and counters needed to keep track of which frames
have been received and which ones have not.

2. One or more frames are transmitted.

3. Finally, the connection is released – freeing up the variables,


buffers, and other resources used to maintain the
connection.
Framing

• To provide service to the network layer the data link layer must
use the service provided to it by physical layer.

• Stream of data bits provided to data link layer is not guaranteed


to be without errors.

• Errors could be:


– Number of received bits does not match number of transmitted
bits (deletion or insertion)
– Bit Value
• It is up to data link layer to correct the errors if necessary.
Framing
• Transmission of the data link layer starts with breaking up the bit
stream
– into discrete frames
– Computation of a checksum for each frame, and
– Include the checksum into the frame before it is transmitted.

• When the frame is received at the destination, the checksum is


recomputed. If it is different from the old value, data link layer
knows that error has occurred and takes steps to deal with it.

i.e discard the bad frame and sending back the error report.
Framing Methods

1. Character count.
2. Flag bytes with byte stuffing.
3. Flag bits with bit stuffing.
4. Physical layer coding violations.

Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011
Character Count Framing Method
• It uses a field in the header to specify the number of
characters in the frame.

• When the data link layer at the destination sees the


character count, it knows how many characters follow and
hence where the end of the frame is..

• Trouble with this algorithm is that when the count is


incorrectly received the destination will get out of synch with
transmission.
– Destination may be able to detect that the frame is in error but
it does not have a means (in this algorithm) how to correct it.
Framing (1)

A byte stream. (a) Without errors. (b) With one error.

Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011
Flag Bytes with Byte Stuffing
• This methods gets around the boundary detection of the frame by
having each appended by the frame start and frame end special
bytes.

• These starting and ending bytes are called flag byte.

• The problem with this method is that when binary data such as
object program or floating point numbers are being transmitted,
there is the chance that the transmitted data may contain the flag
bit pattern.

• Here to solve this a special escape byte (ESC)is added just before
each FLAG in the data.

• This technique is called byte stuffing or character stuffing.


Framing

a) A frame delimited by flag bytes.


b) Four examples of byte sequences before and after byte stuffing.

Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011
Flag Bits with Bit Stuffing Framing
Method
• The drawback of byte stuffing method is that it is closely tied to
the use of 8-bit characters.

• Bit stuffing methods achieves the same thing as Byte Stuffing


method by using Bits (1) instead of Bytes (8 Bits).

• Each frames begins and ends with a special bit patter:


– 01111110
– Whenever the sender’s data link layer encounters five
consecutive 1s in the data it automatically stuffs a 0 bit into
the outgoing bit stream.
Bit Stuffing

Bit stuffing. (a) The original data. (b) The data as they appear on
the line. (c) The data as they are stored in the receiver’s memory after
destuffing.

Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011
Bit Stuffing

• With bit stuffing, the boundary between the two frames


can be recognized by the flag pattern 01111110 which will
never occur in the actual message.
Error Control
• So we have solved the problem of marking the start and end of
each frame.

• Now the next problem is to ensure the correct delivery of these


frame to the network layer.

• Unacknowledged connectionless service: it is OK for the sender to


output frames regardless of its reception.

• Reliable connection-oriented service: it is NOT OK.


Error Control
• Reliable connection-oriented service usually will provide a
sender with some feedback about what is happening at the
other end of the line.
– Receiver Sends Back Special Control Frames.
– If the Sender Receives positive Acknowledgment it will know
that the frame has arrived safely.
– If ack is negative, it means something went wrong and the
frame is to be retransmitted.

• Sometimes, due to hardware problem, a frame may be


vanished completely. In this case, the receiver wont send
any ack.
Error Control
• Timer and Frame Sequence Number for the Sender is
Necessary to handle the case when there is no response
(positive or negative) from the Receiver .

• The sender will wait for ack until the timer expires.

• Send will retransmit the frame if the timer expires.

• This may lead to sending of frames multiple times.

• To prevent this from happening, a sequence number is


assigned to each sending frames. So the receiver can
discard the duplicate frames.
Flow Control
• Important Design issue for the cases when the sender is running on
a fast powerful computer and receiver is running on a slow low-end
machine.

• Two approaches:
1. Feedback-based flow control
2. Rate-based flow control
Feedback-based Flow Control
• Receiver sends back information to the sender giving it
permission to send more data, or

• Telling sender how receiver is doing.


Rate-based Flow Control

• Built in mechanism that limits the rate at which


sender may transmit data, without the need for
feedback from the receiver.
End

Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011

You might also like