Presentation is loading. Please wait.

Presentation is loading. Please wait.

Chapter 11. Data Link Control

Similar presentations

Presentation on theme: "Chapter 11. Data Link Control"— Presentation transcript:

1 Chapter 11. Data Link Control
Stephen Kim

2 FRAMING The data link layer needs to pack bits into frames, so that each frame is distinguishable from another. 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.

3 Framing To define boundaries of messages for distinguishing from other messages and signal. Classification Fixed-size framing: e.g.) ATM Variable-size framing: e.g.) Ethernet Character-oriented protocols Bit-oriented protocols

4 Character-Oriented Protocols
To use special characters to indicate the beginning and the end of a frame Good for exchanging text messages, but what if other type of information (graph, audio, video) that can carry any character pattern even same as the special character. Byte-stuffing : Byte stuffing is the process of adding 1 extra byte whenever there is a flag or escape character in the text.

5 Bit-Oriented Protocols
Consider a frame as a sequence of bits. Add special bit-pattern (e.g ) at the beginning and the end of a frame. The data may contain THE special bit-pattern from the upper layer. Bit stuffing is the process of adding one extra 0 whenever five(5) consecutive 1’s follow a 0 in the data, so that the receiver does not mistake the pattern for a flag.

6 Other Framing - Character Count
Method The header specifies the number of characters in the frame D knows how many characters follow the header, or where the end of frame is. What if a header is garbled? D can not tell where the following frames are. Retransmission does not work either. No one uses this method for the network communication that is supposed to be unreliable. 5 1 2 3 4 6 7 8 9 FR 1 FR 2 FR 3 FR 4

7 Other Framing - Physical Encoding Violation
Applicable if the line encoding of physical medium contains some redundancy. Send an invalid line encoding as a frame boundary. Example In Manchester encoding, valid line codes are 10 or 01. Send as a frame boundary.

8 FLOW AND ERROR CONTROL The most important responsibilities of the data link layer are flow control and error control. Collectively, these functions are known as data link control.

9 Data Link Control Flow Control Error control
Flow control refers to a set of procedures used to restrict the amount of data that the sender can send before waiting for acknowledgment. Error control Error control in the data link layer is based on automatic repeat request, which is the retransmission of data.

10 PROTOCOLS Now let us see how the data link layer can combine framing, flow control, and error control to achieve the delivery of data from one node to another. The protocols are normally implemented in software by using one of the common programming languages. To make our discussions language-free, we have written in pseudocode a version of each protocol that concentrates mostly on the procedure instead of delving into the details of language rules.

11 Figure 11.5 Taxonomy of protocols discussed in this chapter

12 NOISELESS CHANNELS Let us first assume we have an ideal channel in which no frames are lost, duplicated, or corrupted. We introduce two protocols for this type of channel.

13 Simplest Protocol No flow and error control.

14 Algorithm 11.1 Sender-site algorithm for the simplest protocol
Algorithm Receiver-site algorithm for the simplest protocol

15 Example 11.1 Figure 11.7 shows an example of communication using this protocol. It is very simple. The sender sends a sequence of frames without even thinking about the receiver. To send three frames, three events occur at the sender site and three events at the receiver site. Note that the data frames are shown by tilted boxes; the height of the box defines the transmission time difference between the first bit and the last bit in the frame.

16 Figure 11.7 Flow diagram for Example 11.1

17 Stop-and-Wait Protocol, 1

18 Stop-and-Wait Protocol, 2
In normal operation S transmits a frame and wait for an ACK from D during a give time. D transmits an ACK after receiving an error-free frame. In case of a frame dropped S retransmits the frame after the time-out period expires. time-out period time S D FR-0 ACK FR-1 FR-1 ACK

19 Stop-and-Wait Protocol, 3
In case of frame garbled D does nothing, and then S will retransmit. In case of ACK dropped S retransmits the frame D receives the frame and transmits another ACK. D will receive duplicated frames! Add a sequence number to the frame So, D will discard the second copy of the frame, but resend ACK. time S D FR-0 FR-1 ACK time-out period FR-1’

20 Algorithm 11.3 Sender-site algorithm for Stop-and-Wait Protocol
Algorithm Receiver-site algorithm for Stop-and-Wait Protocol

