Ethernet. Introduction. CSE 3213 Fall 2011

Similar documents
Data and Computer Communications

Lecture 05 Chapter 16 High Speed LANs

Data and Computer Communications. Chapter 11 Local Area Network

RMIT University. Data Communication and Net-Centric Computing COSC 1111/2061/1110. Lecture 8. Medium Access Control Methods & LAN

Introduction Computer Networks. Applications Requiring High Speed LANs. Why High Speed LANs? IEEE802.3 Medium Access Control

High Speed LANs. Range of technologies. Fast and Gigabit Ethernet Fibre Channel High Speed Wireless LANs. CS420/520 Axel Krings Page 2

COS 140: Foundations of Computer Science

Contention Protocols and Networks

COS 140: Foundations of Computer Science

EITF25 Internet Techniques and Applications L4: Network Access. Stefan Höst

LANs. Local Area Networks. via the Media Access Control (MAC) SubLayer. Networks: Local Area Networks

Data Link Layer, Part 3 Medium Access Control. Preface

CSMA/CD (Collision Detection)

Data Link Layer, Part 5. Medium Access Control

LAN PROTOCOLS. Beulah A AP/CSE

Data Link Layer -2- Network Access

LECTURE PLAN. Script. Introduction about MAC Types o ALOHA o CSMA o CSMA/CD o CSMA/CA

Data Link Layer -2- Network Access

High Level View. EE 122: Ethernet and Random Access protocols. Medium Access Protocols

Random Assignment Protocols

Multiple Access Protocols

EE 122: Ethernet and

CMPE 257: Wireless and Mobile Networking

Jaringan Komputer. Broadcast Network. Outline. MAC (Medium Access Control) Channel Allocation Problem. Dynamic Channel Allocation

Networks Homework # 2

Computer Networks Medium Access Control. Mostafa Salehi Fall 2008

Local Area Networks (LANs) SMU CSE 5344 /

CS 716: Introduction to communication networks. - 9 th class; 19 th Aug Instructor: Sridhar Iyer IIT Bombay

Medium Access Control Sublayer

Topics. Link Layer Services (more) Link Layer Services LECTURE 5 MULTIPLE ACCESS AND LOCAL AREA NETWORKS. flow control: error detection:

COMMUNICATION NETWORKS NETW 501

Unit 7 Media Access Control (MAC)

Chapter 6 Medium Access Control Protocols and Local Area Networks

Access Technologies! Fabio Martignon

Local Area Networks. Aloha Slotted Aloha CSMA (non-persistent, 1-persistent, p-persistent) CSMA/CD Ethernet Token Ring

Protocols for Multiaccess Networks

COMP476 Networked Computer Systems. Polling. Sharing the Wire. LAN Technologies. COMP476 Networked Computer Systems 1

ECEN 5032 Data Networks Medium Access Control Sublayer

CARRIER SENSE MULTIPLE ACCESS (CSMA):

Media Access Control (MAC) Sub-layer and Ethernet

Computer Networks. Medium Access Sublayer (Part I)

Chapter 4. The Medium Access Control Sublayer. Points and Questions to Consider. Multiple Access Protocols. The Channel Allocation Problem.

Direct Link Networks (II)

Random Access. 1. Aloha. 2. Slotted Aloha 3. CSMA 4. CSMA/CD

Outline. Introduction to Networked Embedded Systems - Embedded systems Networked embedded systems Embedded Internet - Network properties

EECS Introduction to Computer Networking. Local Area Networks / Ethernet. Hub

Getting Connected (Chapter 2 Part 4) Networking CS 3470, Section 1 Sarah Diesburg

Local Area Networks transmission system private speedy and secure kilometres shared transmission medium hardware & software

Communication (III) Kai Huang

CS 43: Computer Networks Media Access. Kevin Webb Swarthmore College November 30, 2017

Computer Network Fundamentals Spring Week 3 MAC Layer Andreas Terzis

Link Layer and Ethernet

Link Layer and Ethernet

LAN Protocols. Required reading: Forouzan 13.1 to 13.5 Garcia 6.7, 6.8. CSE 3213, Fall 2015 Instructor: N. Vlajic

Medium Access Control. CSCI370 Lecture 5 Michael Hutt New York Institute of Technology

CHAPTER 7 MAC LAYER PROTOCOLS. Dr. Bhargavi Goswami Associate Professor & Head Department of Computer Science Garden City College

Aloha and slotted aloha

ECE 4450:427/527 - Computer Networks Spring 2017

