ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 15.

Slides:



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

The Data Link Layer Chapter 3. Data Link Layer Design Issues Services Provided to the Network Layer Framing Error Control Flow Control.
Introduction 1 Lecture 13 Transport Layer (Transmission Control Protocol) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer.
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.
8-Reliability and Channel Coding Dr. John P. Abraham Professor UTPA.
Chapter 2 Designing Reliable Protocols Professor Rick Han University of Colorado at Boulder
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.
EE 122: Error detection and reliable transmission Ion Stoica September 16, 2002.
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.
Advanced Computer Networks : TCP Sliding Windows1 TCP Sliding Windows, Flow Control, and Congestion Control Lecture material taken from “Computer Networks.
Spring 2004 EE4272 Direct Link Networks (I) Hardware Building Blocks (nodes & links) 5 Issues before Exchanging Packets  Encoding  Framing  Error Detection.
TCP. Learning objectives Reliable Transport in TCP TCP flow and Congestion Control.
20101 The Data Link Layer Chapter Design Issues Controls communication between 2 machines directly connected by “wire”-like link Services Provided.
Networking. Protocol Stack Generally speaking, sending an message is equivalent to copying a file from sender to receiver.
18-Aug-154/598N: Computer Networks Overview Direct link networks –Error detection - Section 2.4 –Reliable transmission - Section 2.5.
Process-to-Process Delivery:
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 17.
Principles of Reliable Data Transfer. Reliable Delivery Making sure that the packets sent by the sender are correctly and reliably received by the receiver.
15 - Winter 2006 ECE ECE 766 Computer Interfacing and Protocols 1 Data Link Control Physical layer is only responsible for data transmission Data link.
CSE 461 University of Washington1 Topic The sliding window algorithm – Pipelining and reliability – Building on Stop-and-Wait Yeah! Network.
Data Link Control Protocols
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 11 Data Link Control Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction.
ECE 4450:427/527 - Computer Networks Spring 2015 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 5.3: Reliable Transmission Dr. Nghi.
Data Link Layer We have now discussed the prevalent shared channel technologies  Ethernet/IEEE  Wireless LANs (802.11) We have now covered chapters.
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 16.
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 3.
14-Oct-15Computer Networks1 Reliable Transmission.
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 26.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Data Link Layer Part I – Designing Issues and Elementary.
Transport Layer Moving Segments. Transport Layer Protocols Provide a logical communication link between processes running on different hosts as if directly.
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 14.
Review:. Chapter 3: The Data Link Layer –achieve reliable, efficient communication between two physically connected machines. –Example problems to be.
1 Transport Layer Lecture 10 Imran Ahmed University of Management & Technology.
The data link layer. Data Link Layer Design Issues Services Provided to the Network Layer Framing Error Control Flow Control.
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 13.
Spring 2001CS 5851 Outline Building Blocks Shannon’s Theorem Encoding 11. Physical Layer.
Transport Layer: Sliding Window Reliability
CS 453 Computer Networks Lecture 11 Layer 2 – Data Link Layer Protocols.
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.
Retransmission. Automatic Repeat reQuest (ARQ) 2 Time Packet ACK Timeout Automatic Repeat Request –Receiver sends acknowledgment (ACK) when it receives.
1 Direct Link Networks: Reliable Transmission Sections 2.5.
McGraw-Hill Chapter 23 Process-to-Process Delivery: UDP, TCP Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Part III. Data Link Layer Chapter 11. Data Link Control COMP 3270 Computer Networks Computing Science Thompson Rivers University.
CSE331: Introduction to Networks and Security Lecture 4 Fall 2002.
Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Data Link Layer Part II – Sliding Window Protocols.
1 The utopia protocol  Unrealistic assumptions: –processing time ignored –infinite buffer space available –simplex: data transmitted in one direction.
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
Data Link Layer.
CS380 Int. to Comp. Networks Data Link Networks - Part II1 Reliable Transmission How to fix corrupted frames. –Error correcting codes too expensive –Should.
Chapter 3: The Data Link Layer –to achieve reliable, efficient communication between two physically connected machines. –Design issues: services interface.
Computer Communication & Networks
Reliable Transmission
Data Link Layer Flow Control.
Instructor Mazhar Hussain
Introduction of Transport Protocols
ECE 4450:427/527 - Computer Networks Spring 2017
Chapter 3 – Part 1 The Data Link Layer.
Rivier College CS575: Advanced LANs Chapter 6: Logical Link Control
Overview Jaringan Komputer (2)
CS412 Introduction to Computer Networking & Telecommunication
Getting Connected (Chapter 2 Part 3)
Reliable transmission
Advanced Computer Networks
Getting Connected (Chapter 2 Part 3)
The Transport Layer Reliability
Error detection: Outline
Presentation transcript:

ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 15

