网路概论45.pptVIP

網路概論Class 4 – Data Link Control Part II 授課老師 楊人順 2001/10/16-17 Presentation Outlines Error Detection Techniques Cyclic redundancy check Error Control Error Control Technique Error Control Mechanism Data Link Protocols Multiplexing What is multiplexing ? Frequency Division Multiplexing Time Division Multiplexing Code Division Multiple Access Digital Subscriber Line Cyclic redundancy check CRC is the most common and powerful error-detecting codes. Algorithm Sender calculates a Frame Check Sequence (FCS) from a pattern. Sender sends a frame with (Message + FCS). Receiver then divides the incoming frame by the same pattern and, if there is no remainder, assume there was not error. Modulo 2 Arithmetic: an exclusion-OR operation to replace the “Add” and “Subtract” Definition T = (k + n)-bit frame to be transmitted, with n k M = k-bit message, the fist k bits of T F = n-bit FCS, the last n bits of T P = pattern of n+1 bits; this is the predetermined divisor. CRC Principle Targets in receiver site No error detected: T/P no remainder Errors detected : T/P with as least one bit error. A true : |P| = |F| + 1 FCS generation CRC Principle (con’t) Error Detection Example : pp. 204 Another view of CRC : express all value as polynomials in a dummy variable X E.g., M=110011, M(X)=X5 + X4 + X + 1, P=11001, P(X) = X4 + X3 + 1 Capacity of CRC An error E(X) will only be undetectable if it is divisible by P(X). The following error types are detectable : All single-bit errors All double-bit errors, as long as P(X) has as least three 1s Any odd number of errors, as long as P(X) contains a factor (X + 1) Any burst error for which the length of the burst is less than the length of the divisor polynomial; that is, less than or equal to the length of the FCS Most larger burst errors Undetectable error probability (r is the length of FCS) A burst error of length r + 1, undetectable error probability is 1/2r–1 A longer burst, undetectable error probability is 1/2r