By: Ashley Owens Chelsey James Dannielle Turmon. Protocols Consist of 1) Forward Channels(for data) 2)Reverse Channels(for acknowledgements)

Slides:



Advertisements
Similar presentations
William Stallings Data and Computer Communications 7th Edition
Advertisements

Intermediate TCP/IP TCP Operation.
IS333, Ch. 26: TCP Victor Norman Calvin College 1.
Go-Back-N Improve Stop-and-Wait by not waiting!
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.
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.
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.
EEC-484/584 Computer Networks Lecture 12 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
EEC-484/584 Computer Networks Lecture 14 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
EEC-484/584 Computer Networks Lecture 12 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
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.
The Data Link Layer Chapter 3. Position of the data-link layer.
EEC-484/584 Computer Networks Lecture 13 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
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:
Example Data Link Protocols Quick review Reference Models? Layers? Flow Control? Bit stuffing? Connection Oriented? Synchronous transmission?
15 - Winter 2006 ECE ECE 766 Computer Interfacing and Protocols 1 Data Link Control Physical layer is only responsible for data transmission Data link.
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.
CS332, Ch. 26: TCP Victor Norman Calvin College 1.
TCP1 Transmission Control Protocol (TCP). TCP2 Outline Transmission Control Protocol.
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
Computer Networks Chapter 11 – Data Link Control and Protocols.
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.
Computer Networks Module 3: Data Link Layer (Framing) Dr. Vikram Shete St. Francis Institute of Technology.
Chapter 11 Data Link Control
Data Link and Flow Control Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific.
Computer Networks Lecture 3: Data Link - part II Based on slides from D. Choffnes Northeastern U. and P. Gill from StonyBrook University Revised Autumn.
Eighth Edition by William Stallings Chapter 7 – Data Link Control Protocols Data Link Control Protocols need layer of logic above Physical to manage exchange.
CHAPTER-3 continues. Sliding Window Protocols previous protocols - data frames were transmitted in one direction In practical situations - need for transmitting.
Data Link Layer: Data Link Control : Data Communication and Computer Networks Asst. Prof. Chaiporn Jaikaeo, Ph.D.
Chapter 3: Channel Coding (part 3). Automatic repeat request (ARQ) protocols ▫Used in combination with error detection/correction ▫Block of data with.
Transport Layer: Sliding Window Reliability
Lecture Focus: Data Communications and Networking  Data Link Layer  Data Link Control Lecture 22 CSCS 311.
CS 453 Computer Networks Lecture 11 Layer 2 – Data Link Layer Protocols.
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.
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.
Ch 3. Transport Layer Myungchul Kim
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 3 The Data Link Layer.
Data Link Layer Flow Control.
Sliding Window Protocol | Go-Back-N
Chap. 4 Data link layer 2.
Instructor Mazhar Hussain
Flow Control.
Flow and Error Control.
Chapter 5 Peer-to-Peer Protocols and Data Link Layer
Objectives of Today’s Lecture
Objectives of Today’s Lecture
Chapter 5 Peer-to-Peer Protocols and Data Link Layer
Lecture 4 Peer-to-Peer Protocols and Data Link Layer
ملاحظة: الكلام المسطر + الرسومات ذات السهم الاحمر*مهمة للمذاكرة
Presentation transcript:

By: Ashley Owens Chelsey James Dannielle Turmon

Protocols Consist of 1) Forward Channels(for data) 2)Reverse Channels(for acknowledgements)

For better usage Use links for data in both directions, why Allows the receiver to wait until network layer passed to next packet. Acknowledgement then attached to the outgoing data frame. Causing piggybacking to act.

Piggybacking The technique of temporarily delaying outgoing acknowledgements so they can be hooked onto the next outgoing data frame. It gives a positive acknowledgement with retransmission protocol. Example: When data layer waits for a long period of time then the sender wants, the frames then get resubmitted, defeating the purpose of having acknowledgements.

Advantages of Piggybacking Allows the privilege of having distinct acknowledgement frames. It gives better use of available channel bandwidth. The ack field acts as an acknowledger and a checksum.

Ack Field Frame header cost only a few bits( One bit in frame header) Fewer frames means a lighter processing load of receiver.

Protocol 3 Allows unidirectional data flow over an unreliable channel. Goes in a number of sequences describing each protocol with the frames frame_to send-tells which frames the sender is trying to send frame_expected- tells which frames the receiver is expecting

Bidirectional Protocols Consist of a sequence numbers Stop-and-wait sliding window n=1 This restricts the numbers from 0 and 1 Consist of three class 1)Efficiency 2)Complexity 3)Buffer Requirements

