Chapter 3 Part 1 Switching and Bridging

Slides:



Advertisements
Similar presentations
Interconnection: Switching and Bridging CS 4251: Computer Networking II Nick Feamster Fall 2008.
Advertisements

Communication Networks Recitation 3 Bridges & Spanning trees.
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.
Review r Error Detection: CRC r Multiple access protocols m Slotted ALOHA m CSMA/CD r Homework 3 out r Project 3 out, link state only. Some slides are.
CPSC 441 TUTORIAL TA: FANG WANG HUBS, SWITCHES AND BRIDGES Parts of the slides contents are courtesy of the following people: Jim Kurose, Keith Ross:
5/31/05CS118/Spring051 twisted pair hub 10BaseT, 100BaseT, hub r T= Twisted pair (copper wire) r Nodes connected to a hub, 100m max distance r Hub: physical.
1 Computer Networks Internetworking Devices. 2 Repeaters Hubs Bridges –Learning algorithms –Problem of closed loops Switches Routers.
1 Interconnection ECS 152A. 2 Interconnecting with hubs r Backbone hub interconnects LAN segments r Extends max distance between nodes r But individual.
1 Interconnecting LAN segments Repeaters Hubs Bridges Switches.
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.
Introduction to Computer Networks 09/23 Presenter: Fatemah Panahi.
DataLink Layer1 Ethernet Technologies: 10Base2 10: 10Mbps; 2: 200 meters (actual is 185m) max distance between any two nodes without repeaters thin coaxial.
Connecting LANs, Backbone Networks, and Virtual LANs
Lecture 17 Ethernet r Widely deployed because: m First LAN technology m Simpler and less expensive than token LANs and ATM m Kept up with the speed race:
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.
Network Devices.
 Network Segments  NICs  Repeaters  Hubs  Bridges  Switches  Routers and Brouters  Gateways 2.
5: DataLink Layer5a-1 Chapter 5: The Data Link Layer Last time: r multiple access protocols and LANs r link layer addressing, ARP r specific link layer.
ECE 4450:427/527 - Computer Networks Spring 2015 Dr. Nghi Tran Department of Electrical & Computer Engineering Lecture 6.1: Internetworking Dr. Nghi Tran.
Review: –Ethernet What is the MAC protocol in Ethernet? –CSMA/CD –Binary exponential backoff Is there any relationship between the minimum frame size and.
Networks and Protocols CE Week 2a. Network hardware.
Sem1 - Module 8 Ethernet Switching. Shared media environments Shared media environment: –Occurs when multiple hosts have access to the same medium. –For.
NET 324 D Networks and Communication Department Lec1 : Network Devices.
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.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
CCNA Guide to Cisco Networking Chapter 2: Network Devices.
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 Layer5-1 Interconnecting with hubs r Backbone hub interconnects LAN segments r Extends max distance between nodes r Multi-tier design provides.
5: DataLink Layer 5a-1 Bridges and spanning tree protocol Reference: Mainly Peterson-Davie.
4: DataLink Layer1 Hubs r Physical Layer devices: essentially repeaters operating at bit levels: repeat received bits on one interface to all other interfaces.
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.
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.
Lec # 25 Computer Network Muhammad Waseem Iqbal. Learn about the Internetworking Devices – Repeaters – Hubs – Switches – Bridges – Routers.
Connectors, Repeaters, Hubs, Bridges, Switches, Routers, NIC’s
1 Packet Switching Outline Switching and Forwarding Bridges and Extended LANs.
5-1 Last time □ Multiple access protocols ♦ Channel partitioning MAC protocols TDMA, FDMA ♦ Random access MAC protocols Slotted Aloha, Pure Aloha, CSMA,
Chapter 16– Connecting LANs
Chapter 3 Part 3 Switching and Bridging
Chapter 3: Packet Switching (overview)
Link Layer 5.1 Introduction and services
Internetworking (Part II)
Networking Devices.
Packet Switching Outline Store-and-Forward Switches
Lab 2 – Hub/Switch Data Link Layer
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
Chapter 3 Part 1 Switching and Bridging
Lab 2 – Hub/Switch Data Link Layer
CS 457 – Lecture 8 Switching and Forwarding
Mac Addressing, Ethernet, and Interconnections
Chapter 3 Part 3 Switching and Bridging
Hubs Hubs are essentially physical-layer repeaters:
Connecting LANs, Backbone Networks,
EEC-484/584 Computer Networks
Chapter 6 The Link Layer and LANs
Communication Networks NETW 501
CS4470 Computer Networking Protocols
EEC-484/584 Computer Networks
18: Ethernet, Hubs, Bridges, Switches
Chapter 3 Part 3 Switching and Bridging
Chapter 15. Connecting Devices
LAN switching and Bridges
Packet Switching Outline Store-and-Forward Switches
ECE 4450:427/527 - Computer Networks Spring 2017
Chapter 5 Data Link Layer – Hub, Switch
Connectors, Repeaters, Hubs, Bridges, Switches, Routers, NIC’s
Internetworking (Part II)
Virtual LAN (VLAN).
Presentation transcript:

Chapter 3 Part 1 Switching and Bridging Networking CS 3470, Section 1

Why do you need to switch? So far, we’ve seen how to create small networks Switching enables us to build very large networks

What is a switch? A mechanism that allows us to interconnect links to form a large network A multi-input, multi-output device which transfers packets from an input to one or more outputs Adds the star topology to the point-to-point link, bus (Ethernet), and ring (802.5 and FDDI) topologies ** ** Picture copyright Cisco Systems, license GNU 2.5. http://en.wikipedia.org/wiki/File:Linksys48portswitch.jpg

Advantages of Switching We can interconnect switches to connect many hosts to the same network Can use point-to-point links Adding a new host to the network by connecting it to a switch does not necessarily reduce network performance for other attached hosts

The University of Adelaide, School of Computer Science 1 October 2017 Switching How does the switch decide which output port to place each packet on? It looks at the header of the packet for an identifier that it uses to make the decision Two common approaches Datagram or Connectionless approach Virtual circuit or Connection-oriented approach Also called forwarding Chapter 2 — Instructions: Language of the Computer

The University of Adelaide, School of Computer Science 1 October 2017 Forwarding Assumptions Each host has a globally unique address There is some way to identify the input and output ports of each switch We can use numbers We can use names Chapter 2 — Instructions: Language of the Computer

Types of Switching Circuit Switching Packet switching Most commonly used in telephone networks Physical connection is set up from one end to the other Data is transmitted, Connection is torn down Packet switching Data networks, uses datagrams Enables packets to be sent from one host to another without a direct or dedicated physical connection. Asymmetric routing common Asymmetric routing occurs when packets take one route from sender to receiver, but take a different route from receiver to sender.

Circuit Switching Circuit switching dedicates fixed amount of bandwidth from one end to another Example: A DS3 from LA to Cedar Falls consumes a full DS3 from end to end whether it is in use or not

Circuit Switching Virtual Circuit Switching requires set up and tear down of the circuit after each use. No one else can use any of the bandwidth during an active session—even if it is idle! Known as a connection-oriented approach

Packet Switching Differs from circuit switching (obviously) Data link layer — single broadcast and collision domain Data is sent across links when space is available Known as a connectionless (or datagram) approach

Datagram / Connectionless Approach The University of Adelaide, School of Computer Science 1 October 2017 Datagram / Connectionless Approach Key Idea Every packet contains enough information to enable any switch to decide how to get it to destination Every packet contains the complete destination address Chapter 2 — Instructions: Language of the Computer

Packet Switching Bad example: We can have a switch with 100 attached clients at 100Mbps linked through 10Mbps to another switch with 100 clients at 100Mbps Obviously not the best solution because there's contention at the interconnect Bandwidth is not reserved from one end to another.

Interconnecting with Hubs Hub – Repeats incoming signals out of all outgoing ports (like a repeater) Backbone hub interconnects LAN segments Extends max distance between nodes But individual segment collision domains become one large collision domain

Bridges Link layer device transparent plug-and-play, self-learning stores and forwards Ethernet frames examines frame header and selectively forwards frame based on MAC dest address when frame is to be forwarded on segment, uses CSMA/CD to access segment transparent hosts are unaware of presence of bridges plug-and-play, self-learning bridges do not need to be configured

Bridges: Traffic Isolation Bridge installation breaks LAN into LAN segments Bridges filter packets: Same-LAN-segment frames not usually forwarded onto other LAN segments Segments become separate collision domains bridge collision domain = hub = host LAN segment LAN segment LAN (IP network)

Interconnection without Backbone Not recommended for two reasons: Single point of failure at Computer Science hub All traffic between EE and SE must path over CS segment

Backbone configuration Recommended !

Self Learning A bridge has a bridge table Entry in bridge table: (Node LAN Address, Bridge Interface, Time Stamp) Stale entries in table dropped (TTL can be 60 min) Bridges learn which hosts can be reached through which interfaces When frame received, bridge “learns” location of sender: incoming LAN segment Records sender/location pair in bridge table

Filtering/Forwarding When bridge receives a frame: index bridge table using MAC dest address if entry found for destination { if dest on segment from which frame arrived drop the frame else forward the frame on interface indicated } else flood forward on all but the interface on which the frame arrived

Bridge Example Suppose C sends frame to D and D replies back with frame to C. Bridge receives frame from C Notes in bridge table that C is on interface 1 Because D is not in table, bridge sends frame into interfaces 2 and 3 Frame received by D

Bridge Learning: Example D generates frame for C, sends Bridge receives frame Notes in bridge table that D is on interface 2 Bridge knows C is on interface 1, so selectively forwards frame to interface 1

Your Turn Assume fresh (empty) address/port table. Through which bridge interfaces are the following messages sent? 1. H sends to F, and F replies back to H 2. Next, A sends to F, and F replies back to A What does the end table look like?

Bridge Learning: Drawback Previous strategy works fine until a LAN has a loop in it Possible bad failure case – frames could loop forever without getting to final destination! How could this happen? In a large network, some administrator could add a bridge that closes a loop without realizing it Could also be built in on purpose to provide redundancy So single link failure does not bring down whole network