ICOM 6115©Manuel Rodriguez-Martinez Lecture Objectives Understand the services provided by the Data Link Layer (Layer 2) –Flow Control Stop-and-Wait Sliding Window Introduction to the Medium Access Control (MAC) Sublayer

ICOM 6115©Manuel Rodriguez-Martinez Flow Control Problem –How can the sender reliably send frames to receiver without overrunning it? Key Issues –Reliably Make sure the frame gets there –Detect error –Possibly retransmit –Overrunning Make sure receiver has time to handle frames –Otherwise, frames will be lost causing retransmission

ICOM 6115©Manuel Rodriguez-Martinez Design Issues Need a way to mark frames –Sequence numbers –Allows receiver to keep track of has arrived and what is missing Need a way to acknowledge the receipt of a frame –ACK Must also be numbered Need a protocol to govern transmission and retransmission

ICOM 6115©Manuel Rodriguez-Martinez Frame Header TYPE – frame type (ACK or REGULAR) SEQNO – sequence number for the frame ACKNO – ACK number FLAGS – other control flags SNDR – address of sender RECV – address of receiver TYPESEQ NO ACK NO FLAGSSNDRRECV

ICOM 6115©Manuel Rodriguez-Martinez ARQ Algorithms Automatic Repeat Request (ARQ) Algorithms –Used to control flow of frames Based on these ideas –ACK Indicate receipt of packet –Timeout Indicate that an ACK for a packet X has not arrived –Forces retransmission

ICOM 6115©Manuel Rodriguez-Martinez Stop and Wait Sender can send 1 frame at a time Waits for ACK from receiver Two modes –Simplex –Simplex with timeout

ICOM 6115©Manuel Rodriguez-Martinez Sender Side Algorithm While there is data to send 1.Read next packet P 2.Get a new frame F F.data = P F.seqnum = next_seqno++ % 1; 3.Send frame F 4.Set timer for F 5.Wait for event t If t is timeout // no ACK got here Goto 3 else if t is ACK for F // ACK for this frame Stop timer Goto 1 else // old ACK Goto 5

ICOM 6115©Manuel Rodriguez-Martinez Some issues … Here each packet is acknowledge –At least two frames must be exchanged Client and server must take turns as senders as receivers (dual behavior) –Client request Client is the sender Server is the receiver –Server response Server is the sender Client is the receive

ICOM 6115©Manuel Rodriguez-Martinez Major Limitations is Channel Usage Consider a 1.5Mbps link, with 45msec RTT \where frames can be up to 1KB What is the rate at which packets are sent? –Well, when a packet is sent, we must wait 1 RTT to send the next one Must Wait for ACK –Data rate is then (1024 * 8) /45msec = 182Kpbs

ICOM 6115©Manuel Rodriguez-Martinez Receiver Side Algorithm 1.While there is data to receive 2.Get new data frame F 3.Read F 4.If F.seq_no == next_seqno Pass F.data to network layer Get new ACK frame A A.seqnum = next_seqno; next_seqno= 1 – next_seqno; Send A

ICOM 6115©Manuel Rodriguez-Martinez Lesson here Stop-And-Wait wastes channel bandwidth In previous example –Link bandwidth = 1.5Mbps –Throughput with Stop-and-Wait = 180Kbps –Effective utilization is 12% 88% of bandwidth is wasted We need to keep pipe full –Send delay x bandwidth worth of frames –If we need to wait for ack, we might as well throw many frames in

