EEC-484/584 Computer Networks

Slides:



Advertisements
Similar presentations
University of Calgary – CPSC 441.  We need to break down big networks to sub-LANs  Limited amount of supportable traffic: on single LAN, all stations.
Advertisements

Chapter 6 Wireless and Mobile Networks Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A note on.
6: Wireless and Mobile Networks6-1 Chapter 6 Wireless and Mobile Networks A note on the use of these ppt slides: We’re making these slides freely available.
Overview r Ethernet r Hubs, bridges, and switches r Wireless links and LANs.
20 – Collision Avoidance, : Wireless and Mobile Networks6-1.
6: Wireless and Mobile Networks6-1 Chapter 6: Wireless and Mobile Networks Background: r # wireless (mobile) phone subscribers now exceeds # wired phone.
1 Elements of a wireless network network infrastructure wireless hosts r laptop, PDA, IP phone r run applications r may be stationary (non- mobile) or.
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…
6/2/05CS118/Spring051 Chapter 6: Wireless and Mobile Networks r Cover the following sections only:  6.3: wireless LANs  6.5: mobility management:
5-1 Data Link Layer r Wireless Networks m Wi-Fi (Wireless LAN) Example Problems m RTS/CTS.
Review r Error Detection: CRC r Multiple access protocols m Slotted ALOHA m CSMA/CD r LAN addresses and ARP r Ethernet Some slides are in courtesy of J.
5-1 Data Link Layer r What is Data Link Layer? r Wireless Networks m Wi-Fi (Wireless LAN) r Comparison with Ethernet.
8/7/20151 Mobile Computing COE 446 Wireless Multiple Access Tarek Sheltami KFUPM CCSE COE hthttp://faculty.kfupm.edu.sa/coe/tarek/coe446.htm Principles.
Introduction 1 Lecture 25 Link Layer (Ethernet, Switch) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science & Engineering.
DataLink Layer1 Ethernet Technologies: 10Base2 10: 10Mbps; 2: 200 meters (actual is 185m) max distance between any two nodes without repeaters thin coaxial.
6: Wireless and Mobile Networks6-1 Elements of a wireless network network infrastructure wireless hosts r laptop, PDA, IP phone r run applications r may.
Chapter 6 Wireless and Mobile Networks Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A note on.
Chapter 6 Wireless and Mobile Networks Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 Wireless,
6: Wireless and Mobile Networks6-1 Chapter 6 Wireless and Mobile Networks Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition.
6: Wireless and Mobile Networks6-1 Chapter 6 Wireless and Mobile Networks Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition.
6: Wireless and Mobile Networks6-1 Chapter 6 Wireless and Mobile Networks Computer Networking: A Top Down Approach Featuring the Internet, 3 rd edition.
Adapted from: Computer Networking, Kurose/Ross 1DT066 Distributed Information Systems Chapter 6 Wireless, WiFi and mobility.
Chapter 5 outline 5.1 Introduction and services
ECE 4450:427/527 - Computer Networks Spring 2015
Wi-Fi Wireless LANs Dr. Adil Yousif. What is a Wireless LAN  A wireless local area network(LAN) is a flexible data communications system implemented.
Introduction1-1 Data Communications and Computer Networks Chapter 5 CS 3830 Lecture 27 Omar Meqdadi Department of Computer Science and Software Engineering.
Wireless Access avoid collisions: 2 + nodes transmitting at same time CSMA - sense before transmitting –don’t collide with ongoing transmission by other.
Review: –Ethernet What is the MAC protocol in Ethernet? –CSMA/CD –Binary exponential backoff Is there any relationship between the minimum frame size and.
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.
Wireless and Mobility The term wireless is normally used to refer to any type of electrical or electronic operation which is accomplished without the use.
6: Wireless and Mobile Networks6-1 Elements of a wireless network network infrastructure wireless hosts r laptop, PDA, IP phone r run applications r may.
Final Exam Wednesday 3/18/2015 Tech LR PM 1.
5: DataLink Layer5c-1 Today r Assign Homework m Ch5 #1,4,5,7,11,12 Due Wednesday October 22 m Ch5 #13-16,18,20 Due Monday, October 27 r Project #2 due.
6: Wireless and Mobile Networks6-1 Elements of a wireless network network infrastructure wireless hosts r laptop, PDA, IP phone r run applications r may.
OVERVIEW Lecture 3 Wireless Networks (2). Lecture 3: Wireless Networks 2 CDMA: two-sender interference.
6: Wireless and Mobile Networks6-1 Chapter 6 outline 6.1 Introduction Wireless r 6.2 Wireless links, characteristics m CDMA r 6.3 IEEE wireless.
Lecture 27 University of Nevada – Reno Computer Science & Engineering Department Fall 2015 CPE 400 / 600 Computer Communication Networks Prof. Shamik Sengupta.
EEC-484/584 Computer Networks Lecture 14 Wenbing Zhao
EEC-484/584 Computer Networks Lecture 14 Wenbing Zhao
5: DataLink Layer5-1 Interconnecting with hubs r Backbone hub interconnects LAN segments r Extends max distance between nodes r Multi-tier design provides.
Network and Systems Laboratory nslab.ee.ntu.edu.tw Copyright © Wireless Sensor Networks: Zigbee Stack Polly Huang Department of Electrical.
5: DataLink Layer5-1 Hubs Hubs are essentially physical-layer repeaters: m bits coming from one link go out all other links m at the same rate m no frame.
1 Chapter 4 MAC Layer – Wireless LAN Jonathan C.L. Liu, Ph.D. Department of Computer, Information Science and Engineering (CISE), University of Florida.
5: DataLink Layer5-1 Link-layer switches. 5: DataLink Layer5-2 Hubs … physical-layer (“dumb”) repeaters: m bits coming in one link go out all other links.
Spring 2006 CPE :Wireless and Mobile Networks I 1 Special Topics in Computer Engineering Wireless and Mobile Networks: I Some of these Slides are.
6-1 Last time □ Ethernet ♦ frame structure ♦ CSMA/CD algorithm □ Hubs ♦ physical-layer repeaters ♦ make one large collision domain □ Switches ♦ link-layer.
Chapter 3 Part 1 Switching and Bridging
Link Layer 5.1 Introduction and services
Chapter 6 Wireless and Mobile Networks
Wireless LANs Wireless proliferating rapidly.
Computer Communication Networks
MAC Addresses and ARP 32-bit IP address:
Chapter 4 Data Link Layer Switching
Hubs Hubs are essentially physical-layer repeaters:
ARP: Address Resolution Protocol
CSE 4905 Network Security Overview
Chapter 6 Wireless and Mobile Networks
Hubs Hubs are essentially physical-layer repeaters:
CS 457 – Lecture 7 Wireless Networks
Computer Communication & Networks
IEEE Wireless LAN wireless LANs: untethered (often mobile) networking
컴퓨터 네트워크 Chapter 4 컴퓨터 네트워크.
Elements of a wireless network
EEC-484/584 Computer Networks
Chapter 6 Wireless and Mobile Networks
ECSE-4730: Computer Communication Networks (CCN)
Elements of a wireless network
Wireless LANs CS 352, Lecture 16
Chapter 5 Data Link Layer – Hub, Switch
Elements of a wireless network
Presentation transcript:

