Chapter 3 The Data Link Layer

Size: px

Start display at page:

Download "Chapter 3 The Data Link Layer"

Godfrey Richards
5 years ago
Views:

1 Chapter 3 The Data Link Layer 陳瑞奇 (Rikki) 亞洲大學資訊工程學系 Adapted from Computer Networks, Andrew S. Tanenbaum, Vrije University, Netherlands & Computer Networking: A Top Down Approach, Jim Kurose, Keith Ross Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, Pearson Education-Prentice Hall, The Data Link Layer application Application presentation Presentation session Session H: header T: trail Each may be empty. SH PH PH AH AH AH 4 transport Transport TH SH PH AH 3 Network network NH TH SH PH AH 2 Data link link DH NH TH SH PH AH DT 1 physical Physical bit streams OSI Reference Model 2 1

2 Data Link Layer Design Issues Network layer services 3 2 Framing Error Control Flow Control 1 Network Data link Physical DH bit streams DT 3 Packets and Frames Relationship between packets and frames Network Data link Physical Packet Packet Header Payload field Trailer Header Payload field Trailer DH DT 4 2

3 An exchange using the OSI model Packet Packet Packet DH Packet DT 5 Network Layer Services (a) Virtual communication. (b) Actual communication. 6 3

4 Services Provided to Network Layer 7 Possible Services Offered 1. Unacknowledged connectionless service: Ethernet 2. Acknowledged connectionless service: WLAN, WiFi 3. Acknowledged connection-oriented service: ATM, Frame Relay 8 4

5 Framing methods Flag DH bit streams DT Too risky to count on timing to mark the start and end of each frame Other methods: 1. Byte Count (rarely used anymore) 2. Flag bytes with byte stuffing (PPP) 3. Flag bits with bit stuffing 4. Physical layer coding violations 9 Framing (1): Byte Count DH A byte stream. (a) Without errors. (b) With one error. DT 10 5

6 Framing (2):Flag bytes with byte stuffing DH DT a) A frame delimited by flag bytes. b) Four examples of byte sequences before and after byte stuffing. 11 Framing (3): Flag bits with bit stuffing Flag Flag Bit stuffing. (a) The original. (b) The as they appear on the line. 12 6

7 Framing (4): Physical layer coding violations The combinations of low-low and highhigh which are not used for may be used for marking frame boundaries. 13 Error Control Process (1) Single-bit error Multiple-bit error WCB/McGraw-Hill The McGraw-Hill Companies, Inc.,

8 Error Control Process (2) Burst error WCB/McGraw-Hill The McGraw-Hill Companies, Inc., Error Control Process (3) All transmission media have potential for introduction of errors Error control process has two components Error detection DH DT redundancy in so that error can be detected Error correction DH DT once error detected, frames corrected or retransmitted 16 8

9 Redundancy WCB/McGraw-Hill The McGraw-Hill Companies, Inc., Error Detection Codes Linear, systematic block codes 1. Parity. 2. Checksums. 3. Cyclic Redundancy Checks (CRCs). 4. Hamming codes. 5. Binary convolutional codes. 6. Reed-Solomon codes. 7. Low-Density Parity Check codes. 18 9

10 Error Detection Codes (1) Parity Check For single-bit error WCB/McGraw-Hill odd parity or even parity make number of 1 s in character odd or even The McGraw-Hill Companies, Inc., Error-Detecting Codes (1) Interleaving of parity bits to detect a burst error. Even Parity 22 10

11 Error-Detecting Codes (2) Checksum WCB/McGraw-Hill The McGraw-Hill Companies, Inc., Error Detection Codes (3) Cyclic Redundancy Check (CRC) treat frame as one long binary number attach remainder to frame 16-bit (32-bit) CRC DH Packet CRC 24 11

12 Error-Detecting Codes (3) Error-Detecting Codes -- CRC WCB/McGraw-Hill The McGraw-Hill Companies, Inc., Error-Detecting Codes (3) 0 0 Example calculation of the CRC 26 12

13 Error-Detecting Codes (3) CRC (Cyclic Redundancy Check) CRC Code = Polynomial Code = x 5 + x 4 + x 0 Original Message (dividend): M(x) Generator (divisor): G(x) Degree of G(x): r Quotient: Q(x) Remainder (CRC): R(x) Transmitted Message: T(x) Modulo 2 division (add/sub = XOR) G(x) Q(x) x r M(x) T(x) = x r M(x) - R(x) = M(x)&R(x) T(x)/G(x) = 0 DH Packet CRC R(x) If T (x)/g(x) = 0 then Correct, otherwise Error 27 r 0 s Error-Detecting Codes (3): CRC Calculation of the polynomial code checksum. DH Packet DT 28 13

14 Standard Polynomials (used in HDLC) (used in Ethernet) WCB/McGraw-Hill The McGraw-Hill Companies, Inc., Hardware CRC Source:

15 Error Correction (1) Two types of errors Lost frame - never arrives Damaged frame - error in bits Automatic Repeat request (ARQ) Error detection Positive acknowledgment (ACK) if received Retransmission after time-out if not ACK Negative ACK (NACK)and retransmission if error Error-Correcting Codes 32 Error Correction (2) WCB/McGraw-Hill The McGraw-Hill Companies, Inc.,

, 1998 34 1 Hamming Code (4) 1 1 Generation of Hamming

16 Error Correction (3) Hamming Code WCB/McGraw-Hill The McGraw-Hill Companies, Inc., Hamming Code (4) 1 1 Generation of Hamming Code (Even Parity Check) 1 WCB/McGraw-Hill The McGraw-Hill Companies, Inc.,

