3rd Edition, Chapter 5 - EEamp;T Lecture Notes第三版，第5章- EE amp；T讲义.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * DataLink Layer 2-* 2013 session 1TELE3118: Network TechnologiesWeek 2: Data Link LayerFraming, Error Control, Multiple Access Some slides have been taken from: Computer Networking: A Top Down Approach Featuring the Internet, 3rd edition. Jim Kurose, Keith Ross. Addison-Wesley, July 2004. All material copyright 1996-2004. J.F Kurose and K.W. Ross, All Rights Reserved. Computer Networks, 4th edition. Andrew S. Tanenbaum. Prentice-Hall, 2003. DataLink Layer 2-* Link Layer: Introduction Some terminology: hosts and routers are nodes communication channels that connect adjacent nodes along communication path are links wired links wireless links LANs layer-2 packet is a frame, encapsulates datagram “link” data-link layer has responsibility of transferring datagram from one node to adjacent node over a link DataLink Layer 2-* Link Layer Functions Framing Error control Addressing and Multiple-access control Flow control Reliable transfer DataLink Layer 2-* Framing A character stream. (a) Without errors. (b) With one error. DataLink Layer 2-* Framing (2) (a) A frame delimited by flag bytes. (b) Four examples of byte sequences before and after stuffing. DataLink Layer 2-* Framing (3) 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. DataLink Layer 2-* Error Detection and Correction EDC= Error Detection and Correction bits (redundancy) D = Data protected by error checking, may include header fields  Error detection not 100% reliable! protocol may miss some errors, but rarely larger EDC field yields better detection and correction DataLink Layer 2-* Theory: Hamming Distances Hamming distance of two codewords: The number of bit positions in which they differ Example:andhave Hamming distance 3 Hamming distance of a code: Minimum distance between any two valid codewords E.g. the code: 0000000000, 0