1 / 9

Overview of Research in Router Design

Overview of Research in Router Design. Karl Naden – Networks (18-744) Fall 2010. Routers in a Nutshell. Router. Research Areas. Inputs. Outputs. Routing Decisions. Transport. Research Areas. Inputs. Outputs. Routing Decisions. Transport. Switches vs Buses.

newman
Download Presentation

Overview of Research in Router Design

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Overview of Research in Router Design Karl Naden – Networks (18-744) Fall 2010

  2. Routers in a Nutshell Router

  3. Research Areas Inputs Outputs Routing Decisions Transport

  4. Research Areas Inputs Outputs Routing Decisions Transport

  5. Switches vs Buses • A Fast Switched Backplane for a Gigabit Switched Router • McKeown • 1997 • Key Ideas • Shared Buses are not fast enough • Switches combined with well designed algorithms improve performance

  6. Transportation on a BIG router • Scaling Internet Routers Using Optics • Keslassy et. al. • 2003 • Design Goals • Lots ofLinecards (Input/Outputs) • High throughput requirements, with guarantees • Previous switched architecture and algorithms not good enough • Physical limitations • Power • Heat dissipation • Space • Easy configuration (linecard failures) • Consequence of two-level switched architecture

  7. Research Areas Inputs Outputs Routing Decisions Transport

  8. Data Structures for the Routing Table • Make IP routing decisions fast with well designed data structures • Small Forwarding Tables for Fast Routing Lookups • Degermark et. al. • 1997 • Key Points: • Why use specialized hardware when general-purpose processors can handle IP routing decisions? • Efficient algorithm to limit memory accesses • Make necessary accesses fast by ensuring they will be in the cache

  9. QoS via Packet Classification • How do you support differentiated services? • Need to make decisions at edge routers efficient • Scalable Packet Classification • Baboescu and Varghese • 2000 • EffiCuts: Optimizing Packet Classification for Memory and Throughput • Vamanan, Voskuilen, and Vijaykumar • 2010 • Basic idea: • With good data structures and algorithms for matching packets up to rules, we can make QoS decisions efficiently

More Related