Switch Construction CS

Similar documents
Switching Hardware. Spring 2018 CS 438 Staff, University of Illinois 1

Announcements. Reading. Project #4 is on the web. Homework #1. Midterm #2. Chapter 4 ( ) Note policy about project #3 missing components

Switching Hardware. Spring 2015 CS 438 Staff, University of Illinois 1

Router Construction. Workstation-Based. Switching Hardware Design Goals throughput (depends on traffic model) scalability (a function of n) Outline

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

Cell Switching (ATM) Commonly transmitted over SONET other physical layers possible. Variable vs Fixed-Length Packets

IS-IS in Detail. ISP Workshops

IV. PACKET SWITCH ARCHITECTURES

Reliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1

Quality of Service. Spring 2018 CS 438 Staff - University of Illinois 1

Multiprocessors. HPC Prof. Robert van Engelen

Cell Format. Housekeeping. Segmentation and Reassembly AAL 3/4

BROADBAND AND HIGH SPEED NETWORKS

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns

The Penta-S: A Scalable Crossbar Network for Distributed Shared Memory Multiprocessor Systems

Media Access Protocols. Spring 2018 CS 438 Staff, University of Illinois 1

Chapter 4 The Datapath

CSE 417: Algorithms and Computational Complexity

Overview. Some Definitions. Some definitions. High Performance Computing Programming Paradigms and Scalability Part 2: High-Performance Networks

Traditional queuing behaviour in routers. Scheduling and queue management. Questions. Scheduling mechanisms. Scheduling [1] Scheduling [2]

UNIVERSITY OF MORATUWA

Heaps. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015

Introduction to Network Technologies & Layered Architecture BUPT/QMUL

Lower Bounds for Sorting

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

CMSC Computer Architecture Lecture 12: Virtual Memory. Prof. Yanjing Li University of Chicago

Switching. An Engineering Approach to Computer Networking

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Operating System Concepts. Operating System Concepts

On Multicast Scheduling and Routing in Multistage Clos Networks

CMSC Computer Architecture Lecture 11: More Caches. Prof. Yanjing Li University of Chicago

Hash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.

Introduction to Wireless & Mobile Systems. Chapter 6. Multiple Radio Access Cengage Learning Engineering. All Rights Reserved.

CS211 Fall 2003 Prelim 2 Solutions and Grading Guide

Algorithm Design Techniques. Divide and conquer Problem

CS 683: Advanced Design and Analysis of Algorithms

The Network Layer and Routers

CIS 121. Introduction to Trees

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5.

Architectural styles for software systems The client-server style

Design of efficient, virtual non-blocking optical switches

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Workflow model GM AR. Gumpy. Dynagump. At a very high level, this is what gump does. We ll be looking at each of the items described here seperately.

Course Site: Copyright 2012, Elsevier Inc. All rights reserved.

On Nonblocking Folded-Clos Networks in Computer Communication Environments

BGP Attributes and Path Selection. ISP Training Workshops

1. SWITCHING FUNDAMENTALS

FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS

Lecture 28: Data Link Layer

prerequisites: 6.046, 6.041/2, ability to do proofs Randomized algorithms: make random choices during run. Main benefits:

IPv6 Routing Protocols. ISP Training Workshops

Chapter 4 Threads. Operating Systems: Internals and Design Principles. Ninth Edition By William Stallings

CS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1

Lecture 2. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram

Realistic Storage of Pending Requests in Content-Centric Network Routers

Lecture 3. RTL Design Methodology. Transition from Pseudocode & Interface to a Corresponding Block Diagram

15-859E: Advanced Algorithms CMU, Spring 2015 Lecture #2: Randomized MST and MST Verification January 14, 2015

Master Informatics Eng. 2017/18. A.J.Proença. Memory Hierarchy. (most slides are borrowed) AJProença, Advanced Architectures, MiEI, UMinho, 2017/18 1

Multicast ATM Switches: Survey and Performance Evaluation. Ming-Huang Guo and Ruay-Shiung Chang

top() Applications of Stacks

Big-O Analysis. Asymptotics

Minimum Spanning Trees

Computers and Scientific Thinking

Appendix D. Controller Implementation

Random Graphs and Complex Networks T

Computational Geometry

Priority Queues. Binary Heaps

Minimum Spanning Trees. Application: Connecting a Network

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

Homework 1 Solutions MA 522 Fall 2017

Security of Bluetooth: An overview of Bluetooth Security

Lecture 2: Spectra of Graphs

I containing data and synchronization information between

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:

DATA STRUCTURES. amortized analysis binomial heaps Fibonacci heaps union-find. Data structures. Appetizer. Appetizer

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Greedy Algorithms. Interval Scheduling. Greedy Algorithms. Interval scheduling. Greedy Algorithms. Interval Scheduling

1 Graph Sparsfication

3. b. Present a combinatorial argument that for all positive integers n : : 2 n

Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits

Message Integrity and Hash Functions. TELE3119: Week4

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

Politecnico di Milano Advanced Network Technologies Laboratory. Internet of Things. Projects

Data Structures and Algorithms. Analysis of Algorithms

Fundamental Algorithms

Outline. Applications of FFT in Communications. Fundamental FFT Algorithms. FFT Circuit Design Architectures. Conclusions

Chapter 3 Packet Switching

Module Instantiation. Finite State Machines. Two Types of FSMs. Finite State Machines. Given submodule mux32two: Instantiation of mux32two