EEC-484/584 Computer Networks Lecture 14 Wenbing Zhao wenbingz@gmail.com

EEC-484/584: Computer Networks Outline Reminder Next Monday: Ethernet, ARP, DHCP Lab Next Wed: No class Monday 12/2: Discussion Wed 12/4: quiz#4 Time to start working on the project: Topic needs my approval Link layer devices 802.11 wireless LAN 2/23/2019 EEC-484/584: Computer Networks

EEC-484/584: Computer Networks Link Layer Devices Hubs Switches 2/23/2019 EEC-484/584: Computer Networks

EEC-484/584: Computer Networks Hubs … physical-layer (“dumb”) repeaters: Bits coming in one link go out all other links at same rate All nodes connected to hub can collide with one another No frame buffering No CSMA/CD at hub: host NICs detect collisions twisted pair hub 2/23/2019 EEC-484/584: Computer Networks

EEC-484/584: Computer Networks Switch Link-layer device: smarter than hubs, take active role Store, forward Ethernet frames Examine incoming frame’s MAC address, selectively forward frame to one-or-more outgoing links when frame is to be forwarded on segment, uses CSMA/CD to access segment Transparent Hosts are unaware of presence of switches Plug-and-play, self-learning Switches do not need to be configured 2/23/2019 EEC-484/584: Computer Networks

Switch: Allows Multiple Simultaneous Transmissions Hosts have dedicated, direct connection to switch Switches buffer packets Ethernet protocol used on each incoming link, but no collisions; full duplex Each link is its own collision domain Switching: a-to-a’ and b-to-b’ simultaneously, without collisions Not possible with dumb hub C’ B 1 2 6 3 4 5 C B’ A’ switch with six interfaces (1,2,3,4,5,6) 2/23/2019 EEC-484/584: Computer Networks

Switch Table A Q: how does switch know that A’ reachable via interface 4, B’ reachable via interface 5? A: each switch has a switch table, each entry: (MAC address of host, interface to reach host, time stamp) Looks like a routing table! Q: how are entries created, maintained in switch table? Something like a routing protocol? C’ B 1 2 6 3 4 5 C B’ A’ switch with six interfaces (1,2,3,4,5,6) 2/23/2019 EEC-484/584: Computer Networks

Switch: Self-Learning Source: A Dest: A’ A A A’ Switch learns which hosts can be reached through which interfaces When frame received, switch “learns” location of sender: incoming LAN segment Records sender/location pair in switch table C’ B 1 2 6 3 4 5 C B’ A’ MAC addr interface TTL A 1 60 Switch table (initially empty) 2/23/2019 EEC-484/584: Computer Networks

