Chapter 2 : Direct Link Networks (Continued). So far... Modulation and Encoding Link layer protocols Error Detection -- Parity Check.

Slides:



Advertisements
Similar presentations
Cyclic Code.
Advertisements

EE 4272Spring, 2003 Chapter 7 Data Link Control Objectives: Effective & reliable data communication between two directly connected transmitting-receiving.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Lecture 12 Layer 2 – Data Link Layer Protocols
Introduction to Information Technologies
CSE 461: Error Detection and Correction. Next Topic  Error detection and correction  Focus: How do we detect and correct messages that are garbled during.
Spring 2002CS 4611 Outline Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.
Traceroute Assignment. Base64 Encoding The SMTP protocol only allows 7 bit ASCII data, so how can you send me a picture of Avril Lavigne, which is an.
Error Detection and Correction
Fundamentals of Computer Networks ECE 478/578 Lecture #4: Error Detection and Correction Instructor: Loukas Lazos Dept of Electrical and Computer Engineering.
PART III DATA LINK LAYER. Position of the Data-Link Layer.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 12 Introduction to Computer Networks.
EE 122: Error detection and reliable transmission Ion Stoica September 16, 2002.
1 Outline Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.
The OSI Reference Model
Data Communications Chapter 7 Error Detection. Despite the best prevention techniques, errors may still happen. To detect an error, something extra has.
Error Detection and Correction
Adapted from Tanenbaum's Slides for Computer Networking, 4e The Data Link Layer Chapter 3.
Error Detection and Reliable Transmission EECS 122: Lecture 24 Department of Electrical Engineering and Computer Sciences University of California Berkeley.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 PART III: DATA LINK LAYER ERROR DETECTION AND CORRECTION 7.1 Chapter 10.
18-Aug-154/598N: Computer Networks Overview Direct link networks –Error detection - Section 2.4 –Reliable transmission - Section 2.5.
Data link layer: services
Channel Coding and Error Control
CSE331: Introduction to Networks and Security Lecture 3 Fall 2002.
COM342 Networks and Data Communications
Data Link Layer - 1 Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
1 Data Link Layer Lecture 20 Imran Ahmed University of Management & Technology.
PART III DATA LINK LAYER. Position of the Data-Link Layer.
CIT 307 Online Data Communications Error Detection Module 11 Kevin Siminski, Instructor.
Error Coding Transmission process may introduce errors into a message.  Single bit errors versus burst errors Detection:  Requires a convention that.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 14.
Data Link Layer: Error Detection and Correction
Lecture 6: Framing and Error Detection-Data Link Layer Functions
27-Oct-15Computer Networks1 Outline Chapter 2: Direct Link Networks Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.
Linear Feedback Shift Register. 2 Linear Feedback Shift Registers (LFSRs) These are n-bit counters exhibiting pseudo-random behavior. Built from simple.
Computer Science Division
Computer Networks Lecture 2: Data Link Based on slides from D. Choffnes Northeastern U. and P. Gill from StonyBrook University Revised Autumn 2015 by S.
Computer Communication & Networks Lecture 9 Datalink Layer: Error Detection Waleed Ejaz
CSCI 465 D ata Communications and Networks Lecture 9 Martin van Bommel CSCI 465 Data Communications & Networks 1.
Lecture Focus: Data Communications and Networking  Data Link Layer  Error Control Lecture 19 CSCS 311.
1 © Unitec New Zealand CRC calculation and Hammings code.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Review.
10.1 Chapter 10 Error Detection and Correction Data can be corrupted during transmission. Some applications require that errors be detected and.
Error Detection and Correction
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 PART III: DATA LINK LAYER ERROR DETECTION AND CORRECTION 7.1 Chapter 10.
Transmission Errors Error Detection and Correction.
10.1 Chapter 10 Error Detection and Correction Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Network Layer4-1 Chapter 5: The Data Link Layer Our goals: r understand principles behind data link layer services: m error detection, correction m sharing.
Part III: Data Link Layer Error Detection and Correction
Dr. Clincy Professor of CS
Modulo-2 Digital coding uses modulo-2 arithmetic where addition becomes the following operations: 0+0= =0 0+1= =1 It performs the.
Introduction to Information Technologies
: An Introduction to Computer Networks
Dr. Clincy Professor of CS
Advanced Computer Networks
CIS 321 Data Communications & Networking
Part III Datalink Layer 10.
Detecting and Correcting Bit Errors
Chapter 9 Error Detection and Correction
Introduction to Information Technologies
Error Detection Neil Tang 9/26/2008
Protocols and the TCP/IP Suite
Chapter 9 Error Detection and Correction
Error Detection and Correction
Error detection: Outline
EECS 122: EE122: Error Detection and Reliable Transmission
Chapter 10 Error Detection and Correction
Presentation transcript:

Chapter 2 : Direct Link Networks (Continued)

So far... Modulation and Encoding Link layer protocols Error Detection -- Parity Check.

Next... CRC codes -- what are they ? Retransmissions of packets -- ensuring reliability. Multiple-access -- Ethernet.

CRC codes Cyclic Redundancy Check –based on theory of finite fields. Use of Modulo 2 arithmetic. Can help in detecting errors and in correcting some errors.

Representation Each (n+1) bit message is represented by a `n’ degree polynomial. Coefficient of a term = bit in the message. Example is represented as: M(x) = 1x 7 + 0x 6 + 0x 5 + 1x 4 +1x 3 + 0x 2 + 1x 1 + 0x 0 Think of sender and receiver exchanging polynomials.

Generator Polynomial Sender and receiver agree upon a divisor polynomial of degree ‘k’ --> level of redundancy. Example : C(x) = x 3 + x Common generator polynomials are tabulated -- coding theory. Choice of C(x) dictates what types of errors can be detected -- depends on protocol designer.

Modulo-2 rules A polynomial B(x) is divisible by C(x) if B(x) is of higher degree than C(x). A polynomial B(x) can also be divisible by C(x) if B(x) is of the same degree as C(x). Remainder of division = B(x) - C(x). To perform B(x) - C(x), XOR matching coefficients.

Example B(x) = x 3 + x 2 +1, C(x) = x Division yields a remainder of x 2. Check -- result of the simple rules from previous slide.

Sender Functions Message M(x) is (n+1) bits long. Sends (n+1) + k bits --> adding K bits causes a new polynomial P(x). Requirement : P(x) should be divisible by C(x).

Receiver functions Receiver divides received polynomial by C(x). If remainder = 0, receiver believes that there are no errors. If remainder != 0, receiver believes that there are errors -- recovery possible.

Steps of Operation at Sender 1.Multiply M(x) by X k --> add k zeroes at the end of the message or induce a “left” shift -- let this be T(x) 2.Divide T(x) by C(x); find remainder. 3.Subtract remainder from T(x) to get P(x) Note -- P(x) exactly divisible by C(x).

Steps of Operation at Receiver Consider an error E(x). Received message = P(x) + E(x). Divide by C(x). If E(x) is of smaller degree than C(x), only E(x) remains. –P(x) is perfectly divisible. So remainder is E(x) -- the error itself!

Example M(x) = x 7 + x 4 + x 3 + x, C(x) = x 3 + x k = 3 -- first multiple by x 3 to get T(x). Divide by C(x). Remainder = 101. Subtract 101 (XOR T(x) and 101) to find P(x).

Common Errors x i is a common error -- one bit is changed. Look at the book for more on C(x). Add error of say 110 and see what happens to remainder at the receiver. – What is E(x) ?