An upper bound model for TCP and UDP throughput in IPv4 and IPv6

performance to the performance they can experience when they use the services from a xed location.

CSE 2320 Notes 8: Sorting. (Last updated 10/3/18 7:16 PM) Idea: Take an unsorted (sub)array and partition into two subarrays such that.

Python Programming: An Introduction to Computer Science

Τεχνολογία Λογισμικού

Our Learning Problem, Again

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.

Traffic Models and QoS

Lecture 10 Collision resolution. Collision resolution

A graphical view of big-o notation. c*g(n) f(n) f(n) = O(g(n))

Transcription:

Switch Costructio CS 00 Workstatio-Based Aggregate badwidth /2 of the I/O bus badwidth capacity shared amog all hosts coected to switch example: Gbps bus ca support 5 x 00Mbps ports (i theory) I/O bus Packets-per-secod CP must be able to switch small packets 00,000 packets-persecod is achievable Mai memory Iterface Iterface 2 Iterface CS 00 2

Switchig Hardware esig Goals Throughput (depeds o traffic model) Scalability (a fuctio of ) Iput Port Cotrol processor Iput Port Iput Port Iput Port Switch Fabric Iput Port Ports Circuit maagemet (e.g., map VCIs, switch datagrams) bufferig (iput ad/or output) Fabric As simple as possible Sometimes do bufferig (iteral) Iput Port CS 00 Bufferig Wherever cotetio is possible Iput port (coted for fabric) Iteral (coted for output port) Output port (coted for lik) Head-of-Lie Blockig Iput bufferig 2 2 Switch Port Port 2 CS 00

Switch esig Crossbar switches Baya Networks Batcher Networks Sushie Switch CS 00 5 Crossbar Switch Every iput port is coected to every output port NxN Output ports Complexity scales as O(N 2 ) CS 00

Crossbar Switch CS 00 7 Kockout Switch Assumptio: It is ulikely that N iputs will have packets destied for the same output port Pick L from N packets at a port Output port maitais L cyclic buffers Shifter places up to L packets i oe cycle Each buffer gets oly oe packet Output port uses roud-robi betwee buffers Arrival order is maitaied Problem Hot spots Output ports scale as O(N) CS 00 8

Kockout Switch Output port desig Packet filters Recogize packets destied for a specific port Cocetrator Selects up to L packets from those destied for this port iscards excess packets Queue Legth L CS 00 9 Kockout Switch 2 R R R 2 R Choose L of N Ex: 2 of R 2x2 radom selector Choice R Choice 2 2 iscard What happes if more tha L arrive? iscard elay uit CS 00 0

Self-Routig Fabrics Idea se source routig o etwork i switch Iput port attaches output port umber as header Fabric routes packet based o output port Types Baya Network Batcher-Baya Network Sushie Switch CS 00 Baya Network A etwork of 2x2 switches Each elemet routes to output 0 or based o packet header A switch at stage i looks at bit i i the header 0000 0 CS 00 2

Baya Network 00 0 00 00 00 00 0 0 0 0 0 0 0 0 0 CS 00 Baya Network Perfect Shuffle N iputs requires log 2 N stages of N/2 switchig elemets Complexity o order of N log 2 N Collisios If two packets arrive at the same switch destied for the same output port, a collisio will occur If all packets are sorted i ascedig order upo arrival to a baya etwork, o collisios will occur! CS 00

Batcher Network Performs merge sort A etwork of 2x2 switches Each elemet routes to output 0 or based o packet header A switch at stage i looks at the whole header Two types of switches p switch Seds higher umber to top output (0) ow switch Seds higher umber to bottom output () CS 00 5 Batcher Network 7 7 Sort 7 7 Merge 7 7 Merge CS 00

Batcher Network CS 00 7 Batcher Network How it really works Merger is preseted with a pair of sorted lists, oe i ascedig order, oe i descedig order First stage of merger seds packets to the correct half of the etwork Secod stage seds them to the correct quarter Size N/2 switches per stage log 2 N x ( + log 2 N)/2 stages Complexity = N log 22 N CS 00 8

Batcher-Baya Network Idea Attach a batcher etwork back-to-back with a baya etwork Arbitrary uique permutatios ca be routed without cotetio Two packets destied for same output port still collide! CS 00 9 Batcher-Baya Switch Architecture 0 5 0 0 0 0 0 Sort Filter Add Coc. Route 2 5 5 5 5 0 5 Simple compoets with o bufferig. filter elimiates duplicates by comparig cosecutive addresses ad returs ack to iputs adder computes ad iserts rak of cells cocetrator uses rak as output address routig etwork delivers to output Adder, cocetrator ad routig etwork all have log 2 stages (coc. is reverse baya, routig et. is baya) CS 00 20

Sushie Switch Sushie Switch Like a kockout switch Ca hadle up to L packets per output port Recirculates overflow packets If more tha L packets arrive for ay output port i oe cycle Elemets Multiple Baya etworks Eables multiple packets per output port elay Box Excess (K) packets are recirculated ad resubmitted to the switch Batcher etwork N ew packets K delayed packets Trap Idetifies packets destied for baya Idetifies excess packets Selector Routes multiple packets for same output o separate bayas CS 00 2 Sushie Switch k elay k Iputs Batcher +k Trap +k Selector L Bayas CS 00 22

Refereces Robi Kravets, Switchig Hardware, IC, CS/ECE- 8. CS 00 2