Switching and Forwarding

Similar documents
Switching and Forwarding - continued

Switching and Forwarding - continued

Switching and Forwarding

HWP2 Application level query routing HWP1 Each peer knows about every other beacon B1 B3

Research paper Measured Capacity of an Ethernet: Myths and Reality

Switching and Forwarding Reading: Chapter 3 1/30/14 1

Packet Switching. Hongwei Zhang Nature seems to reach her ends by long circuitous routes.

CSCI Computer Networks

Outline. Routing. Introduction to Wide Area Routing. Classification of Routing Algorithms. Introduction. Broadcasting and Multicasting

CSE 461: Bridging LANs. Last Topic

L9: Bridges and LAN Switches. Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806

Packet Switching Techniques

Lecture 7. Reminder: Homework 2, Programming Project 1 due today. Homework 3, Programming Project 2 out, due Thursday next week. Questions?

CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca

CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca

CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca

Lecture 6: Bridges and Switches. CS/ECE 438: Communication Networks Prof. Matthew Caesar February 19, 2010

Medium Access Protocols

CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca

Packet Switching. Guevara Noubir Fundamentals of Computer Networks. Computer Networks: A Systems Approach, L. Peterson, B. Davie, Morgan Kaufmann

CompSci 356: Computer Network Architectures. Lecture 7: Switching technologies Chapter 3.1. Xiaowei Yang

Data Communication & Computer Networks INFO

Internetworking Part 1

Administrivia CSC458 Lecture 4 Bridging LANs and IP. Last Time. This Time -- Switching (a.k.a. Bridging)

Switching and bridging

CompSci 356: Computer Network Architectures. Lecture 8: Spanning Tree Algorithm and Basic Internetworking Ch & 3.2. Xiaowei Yang

ECE 4450:427/527 - Computer Networks Spring 2017

CSE/EE 461 Lecture 7 Bridging LANs. Last Two Times. This Time -- Switching (a.k.a. Bridging)

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

CSEP 561 LAN Switches. David Wetherall

Reminder: Datalink Functions Computer Networking. Datalink Architectures

Copyright 2010, Elsevier Inc. All rights Reserved

L8: Packet Switching. Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806

Troubleshooting Transparent Bridging Environments

EEC-484/584 Computer Networks

EPL606. Internetworking. Part 2a. 1Network Layer

Network Layer. The Network Layer. Contents Connection-Oriented and Connectionless Service. Recall:

Network Layer. Recall: The network layer is responsible for the routing of packets The network layer is responsible for congestion control

Communication Networks ( ) / Spring 2011 The Blavatnik School of Computer Science, Tel-Aviv University. Allon Wagner

Troubleshooting Transparent Bridging Environments

CS/ECE 438: Communication Networks for Computers Spring 2018 Midterm Examination Online

Networking interview questions

Revision of Previous Lectures

Switching / Forwarding

Administrivia. Homework on class webpage If you are having problems following me in class (or doing the homework problems), please buy the textbook

Some portions courtesy Srini Seshan or David Wetherall

===================================================================== Exercises =====================================================================

Introduction to Communication Networks Spring Unit 13 Network extensions Bridges.

Lecture 10: Internetworking"

Lecture 8: Networks to Internetworks

CSCI 466 Midterm Networks Fall 2011

CSE 123: Computer Networks Alex C. Snoeren. HW 2 due Thursday 10/21!

Data Communications. Connecting Devices

Internet Protocols (chapter 18)

Lecture 9: Bridging & Switching"

CSCI 466 Midterm Networks Fall 2011

Lecture 7. Network Layer. Network Layer 1-1

CPE 448/548 Exam #1 (100 pts) February 14, Name Class: 448

The Spanning Tree Protocol

Chapter 3 Packet Switching

Configuring Transparent Bridging

C13a: Packet Switching

CS519: Computer Networks. Lecture 1 (part 2): Jan 28, 2004 Intro to Computer Networking

CSE 123A Computer Networks

ECE 333: Introduction to Communication Networks Fall 2001

Expected Time: 90 min PART-A Max Marks: 42

Introduction. IP Datagrams. Internet Service Paradigm. Routers and Routing Tables. Datagram Forwarding. Example Internet and Conceptual Routing Table

CSE 3214: Computer Network Protocols and Applications Network Layer

ECE 435 Network Engineering Lecture 21

Last time. Wireless link-layer. Introduction. Characteristics of wireless links wireless LANs networking. Cellular Internet access

15-441: Computer Networks Homework 1

CS Networks and Distributed Systems. Lecture 5: Bridging. Revised 1/14/13

CS610- Computer Network Solved Subjective From Midterm Papers

UDP: Datagram Transport Service

Traditional network management methods have typically

Bridging and Switching Basics

Part 5: Link Layer Technologies. CSE 3461: Introduction to Computer Networking Reading: Chapter 5, Kurose and Ross

VTU-NPTEL-NMEICT Project

Introduction. The fundamental purpose of data communications is to exchange information between user's computers, terminals and applications programs.

Switching & ARP Week 3

EE 122: Switching and Forwarding

Virtual University of Pakistan. Describe the Hidden Node and Exposed Node problems in Standard? VUSR. [Larry L. Peterson]

Data Link Layer. Our goals: understand principles behind data link layer services: instantiation and implementation of various link layer technologies

CMSC 332 Computer Networks Network Layer

Network Control and Signalling

HW3 and Quiz. P14, P24, P26, P27, P28, P31, P37, P43, P46, P55, due at 3:00pm with both soft and hard copies, 11/11/2013 (Monday) TCP), 20 mins