21 Example 11.2 Figure 11.9 shows an example of communication using this protocol. It is still very simple. The sender sends one frame and waits for feedback from the receiver. When the ACK arrives, the sender sends the next frame. Note that sending two frames in the protocol involves the sender in four events and the receiver in two events.

22 Figure 11.9 Flow diagram for Example 11.2

23 NOISY CHANNELS Although the Stop-and-Wait Protocol gives us an idea of how to add flow control to its predecessor, noiseless channels are nonexistent. We discuss three protocols in this section that use error control.

24 Note Error correction in Stop-and-Wait ARQ is done by keeping a copy of the sent frame and retransmitting of the frame when the timer expires. In Stop-and-Wait ARQ, we use sequence numbers to number the frames. The sequence numbers are based on modulo-2 arithmetic. In Stop-and-Wait ARQ, the acknowledgment number always announces in modulo-2 arithmetic the sequence number of the next frame expected.

25 Stop-and-Wait Protocol, 1
In case of delayed ACK or prematured time-out. S will retransmit the frame, say FR-0, after the time-out. S receives an ACK, but what it is for? either for the first frame or for the retransmitted frame? S sends the next frame, say FR-1 and receive an ACK. What is it for? FR-0 or FR-1? time S D FR-0 FR-1 ACK delayed time-out period FR-2 Add a sequence number to the ACK frame !!!

26 Size of Sequence Number
The number of frames to be sent is arbitrary, but the space for the sequence is finite (in header) 1-bit sequence number is good enough for Stop-and-Wait. Slast := # of frame in buffer of S (or to being sent). Dnext := # of frame that D expects to receive Slast Dnext 1 FR 0 ACK 0 FR 1 ACK 1 time-out period time FR 0 FR 1 ACK 0 delayed time-out period Slast Dnext 1 ACK 1 FR 2

27 Figure 11.10 Design of the Stop-and-Wait ARQ Protocol

28 Algorithm 11.5 Sender-site algorithm for Stop-and-Wait ARQ

29 (continued) Algorithm Sender-site algorithm for Stop-and-Wait ARQ

30 Algorithm 11.6 Receiver-site algorithm for Stop-and-Wait ARQ Protocol

31 Example 11.3 Figure shows an example of Stop-and-Wait ARQ. Frame 0 is sent and acknowledged. Frame 1 is lost and resent after the time-out. The resent frame 1 is acknowledged and the timer stops. Frame 0 is sent and acknowledged, but the acknowledgment is lost. The sender has no idea if the frame or the acknowledgment is lost, so after the time-out, it resends frame 0, which is acknowledged.

32 Figure 11.11 Flow diagram for Example 11.3

33 Performance of Stop-and-Wait Protocol
Assumption Propagation delay :  sec Frame size: L bits Bandwidth: r bit/sec Ignore control frame size Ignore processing delay and queuing delay Performance It sends an L-bits frame and wait at least 2+L/r sec During this period, it is able to send (2+L/r)r=2r+L bits Example 20 msec propagation delay, 10 Mbps channel, frame size 1000-bit. It make the channel busy for 100 usec out of 40.1 msec 0.25% efficiency

34 Example 11.4 Assume that, in a Stop-and-Wait ARQ system, the bandwidth of the line is 1 Mbps, and 1 bit takes 20 ms to make a round trip. What is the bandwidth-delay product? If the system data frames are 1000 bits in length, what is the utilization percentage of the link? Solution The bandwidth-delay product is (1*106)*(20*10-3)=20,000 bits The system can send 20,000 bits during the time it takes for the data to go from the sender to the receiver and then back again. However, the system sends only 1000 bits. We can say that the link utilization is only 1000/20,000, or 5 percent. For this reason, for a link with a high bandwidth or long delay, the use of Stop- and-Wait ARQ wastes the capacity of the link.

35 Example 11.5 What is the utilization percentage of the link in Example 11.4 if we have a protocol that can send up to 15 frames before stopping and worrying about the acknowledgments? Solution The bandwidth-delay product is still 20,000 bits. The system can send up to 15 frames or 15,000 bits during a round trip. This means the utilization is 15,000/20,000, or 75 percent. Of course, if there are damaged frames, the utilization percentage is much less because frames have to be resent.

