Spring 2000CS 4611 Router Construction Outline Switched Fabrics IP Routers Extensible (Active) Routers.

Slides:



Advertisements
Similar presentations
Router Internals CS 4251: Computer Networking II Nick Feamster Spring 2008.
Advertisements

Router Internals CS 4251: Computer Networking II Nick Feamster Fall 2008.
IP Router Architectures. Outline Basic IP Router Functionalities IP Router Architectures.
1 ELEN 602 Lecture 18 Packet switches Traffic Management.
Chapter 8 Hardware Conventional Computer Hardware Architecture.
Router Architecture : Building high-performance routers Ian Pratt
1 Delta Network The delta network is one example of a multistage interconnection network that can be used as a switch fabric The delta network is an example.
What's inside a router? We have yet to consider the switching function of a router - the actual transfer of datagrams from a router's incoming links to.
Spring 2002CS 4611 Router Construction Outline Switched Fabrics IP Routers Tag Switching.
4-1 Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving side, delivers.
10 - Network Layer. Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving.
Chapter 10 Switching Fabrics. Outline Physical Interconnection Physical box with backplane Individual blades plug into backplane slots Each blade contains.
t Popularity of the Internet t Provides universal interconnection between individual groups that use different hardware suited for their needs t Based.
EE 122: Router Design Kevin Lai September 25, 2002.
Katz, Stoica F04 EECS 122: Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering.
ECE 526 – Network Processing Systems Design
Spring 2004 EE4272 The Need of Spanning Tree Algorithm.
Router Architectures An overview of router architectures.
Router Architectures An overview of router architectures.
4: Network Layer4b-1 Router Architecture Overview Two key router functions: r run routing algorithms/protocol (RIP, OSPF, BGP) r switching datagrams from.
Chapter 4 Queuing, Datagrams, and Addressing
1 IP routers with memory that runs slower than the line rate Nick McKeown Assistant Professor of Electrical Engineering and Computer Science, Stanford.
Computer Networks Switching Professor Hui Zhang
Chapter 4 Network Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 All material copyright
Advanced Computer Networks
TO p. 1 Spring 2006 EE 5304/EETS 7304 Internet Protocols Tom Oh Dept of Electrical Engineering Lecture 9 Routers, switches.
1 Copyright © Monash University ATM Switch Design Philip Branch Centre for Telecommunications and Information Engineering (CTIE) Monash University
CPS 356: Introduction to Computer Networks Lecture 7: Switching technologies Ch 2.8.2, 3.1, 3.4 Xiaowei Yang
1 John Magee 24 February 2014 CS 280: Network Layer: Virtual Circuits / Datagram Networks and What’s inside a Router? Most slides adapted from Kurose and.
Router Architecture Overview
CSS432: Switching and Bridging 1 Switching and Bridging Textbook Ch3.1 and 3.4 Instructor: Joe McCarthy (based on Prof. Fukuda’s slides)
Advance Computer Networking L-8 Routers Acknowledgments: Lecture slides are from the graduate level Computer Networks course thought by Srinivasan Seshan.
CSS432: Switching and Bridging 1 Switching and Bridging Textbook Ch3.1 and 3.4 Professor: Munehiro Fukuda.
Outline Packet switching paradigms Bridges and extended LANs Cell switching Switching hardware.
Local-Area-Network (LAN) Architecture Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #14 Shivkumar Kalyanaraman: GOOGLE: “Shiv RPI”
Computer Networks: Switching and Queuing Ivan Marsic Rutgers University Chapter 4 – Switching and Queuing Delay Models.
CS 4396 Computer Networks Lab Router Architectures.
Final Chapter Packet-Switching and Circuit Switching 7.3. Statistical Multiplexing and Packet Switching: Datagrams and Virtual Circuits 4. 4 Time Division.
Forwarding.
21-Dec-154/598N: Computer Networks Cell Switching (ATM) Connection-oriented packet-switched network Used in both WAN and LAN settings Signaling (connection.
Ch 8. Switching. Switch  Devices that interconnected with each other  Connecting all nodes (like mesh network) is not cost-effective  Some topology.
1 IEX8175 RF Electronics Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.
Lecture Note on Switch Architectures. Function of Switch.
1 A quick tutorial on IP Router design Optics and Routing Seminar October 10 th, 2000 Nick McKeown
Packet Switch Architectures The following are (sometimes modified and rearranged slides) from an ACM Sigcomm 99 Tutorial by Nick McKeown and Balaji Prabhakar,
Network Layer4-1 Chapter 4 Network Layer All material copyright J.F Kurose and K.W. Ross, All Rights Reserved Computer Networking: A Top Down.
Univ. of TehranIntroduction to Computer Network1 An Introduction to Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.
CS 4594 Broadband Switching Elements and Fabrics.
Application Layer 2-1 Chapter 4 Network Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A.
Univ. of TehranIntroduction to Computer Network1 An Introduction to Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.
Network layer (addendum) Slides adapted from material by Nick McKeown and Kevin Lai.
Graciela Perera Department of Computer Science and Information Systems Slide 1 of 18 INTRODUCTION NETWORKING CONCEPTS AND ADMINISTRATION CSIS 3723 Graciela.
Chapter 3 Part 3 Switching and Bridging
Addressing: Router Design
CS4470 Computer Networking Protocols
Chapter 4: Network Layer
Chapter 3 Part 3 Switching and Bridging
What’s “Inside” a Router?
CS 31006: Computer Networks – The Routers
Bridges and Extended LANs
Packet Switch Architectures
Router Construction Outline Switched Fabrics IP Routers
EE 122: Lecture 7 Ion Stoica September 18, 2001.
Chapter 4 Network Layer Computer Networking: A Top Down Approach 5th edition. Jim Kurose, Keith Ross Addison-Wesley, April Network Layer.
Chapter 3 Part 3 Switching and Bridging
Computer Networks: Switching and Queuing
Chapter 4: Network Layer
HWP2 – Application level query routing
Packet Switch Architectures
Presentation transcript:

Spring 2000CS 4611 Router Construction Outline Switched Fabrics IP Routers Extensible (Active) Routers

Spring 2000CS 4612 Workstation-Based Aggregate bandwidth –1/2 of the I/O bus bandwidth –capacity shared among all hosts connected to switch –example: 800Mbps bus can support 8 T3 ports CPU Main memory I/O bus Interface 1 Interface 2 Interface 3 Packets-per-second –must be able to switch small packets –100,000 packets-per- second is achievable –e.g., 64-byte packets implies 51.2Mbps

Spring 2000CS 4613 Switching Hardware Design Goals –throughput (depends on traffic model) –scalability (a function of n) Ports –circuit management (e.g., map VCIs, route datagrams) –buffering (input and/or output) Fabric –as simple as possible –sometimes do buffering (internal) Input port Input port Input port Input port Output port Output port Output port Output port Fabric

Spring 2000CS 4614 Buffering Wherever contention is possible –input port (contend for fabric) –internal (contend for output port) –output port (contend for link) Head-of-Line Blocking –input buffering

Spring 2000CS 4615 Crossbar Switches

Spring 2000CS 4616 Knockout Switch Example crossbar Concentrator –select l of n packets Complexity: n 2

Spring 2000CS 4617 Knockout Switch (cont) Output Buffer (c) Shifter Buffers (b) Shifter Buffers (a) Shifter Buffers

Spring 2000CS 4618 Self-Routing Fabrics Banyan Network –constructed from simple 2 x 2 switching elements –self-routing header attached to each packet –elements arranged to route based on this header –no collisions if input packets sorted into ascending order –complexity: n log 2 n

Spring 2000CS 4619 Self-Routing Fabrics (cont) Batcher Network –switching elements sort two numbers some elements sort into ascending (clear) some elements sort into descending (shaded) –elements arranged to implement merge sort –complexity: n log 2 2 n Common Design: Batcher-Banyan Switch

Spring 2000CS High-Speed IP Router Switch (possibly ATM) Line Cards + Forwarding Engines –link interface –router lookup (input) –common IP path (input) –packet queue (output) Network Processor –routing protocol(s) –exceptional cases

Spring 2000CS High-Speed Router Line card (forwarding buffering) Line card (forwarding buffering) Line card (forwarding buffering) Line card (forwarding buffering) Routing CPU Buffer memory Routing software w/ router OS Routing software w/ router OS

Spring 2000CS Alternative Design Crossbar Switch PC CPU MEM NI with uP NI with uP PC CPU MEM NI with uP NI with uP PC CPU MEM NI with uP NI with uP PC CPU MEM NI with uP NI with uP PC CPU MEM NI with uP NI with uP PC CPU MEM NI with uP NI with uP