Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #14 Shivkumar Kalyanaraman: GOOGLE: “Shiv RPI”

Slides:



Advertisements
Similar presentations
IP Router Architectures. Outline Basic IP Router Functionalities IP Router Architectures.
Advertisements

Layer 3 Switching. Routers vs Layer 3 Switches Both forward on the basis of IP addresses But Layer 3 switches are faster and cheaper However, Layer 3.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Informal Quiz 7: QoS->Optical T F  Strong authentication involves sending shared secrets.
1 ELEN 602 Lecture 18 Packet switches Traffic Management.
Chapter 8 Hardware Conventional Computer Hardware Architecture.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #06: SOLUTIONS Shivkumar Kalyanaraman: GOOGLE: “Shiv.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 High Speed Router Design Shivkumar Kalyanaraman Rensselaer Polytechnic Institute
Router Architecture : Building high-performance routers Ian Pratt
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 TCP/IP Stack Introduction: Looking Under the Hood! Shiv Kalyanaraman Rensselaer Polytechnic Institute.
Spring 2002CS 4611 Router Construction Outline Switched Fabrics IP Routers Tag Switching.
High-Speed Router Design. Content Classes of Routers Components of a Router High-Speed Router Lookup Advances in Switching Fabrics Speeding Up Output.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 High Speed Router Design Shivkumar Kalyanaraman Rensselaer Polytechnic Institute
10 - Network Layer. Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving.
Big, Fast Routers Dave Andersen CMU CS
Chapter 10 Switching Fabrics. Outline Physical Interconnection Physical box with backplane Individual blades plug into backplane slots Each blade contains.
EE 122: Router Design Kevin Lai September 25, 2002.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Intel IXP1200 Network Processor q Lab 12, Introduction to the Intel IXA q Jonathan Gunner, Sruti.
ECE 526 – Network Processing Systems Design
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Quiz 1 SOLUTIONS Time: 60 min (strictly enforced) Points: 50 YOUR.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-4670: Computer Communication Networks (CCN) Informal Quiz 2 Shivkumar Kalyanaraman:
Router Architectures An overview of router architectures.
Router Architectures An overview of router architectures.
Router Design (Nick Feamster) February 11, Today’s Lecture The design of big, fast routers Partridge et al., A 50 Gb/s IP Router Design constraints.
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
ECE 526 – Network Processing Systems Design Network Processor Architecture and Scalability Chapter 13,14: D. E. Comer.
CS 552 Computer Networks IP forwarding Fall 2005 Rich Martin (Slides from D. Culler and N. McKeown)
ATM SWITCHING. SWITCHING A Switch is a network element that transfer packet from Input port to output port. A Switch is a network element that transfer.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #03 SOLUTIONS Shivkumar Kalyanaraman: GOOGLE: “Shiv.
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
Router Architecture Overview
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Packet Switches.
Advance Computer Networking L-8 Routers Acknowledgments: Lecture slides are from the graduate level Computer Networks course thought by Srinivasan Seshan.
Delivery, Forwarding, and Routing of IP Packets
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #13 Shivkumar Kalyanaraman: GOOGLE: “Shiv RPI”
Routers. These high-end, carrier-grade 7600 models process up to 30 million packets per second (pps).
Computer Networks: Switching and Queuing Ivan Marsic Rutgers University Chapter 4 – Switching and Queuing Delay Models.
Packet Forwarding. A router has several input/output lines. From an input line, it receives a packet. It will check the header of the packet to determine.
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.
21-Dec-154/598N: Computer Networks Cell Switching (ATM) Connection-oriented packet-switched network Used in both WAN and LAN settings Signaling (connection.
CS 740: Advanced Computer Networks IP Lookup and classification Supplemental material 02/05/2007.
Interconnect Networks Basics. Generic parallel/distributed system architecture On-chip interconnects (manycore processor) Off-chip interconnects (clusters.
Ch 8. Switching. Switch  Devices that interconnected with each other  Connecting all nodes (like mesh network) is not cost-effective  Some topology.
Lecture Note on Switch Architectures. Function of Switch.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #09: SOLUTIONS Shivkumar Kalyanaraman: GOOGLE: “Shiv.
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,
Spring 2000CS 4611 Router Construction Outline Switched Fabrics IP Routers Extensible (Active) Routers.
Univ. of TehranIntroduction to Computer Network1 An Introduction to Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.
Structure of a switch We use switches in circuit-switched and packet- switched networks. In this section, we discuss the structures of the switches used.
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.
1 Building big router from lots of little routers Nick McKeown Assistant Professor of Electrical Engineering and Computer Science, Stanford University.
Graciela Perera Department of Computer Science and Information Systems Slide 1 of 18 INTRODUCTION NETWORKING CONCEPTS AND ADMINISTRATION CSIS 3723 Graciela.
Addressing: Router Design
Chapter 4: Network Layer
Packet Switching (basics)
What’s “Inside” a Router?
15-744: Computer Networking
Advance Computer Networking
Bridges and Extended LANs
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.
Project proposal: Questions to answer
Computer Networks: Switching and Queuing
Chapter 4: Network Layer
Presentation transcript:

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #14 Shivkumar Kalyanaraman: GOOGLE: “Shiv RPI” Informal Quiz #14 Shivkumar Kalyanaraman: GOOGLE: “Shiv RPI”

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 2 High Speed Router Design (Slide set #16): Informal Quiz

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 3 Router Design T F   The trie data structure for IP forwarding lookup facilitates binary search in terms of prefix length.  An overwhelmingly large number of prefixes in the global routing mesh are between 16 and 24 bits long  Larger routers require lesser space, power and number of interfaces for the same capacity  Processing and memory access become bottlenecks in the data plane of high speed routers  Current PC software routers can easily handle multiple Gb/s interfaces at line rates simultaneously  Aggregate packet forwarding rates are usually measured using the smallest packet sizes (eg: 64 bytes)  The goal of network processors is to provide speeds approaching that of ASICs, but with programmability  IP options are usually handled in the slow processing path  Bridges and L2 switches use a simple hashing procedure for lookup.  Longest prefix match is equivalent to a two-dimensional search problem  At OC-192c rates, the time available for looking up a 64 byte packet is in the order of 100s of nanoseconds.  A trie is a binary tree.

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 4 Router Design T F  24-bit prefixes are the most common prefixes in global routing tables  Very few prefixes in global routing tables are larger than 24 bits  First generation IP routers used switched backplanes to interconnect network interface cards  Faster routers use asymmetric multi-processing and parallelism to push specialized computing functions to NICs and by using co-processors (ASICs)  Call blocking in circuit switches leads to failure to connect calls, whereas blocking in packet switches leads to packet buffering  Crossbars can arbitrarily scale in terms of number of cross-points and management of crosspoints  Modern voice switches combine both space-division and time-division switching  Multi-stage cross-bar designs save on crosspoints but may increase blocking probability  Banyan switch fabric is an example of a self-routing recursive fabric  Blocking in Banyan switches can be avoided by choosing the order in which packets appear at the input ports (I.e. using a batcher sorting stage)  Output queueing is usually not used because it requires prohibitive maximum speeds of memory access or processing.  Output queues face the head-of-line blocking problem

Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 5 Router Design T F  Virtual output queues are used at the output ports of routers  The knockout principle distributes the pain of losing packets across inputs, thus facilitating lower speed output queues  Packet classification is a generalization of the longest-prefix-match problem  Micro-engines in network processors run their own operating systems  Micro-engines in network processors are ASICs  The slow-path processing in network processors is handled by the StrongARM/Xscale processor  A CAM (content-addressible memory) module returns all elements that match a given key  T-CAMs are useful for packet classification  Intel IXA network processors use a variety of register structures (eg: ring buffers, next- neighbor register) to ease packet processing  Intel IXA network processors use specialized modules for key functions (eg: CRC, hashing, random number generation etc)  Various types of parallelism and pipelining (both at the hardware and software level) is used in network processors  Power constraints determine the layout of chips and boards in ultra-fast routers  Power constraints also lead to multi-rack packaging for Tb/s routers  Multi-rack packaging increases the switch round-trip time and hence buffering requirements  Power constraints are likely to lead to increasing use of optical switching inside next- generation ultra-fast routers