Presentation is loading. Please wait.

Presentation is loading. Please wait.

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,

Published byBlaise Mansel Modified over 9 years ago

Similar presentations

Presentation on theme: "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,"— Presentation transcript:

1 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, ACK of frame 4 arrived after the time of frame 4 expired. 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, for the following data link control techniques: Simplest Stop-And-Wait Stop-and-wait ARQ Go-back-N ARQ Selective- Repeat ARQ

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

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

4 Stop and Wait ARQ AB f0 ACK 1 f1 ACK 0 f1 Time out f0 f1 ACK 1 f1 ACK 0 accepted discarded accepted discarded

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

6 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.

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

8 11.8 Algorithm 11.5 Sender-site algorithm for Stop-and-Wait ARQ (continued)

9 11.9 Algorithm 11.5 Sender-site algorithm for Stop-and-Wait ARQ (continued)

10 11.10 Algorithm 11.6 Receiver-site algorithm for Stop-and-Wait ARQ Protocol R n is the sequence number of the next packet expected

11 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. Use “A1, 0” denote a frame with data A1 and sequence 0. Use “Ack 1” denote an ack frame with ack number 1.

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

13 Case 2: second frame from A to B is lost AB A1A2A3

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

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

Download ppt "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,"

Similar presentations

Sliding window protocols:  Window: subset of consecutive frames  only frames in window can be sent.

Sliding window protocols:  Window: subset of consecutive frames  only frames in window can be sent.
Network Operations & administration CS 4592 Lecture 15 Instructor: Ibrahim Tariq.

Network Operations & administration CS 4592 Lecture 15 Instructor: Ibrahim Tariq.
11-1 FRAMING The data link layer needs to pack bits into frames, so that each frame is distinguishable from another. Our postal system practices a type.

11-1 FRAMING The data link layer needs to pack bits into frames, so that each frame is distinguishable from another. Our postal system practices a type.
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.

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.
William Stallings Data and Computer Communications 7th Edition

William Stallings Data and Computer Communications 7th Edition
Data Link Control We want to minimize the amount of error correcting and detecting we need to do.

Data Link Control We want to minimize the amount of error correcting and detecting we need to do.
Chapter 11 Data Link Control

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.

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.

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.
11-5 NOISY CHANNELS Although the Stop-and-Wait Protocol gives us an idea of how to add flow control to its predecessor, noiseless channels are nonexistent.

11-5 NOISY CHANNELS Although the Stop-and-Wait Protocol gives us an idea of how to add flow control to its predecessor, noiseless channels are nonexistent.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 11 Data Link Control and Protocols.

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

11.1 Chapter 11 Data Link Control Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 13 Introduction to Computer Networks.

CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 13 Introduction to Computer Networks.
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:

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:
11.1 Chapter 11 Data Link Control Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

11.1 Chapter 11 Data Link Control Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.

Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.
Data Link Control Protocols

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

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

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.

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

Similar presentations

Ads by Google