Chapter 4. The Medium Access Control Sublayer

Lecture 5 The Data Link Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it

Networking Technologies and Applications

College of Computer and Information Sciences Department of Computer Engineering CEN444 Computer Networks Midterm 2 Exam Second Semester 1434/1435

Redes de Computadores. Medium Access Control

CHAPTER 15 LOCAL AREA NETWORKS ANSWERS TO QUESTIONS

EITF25 Internet- - Techniques and Applica8ons Stefan Höst. L5 Data link (part 2)

CS 43: Computer Networks. 27: Media Access Contd. December 3, 2018

The Link Layer and LANs. Chapter 6: Link layer and LANs

CSE 461 Multiple Access. David Wetherall

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 16

Lecture 6 The Data Link Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it

The random access methods we study in this chapter have evolved from a very interesting protocol known as ALOHA, which used a very simple procedure

Data Link Layer: Collisions

Problem Set Name the 7 OSI layers and give the corresponding functionalities for each layer.

Fibre Channel: This standard provides a low-cost, easily scalable approach to achieving very high data rates in local areas.

Introduction to Computer Networks. IEEE Ethernet

Outline: Connecting Many Computers

Ethernet. Networks: Ethernet 1

CSE 461: Multiple Access Networks. This Lecture

Chapter 12 Multiple Access 12.1

Direct Link Communication II: Wired Media. Multi-Access Communication

ECE 4450:427/527 - Computer Networks Spring 2017

Chapter 5: Link layer

Multiple Access. Data Communications and Networking

CMPE 257: Wireless and Mobile Networking

Link Layer and LANs 안상현서울시립대학교컴퓨터 통계학과.

Lecture 6: Example LAN: Ethernet

Lecture 8 The Data Link Layer part I. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it

ECE 358 MAC Examples. Xuemin (Sherman) Shen Office: EIT 4155 Phone: x

COMPUTER NETWORKS - Local area networks

Local area networks. Copyright

1-1. Switching Networks (Fall 2010) EE 586 Communication and. November 8, Lecture 30

Multiple Access Links and Protocols

Chapter 5 Link Layer and LANs

Links Reading: Chapter 2. Goals of Todayʼs Lecture. Message, Segment, Packet, and Frame

Lecture 19. Principles behind data link layer services Framing Multiple access protocols

Outline / Wireless Networks and Applications Lecture 9: Wireless LANs Aloha and 802 Wireless. Regular Ethernet CSMA/CD

Markov Chains and Multiaccess Protocols: An. Introduction

King Fahd University of Petroleum and Minerals College of Computer Sciences and Engineering Department of Computer Engineering

Data Communications. Automatic Repeat Request Medium Access Control

HIGH-SPEED LANS CHAPTER The Emergence of High-Speed LANS Ethernet Fibre Channel Recommended Reading and Web Sites

Transcription:

Ethernet CSE 3213 Fall 2011 19 October 2011 1 Introduction Rapid changes in technology designs Broader use of LANs New schemes for high-speed LANs High-speed LAN technologies: Fast and gigabit Ethernet Fiber channel High speed wireless LANs 2 1

Characteristics of Some High- Speed LANs 3 Ethernet (CSMA/CD) Medium access control: Carrier Sense Multiple Access with Collision Detection Xerox - Ethernet IEEE 802.3 4 2

CSMA/CD Precursors earliest was ALOHA developed for packet radio networks station may transmit a frame at any time if frame is determined invalid, it is ignored maximum utilization of channel about 18% next came slotted ALOHA organized slots equal to transmission time increased utilization to about 37% 5 ALOHA Developed for packet radio networks. When station has frame, it sends. Station listens (for max round trip time) plus small increment. If ACK, fine. If not, retransmit. If no ACK after repeated transmissions, give up. Frame check sequence (as in HDLC). If frame OK and address matches receiver, send ACK. Frame may be damaged by noise or by another station transmitting at the same time (collision). Any overlap of frames causes collision. Max utilization 18%. 6 3

Slotted ALOHA Time in uniform slots equal to frame transmission time. Need central clock (or other sync mechanism). Transmission begins at slot boundary. Frames either miss or overlap totally. Max utilization 37%. 7 CSMA Propagation time is much less than transmission time. All stations know that a transmission has started almost immediately. First listen for clear medium ( carrier sense ). If medium idle, transmit. If two stations start at the same instant, collision. Wait reasonable time (round trip plus ACK contention). No ACK then retransmit. 8 4

