5.access Method and Data Link Control
5.access Method and Data Link Control
5.access Method and Data Link Control
Computer Networks
Chapter 5
Access Method and Data Link
Control
1
Outline:
Error Detection and Correction
Ethernet
Token ring
2
Token Ring
Token Ring network IBM’s implementation of the
token ring network architecture, which uses a
token-passing protocol transmitting at 4 or 16Mbps.
On a token-ring network, the controlling network
interface card generates a token that controls the
right to transmit.
This token is continuously passed from one node to
the next around the network.
When a node has information to transmit, it
captures the token, sets its status to busy, and adds
the message and the destination address.
3
Error Detection and Correction
Error detection and correction. A
mechanism used to determine whether
transmission errors have occurred and, if so, to
correct those errors.
Some programs or transmission protocols simply
request a retransmission of the affected block of
data if an error is detected.
More complex protocols attempt to both detect
and determine at the receiving end what the
correct transmission should have been.
4
Cyclic Redundancy Check
One of the most common, and one of the most
powerful, error-detecting codes is the cyclic
redundancy check (CRC),
For a block of k bits transmitter generates n bit
sequence
Transmit k+n bits which is exactly divisible by
some number
Receiver divides frame by that number
If no remainder, assume no error
For math, see Stallings chapter 7
5
Error Control
Error control refers to mechanisms to detect and correct
errors that occur in the transmission of frames.
Lost frames: A frame fails to arrive at the other side.
For example, a noise burst may damage a frame to the extent
that the receiver is not aware that a frame has been
transmitted.
Damaged frames: A recognizable frame does arrive, but
some of the bits are in error (have been altered during
transmission).
The most common techniques for error control are
based on some or all of the following ingredients:
Error detection
Positive acknowledgment
Retransmission after timeout
Negative acknowledgement and retransmission 6
Collectively, these mechanisms are all referred
to as automatic repeat request (ARQ);
Three versions of ARQ have been standardized:
Stop and wait
Go back N
Selective reject (selective retransmission)
7
Stop and Wait
Source transmits single frame
Wait for ACK
If received frame damaged, discard it
Transmitter has timeout
If no ACK within timeout, retransmit
If ACK damaged, transmitter will not recognize it
Transmitter will retransmit
Receive gets two copies of frame
Use ACK0 and ACK1
8
9
Stop and Wait – Pros and Cons
Simple
Inefficient
10
Go Back N (1)
The form of error control based on sliding-
window flow control that is most commonly
used is called go-back-N ARQ.
If no error, ACK as usual with next frame
expected
Use window to control number of outstanding
frames
If error, reply with rejection
Discard that frame and all future frames until error
frame received correctly
Transmitter must go back and retransmit that
frame and all subsequent frames 11
Go Back N - Damaged Frame
Receiver detects error in frame i
Receiver sends rejection-i
Transmitter gets rejection-i
Transmitter retransmits frame i and all
subsequent
12
Go Back N - Lost Frame (1)
Frame i lost
Transmitter sends i+1
Receiver gets frame i+1 out of sequence
Receiver send reject i
Transmitter goes back to frame i and retransmits
13
Go Back N - Lost Frame (2)
Frame i lost and no additional frame sent
Receiver gets nothing and returns neither
acknowledgement nor rejection
Transmitter times out and sends
acknowledgement frame with P bit set to 1
Receiver interprets this as command which it
acknowledges with the number of the next
frame it expects (frame i )
Transmitter then retransmits frame i
14
Go Back N - Damaged
Acknowledgement
Receiver gets frame i and send
acknowledgement (i+1) which is lost
Acknowledgements are cumulative, so next
acknowledgement (i+n) may arrive before
transmitter times out on frame i
If transmitter times out, it sends
acknowledgement with P bit set as before
This can be repeated a number of times before
a reset procedure is initiated
15
Go Back N - Damaged Rejection
As for lost frame (2)
16
17
Selective Reject
Also called selective retransmission
Only rejected frames are retransmitted
Subsequent frames are accepted by the receiver
and buffered
Minimizes retransmission
Receiver must maintain large enough buffer
More complex login in transmitter
18
19
High Level Data Link Control
The most important data link control protocol is
HDLC (IS0 33009, IS0 4335).
20
21
Flag Fields
Delimit frame at both ends
01111110
May close one frame and open another
Receiver hunts for flag sequence to synchronize
22
23
Control Field
Different for different frame type
Information - data to be transmitted to user (next
layer up)
Flow and error control piggybacked on information frames
Supervisory - ARQ when piggyback not used
Unnumbered - supplementary link control
First one or two bits of control filed identify
frame type
24
25
Poll/Final Bit
Use depends on context
Command frame
P bit
1 to solicit (poll) response from peer
Response frame
F bit
1 indicates response to soliciting command
26
Information Field
Only in information and some unnumbered
frames
Must contain integral number of octets
Variable length
27
Frame Check Sequence Field
FCS
Error detection
16 bit CRC
Optional 32 bit CRC
28
HDLC Operation
Exchange of information, supervisory and
unnumbered frames
Three phases
Initialization
Data transfer
Disconnect
29