CS 457 – Lecture 6 Ethernet Spring 2012.

Slides:



Advertisements
Similar presentations
Ethernet “dominant” LAN technology: cheap $20 for 100Mbs!
Advertisements

1 Links Reading: Chapter 2 COS 461: Computer Networks Spring 2006 (MW 1:30-2:50 in Friend 109) Jennifer Rexford Teaching Assistant: Mike Wawrzoniak
The ALOHA Protocol “Free for all”: whenever station has a frame to send, it does so. –Station listens for maximum RTT for an ACK. –If no ACK after a specified.
5: DataLink Layer5a-1 MAC Sublayer. 5: DataLink Layer5a-2 Multiple Access Links and Protocols Two types of “links”: r point-to-point m PPP for dial-up.
5: DataLink Layer5-1 Data Link Layer r What is Data Link Layer? r Multiple access protocols r Ethernet.
5-1 Data Link Layer r What is Data Link Layer? r Multiple access protocols r Link-layer Addressing r Ethernet.
1 Announcement r Homework #3 was due last night r Homework #4 is out.
Links COS 461: Computer Networks Spring 2011 Mike Freedman
EE 122: Ethernet and Ion Stoica September 18, 2002 (* this talk is based in part on the on-line slides of J. Kurose & K. Rose)
1 Link Layer Message M A B Problem: Given a message M at a node A consisting of several packets, how do you send the packets to a “neighbor” node B –Neighbor:
DataLink Layer session 1 TELE3118: Network Technologies Week 2: Data Link Layer Framing, Error Control, Multiple Access Some slides have been taken.
EEC-484/584 Computer Networks Lecture 13 Wenbing Zhao
5-1 Data Link Layer r Today, we will study the data link layer… r This is the last layer in the network protocol stack we will study in this class…
5: DataLink Layer5-1 Link Layer – Error Detection/Correction and MAC.
5: DataLink Layer5-1 Chapter 5 Link Layer and LANs Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross.
16 – CSMA/CD - ARP Network Layer4-1. 5: DataLink Layer5-2 CSMA (Carrier Sense Multiple Access) CSMA: listen before transmit: If channel sensed idle: transmit.
EEC-484/584 Computer Networks Lecture 13 Wenbing Zhao
Lecture 16 Random Access protocols r A node transmits at random at full channel data rate R. r If two or more nodes “collide”, they retransmit at random.
Link Layer Zeinab Movahedi Some slides are from Computer networks course thought by Jennifer Rexford at Princeton University.
Introduction1-1 Data Communications and Computer Networks Chapter 5 CS 3830 Lecture 26 Omar Meqdadi Department of Computer Science and Software Engineering.
5: DataLink Layer5-1 LAN technologies Data link layer so far: m services, error detection/correction, multiple access Next: LAN technologies m addressing.
1 Random Access Protocols r When node has packet to send m transmit at full channel data rate R. m no a priori coordination among nodes  two or more transmitting.
1 Link-Layer Contention EE 122: Intro to Communication Networks Fall 2007 (WF 4-5:30 in Cory 277) Vern Paxson TAs: Lisa Fowler, Daniel Killebrew & Jorge.
Links Mike Freedman COS 461: Computer Networks Lectures: MW 10-10:50am in CS 104
Introduction1-1 Data Communications and Computer Networks Chapter 5 CS 3830 Lecture 27 Omar Meqdadi Department of Computer Science and Software Engineering.
5: DataLink Layer5-1 Ethernet “dominant” wired LAN technology: r cheap $20 for 100Mbs! r first widely used LAN technology r Simpler, cheaper than token.
1 Computer Communication & Networks Lecture 13 Datalink Layer: Local Area Network Waleed Ejaz
4-1 Last time □ Link layer overview ♦ Services ♦ Adapters □ Error detection and correction ♦ Parity check ♦ Internet checksum ♦ CRC □ PPP ♦ Byte stuffing.
NUS.SOC.CS2105 Ooi Wei Tsang Application Transport Network Link Physical you are here.
Multiple Access Readings: Kurose & Ross, 5.3, 5.5.
Data Link Layer Moving Frames. Link Layer Protocols: ethernet, wireless, Token Ring and PPP Has node-to-node job of moving network layer.
4: DataLink Layer1 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single wire, e.g. PPP, SLIP) r broadcast (shared wire.
1 Week 5 Lecture 3 Data Link Layer. 2 Data Link Layer location application: supporting network applications –FTP, SMTP, STTP transport: host-host data.
5: DataLink Layer5-1 The Data Link Layer Chapter 5 Kurose and Ross Today 5.1 and 5.3.
5: DataLink Layer5-1 CSMA (Carrier Sense Multiple Access) CSMA: listen before transmit: If channel sensed idle: transmit entire frame r If channel sensed.
5: DataLink Layer5-1 Chapter 5 Link Layer and LANs Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition. Jim Kurose, Keith Ross.
5: DataLink Layer 5a-1 Multiple Access protocol. 5: DataLink Layer 5a-2 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single.
Data Link Layer. Useful References r Wireless Communications and Networks by William Stallings r Computer Networks (third edition) by Andrew Tanenbaum.
5: DataLink Layer5a-1 Chapter 5: The Data Link Layer Last time: r link layer services r error detection, correction r multiple access protocols and LANs.
Ch 5. The Link Layer and Local Area Networks Myungchul Kim
EE 122: Lecture 6 Ion Stoica September 13, 2001 (* this talk is based in part on the on-line slides of J. Kurose & K. Rose)
1 Ethernet “dominant” LAN technology: cheap $20 for 100Mbs! first widely used LAN technology Simpler, cheaper than token LANs and ATM Kept up with speed.
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.
5: DataLink Layer5-1 Chapter 5: The Data Link Layer Our goals: r understand principles behind data link layer services: m error detection, error correction.
Transport Layer 3-1 Chapter 5 Link Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012  CPSC.
5: DataLink Layer5-1 Link Layer r 5.1 Introduction and services r 5.2 Error detection and correction r 5.3Multiple access protocols r 5.4 Link-layer Addressing.
Links Mike Freedman COS 461: Computer Networks Lectures: MW 10-10:50am in Architecture N101
CS 457 – Lecture 3 Link Layer Protocols Fall 2011.
5: DataLink Layer5-1 Slotted ALOHA Assumptions r all frames same size r time is divided into equal size slots, time to transmit 1 frame r nodes start to.
5-1 Last time □ Multiple access protocols ♦ Channel partitioning MAC protocols TDMA, FDMA ♦ Random access MAC protocols Slotted Aloha, Pure Aloha, CSMA,
Example DLL Protocols 1. High-Level Data Link Control (HDLC).
Link Layer 5.1 Introduction and services
Getting Connected (Chapter 2 Part 4)
Chapter 5 Link Layer A note on the use of these ppt slides:
CS4470 Computer Networking Protocols
Random Access Protocols
Chapter 5 Link Layer and LANs
Computer Communication Networks
Chapter 5: The Data Link Layer
Data Link Issues Relates to Lab 2.
Services of DLL Framing Link access Reliable delivery
Multiple access.
2012 session 1 TELE3118: Network Technologies Week 2: Data Link Layer Framing, Error Control, Multiple Access Some slides have been taken from: Computer.
Data Link Issues Relates to Lab 2.
Links Jennifer Rexford COS 461: Computer Networks
Overview Jaringan Komputer (3)
Link Layer and LANs Not everyone is meant to make a difference. But for me, the choice to lead an ordinary life is no longer an option 5: DataLink Layer.
Link Layer 5.1 Introduction and services
Link Layer: Multiple Access
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.
Presentation transcript:

CS 457 – Lecture 6 Ethernet Spring 2012

Point to Point Link Summary One sender, One receiver, One link For Point to Point Links, showed How To Encode bits on the wire (wireless channel) Send and receive data frames Detect errors in the frame Use a sliding window to make the link reliable What if multiple sender/receivers share the link?

Adaptors Communicating datagram link layer protocol frame frame sending node adapter adapter receiving node Link layer implemented in adaptor Ethernet card, PCMCIA card, 802.11 card Sending side: Encapsulates datagram in a frame Adds error checking bits, flow control, etc. Receiving side Looks for errors, flow control, etc. Extracts datagram and passes to receiving node New problem: more than 2 adaptors on same wire

“Taking Turns” MAC protocols Token passing token passed from one node to next sequentially Concerns: Token overhead Latency Single point of failure (token) Token regeneration Polling Master node “invites” slave nodes to transmit in turn Concerns: Polling overhead Latency Single point of failure (master)

Random Access Protocols When node has packet to send Transmit at full channel data rate R. No a priori coordination among nodes Two or more transmit: collision! Random access MAC protocol specifies: How to detect collisions How to recover from collisions Examples ALOHA and Slotted ALOHA CSMA, CSMA/CD, CSMA/CA

Key Ideas of Random Access Carrier sense Listen before speaking, and don’t interrupt Checking if someone else is already sending data … and waiting till the other node is done Collision detection If someone else starts talking at the same time, stop Realizing when two nodes are transmitting at once …by detecting that the data on the wire is garbled Randomness Don’t start talking again right away Waiting for a random time before trying again

CSMA (Carrier Sense Multiple Access) Collisions hurt the efficiency of ALOHA protocol At best, channel is useful 37% of the time CSMA: listen before transmit If channel sensed idle: transmit entire frame If channel sensed busy, defer transmission Human analogy: don’t interrupt others!

CSMA Collisions Collisions can still occur: Collision: propagation delay means two nodes may not hear each other’s transmission Collision: entire packet transmission time wasted

CSMA/CD (Collision Detection) CSMA/CD: carrier sensing, deferral as in CSMA Collisions detected within short time Colliding transmissions aborted, reducing wastage Collision detection Easy in wired LANs: measure signal strengths, compare transmitted, received signals Difficult in wireless LANs: receiver shut off while transmitting Human analogy: the polite conversationalist

CSMA/CD Collision Detection

Ethernet Dominant wired LAN technology: First widely used LAN technology Simpler, cheaper than token LANs and ATM Kept up with speed race: 10 Mbps – 10 Gbps or more Metcalfe’s Ethernet sketch

Ethernet Uses CSMA/CD Carrier sense: wait for link to be idle Channel idle: start transmitting Channel busy: wait until idle Collision detection: listen while transmitting No collision: transmission is complete Collision: abort transmission, send jam signal Random access: exponential back-off After collision, wait a random time before trying again After mth collision, pick K randomly from {0, …, 2m-1} … and wait for K*512 bit times before trying again

Limitations on Ethernet Length B A latency d Latency depends on physical length of link Time to propagate a packet from one end to the other Suppose A sends a packet at time t And B sees an idle line at a time just before t+d … so B happily starts transmitting a packet B detects a collision, and sends jamming signal But A doesn’t see collision till t+2d

Limitations on Ethernet Length B A latency d A needs to wait for time 2d to detect collision So, A should keep transmitting during this period … and keep an eye out for a possible collision Imposes restrictions on Ethernet Maximum length of the wire: 2500 meters Minimum length of the packet: 512 bits (64 bytes) Limitations less relevant with switched networks? Still have to do broadcast..

Ethernet Frame Structure Sending adapter encapsulates packet in frame Preamble: synchronization Seven bytes with pattern 10101010, followed by one byte with pattern 10101011 Used to synchronize receiver, sender clock rates

Ethernet Frame Structure (Cont.) Addresses: source and destination MAC addresses Adaptor passes frame to network-level protocol If destination address matches the adaptor Or the destination address is the broadcast address Otherwise, adapter discards frame Type: indicates the higher layer protocol Usually IP But also Novell IPX, AppleTalk, … CRC: cyclic redundancy check Checked at receiver If error is detected, the frame is simply dropped