CSMA (2) Utilization far exceeds ALOHA. Max utilization depends on propagation time (medium length) and frame length. Longer frame and shorter propagation gives better utilization. First listen for clear medium ( carrier sense ). If medium idle, transmit. If medium is busy, wait for idle then transmit. This is called 1-persistent CSMA. Stations are selfish. If two or more stations waiting, collision guaranteed. Gets sorted out after collision. 9 Nonpersistent CSMA 1. If medium is idle, transmit. 2. If medium is busy, wait amount of time drawn from probability distribution (retransmission delay) and repeat 1. Random delays reduces probability of collisions. Consider two stations become ready to transmit at same time While another transmission is in progress. If both stations delay same time before retrying, both will attempt to transmit at same time. Capacity is wasted because medium will remain idle following end of transmission. Even if one or more stations waiting. Nonpersistent stations are deferential. 10 5

p-persistent CSMA Compromise that attempts to reduce collisions. Like nonpersistent And reduce idle time. Like 1-persistent Rules: 1. If medium idle, transmit with probability p, and delay one time unit with probability (1 p). Time unit typically maximum propagation delay. 2. If medium busy, listen until idle and repeat step 1. 3. If transmission is delayed one time unit, repeat step 1. What is an effective value of p? 11 Value of p? To avoid instability under heavy load. Assume n stations waiting to send. At the end of a transmission, the expected number of stations attempting to transmit is np. n = number of stations ready to transmit p = probability of transmitting If np > 1 on average there will be a collision. Repeated attempts to transmit almost guarantee more collisions. Retries compete with new transmissions. Eventually, all stations will try to send. Continuous collisions; zero throughput So we want np < 1 for expected peaks of n. If heavy load expected, p should be small. However, as p is made smaller, stations will wait longer. At low loads, this gives very long delays. 12 6

CSMA/CD With CSMA, collision occupies medium for duration of transmission capacity wasted. To reduce this waste, stations continue to listen to medium while transmitting. Use CSMA/CD (see next slide). Important rule: frames should be long enough to allow collision detection prior to the end of transmission. Shorter frames: collision detection does not occur. CSMA/CD performance same as CSMA. 13 Description of CSMA/CD 1.If the medium is idle, transmit; otherwise, go to step 2. 2.If the medium is busy, continue to listen until the channel is idle, then transmit immediately. 3.If a collision is detected during transmission, transmit a brief jamming signal to assure that all stations know that there has been a collision and then cease transmission. 4.After transmitting the jamming signal, wait a random amount of time, referred to as the backoff, then attempt to transmit again (repeat from step 1). 7

CSMA/CD Operation 15 Which Persistence Algorithm? IEEE 802.3 uses 1-persistent. Nonpersistent: capacity wasted. p-persistent: low p to avoid instability under high loads, but will cause long delays under light loads. 1-persistent (p = 1) seems more unstable than p- persistent due to the greed of the stations. But wasted time due to collisions is short (if frames are long relative to propagation delay). With random backoff, unlikely to collide on next tries. To ensure backoff maintains stability, IEEE 802.3 and Ethernet use binary exponential backoff. 16 8

Binary Exponential Backoff Attempt to transmit repeatedly if repeated collisions First 10 attempts, mean value of random delay doubled Value then remains the same for 6 further attempts After 16 unsuccessful attempts, station gives up and reports error As congestion increases, stations back off by larger amounts to reduce the probability of collision. 1-persistent algorithm with binary exponential backoff efficient over wide range of loads Low loads, 1-persistence guarantees station can seize channel once idle High loads, at least as stable as other techniques Backoff algorithm gives last-in, first-out effect Stations with no or few collisions transmit first 17 Ethernet MAC Summary Random Access Stations access medium randomly Contention Stations content for time on medium CSMA/CD with 1-persistent binary exponential backoff 18 9

Collision Detection on baseband bus collision produces higher signal voltage collision detected if cable signal greater than single station signal signal is attenuated over distance limit to 500m (10Base5) or 200m (10Base2) on twisted pair (star-topology) activity on more than one port is collision use special collision presence signal IEEE 802.3 MAC Frame Format 10

10-Mbps Ethernet Specifications High Speed Ethernet (16.2) 100-Mbps (Fast Ethernet) Gigabit Ethernet 10-Gbps Ethernet 40-Gbps Ethernet 100-Gbps Ethernet 22 11

Reading Chapter 16, Stallings book Assigned reading: Section 16.2 High Speed Ethernet 23 12