36 Go-Back-N Protocol, 1 Motivation Procedure S D 1 2 3 4 5 6 7 8
Inefficiency of Stop-and-Wait protocol S continuously sends enough frames so that the channel is kept busy while S waits for ACK. Procedure S has a limit on the number of outstanding frames (Sw), and each frame is associated with a timer S sends frame 0 followed by additional frames, so Sw frames are outstanding. Upon receiving ACK k, S sends frames up to Sw + k. If time-out occurs, go back to Sw previous frames (outstanding frames) which are outstanding in S, and re-transmit all those outstanding frames. S D 1 2 3 4 5 6 7 8 time-out period

37 Go-Back-N Protocol, 2 If errors occurs, the loss of transmission time for Sw frames. In Stop-and-Wait, the loss was the time-out period. Each outstanding frame is associated with a timer. Outstanding frames are maintained by two variables: Sf and Sn. Sf : the oldest outstanding frame. Sn: the next frame to send. Sn-Sf < Ssize. D has a single state variable: Rn := the frame number to receive. If D receives frame k for k = Rn, it sends an ACK for Rn and update Rn=Rn+1. Upon receiving ACK(Rn), S update Sf = Rn and sends more frames such that at most Sw frames are outstanding. Relations between the variables Sf  Rn < Sn and Sn-Sf < Sw

38 Go-Back-N Protocol, 3 Size of Header (for sequence number)
m bits – capable of representing 0 to 2m - 1. If Sw < 2m, S and D can say which frame has been received or acknowledged without ambiguity. Example Assume Sw=2m, for m=2 (4) Assume Sw=2m-1, for m=2 (3) S D time-out period 1 2 3 Is this fram 0 or frame 4? S D time-out period 1 2 3 This is the retransmission of fram 0

39 Go-Back-N Protocol, 4 Improvement Piggybacking
D sends a NAK(Rnext) after the first out-of-sequence message S retransmits from frames Rnext after receiving NAK(Rnext). Piggybacking In bi-directional communication, ACK or NAK is piggybacked to an information frame in reverse direction. What if there no user data for a certain period of time? ACK timer. S D 1 A1 2 3 4 5 6 7 N1 A2 8 9 A3

40 Summary, Goback-N Protocol
In the Go-Back-N Protocol, the sequence numbers are modulo 2m, where m is the size of the sequence number field in bits. The send window is an abstract concept defining an imaginary box of size 2m − 1 with three variables: Sf, Sn, and Sw. The send window can slide one or more slots when a valid acknowledgment arrives. The receive window is an abstract concept defining an imaginary box of size 1 with one single variable Rn. The window slides when a correct frame has arrived; sliding occurs one slot at a time. In Go-Back-N ARQ, the size of the send window must be less than 2m(not equal to !!!) the size of the receiver window is always 1.

41 Figure 11.12 Send window for Go-Back-N ARQ

42 Figure 11.13 Receive window for Go-Back-N ARQ

43 Figure 11.14 Design of Go-Back-N ARQ

44 Figure 11.15 Window size for Go-Back-N ARQ

45 Algorithm 11.7 Go-Back-N sender algorithm

46 (continued) Algorithm Go-Back-N sender algorithm

47 Algorithm 11.8 Go-Back-N receiver algorithm

48 Example 11.6 Figure shows an example of Go-Back-N. This is an example of a case where the forward channel is reliable, but the reverse is not. No data frames are lost, but some ACKs are delayed and one is lost. The example also shows how cumulative acknowledgments can help if acknowledgments are delayed or lost. After initialization, there are seven sender events. Request events are triggered by data from the network layer; arrival events are triggered by acknowledgments from the physical layer. There is no time-out event here because all outstanding frames are acknowledged before the timer expires. Note that although ACK 2 is lost, ACK 3 serves as both ACK 2 and ACK 3.

49 Figure 11.16 Flow diagram for Example 11.6

