CS380 Int. to Comp. Networks Data Link Networks - Part II1 Reliable Transmission How to fix corrupted frames. –Error correcting codes too expensive –Should.

Slides:



Advertisements
Similar presentations
Nick Feamster CS 4251 Computer Networking II Spring 2008
Advertisements

TCP Sliding Windows, Flow Control, and Congestion Control Lecture material taken from Computer Networks A Systems Approach, Fourth Ed.,Peterson and Davie,
Ethernet. Most successful local area networking technology of last 20 years. Developed in the mid-1970s by researchers at the Xerox Palo Alto Research.
2.5 Reliable Transmission
Chapter 2: Direct Link Networks (continued) Slide Set 5.
Spring 2002CS 4611 Outline Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.
Chapter 2 Designing Reliable Protocols Professor Rick Han University of Colorado at Boulder
CSE331: Introduction to Networks and Security Lecture 5 Fall 2002.
1 Outline Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.
ACN: TCP Sliding Windows1 TCP Sliding Windows, with Flow Control, and Congestion Control Based on Peterson and Davie Textbook.
Advanced Computer Networks : TCP Sliding Windows1 TCP Sliding Windows, Flow Control, and Congestion Control Lecture material taken from “Computer Networks.
Spring 2002CS 4611 Shared Access Networks Outline Bus (Ethernet) Token ring (FDDI) Wireless (802.11)
Spring 2004 EE4272 Direct Link Networks (I) Hardware Building Blocks (nodes & links) 5 Issues before Exchanging Packets  Encoding  Framing  Error Detection.
Distributed systems Module 1 -Basic networking Teaching unit 1 – LAN standards Ernesto Damiani University of Bozen-Bolzano Lesson 4 – Ethernet frame.
Spring 2003CS 4611 Outline Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.
Networking. Protocol Stack Generally speaking, sending an message is equivalent to copying a file from sender to receiver.
Distributed Systems Module 1 -Basic networking Teaching unit 1 – LAN standards Ernesto Damiani University of Bozen-Bolzano Lesson 3 – Introduction to Ethernet.
Ethernet Outline Multiple Access and Ethernet Intro Ethernet Framing CSMA/CD protocol Exponential backoff.
18-Aug-154/598N: Computer Networks Overview Direct link networks –Error detection - Section 2.4 –Reliable transmission - Section 2.5.
CSCI-1680 Link Layer Based partly on lecture notes by David Mazières, Phil Levis, John Jannotti Rodrigo Fonseca.
Spring 2006CS 3321 Chapter 2 Tidbits Outline A little hardware Ethernet Realistic data transfer rates.
Principles of Reliable Data Transfer. Reliable Delivery Making sure that the packets sent by the sender are correctly and reliably received by the receiver.
ECE 4450:427/527 - Computer Networks Spring 2015 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 5.3: Reliable Transmission Dr. Nghi.
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 16.
Network Technologies Chapter 2. Approaches to Network Communication Connection-Oriented –Circuit-switched –A dedicated connection (circuit) is formed.
14-Oct-15Computer Networks1 Reliable Transmission.
Ethernet Fundamentals. The success of Ethernet is due to the following factors: Simplicity and ease of maintenance Ability to incorporate new technologies.
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 15.
1 Transport Layer Lecture 10 Imran Ahmed University of Management & Technology.
Chapter Six The Data Link Layer. Objectives Learn about physical addressing on the network. Explore the MAC and LLC sublayers of Data Link. Get introduced.
Spring 2001CS 5851 Outline Building Blocks Shannon’s Theorem Encoding 11. Physical Layer.
Transport Layer: Sliding Window Reliability
1 Multiple Access: Ethernet Section Point-to-Point vs. Broadcast Media Point-to-point –PPP for dial-up access –Point-to-point link between Ethernet.
1 Direct Link Networks: Reliable Transmission Sections 2.5.
CSE331: Introduction to Networks and Security Lecture 4 Fall 2002.
Computer Networking Lecture 16 – Reliable Transport.
1 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
1 Computer Networks: A Systems Approach, 5e Larry L. Peterson and Bruce S. Davie Chapter 2 Getting Connected Copyright © 2010, Elsevier Inc. All rights.
Go-Back-N ARQ packets transmitted continuously (when available) without waiting for ACK, up to N outstanding, unACK’ed packets a logically different sender.
Example DLL Protocols 1. High-Level Data Link Control (HDLC).
Reliable Transmission
The University of Adelaide, School of Computer Science
Getting Connected (Chapter 2 Part 3)
Networks Lecture 7.
B. R. Chandavarkar CSE Dept., NITK Surathkal
2. Getting connected (part 2)
Ethernet Outline Multiple Access and Ethernet Intro Ethernet Framing
CS 457 – Lecture 6 Ethernet Spring 2012.
Introduction of Transport Protocols
ECE 4450:427/527 - Computer Networks Spring 2017
Data Link Layer: Data Link Control
Getting Connected (Chapter 2 Part 3)
Reliable transmission
Point-to-Point Links Outline Encoding Framing Error Detection
Ethernet Neil Tang 9/17/2008 CS440 Computer Networks.
CSS432 (Link Level Protocols) Reliable Transmission Textbook Ch 2.5
Outline A little hardware Ethernet Realistic data transfer rates
TCP Sliding Windows, Flow Control, and Congestion Control
Advanced Computer Networks
Getting Connected (Chapter 2 Part 3)
The Transport Layer Reliability
Transport Layer Outline Intro to transport UDP
Ethernet Outline Multiple Access and Ethernet Intro Ethernet Framing
Dr. Mozafar Bag-Mohammadi Ilam University
Ethernet 16EC351 Computer networks unit II Mr.M.Jagadesh,AP/ECE.
TCP Sliding Windows, Flow Control, and Congestion Control
LAN Addresses and ARP IP address: drives the packet to destination network LAN (or MAC or Physical) address: drives the packet to the destination node’s.
Error detection: Outline
Ethernet Outline Multiple Access and Ethernet Intro Ethernet Framing
TCP Sliding Windows, Flow Control, and Congestion Control
Presentation transcript:

CS380 Int. to Comp. Networks Data Link Networks - Part II1 Reliable Transmission How to fix corrupted frames. –Error correcting codes too expensive –Should discard frames (retransmission) Recover from Corrupt Frames should be done in the Link Level

CS380 Int. to Comp. Networks Data Link Networks - Part II2 Reliable Transmission Recovery is accomplished with two mechanisms –Acknowledgements (ACK) Small control frame (a frame with header only but no data) sent back indicating successful frame delivery –Timeouts if the sender does not receive an ACK in a predetermined time the original frame is retransmitted.

CS380 Int. to Comp. Networks Data Link Networks - Part II3 ARQ Algorithms –The general strategy of using ACKs and timeouts to implement reliable delivery is called Automatic Repeat reQuest (ARQ) –Two ARQ algorithms: Stop-and-wait Sliding Window

CS380 Int. to Comp. Networks Data Link Networks - Part II4 4 Scenarios for Stop-and-Wait Problem: If there is lost/delayed ACK like in (c) and (d), sender will times-out and retransmits frame. The receiver believes it is the next frame. What to do? A 1-bit sequence number included in the header Both (a) and (b) are fine

CS380 Int. to Comp. Networks Data Link Networks - Part II5 Stop-and-Wait with 1-bit Sequence Number Include a 1-bit sequence number (with values of 0 or 1) in the header Sequence numbers used for each frame alternate Thus, when the sender retransmits frame 0, the receiver knows that it is a second copy of frame 0 rather than the first copy of frame 1 Time Sender Receiver frame 0 frame 1 frame 0 ACK0 ACK1 ACK0

CS380 Int. to Comp. Networks Data Link Networks - Part II6 Stop-and-Wait with 1-bit Sequence Number –Main shortcoming Only one frame is sent at a time may underutilize the link capacity  not keeping the pipe full Example: 1.5Mbps link x 45ms RTT Delay x bandwidth = 67.5Kb (~8KB). Assuming frame size of 1KB, stop-and-wait uses about one-eighth of the link's capacity. Want the sender to be able to transmit up to 8 frames before having to wait for an ACK. ( Sliding Window can do that )

CS380 Int. to Comp. Networks Data Link Networks - Part II7 Sliding Window Idea: Allow sender to transmit multiple frames before receiving an ACK, thereby keeping the pipe full.There is an upper limit on the number of outstanding (un-ACKed) frames allowed. SenderReceiver T ime … … Allow multiple outstanding (un-ACKed) frames Upper bound on un-ACKed frames, called window

CS380 Int. to Comp. Networks Data Link Networks - Part II8 Sliding Window: Sender Assign sequence number to each frame ( SeqNum ) Maintain three state variables: –send window size ( SWS ) –last acknowledgment received ( LAR ) –last frame sent ( LFS ) Maintain invariant: LFS - LAR <= SWS Advance LAR when ACK arrives Buffer up to SWS frames  SWS LARLFS ……

CS380 Int. to Comp. Networks Data Link Networks - Part II9 Sliding Window : Receiver Maintain three state variables –receive window size ( RWS ) –largest acceptable frame( LAF ) –last frame received ( LFR ) Maintain invariant: LAF - LFR <= RWS Frame SeqNum arrives: –if LFR < SeqNum < = LAF accept –if SeqNum LAF discarded Send cumulative ACKs  RWS LFRLAF ……