Module 15: Network Structures

Goal and Outline. Computer Networking. What Do We Need? Today s Story Lecture 3: Packet Switched Networks Peter Steenkiste

3. What could you use if you wanted to reduce unnecessary broadcast, multicast, and flooded unicast packets?

CSEP 561 Internetworking. David Wetherall

Communication Networks - 3 general areas: data communications, networking, protocols

LAN Interconnection and Other Link Layer Protocols

LAN Overview (part 2) Interconnecting LANs - Hubs

Chapter 6 Connecting Device

Request for Comments: S. Gabe Nortel (Northern Telecom) Ltd. May Nortel s Virtual Network Switching (VNS) Overview

Next Steps Spring 2011 Lecture #18. Multi-hop Networks. Network Reliability. Have: digital point-to-point. Want: many interconnected points

Ch. 4 - WAN, Wide Area Networks

Module 1. Introduction. Version 2, CSE IIT, Kharagpur

Multicast Communications. Slide Set were original prepared by Dr. Tatsuya Susa

Integrated Services. Integrated Services. RSVP Resource reservation Protocol. Expedited Forwarding. Assured Forwarding.

Transcription:

Switching and Forwarding Outline Store-and-Forward Switches Bridges and Extended LANs Spring 7 CSE64 Switch Switching protocol T T STS- Spring 7 CSE64

Scalable Networks Switch forwards packets from input port to output port port selected based on address in packet header T T STS- Input ports Switch T T STS- Output ports Advantages cover large geographic area (tolerate latency) support large numbers of hosts (scalable bandwidth) Spring 7 CSE64 Source Routing Switch Switch Host A Switch Host B Spring 7 CSE64 4

Source Routing Header entering switch D C B A D C B A Ptr D C B A Header leaving switch A D C B D C B Ptr D C B A (a) (b) (c) Spring 7 CSE64 5 Virtual Circuit Switching Explicit connection setup (and tear-down) phase Subsequence packets follow same circuit Sometimes called connection-oriented model Analogy: phone call Each switch maintains a VC table Host A Switch 5 Switch 7 Switch 4 Host B Spring 7 CSE64 6

Datagram Switching No connection setup phase Each packet forwarded independently Sometimes called connectionless model Analogy: postal system Each switch maintains a forwarding (routing) table Host D Switch Host C Host A Host E Switch Host G Switch Host F Host B Host H Spring 7 CSE64 7 Example Tables Circuit Table (switch, port ) VC In VC Out Port Out 5 6 8 Forwarding Table (switch ) Address Port A C F G Spring 7 CSE64 8 4

Virtual Circuit Model Typically wait full RTT for connection setup before sending first data packet. While the connection request contains the full address for destination, each data packet contains only a small identifier, making the per-packet header overhead small. If a switch or a link in a connection fails, the connection is broken and a new one needs to be established. Connection setup provides an opportunity to reserve resources. Spring 7 CSE64 9 Datagram Model There is no round trip delay waiting for connection setup; a host can send data as soon as it is ready. Source host has no way of knowing if the network is capable of delivering a packet or if the destination host is even up. Since packets are treated independently, it is possible to route around link and node failures. Since every packet must carry the full address of the destination, the overhead per packet is higher than for the connection-oriented model. Spring 7 CSE64 5

Bridges and Extended LANs LANs have physical limitations (e.g., 5m) Connect two or more LANs with a bridge accept and forward strategy level connection (does not add packet header) A B C Port Bridge Port X Y Z Ethernet Switch = Bridge on Steroids Spring 7 CSE64 Learning Bridges Do not forward when unnecessary Maintain forwarding table A B C Bridge Port Port X Y Z Host Port A B C X Y Z Learn table entries based on source address Table is an optimization; need not be complete Always forward broadcast frames Spring 7 CSE64 6

Spanning Tree Algorithm Problem: loops A B B C B5 B D B7 K E F B G H B6 B4 I J Bridges run a distributed spanning tree algorithm select which bridges actively forward developed by Radia Perlman now IEEE 8. specification (a) (b) Spring 7 CSE64 Algorithm Overview Each bridge has unique id (e.g., B, B, B) Select bridge with smallest id as root Select bridge on each LAN closest to root as designated bridge (use id to break ties) A Each bridge forwards frames over each LAN for which it B C is the designated bridge B D B5 B7 B K E F B G H B6 B4 I J Spring 7 CSE64 4 7

Algorithm Details Bridges exchange configuration messages id for bridge sending the message id for what the sending bridge believes to be root bridge distance (hops) from sending bridge to root bridge Each bridge records current best configuration message for each port Initially, each bridge believes it is the root Spring 7 CSE64 5 Algorithm Detail (cont) When learn not root, stop generating config messages in steady state, only root generates configuration messages When learn not designated bridge, stop forwarding config messages in steady state, only designated bridges forward config messages Root continues to periodically send config messages If any bridge does not receive config message after a period of time, it starts generating config messages claiming to be the root Spring 7 CSE64 6 8

Configuration A B B C B5 B D B7 K E F B G H I B6 B4 J Spring 7 CSE64 7 Broadcast and Multicast Forward all broadcast/multicast frames current practice Learn when no group members downstream Accomplished by having each member of group G send a frame to bridge multicast address with G in source field Spring 7 CSE64 8 9

Limitations of Bridges Do not scale spanning tree algorithm does not scale broadcast does not scale Do not accommodate heterogeneity Caution: beware of transparency Spring 7 CSE64 9