1 / 28

The Data Link Layer

The Data Link Layer. Functions of the Data Link Layer. Provide service interface to the network layer Frame delineation Dealing with transmission errors Error detection and correction codes Positive and negative acknowledgements Timers Regulating data flow

tobias
Download Presentation

The Data Link Layer

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. The Data Link Layer

  2. Functions of the Data Link Layer • Provide service interface to the network layer • Frame delineation • Dealing with transmission errors • Error detection and correction codes • Positive and negative acknowledgements • Timers • Regulating data flow • Slow receivers not swamped by fast senders

  3. Functions of the Data Link Layer Relationship between packets and frames.

  4. Data Link Layer Services • Unacknowledged connectionless service • Acknowledged connectionless service • Acknowledged connection-oriented service

  5. Frame Delimiting • Character count • Flag bytes with byte stuffing • Starting and ending flags, with bit stuffing

  6. Framing A character stream. (a) Without errors. (b) With one error.

  7. Framing (a) A frame delimited by flag bytes. (b) Four examples of byte sequences before and after stuffing.

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

  9. Error Detection and Correction • Error-Correcting Codes • Error-Detecting Codes

  10. Hamming Distance • Hamming distance between codewords X and Y, is the number of ones in • The number of detected bit errors is d if d+1 is the minimum Hamming distance between two codes. • The number of corrected bit errors is d if 2d+1 is the minimum Hamming distance between two codes.

  11. Error Correction • Codeword Y is calculated from generation matrix G,andblock of data X: Y=XG=[x1,x2,…,xm]·Gmxn • At the receiver side the syndrom is found that detects and correct an error using check parity matrix H: S=Y’HT

  12. Error correction • For generation and parity check matrices it should hold GHT=0 • If G=[Im|P] Then H=[-PT|In-m] • Here I is unity matrix, n is the codeword length, and m=n-k is the data block length

  13. Error correction: Hamming Code • In Hamming code the codeword length is 2m-1-1, the number of added bits is 2m-1-m-1 • Parity check matrix comprises all possible column vectors. For example for m=4

  14. Error Detection Code: CRC • Data block and codeword represented by polynomials. • If data block is X(x)=b0+b1x+…+bm-1xm-1, codeword is Y(x)=X(x)xk-mod(X(x), G(x)), where G(x) is a generator polynomial of order k. • At the receiver side, codeword polynomial is divided by G(x). If the reminder is non-zero, an error is detected.

  15. Error-Detecting Codes Calculation of the polynomial code checksum.

  16. Elementary Data Link Protocols • An Unrestricted Simplex Protocol • A Simplex Stop-and-Wait Protocol • A Simplex Protocol for a Noisy Channel with Frame Sequence Numbers

  17. Sliding Window Protocols • A One-Bit Sliding Window Protocol • A Protocol Using Go Back N • A Protocol Using Selective Repeat

  18. Sliding Window Protocols 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.

  19. Sliding Window Protocols Pipelining and error recovery. Effect on an error when (a) Go back N (Wrec=1) (b) Selective Repeat

  20. Sliding Window Protocol Timers Simulation of multiple timers in software.

  21. A Sliding Window Protocol Using Selective Repeat • Initial situation with a window size seven. • After seven frames sent and received, but not acknowledged. • Initial situation with a window size of four. • After four frames sent and received, but not acknowledged. Wrec ≤ (Smax+1)/2

  22. Example Data Link Protocols • HDLC - High-level Data Link Control • PPP – Point-to-Point Protocol

  23. High-Level Data Link Control Frame format for bit-oriented protocols.

  24. High-Level Data Link Control Control field of (a) An information frame. (b) A supervisory frame. Type: RECEIVE READY, REJECT, RECEIVE NOT READY, SELECTIVE REPEAT (c) An unnumbered frame. Type: DISCONNECT, SNRP (set normal response mode), SABM (set asynchronous balanced mode), FRAME REJECT

  25. The Data Link Layer in the Internet A home personal computer acting as an internet host.

  26. PPP – Point to Point Protocol The PPP full frame format for unnumbered mode operation. Protocol: Link Control Protocol (LCP), Network Control Protocol (NCP), IP, IPX, Appletalk, CLNP

  27. PPP – Point to Point Protocol A simplified phase diagram for bring a line up and down.

  28. PPP – Point to Point Protocol The LCP frame types.

More Related