CS380 Int. to Comp. Networks Data Link Networks - Part II10 Sequence Number Space SeqNum field is finite; sequence numbers wrap around Sequence number space must be larger then number of outstanding frames SWS <= MaxSeqNum-1 is not sufficient –suppose 3-bit SeqNum field (0..7) –SWS=RWS=7 –sender transmit frames 0..6 –arrive successfully, but ACKs lost –sender retransmits 0..6 –receiver expecting 7, 0..5, but receives second incarnation of 0..5 SWS < (MaxSeqNum + 1)/2 is correct rule Intuitively, SeqNum “slides” between two halves of sequence number space

CS380 Int. to Comp. Networks Data Link Networks - Part II11 Shared Access Networks Outline Ethernet (802.3) Token Ring (802.5) Wireless (802.11)

CS380 Int. to Comp. Networks Data Link Networks - Part II12 Ethernet (802.3) Xerox Palo Alto Research Center(PARC) created Ethernet in the mid-1970’s Uses a technology called Carrier Sense, Multiple Access with Collision Detect(CSMA/CD) Multiple Access – nodes send/receive data over a shared link Carrier Sense – all nodes distinguish between idle/busy link Collision Detection – node monitors transmission and detects collision

CS380 Int. to Comp. Networks Data Link Networks - Part II13 Ethernet (802.3) Beginnings in an early packet radio system called Aloha developed at the University of Hawaii DEC, Intel, and Xerox defined a 10 Mbps Ethernet standard in This formed the basis of the IEEE standard called  Wider collection of physical media  Faster version 100 Mbps Fast Ethernet 1000 Mbps Gigabit Ethernet

CS380 Int. to Comp. Networks Data Link Networks - Part II14 Ethernet Physical Properties Host Adaptor Transceiver Ethernet Cable Transceiver sends/receives data and detects when the line is idle Adaptor contains all the logic for the protocol (not the transceiver) Use Manchester encoding

CS380 Int. to Comp. Networks Data Link Networks - Part II15 Ethernet Physical Properties: Repeater Hosts Terminators Repeaters join multiple Ethernet segments  forwards signals on all outgoing segments  can support up to 4 repeaters Terminators avoid bounce-back Can support up to 1024 hosts

CS380 Int. to Comp. Networks Data Link Networks - Part II16 Ethernet Hub Hubs Multiway repeater (sometimes called hub)

CS380 Int. to Comp. Networks Data Link Networks - Part II17 Access Protocol for Ethernet Controls access to the shared Ethernet link Called the Ethernet’s Media Access Control (MAC) protocol Usually implemented in hardware on the adaptor

CS380 Int. to Comp. Networks Data Link Networks - Part II18 Ethernet Frame Format PreambleDestSrc Type Body CRC Preamble – synch bits for signal – alternating O’s and 1’s Type – demultiplexing key (which of the higher level protocols does the frame belong?)

CS380 Int. to Comp. Networks Data Link Networks - Part II19 Ethernet Addresses Ethernet adaptors have unique addresses Burned into ROM Series of six one-byte numbers(a pair of hexadecimal digits) 8:0:2b:e4:b1: Each manufacturer is assigned a 24-bit prefix Example: Advanced Micro Devices has been assigned the 24-bit prefix 8:0:20

CS380 Int. to Comp. Networks Data Link Networks - Part II20 Ethernet Addresses Ethernet adaptors receive all frames Ethernet adaptors accept: - frames addressed to its own address - frames addressed to the broadcast address - frames addressed to a multicast address - all frames, if placed into promiscuous mode (Note: an adaptor can be programmed to run in promiscuous mode)

CS380 Int. to Comp. Networks Data Link Networks - Part II21 Ethernet Transmission Algorithm The sender’s side is where the action is If an adaptor has a frame to send and the line is idle, the frames is transmitted immediately If an adaptor has a frame to send and the line is busy, it waits for the line to go idle then transmits immediately Collision - two adaptors find the line idle do they transmit their packets which collide 96-bit transmission if adaptor detects collision (64b preamble + 32b jamming sequence) Once a collision is detected and stopped the adaptor will wait some time and try again. This time is called exponential backoff - each time it tries to transmit but fails results in doubling the delay interval between tries

CS380 Int. to Comp. Networks Data Link Networks - Part II22 Collisions AB AB AB AB

CS380 Int. to Comp. Networks Data Link Networks - Part II23 Experience with Ethernet Works well for 30% or less utilization otherwise network capacity is wasted Most Ethernets have fewer than 200 hosts (1024 maximum) Easy to administer, there are no: - switches - routers Easy to add new hosts

CS380 Int. to Comp. Networks Data Link Networks - Part II24 Network Adaptors Network Adaptor - framing - error detection - media access protocol ARQ(Automatic Repeat reQuest) algorithm is typically handled one layer up running on the host Device Driver – a collection of OS routines that effectively anchor the protocol graph to the network hardware