50 Example 11.7 Figure shows what happens when a frame is lost. Frames 0, 1, 2, and 3 are sent. However, frame 1 is lost. The receiver receives frames 2 and 3, but they are discarded because they are received out of order. The sender receives no acknowledgment about frames 1, 2, or 3. Its timer finally expires. The sender sends all outstanding frames (1, 2, and 3) because it does not know what is wrong. Note that the resending of frames 1, 2, and 3 is the response to one single event. When the sender is responding to this event, it cannot accept the triggering of other events. This means that when ACK 2 arrives, the sender is still busy with sending frame 3.

51 Example 11.7 (continued) The physical layer must wait until this event is completed and the data link layer goes back to its sleeping state. We have shown a vertical line to indicate the delay. It is the same story with ACK 3; but when ACK 3 arrives, the sender is busy responding to ACK 2. It happens again when ACK 4 arrives. Note that before the second timer expires, all outstanding frames have been sent and the timer is stopped.

52 Figure 11.17 Flow diagram for Example 11.7

53 Note Stop-and-Wait ARQ is a special case of Go-Back-N ARQ in which the size of the send window is 1.

54 Figure 11.18 Send window for Selective Repeat ARQ

55 Figure 11.19 Receive window for Selective Repeat ARQ

56 Figure 11.20 Design of Selective Repeat ARQ

57 Figure 11.21 Selective Repeat ARQ, window size

58 Selective Repeat In Selective Repeat ARQ, the size of the sender and receiver window must be at most one-half of 2m.

59 Algorithm 11.9 Sender-site Selective Repeat algorithm

60 (continued) (continued)
Algorithm Sender-site Selective Repeat algorithm (continued)

61 (continued) Algorithm Sender-site Selective Repeat algorithm

62 Algorithm 11.10 Receiver-site Selective Repeat algorithm

63 Algorithm 11.10 Receiver-site Selective Repeat algorithm

64 Figure 11.22 Delivery of data in Selective Repeat ARQ

65 Example 11.8 This example is similar to Example 11.3 in which frame 1 is lost. We show how Selective Repeat behaves in this case. Figure shows the situation. One main difference is the number of timers. Here, each frame sent or resent needs a timer, which means that the timers need to be numbered (0, 1, 2, and 3). The timer for frame 0 starts at the first request, but stops when the ACK for this frame arrives. The timer for frame 1 starts at the second request, restarts when a NAK arrives, and finally stops when the last ACK arrives. The other two timers start when the corresponding frames are sent and stop at the last arrival event.

66 Example 11.8 (continued) At the receiver site we need to distinguish between the acceptance of a frame and its delivery to the network layer. At the second arrival, frame 2 arrives and is stored and marked, but it cannot be delivered because frame 1 is missing. At the next arrival, frame 3 arrives and is marked and stored, but still none of the frames can be delivered. Only at the last arrival, when finally a copy of frame 1 arrives, can frames 1, 2, and 3 be delivered to the network layer. There are two conditions for the delivery of frames to the network layer: First, a set of consecutive frames must have arrived. Second, the set starts from the beginning of the window.

67 Example 11.8 (continued) Another important point is that a NAK is sent after the second arrival, but not after the third, although both situations look the same. The reason is that the protocol does not want to crowd the network with unnecessary NAKs and unnecessary resent frames. The second NAK would still be NAK1 to inform the sender to resend frame 1 again; this has already been done. The first NAK sent is remembered (using the nakSent variable) and is not sent again until the frame slides. A NAK is sent once for each window position and defines the first slot in the window.

68 Example 11.8 (continued) The next point is about the ACKs. Notice that only two ACKs are sent here. The first one acknowledges only the first frame; the second one acknowledges three frames. In Selective Repeat, ACKs are sent when data are delivered to the network layer. If the data belonging to n frames are delivered in one shot, only one ACK is sent for all of them.

69 Figure 11.23 Flow diagram for Example 11.8

70 Figure 11.24 Design of piggybacking in Go-Back-N ARQ

71 HDLC High-level Data Link Control (HDLC) is a bit-oriented protocol for communication over point-to-point and multipoint links. It implements the ARQ mechanisms we discussed in this chapter.

72 Figure 11.25 Normal response mode

73 Figure 11.26 Asynchronous balanced mode

74 Figure HDLC frames

