Assume that a file is transferred from a node A to a node B. The file has been fragmented in 5 frames (denoted as f0, f1, f2, f3, f4). Show the flow of.

Slides:

Advertisements

Similar presentations

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

Advertisements

Data Link Layer Protocols Flow Control in Data Link Layer.

Network Operations & administration CS 4592 Lecture 15 Instructor: Ibrahim Tariq.

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,

William Stallings Data and Computer Communications 7th Edition

ICSA341 Data Communications and Computer Networks 1 Data Link Control General principles.

Chapter 11 Data Link Control

Data link control. Data Link Control –Flow Control how much data may sent –Error Control How can error be detected and corrected.

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.

Chapter 7 – Data Link Control Protocols

Transport Layer 3-1 Transport Layer r To learn about transport layer protocols in the Internet: m TCP: connection-oriented protocol m Reliability protocol.

CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 13 Introduction to Computer Networks.

William Stallings Data and Computer Communications 7 th Edition Chapter 7 Data Link Control Protocols.

1 Reliable Data Transfer. 2 r Problem: Reliability  Want an abstraction of a reliable link even though packets can be corrupted or get lost r Solution:

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

Data Link Control Line Discipline Flow Control Error Control.

CS3502: Data and Computer Networks DATA LINK LAYER - 2 WB version.

Data Link Control Protocols

Data Link Control Protocols Dr. Muazzam A. Khan. Flow Control Ensuring the sending entity does not overwhelm the receiving entity —Preventing buffer overflow.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 11 Data Link Control Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction.

Data Link Layer We have now discussed the prevalent shared channel technologies  Ethernet/IEEE  Wireless LANs (802.11) We have now covered chapters.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Data Link Control and Protocols.

11.1 Chapter 11 Data Link Control Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

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.

Error/Flow Control Modeling (ARQ Modeling). Modeling of Go Back N.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 11 Data Link Control and Protocols.

Data Link Layer - 2 Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.

Eighth Edition by William Stallings Chapter 7 – Data Link Control Protocols Data Link Control Protocols need layer of logic above Physical to manage exchange.

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.

CSCI 465 D ata Communications and Networks Lecture 10 Martin van Bommel CSCI 465 Data Communications & Networks 1.

COSC 3213: Computer Networks I Instructor: Dr. Amir Asif Department of Computer Science York University Section M Topics: 1.Flow Control and ARQ Protocols.

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.

COMMUNICATION NETWORKS NETW 501 TUTORIAL 9 Presented by: Eng. Hana Hesham Eng. Mohamed Atef.

Part III. Data Link Layer Chapter 11. Data Link Control COMP 3270 Computer Networks Computing Science Thompson Rivers University.

Chapter 11 Data Link Control and Protocols Flow and Error Control Flow Control Error Control.

DATA LINK CONTROL. DATA LINK LAYER RESPONSIBILTIES  FRAMING  ERROR CONTROL  FLOW CONTROL.

11.1 Chapter 11 Data Link Control Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Computer Networking Lecture 16 – Reliable Transport.

Chapter 9: Data Link Control Business Data Communications, 4e.

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

2.10 Flow and Error Control Before that ...

Chapter 9: Data Link Control

Data Link Layer Flow Control.

Data Link Layer - 3 Dr. Sanjay P. Ahuja, Ph.D.

UNIT 4 Data Link Control Line Discipline Flow Control Error Control

Sliding Window Protocol | Go-Back-N

B. R. Chandavarkar CSE Dept., NITK Surathkal

Data Communications and Networking Pipelined reliable data transfer

Chap. 4 Data link layer 2.

Data Link Layer: Data Link Control

Flow and Error Control.

Overview Jaringan Komputer (2)

Chapter 5 Peer-to-Peer Protocols and Data Link Layer

DATA COMMUNICATION Lecture-39.

CS4470 Computer Networking Protocols

Lecture 7 review Consider a link running the Go-Back-N protocol. Suppose the transmission delay and propagation delay are both 1ms, the window size is.

Kendali Data Link dan Protokol

DATA COMMUNICATION Lecture-38.

Chapter 11 Data Link Control

Assume that a file is transferred from a node A to a node B

Chapter 5 Peer-to-Peer Protocols and Data Link Layer

Lecture 4 Peer-to-Peer Protocols and Data Link Layer

Chapter 9: Data Link Control

Presentation transcript:

Assume that a file is transferred from a node A to a node B. The file has been fragmented in 5 frames (denoted as f0, f1, f2, f3, f4). Show the flow of frames exchanged between the two nodes, and the status of the windows after the transmission/reception of each information/control frame, if the field of sequence number is three-bit-length, and the sender and receiver are using the maximum possible window size (7), for the following data link control techniques: Simplest Stop-And-Wait Stop-and-wait ARQ Go-back-N ARQ Selective- Repeat ARQ

AB f0 f1 f2 f3 f4 Simplest (ideal channel, no error)

Stop and Wait in ideal channel (no error) AB f0 (seq 0) f1 (seq 1) ACK 0 f2 (seq 0) ACK 1 ACK 0 f3 (seq 1)

Stop and Wait ARQ AB f0 (0) ACK 1 f1 (1) ACK 0 f1 (1) Time out Premature Time out f2 (0) f3 (1) ACK 1 f3 (1) ACK 0 accepted discarded accepted discarded fm (n): frame #m with sequence number of n Time out

Go-Back-N ARQ AB f0 f1 ACK 1 ACK 2 ACK 4 f1 Time out f4 f3 ACK 5 discarded f2 discarded f f1 f discarded f Time out Premature Time out … … ACK 3

Stop-and-Wait ARQ Example Assume that computer A sends 3 frames to computer B. The three data frames sent by A are denoted as A1, A2, A3. Suppose each data frame needs 1 ms to transmit and each ack frame needs no time to transmit. The time-out value is set to be 4ms. The round trip time is always 2 ms (i.g., each direction takes 1ms). Use “A1, 0” denote a frame with data A1 and sequence 0. Use “Ack 1” denote an ack frame with ack number 1.

Case 1: Ideal channel without any error/lost or congestion AB A1A2A3

Case 2: second frame (A2) from A to B is lost AB A1A2A3

Case 3: second frame (A2) from A to B uses 3 ms AB A1A2A3

Case 4: second ack frame from B to A uses 3ms AB A1A2A3

Duplex Communication with Stop-and-Wait ARQ Assume that computer A and computer B communicate with each other. Each has 3 frames to send to the other. The three data frames sent by A are denoted as A1, A2, A3 and the frames from B are B1, B2, B3. They use duplex Stop-and-Wait ARQ for the communication, i.e., each data frame has a sequence # field and an Ack # field. Suppose each data frame needs 1 ms to transmit and each ack-only frame needs no time to transmit. The time-out value is set to be 5ms. The round trip time is always 2 ms. Use “A1, (0,1)” denote a frame with data A1 and sequence 0, ack 1.

Ideal channel without any error/lost or congestion AB A1A2 B1 A3 B2B3