Switch: Frame Filtering/Forwarding When frame received: 1. record link associated with sending host 2. index switch table using MAC dest address 3. if entry found for destination then { if dest on segment from which frame arrived then drop the frame else forward the frame on interface indicated } else flood forward on all but the interface on which the frame arrived 2/23/2019 EEC-484/584: Computer Networks

Self-Learning, Forwarding: Example Source: A Dest: A’ A A A’ C’ B Frame destination unknown: flood Destination A location known: selective send 1 2 A A’ A A’ A A’ A A’ A A’ 6 3 4 5 C A’ A B’ A’ MAC addr interface TTL A 1 60 Switch table (initially empty) A’ 4 60 2/23/2019 EEC-484/584: Computer Networks

Interconnecting Switches Switches can be connected together D E F S2 S4 S3 H I G S1 A B C Q: sending from A to G - how does S1 know to forward frame destined to G via S4 and S3? A: self learning! (works exactly the same as in single-switch case!) 2/23/2019 EEC-484/584: Computer Networks

Self-Learning Multi-Switch: Exercise Suppose C sends frame to I, I responds to C S4 1 S1 2 S3 S2 A F D I B C G H E Q: show switch tables and packet forwarding in S1, S2, S3, S4 2/23/2019 EEC-484/584: Computer Networks

Institutional Network 2/23/2019 EEC-484/584: Computer Networks

EEC-484/584: Computer Networks Switches vs. Routers Both store-and-forward devices Routers: network layer devices (examine network layer headers) Switches are link layer devices Routers maintain routing tables, implement routing algorithms Switches maintain switch tables, implement filtering, learning algorithms 2/23/2019 EEC-484/584: Computer Networks

IEEE 802.11 Wireless LAN 802.11a 5-6 GHz range up to 54 Mbps 802.11g 2.4-5 GHz range 802.11n: multiple antennae up to 200 Mbps 802.11b 2.4-5 GHz unlicensed spectrum up to 11 Mbps direct sequence spread spectrum (DSSS) in physical layer all hosts use same chipping code all use CSMA/CA for multiple access all have base-station and ad-hoc network versions Wireless, Mobile Networks

802.11 LAN architecture wireless host communicates with base station Internet wireless host communicates with base station base station = access point (AP) Basic Service Set (BSS) (aka “cell”) in infrastructure mode contains: wireless hosts access point (AP): base station ad hoc mode: hosts only AP hub, switch or router AP BSS 1 BSS 2 Wireless, Mobile Networks

802.11: Channels, association 802.11b: 2.4GHz-2.485GHz spectrum divided into 11 channels at different frequencies AP admin chooses frequency for AP interference possible: channel can be same as that chosen by neighboring AP! host: must associate with an AP scans channels, listening for beacon frames containing AP’s name (SSID) and MAC address selects AP to associate with may perform authentication will typically run DHCP to get IP address in AP’s subnet Wireless, Mobile Networks

802.11: passive/active scanning BBS 1 BBS 1 BBS 2 BBS 2 AP 1 AP 2 AP 1 1 AP 2 1 1 2 2 2 3 3 4 H1 H1 Passive Scanning: beacon frames sent from APs association Request frame sent: H1 to selected AP association Response frame sent: H1 to selected AP Active Scanning: Probe Request frame broadcast from H1 Probes response frame sent from APs Association Request frame sent: H1 to selected AP Association Response frame sent: H1 to selected AP Wireless, Mobile Networks

Wireless, Mobile Networks IEEE 802.11: multiple access avoid collisions: 2+ nodes transmitting at same time 802.11: CSMA - sense before transmitting don’t collide with ongoing transmission by other node 802.11: no collision detection! difficult to receive (sense collisions) when transmitting due to weak received signals (fading) can’t sense all collisions in any case: hidden terminal, fading Solution: Link layer acknowledgement Collision avoidance: CSMA/C(ollision)A(voidance) A B C A’s signal strength space C’s signal Wireless, Mobile Networks

IEEE 802.11 MAC Protocol: CSMA/CA: Link layer acknowledgement 802.11 sender 1 if sense channel idle for DIFS then transmit entire frame (no CD) 2 if sense channel busy then start random backoff time timer counts down while channel idle transmit when timer expires if no ACK, increase random backoff interval, repeat 2 802.11 receiver - if frame received OK return ACK after SIFS (ACK needed due to hidden terminal problem) sender receiver DIFS data Difs: distributed inter-frame space Sifs: short inter-frame spacing SIFS ACK Wireless, Mobile Networks

Avoiding collisions: when ack is not received in time idea: allow sender to “reserve” channel rather than random access of data frames: avoid collisions of long data frames sender first transmits small request-to-send (RTS) packets to BS using CSMA RTSs may still collide with each other (but they’re short) BS broadcasts clear-to-send CTS in response to RTS CTS heard by all nodes sender transmits data frame other stations defer transmissions avoid data frame collisions completely using small reservation packets! Wireless, Mobile Networks

Collision Avoidance: RTS-CTS exchange B AP RTS(A) RTS(B) reservation collision RTS(A) CTS(A) DATA (A) ACK(A) defer time Wireless, Mobile Networks