ICOM 6115©Manuel Rodriguez-Martinez Sliding Window Protocol Idea is to send a group of frames over the link –Called outstanding frames –Delay x bandwidth worth of them –Must be buffered until they get ACK As acknowledgments start to arrive, outstanding frames are liberated Once the window is extended, more frames can be sent

ICOM 6115©Manuel Rodriguez-Martinez Sliding Window Algorithm

ICOM 6115©Manuel Rodriguez-Martinez Sliding Window Sender Basics Each frame can be assigned a sequence number Sender must keep the following state –SWS – sender window size Number of frames I can have outstanding –LAR – Last Acknowledge Frame Last one receive told me she got! –LFS – Last frame sent Invariant: LFS – LAR <= SWS

ICOM 6115©Manuel Rodriguez-Martinez Sender Side of Sliding Windows Outstanding frames must be kept buffered –In case they must be retransmitted Sender can only move window to the right when it receive ACK for frame LAR + 1. –In which case LFS = LFS + 1 OutstandingFrames

ICOM 6115©Manuel Rodriguez-Martinez Sender Behavior Loop –emitting frames up to SWS –Start timers for outstanding frames –When ACK arrives If duplicate ACK do nothing If not, then mark packet as ACK and stop timer –Move window to the right by a value X X is the largest of number contiguous frames that have been ACK –LFS = LFS + X, LAR = LAR + X

ICOM 6115©Manuel Rodriguez-Martinez Sliding Window Receiver Basics Receiver must keep the following state –RWS – receiver window size Frames that must be buffered before passing to network layer –Server to put frames in order! LAF – largest acceptable frame –Frames with highest sequence number to be accepted LFR – last frame received –Last frame to got here and I have ACK Invariant: LAF – LFR <= RWS

ICOM 6115©Manuel Rodriguez-Martinez Receiver side of Sliding Window Outstanding frames must be buffered –To give them in order to network layer –Receiver can move window only when frame with seq number NFE = LFR + 1 arrives In which case, LFA = LFA + 1 LFR OutstandingFrames

ICOM 6115©Manuel Rodriguez-Martinez Receiver Behavior Loop –Read frames –When Frames arrives If duplicate frame do nothing If not, then store frame and send ACK –Move window to the right by a value X X is the largest of number contiguous frames that have been RECEIVED –LFA = LFA + X, LFR = LFR + X

ICOM 6115©Manuel Rodriguez-Martinez Some issues Lost frames cause gaps on window Slow down data transfers since windows can only move when contiguous frames have been ACK

ICOM 6115©Manuel Rodriguez-Martinez Medium Access Control (MAC) Sublayer Lower part of the Data Link Layer for multi- access networks –e.g. Bus networks like Ethernet MAC has the protocols to control which host get access to the network Logical Link Control (LLC) –Actual Data Link Services Connectionless No ACKs Connectionless with ACKs Connection-oriented with ACKs

ICOM 6115©Manuel Rodriguez-Martinez A View of the Data Link Layer

ICOM 6115©Manuel Rodriguez-Martinez Why have a LLC? Split Data Link Layer –MAC is specific to the physical network Various Flavors of Ethernet Various Flavors of WiFI (802.11a or b) –LLC is common to all Build just one version of this Permits backward compatibility or interoperability a y b share LLC –MAC is specific to interface with physical layer

ICOM 6115©Manuel Rodriguez-Martinez Example MAC sublayers IEEE – Ethernet IEEE – IBM Token Ring IEEE – Wireless LAN IEEE – Personal LAN (Bluetooth) IEEE – Broadband Wireless –Wireless Local Loop All these share a common LLC –IEEE 802.2

ICOM 6115©Manuel Rodriguez-Martinez Services provided by MAC sublayer Addressing –MAC Address Given to the network interface card Frame generation Checksum computation Error detection Arbitration for channel access –Conflict detection and resolution