Sending/Receiving Window Sender maintains a set of sequence numbers corresponding to frames it is permitted to send. The receiving end corresponds to the set of frames permitted to be accepted Must maintain the same lower and upper limits Must maintain the same size Some are fixed in size, but grow and shrink over time frame of being sent and received Gives date link more freedom about order of sending and receiving

Senders window may be lost or damaged in transit, sender must keep all frames in memory. If window grows to max size, the sending layer must forcible shut off the network until another buffer becomes free. ?v=UidfjVs-0f4

Purpose of Sequence of Numbers Represent frames that have been sent or can be sent Newest packet is sent at highest sequence number Maintains a list of acknowledgment frames

The receiving layer window corresponds to the frames it may accept. Any frame falling within the window is put into the receivers buffer

One-Bit Sliding Window Protocol Bidirectional Use the stop-and-wait protocol as discussed in slide 8 It starts by defining variables Frame_to_send- tells frames the sender is trying to send Frame_expected- tells which frame the receiver is expecting. O and 1 are the only possibilities

Contains the physical_layer and start_ timer procedure

Protocol Using Go-Back_N Allows sender to transmits w frames before blocking, instead of just one. With the large variety of w the sender will be able to continuously transmit frames since the acknowledgements will arrive for previous frames. Before the windows become full, it prevents the sender from blocking. Receiver would discard all subsequent frames, sending no acknowledgements for the discarded frames.

Bandwidth-delay product In order to find the appropriate value for w we need to know how many frames can fit inside the channel. Bandwidth in bits/sec multiplied by one-way transit time 2BD+1 Link utilization-< w/1+2BD This value is an upper bound because it does not allow for any frame processing time and treats the acknowledgement frame as having zero length, since its usually short.

Pipelining Technique of keeping multiple frames in flight Can cause serious issues Unreliable communication channel Frame can become lost of damaged

Approaches To Dealing With Errors In Pipelining To aid in the recovery the frames are discarded by data link layer When the window size is to large the frames are buffered by data link layer

Selective Repeat Another strategy for handling errors of frames When bad frame that is received is discarded, but any good frames received after it are accepted and buffered. Only the oldest unacknowledged frames are retransmitted. Often combined with having receiver send a negative acknowledgement(NAK) There are a few approaches to if NAK becomes lost, or is timed out

Alternative Approaches Bandwidth and data link layer buffer space The network_layer_ready- is used when the network layer has packet it wants to send The library procedures include: disable_network_layer enable_network_layer

Cumulative Acknowledgement Uses protocol 5 Extremely important when frames were lost or garbled Whenever acknowledgements come in, the data link layer check to see if any buffers can be released Has multiple outstanding frames, and needs multiple timers

Protocol Using Selective Repeat Allows receiver to accept and buffer the frames following a damaged or lost one Both sender and receiver maintain a window of outstanding and acceptable sequence number

Data Link Protocols Point to point lines in the internet with two common situations Used to send packets over these links

First: is when packets are sent over SONET optical fiber links in wide-area networks. These links are widely used, to connect routers in different locations of ISP’s network

SONET It provides a bitstream that runs at a well-defined rate The bitstream is organized as fixed-sized byte payloads that recur every 125msec whether or not there is data sent

Second: is the ADSL links running on the local loop of the television network at the edge of internet

Examples of data link protocols SLIP(serial line internet protocol)- is used to handle error detection link configuration, support multiple protocols, permit authentication, and more. LCP(link control protocol)- a link control that brings lines up, testing them, negotiating options, and bringing them down again gracefully when they are no longer needed. NCP(network control protocol)- a way to negotiate network-layer options in a way that is independent of the network layer protocol to be used. HDLC( high-level data link control)- provides reliable transmission with a sliding window, acknowledgements, and timeouts.

ADSL( Asymmetric Digital Subscriber Loop) Connects million of home subscribes to the internet at megabit/sec rates over same telephone local loop used for plain old telephone service It sends bits over a local loop to a device called DSLAM( DSL Access Multiplexer)

ATM(Asynchronous Transfer Mode) Link layer based on the transmission of fixed-length cells of information Means that cells do not always need to be sent in the way that bits are continuously sent over synchronous lines Connection-Oriented technology To send data over network it needs to be mapped into a sequence of cells Each cell carries a virtual circuit identifier in its header and devices use this identifier to forward cells along the paths of established connections They can divide the bandwidth of physical layer link into slices sending both voice and data

Adaption Layers To send data over an ATM network, it needs to be mapped into a sequence of cells, this is done with an ATM adaption layer in a process called segmentation and reassembly. Several are defined for different services Periodic voice samples Packet data AAL5 (ATM Adaption Layer 5) is the main one used for packet data

Summary The purpose of sliding protocols is to convert the raw bit stream offered by the physical layer into a stream of frames for use by the network layer It also provides error correction and detection