I N THE N AME OF G OD C OMPUTER N ETWORKS C HAPTER 3: T HE D ATA L INK L AYER ( PART 3) Dr. Shahriar Bijani Shahed University March 2014.

Slides:



Advertisements
Similar presentations
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 14 Introduction to Computer Networks.
Advertisements

Chapter 3 The Data Link Layer.
Data Link Layer Protocols Flow Control in Data Link Layer.
Data Link Layer (cont’d)
The Data Link Layer Chapter 3. Data Link Layer Design Issues Services Provided to the Network Layer Framing Error Control Flow Control.
Assume that a file is transferred from a node A to a node B. The file has been fragmented in 5 frames. Frame 0 is corrupted, the ACK of frame 1 is corrupted,
Data Link Layer Computer Networks.
Go-Back-N Improve Stop-and-Wait by not waiting!
Chapter 11 Data Link Control
Flow and Error Control. Flow Control Flow control coordinates the amount of data that can be sent before receiving acknowledgement It is one of the most.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 11 Data Link Control and Protocols.
The Data Link Layer 2 Chapter 3 CN5E by Tanenbaum & Wetherall, © Pearson Education-Prentice Hall and D. Wetherall, 2011 Data Link Layer Design Issues Error.
ELEN 602 Lecture 5 Review of last lecture –Error Detection -- parity/CRC etc. Automatic Retransmission Request (ARQ) Reading: Chap
Data Link Layer as a Reliable Data Transport Protocol Computer Networks Computer Networks Term B10.
Data Link Layer Review Advanced Computer Networks.
EEC-484/584 Computer Networks Lecture 14 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
Networks: Data Link Layer1 Data Link Layer. Networks: Data Link Layer2 Data Link Layer Provides a well-defined service interface to the network layer.
Networks: Data Link Layer1 Data Link Layer. Networks: Data Link Layer2 Data Link Layer Provides a well-defined service interface to the network layer.
Computer Networks: Data Link Layer 1 Data Link Layer.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 12 Introduction to Computer Networks.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 13 Introduction to Computer Networks.
EEC-484/584 Computer Networks Lecture 14 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
CMPE 150 – Winter 2009 Lecture 6 January 22, 2009 P.E. Mantey.
CSC 450/550 Part 2: The Data Link Layer. CSC 450/550 Summary Part A Functions (1)Functions of the data link layer (2)Framing (3)Error control (3.1) Error.
The Data Link Layer Chapter 3. Data Link Layer Design Issues Services Provided to the Network Layer Framing Error Control Flow Control.
Adapted from Tanenbaum's Slides for Computer Networking, 4e The Data Link Layer Chapter 3.
Lect11.ppt - 03/15/05 CDA 6505 Network Architecture and Client/Server Computing Lecture 11 Link-Level Flow and Error Control by Zornitza Genova Prodanoff.
Link-Level Flow and Error Control
Principles of Reliable Data Transfer. Reliable Delivery Making sure that the packets sent by the sender are correctly and reliably received by the receiver.
CSE 461 University of Washington1 Topic The sliding window algorithm – Pipelining and reliability – Building on Stop-and-Wait Yeah! Network.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 11 Data Link Control Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction.
11.1 Chapter 11 Data Link Control Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 11: Flow Control – can occur at layer 2 (data link) and at layer 4 (transport)  You saw the need in the most recent assignment.  Data packets.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Data Link Layer Part I – Designing Issues and Elementary.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Data Link Control and Protocols.
Chapter 3 THE DATA LINK LAYER
Chapter 5 Peer-to-Peer Protocols and Data Link Layer PART I: Peer-to-Peer Protocols ARQ Protocols and Reliable Data Transfer Flow Control.
1 Transport Layer Lecture 10 Imran Ahmed University of Management & Technology.
THE DATA LINK LAYER Chapter 3 1. H YBRID M ODEL The hybrid reference model to be used in this book. 2.
The data link layer. Data Link Layer Design Issues Services Provided to the Network Layer Framing Error Control Flow Control.
The Data Link Layer. Functions of the Data Link Layer Provide service interface to the network layer Dealing with transmission errors Error detection.
The Data Link Layer Chapter 3 10/28/2015www.noteshit.com1.
Computer Networks Lecture 3: Data Link - part II Based on slides from D. Choffnes Northeastern U. and P. Gill from StonyBrook University Revised Autumn.
Chapter 3: Channel Coding (part 3). Automatic repeat request (ARQ) protocols ▫Used in combination with error detection/correction ▫Block of data with.
The Data Link Layer Chapter 3 1/21/2016www.ishuchita.com1.
Lecture Focus: Data Communications and Networking  Data Link Layer  Data Link Control Lecture 22 CSCS 311.
11.1 Flow and Error Control Flow Control Error Control.
1 Flow&Error Control R. Supakorn. 2 Flow Control Flow control refers to a set of procedure used to restrict the amount of data that the sender can send.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Data Link Layer Chapter 3.
CSCI 465 D ata Communications and Networks Lecture 11 Martin van Bommel CSCI 465 Data Communications & Networks 1.
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Data Link Layer Part II – Sliding Window Protocols.
DATA LINK CONTROL. DATA LINK LAYER RESPONSIBILTIES  FRAMING  ERROR CONTROL  FLOW CONTROL.
Data Link Layer as a Reliable Data Transport Protocol Advanced Computer Networks Advanced Computer Networks Term D11.
NET 222: COMMUNICATIONS AND NETWORKS FUNDAMENTALS ( NET 222: COMMUNICATIONS AND NETWORKS FUNDAMENTALS (PRACTICAL PART) Tutorial 4 : Chapter 7 Data & computer.
Chapter 3: The Data Link Layer –to achieve reliable, efficient communication between two physically connected machines. –Design issues: services interface.
Computer Communication & Networks
The Data Link Layer Chapter
Data Link Layer Flow Control.
Chapter 3 Review on Data Link Layer
Chapter 3 – Part 1 The Data Link Layer.
Overview Jaringan Komputer (2)
Data Link Layer as a Reliable Data Transport Protocol
Communication Networks NETW 501
Data Link Layer (cont’d)
The Data Link Layer Chapter
Communication Networks NETW 501
DATA COMMUNICATION Lecture-38.
Data Link Layer (cont’d)
Lecture 4 Peer-to-Peer Protocols and Data Link Layer
Presentation transcript:

I N THE N AME OF G OD C OMPUTER N ETWORKS C HAPTER 3: T HE D ATA L INK L AYER ( PART 3) Dr. Shahriar Bijani Shahed University March 2014

References: Computer Networks A. S. Tanenbaum and D. J. Wetherall, Computer Networks (5th Edition), Pearson Education, the book slides, Chapter 6, Data Communications and Computer Networks: A Business User's Approach, 6th Edition B. A. Forouzan, Data Communications and Networking, 5th Edition, Behrouz A. Forouzan, McGraw Hill, lecture slides, Mc Graw Hill, Data Link Layer,

D ATA L INK P ROTOCOLS Elementary Data Link Protocols Utopian Simplex Protocol Simplex Stop-and-Wait Protocol Error-Free Channel Simplex Stop-and-Wait Protocol Noisy Channel Sliding Window Protocols 3

E LEMENTARY D ATA L INK P ROTOCOLS Implementation of the physical, data link, and network layers. 4

E LEMENTARY D ATA L INK P ROTOCOLS Some definitions needed in the protocols to follow. These definitions are located in the file protocol.h.... 5

E LEMENTARY D ATA L INK P ROTOCOLS Some definitions needed in the protocols to follow. These definitions are located in the file protocol.h.... 6

E LEMENTARY D ATA L INK P ROTOCOLS Some definitions needed in the protocols to follow. These definitions are located in the file protocol.h. 7

U TOPIAN S IMPLEX P ROTOCOL (1) A utopian simplex protocol.... 8

U TOPIAN S IMPLEX P ROTOCOL (2) A utopian simplex protocol. 9

10 SenderReceiver Frame ACK Timeout Frame Timeout Frame S TOP AND W AIT Simplest form of reliability Example: Bluetooth Problems? Utilization Can only have one frame in flight at any time

S IMPLEX S TOP - AND -W AIT P ROTOCOL FOR A N OISY C HANNEL (1) A simplex stop-and-wait protocol

S IMPLEX S TOP - AND -W AIT P ROTOCOL FOR A N OISY C HANNEL (2) 12 A simplex stop-and-wait protocol.

ARQ (Automatic Repeat reQuest) or PAR (Positive Acknowledgement with Retransmission): Protocols in which the sender waits for a positive acknowledgement before advancing to the next data 13

S LIDING W INDOW P ROTOCOLS 14 Allow multiple outstanding, un-ACKed frames Number of un-ACKed frames is called the window Made famous by TCP Sender Receiver Frames ACKs Window

S LIDING W INDOW P ROTOCOLS (1) A positive acknowledgement, unidirectional with retransmission protocol

S LIDING W INDOW P ROTOCOLS (2) A positive acknowledgement with retransmission protocol

S LIDING W INDOW P ROTOCOLS (3) A positive acknowledgement with retransmission protocol. 17

S LIDING W INDOW P ROTOCOLS (4) A sliding window of size 1, with a 3-bit sequence number. (a) Initially. (b) After the first frame has been sent. 18

S LIDING W INDOW P ROTOCOLS (5) A sliding window of size 1, with a 3-bit sequence number (c) After the first frame has been received. (d) After the first acknowledgement has been received. 19

O NE -B IT S LIDING W INDOW P ROTOCOL (1) A bidirectional 1-bit sliding window protocol

O NE -B IT S LIDING W INDOW P ROTOCOL (2) A bidirectional 1-bit sliding window protocol.

O NE -B IT S LIDING W INDOW P ROTOCOL (3) 22 A bidirectional 1-bit sliding window protocol.

O NE -B IT S LIDING W INDOW P ROTOCOL (4) Two scenarios for protocol 4. (a) Normal case. (b) Abnormal case. The notation is (seq, ack, packet number). An asterisk (*) indicates where a network layer accepts a packet 23

P ROTOCOL U SING G O -B ACK -N (1) Pipelining and error recovery. Effect of an error when (a) receiver’s window size is 1 24 Go-back-N

P ROTOCOL U SING G O -B ACK -N (2) Pipelining and error recovery. Effect of an error when (b) receiver’s window size is large. 25 Selective-repeat

P ROTOCOL U SING G O -B ACK -N (3) A sliding window protocol using go-back-n

P ROTOCOL U SING G O -B ACK -N (4) A sliding window protocol using go-back-n

P ROTOCOL U SING G O -B ACK -N (5) A sliding window protocol using go-back-n

P ROTOCOL U SING G O -B ACK -N (6) A sliding window protocol using go-back-n

P ROTOCOL U SING G O -B ACK -N (7) A sliding window protocol using go-back-n

P ROTOCOL U SING G O -B ACK -N (8) A sliding window protocol using go-back-n

P ROTOCOL U SING G O -B ACK -N (9) A sliding window protocol using go-back-n. 32

P ROTOCOL U SING G O -B ACK -N (10) Simulation of multiple timers in software. (a) The queued timeouts (b) The situation after the first timeout has expired. 33

P ROTOCOL U SING G O -B ACK -N (11) Send window for Go-Back-N ARQ 34

P ROTOCOL U SING G O -B ACK -N (12) Receive window for Go-Back-N ARQ 35

P ROTOCOL U SING G O -B ACK -N (13) A Design of Go-Back-N ARQ 36

P ROTOCOL U SING S ELECTIVE R EPEAT (1) A sliding window protocol using selective repeat

P ROTOCOL U SING S ELECTIVE R EPEAT (2) A sliding window protocol using selective repeat

P ROTOCOL U SING S ELECTIVE R EPEAT (3) A sliding window protocol using selective repeat

P ROTOCOL U SING S ELECTIVE R EPEAT (4) A sliding window protocol using selective repeat

P ROTOCOL U SING S ELECTIVE R EPEAT (5) A sliding window protocol using selective repeat

P ROTOCOL U SING S ELECTIVE R EPEAT (6) A sliding window protocol using selective repeat

P ROTOCOL U SING S ELECTIVE R EPEAT (7) A sliding window protocol using selective repeat

P ROTOCOL U SING S ELECTIVE R EPEAT (8) A sliding window protocol using selective repeat

P ROTOCOL U SING S ELECTIVE R EPEAT (9) A sliding window protocol using selective repeat. 45

P ROTOCOL U SING S ELECTIVE R EPEAT (10) Send window for Selective Repeat ARQ (above) Receive window for Selective Repeat ARQ (bellow) 46

P ROTOCOL U SING S ELECTIVE R EPEAT (11) a) Initial situation with a window of size7 b) After 7 frames sent and received but not acknowledged. c) Initial situation with a window size of 4. d) After 4 frames sent and received but not acknowledged. 47

E XAMPLE D ATA L INK P ROTOCOLS 1. Packet over SONET 2. ADSL (Asymmetric Digital Subscriber Loop) 48