17 x Even parity Hamming Code (5) x x O WCB/McGraw-Hill The McGraw-Hill Companies, Inc., Error-Correcting Codes Use of a Hamming code to correct 1-bit errors. Bit 1,2,4,8 與上頁左右顛倒 ( 也是可以 ) 37 17

18 Flow Control Necessary when is being sent faster than it can be processed by receiver Buffer Usually a buffer is filled, and transfer is stopped until buffer is emptied 38 Flow Control with Error Control WCB/McGraw-Hill The McGraw-Hill Companies, Inc.,

19 Stop and Wait 42 Stop-And-Wait Seq# 43 19

20 Stop and Wait ARQ WCB/McGraw-Hill The McGraw-Hill Companies, Inc., Stop-And-Wait ARQ Transmitting Data Retransmission Time Received Data Error Time Output Data Time ACK: Acknowledge NAK: Negative ACK 45 20

Stop-and-Wait Flow Control Simplest form of Frame-Oriented Control Source may not send new frame until receiver acknowledges previous one Very inefficient, especially when a single message is broken

21 Stop-and-Wait Flow Control Simplest form of Frame-Oriented Control Source may not send new frame until receiver acknowledges previous one Very inefficient, especially when a single message is broken into many small frames buffer size of receiver is limited if error, detected sooner and less need be retransmitted 46 Sliding-Window Flow Control Allows multiple frames to be in transit Receiver sends acknowledgement with sequence number of next frame Sender maintains list of sequence numbers it can send, receiver maintains list of sequence numbers it can receive Packet 3 ACK n Packet 2 Packet

22 Sliding Window Protocols (2) A sliding window of size 1, with a 3-bit sequence number. (a) Initially. (b) After the first frame has been sent. (c) After the first frame has been received. (d) After the first acknowledgement has been received. 48 Sliding Window 50 22

Sliding-Window Flow Control (1) Go-Back-N ARQ (GBN ARQ) Go-back 3 Go-back 5 Transmitting Data 1 2 3 4 5 3 4 5 6 7 5 Time Received

23 Sliding-Window Flow Control (1) Go-Back-N ARQ (GBN ARQ) Go-back 3 Go-back 5 Transmitting Data Time Received Data Error Error Time Output Data Time 51 Damaged Frame WCB/McGraw-Hill The McGraw-Hill Companies, Inc.,

24 Lost Frame WCB/McGraw-Hill The McGraw-Hill Companies, Inc., Lost ACK WCB/McGraw-Hill The McGraw-Hill Companies, Inc.,

25 A Protocol Using Go Back N Pipelining and error recovery. 55 Sliding-Window Flow Control (2) Selective-Repeat ARQ (SR ARQ) Retransmission Retransmission Transmitting Data Time Received Data Error Error Time Buffer Time Output Data Time 57 25

26 A Protocol Using Selective Repeat 58 High-Level Data Link Control (HDLC) Frame format for bit-oriented protocols

27 The Data Link Layer in the Internet: PPP A home personal computer acting as an internet host. PPPoE PPP 72 PPP 73 27

28 PPP Point to Point Protocol The PPP full frame format for unnumbered mode operation. 74 PPP Point to Point Protocol (2) 75 28

PPPoE PPP DSLAM: Digital Subscriber Line Access Multiplexer Source: http://www.digitaltut.

29 PPP over Ethernet (PPPoE) Internet Service Provider (ISP) still like PPP because of authentication (PPP supports CHAP), accounting (checking customer s bill), link management (ISP can use PPP to assign a public IP address for customer). PPPoE PPP DSLAM: Digital Subscriber Line Access Multiplexer Source: 76 Protocol 轉換範例 Packet Application IP TCP/UDP IP PPP Ether Ether Ether Ether WiFi WiFi Fiber UTP UTP UTP UTP OFDMA OFDMA Adapted from 清大資工系黃能富教授 77 29

Packet PPPoE 範例 Application DHCP UDP IP PPP Fiber PPP Fiber PPP DSL PPP DSL PPP Ether UTP5 TCP/UDP IP PPP Ethernet UTP5 PPP PPPoE 78 各個電腦自行利用 PPPoE 撥接 ADSL 上網

30 Packet PPPoE 範例 Application DHCP UDP IP PPP Fiber PPP Fiber PPP DSL PPP DSL PPP Ether UTP5 TCP/UDP IP PPP Ethernet UTP5 PPP PPPoE 78 各個電腦自行利用 PPPoE 撥接 ADSL 上網 (DHCP) or Fixed IP PPP over WLAN PPP over WiFi (PPPoE) (PPPoE) Source: TCP/UDP IP PPP WiFi OFDMA 79 30

31 The Data Link Layer application Application presentation Presentation session Session H: header T: trail Each may be empty. SH PH PH AH AH AH 4 transport Transport TH SH PH AH 3 Network network NH TH SH PH AH 2 Data link link DH NH TH SH PH AH DT 1 physical Physical bit streams OSI Reference Model 84 End of Chapter 3 Questions? Thank you! Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, Pearson Education-Prentice Hall,

The Data Link Layer. Data Link Layer Design Issues

The Data Link Layer. Data Link Layer Design Issues The Data Link Layer Chapter 3 Data Link Layer Design Issues Network layer services Framing Error control Flow control 1 Packets and Frames Relationship between packets and frames. Network Layer Services