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

Slides:



Advertisements
Similar presentations
Data Link Layer Protocols Flow Control in Data Link Layer.
Advertisements

CH. 7 Data Link Control. Requirements & Objectives of Data Link Control Frame Synchronization Flow Control Error Control Addressing Control and Data on.
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. Frame 0 is corrupted, the ACK of frame 1 is corrupted,
EIE325: Telecommunication TechnologiesMaciej J. Ogorza ł ek, PolyU, EIE Telecommunication Technologies Week 8 Flow Control Error Control.
William Stallings Data and Computer Communications 7th Edition
Transport Layer – TCP (Part2) Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
Transport Layer – TCP (Part1) Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
Data and Computer Communications Updated: 2/9/2009.
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.
8-Reliability and Channel Coding Dr. John P. Abraham Professor UTPA.
Department of Electronic Engineering City University of Hong Kong EE3900 Computer Networks Data Link Control Slide 1 Data Link Control Chapter 7.
Chapter 7 – Data Link Control Protocols
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 13 Introduction to Computer Networks.
Data Link Control Protocols Data link control protocol Provides a layer of control between systems on a transmission medium referred to as data link. DLC.
William Stallings Data and Computer Communications 7 th Edition Chapter 7 Data Link Control Protocols.
1 K. Salah Module 4.0: Data Link Layer The Logical Link Control (LLC) sublayer –Framing –Flow Control –Error Control The Media Access Control (MAC) sublayer.
EE 4272Spring, 2003 Chapter 7 Data Link Control Objectives: Effective & reliable data communication between two directly connected transmitting-receiving.
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
TCP: flow and congestion control. Flow Control Flow Control is a technique for speed-matching of transmitter and receiver. Flow control ensures that a.
CS3502: Data and Computer Networks DATA LINK LAYER - 2 WB version.
Data and Computer Communications Eighth & Ninth Edition by William Stallings Chapter 7 – Data Link Control Protocols.
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.
Aegis School of Telecommunication Chapter 7 Data Link Control Protocols Telecom Systems I by Dr. M. G. Sharma, Phd.
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.
Data Link Layer - 1 Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
Data and Computer Communications Tenth Edition by William Stallings Data and Computer Communications, Tenth Edition by William Stallings, (c) Pearson Education.
TCP Lecture 13 November 13, TCP Background Transmission Control Protocol (TCP) TCP provides much of the functionality that IP lacks: reliable service.
26-TCP Dr. John P. Abraham Professor UTPA. TCP  Transmission control protocol, another transport layer protocol.  Reliable delivery  Tcp must compensate.
Switching Techniques Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
CSC 311 Chapter Eight FLOW CONTROL TECHNIQUES. CSC 311 Chapter Eight How do we manage the large amount of data on the network? How do we react to a damaged.
Chapt 3 Data Link Layer1 Data Link Layer Functions –Provides services to network layer Well-defined interface –Framing –Flow control – between adjacent.
CS3505: DATA LINK LAYER. data link layer  phys. layer subject to errors; not reliable; and only moves information as bits, which alone are not meaningful.
IEEE (Token Ring) LAN 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.
Data Link Layer: Data Link Control : Data Communication and Computer Networks Asst. Prof. Chaiporn Jaikaeo, Ph.D.
CS 453 Computer Networks Lecture 11 Layer 2 – Data Link Layer Protocols.
11.1 Flow and Error Control Flow Control Error Control.
1 FIT1005 Topic 6 - Data Link Layer Reference: Chapter 7 -Stallings.
Data Link Layer Flow and Error Control. Flow Control Flow Control Flow Control Specifies the amount of data can be transmitted by sender before receiving.
CSCI 465 D ata Communications and Networks Lecture 10 Martin van Bommel CSCI 465 Data Communications & Networks 1.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Principles of reliable data transfer 0.
Telecommunications & Networking Lesson 3. ISO Open System Interconnect (OSI) Application Presentation Session Transport Network Data Link Physical Application.
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Data Link Layer Part II – Sliding Window Protocols.
Data and Computer Communications Data Link Control Protocols.
1 The Data Link Layer A. S. Tanenbaum Computer Networks W. Stallings Data and Computer Communications Chapter 3.
DATA LINK CONTROL. DATA LINK LAYER RESPONSIBILTIES  FRAMING  ERROR CONTROL  FLOW CONTROL.
Computer Networking Lecture 16 – Reliable Transport.
NET 222: COMMUNICATIONS AND NETWORKS FUNDAMENTALS ( NET 222: COMMUNICATIONS AND NETWORKS FUNDAMENTALS (PRACTICAL PART) Tutorial 4 : Chapter 7 Data & computer.
Data and Computer Communications Data Link Control Protocols.
NETWORKING CONCEPTS. STOP AND WAIT FLOW CONTROL simplest form of flow control, After the destination entity receives the frame, it indicates its willingness.
Chapter 3: The Data Link Layer –to achieve reliable, efficient communication between two physically connected machines. –Design issues: services interface.
Powerpoint Templates Data Communication Muhammad Waseem Iqbal Lec # 15.
Data Link Control Protocols  need layer of logic above Physical  to manage exchange of data over a link frame synchronization frame synchronization flow.
Chapter 9: Data Link Control
Data Link Layer Flow Control.
Data Link Layer - 3 Dr. Sanjay P. Ahuja, Ph.D.
Data and Computer Communications
Chapter 23 Introduction To Transport Layer
Instructor Mazhar Hussain
MODULE I NETWORKING CONCEPTS.
Flow Control.
Flow and Error Control.
Assume that a file is transferred from a node A to a node B
Chapter 9: Data Link Control
Presentation transcript:

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

Flow Control Flow Control is a technique to ensure that the sender does not overwhelm the receiver. Flow control in the absence of errors. We assume that: No frames are lost and none arrive with errors. Frames arrive in the order they were sent. The simplest flow control is Stop-and-Wait flow control. 1. A sender sends a frame. 2. After reception, receiver indicates its willingness to accept another frame by sending an ACK. 3. Sender must wait until it receives an ACK before sending the next frame. 4. Receiver can thus stop the flow of data by simply withholding the ACK. This works fine when the message is sent in large frames, else it can be very inefficient. Sender Receiver Buffer

Flow Control Large blocks of data are broken into smaller blocks of data and sent in many frames because: The longer the transmission, the greater the chance of error On a shared media, it is desirable not to allow one station to occupy the line for very long Buffer size of the receiver may be limited

Stop and Wait Protocol Analysis –The Effect of Propagation Delay and Transmission Rate Consider a point-to-point link using Stop and Wait scheme.

Stop and Wait Protocol Analysis –The Effect of Propagation Delay and Transmission Rate Consider two extreme examples: 1. Satellite link with t prop = 270 mseconds. Assume data rate = 56 kbps and a 4000 bit frame is to be sent. t frame = 4000 / = seconds = 71 mseconds a = 270 / 71 = 3.8 Efficiency or utilization = 1 / (1 + 2 * (3.8)) = 0.12 or 12% 2. LAN with data rate = 1 Mbps, frame size = 500 bits, distance of link = 1 km. Given, v = 2 * 10 8 m/sec t frame = 500 / 10 6 = 5 / 10 4 = 5 * t prop = d / v = 1000 / 2 * 10 8 = 1 / 2 * 10 5 = 0.5 * = 5 * a = t prop / t frame = 5 * / 5 * = 0.01 Efficiency or utilization = 1 / (1 + 2 * (0.01)) = 1 / 1.02 = 0.98 or 98% Here, t prop < t frame by a factor of 100, so the first bit of frame has already reached end of link while the frame is still being transmitted and so utilization approaches 100%.

Stop and Wait Protocol Analysis –The Effect of Propagation Delay and Transmission Rate Conclusions with regards to the line utilization of the Stop and Wait Protocol: 1. The combination of long transmit time (propagation delay), high data rate (R), and short frame length (L) is disastrous in terms of line efficiency. 2. This protocol provides adequate line utilization in some cases but for other cases, another protocol, namely, the Sliding Window Protocol is used.

Sliding Window Protocol Say two stations A, B are connected via a full duplex link. B allocates buffer space for n frames instead of just one. So A can send n frames without waiting for an ACK. Each frame has a sequence # to keep track of frames which have been received. B acknowledges a frame by sending an ACK that includes the sequence # of the next frame expected. This ACK also implicitly indicates that B is prepared to receive the next n frames beginning with the number specified. This scheme can also acknowledge multiple frames. E.g. B receives frames 2,3, and 4 but withholds ACK till it receives frame 4. Then it sends ACK with sequence #5 thereby acknowledging frames 2,3,4. A maintains a list of sequence #s it is allowed to send and B maintains a list of sequence #s it is prepared to receive. Each of these lists can be thought as a window of frames. This protocol is called sliding window protocol.

Sliding Window Protocol The sequence # occupies a field in a frame. If sequence # field is k-bits wide, then sequence # can be between 0 to 2 k -1. If field = 3 bits then sequence #s can range from 0 – 7. The next frame # is again 0 (mod 2 k ). S EQ#DATA….

Sliding Window Protocol

This mechanism provides flow control since the receiver must only be able to accommodate at most n frames beyond the one it has last acknowledged. The receiver can also completely cut off the sender by sending a Receive Not Ready (RNR) message. E.g. RNR5 means it has received all frames up to #4 but is unable to accept any more. Later the receiver can send a normal ACK to reopen the window. A window size of 7 is used for most applications. A window size of 127 is used for some satellite links.