75 Figure 11.28 Control field format for the different frame types

76 Table 11.1 U-frame control command and response

77 Example 11.9 Figure shows how U-frames can be used for connection establishment and connection release. Node A asks for a connection with a set asynchronous balanced mode (SABM) frame; node B gives a positive response with an unnumbered acknowledgment (UA) frame. After these two exchanges, data can be transferred between the two nodes (not shown in the figure). After data transfer, node A sends a DISC (disconnect) frame to release the connection; it is confirmed by node B responding with a UA (unnumbered acknowledgment).

78 Figure 11.29 Example of connection and disconnection

79 Example 11.10 Figure shows an exchange using piggybacking. Node A begins the exchange of information with an I-frame numbered 0 followed by another I-frame numbered 1. Node B piggybacks its acknowledgment of both frames onto an I-frame of its own. Node B’s first I-frame is also numbered 0 [N(S) field] and contains a 2 in its N(R) field, acknowledging the receipt of A’s frames 1 and 0 and indicating that it expects frame 2 to arrive next. Node B transmits its second and third I-frames (numbered 1 and 2) before accepting further frames from node A.

80 Example (continued) Its N(R) information, therefore, has not changed: B frames 1 and 2 indicate that node B is still expecting A’s frame 2 to arrive next. Node A has sent all its data. Therefore, it cannot piggyback an acknowledgment onto an I-frame and sends an S-frame instead. The RR code indicates that A is still ready to receive. The number 3 in the N(R) field tells B that frames 0, 1, and 2 have all been accepted and that A is now expecting frame number 3.

81 Figure 11.30 Example of piggybacking without error

82 Example 11.11 Figure shows an exchange in which a frame is lost. Node B sends three data frames (0, 1, and 2), but frame 1 is lost. When node A receives frame 2, it discards it and sends a REJ frame for frame 1. Note that the protocol being used is Go-Back-N with the special use of an REJ frame as a NAK frame. The NAK frame does two things here: It confirms the receipt of frame 0 and declares that frame 1 and any following frames must be resent. Node B, after receiving the REJ frame, resends frames 1 and 2. Node A acknowledges the receipt by sending an RR frame (ACK) with acknowledgment number 3.

83 Figure 11.31 Example of piggybacking with error

Although HDLC is a general protocol that can be used for both point-to-point and multipoint configurations, one of the most common protocols for point-to-point access is the Point-to-Point Protocol (PPP). PPP is a byte-oriented protocol.

85 Figure 11.32 PPP frame format

86 Note PPP is a byte-oriented protocol using byte stuffing with the escape byte

87 Figure 11.33 Transition phases

88 Figure 11.34 Multiplexing in PPP

89 Figure 11.35 LCP packet encapsulated in a frame

90 Table LCP packets

91 Table Common options

92 Figure 11.36 PAP packets encapsulated in a PPP frame

93 Figure 11.37 CHAP packets encapsulated in a PPP frame

94 Figure 11.38 IPCP packet encapsulated in PPP frame

95 Table 11.4 Code value for IPCP packets

96 Figure 11.39 IP datagram encapsulated in a PPP frame

97 Figure Multilink PPP

98 Example 11.12 Let us go through the phases followed by a network layer packet as it is transmitted through a PPP connection. Figure shows the steps. For simplicity, we assume unidirectional movement of data from the user site to the system site (such as sending an through an ISP). The first two frames show link establishment. We have chosen two options (not shown in the figure): using PAP for authentication and suppressing the address control fields. Frames 3 and 4 are for authentication. Frames 5 and 6 establish the network layer connection using IPCP.

99 Example (continued) The next several frames show that some IP packets are encapsulated in the PPP frame. The system (receiver) may have been running several network layer protocols, but it knows that the incoming data must be delivered to the IP protocol because the NCP protocol used before the data transfer was IPCP. After data transfer, the user then terminates the data link connection, which is acknowledged by the system. Of course the user or the system could have chosen to terminate the network layer IPCP and keep the data link layer running if it wanted to run another NCP protocol.

100 Figure An example

101 Figure 11.41 An example (continued)

Download ppt "Chapter 11. Data Link Control"

Similar presentations

Ads by Google