Che 1 Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING Network Processor.

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.
Identifying MPLS Applications
IP Router Architectures. Outline Basic IP Router Functionalities IP Router Architectures.
Logically Centralized Control Class 2. Types of Networks ISP Networks – Entity only owns the switches – Throughput: 100GB-10TB – Heterogeneous devices:
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.
Internetworking II: MPLS, Security, and Traffic Engineering
© Jörg Liebeherr ECE 1545 Packet-Switched Networks.
Performance Evaluation of Open Virtual Routers M.Siraj Rathore
Introducing MPLS Labels and Label Stacks
Chapter 8 Hardware Conventional Computer Hardware Architecture.
Chris Blondia Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN N ETWORKING 1 Layer.
MPLS and Traffic Engineering
EE 122: Router Design Kevin Lai September 25, 2002.
Nick McKeown 1 Memory for High Performance Internet Routers Micron February 12 th 2003 Nick McKeown Professor of Electrical Engineering and Computer Science,
Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN N ETWORKING Challenges and issues.
1 MPLS Architectural Principles George Swallow
ECE 526 – Network Processing Systems Design
Connecting Devices and Multi-Homed Machines. Layer 1 (Physical) Devices Repeater: Extends distances by repeating a signal Extends distances by repeating.
Router Architectures An overview of router architectures.
Experiences with Deploying a Global IP/MPLS Network
SMUCSE 8344 MPLS Virtual Private Networks (VPNs).
Microsoft Virtual Academy Module 4 Creating and Configuring Virtual Machine Networks.
Router Architectures An overview of router architectures.
1 Multi-Protocol Label Switching (MPLS) presented by: chitralekha tamrakar (B.S.E.) divya krit tamrakar (B.S.E.) Rashmi shrivastava(B.S.E.) prakriti.
Computer Networks Switching Professor Hui Zhang
Gigabit Routing on a Software-exposed Tiled-Microprocessor
ECE 526 – Network Processing Systems Design Network Processor Architecture and Scalability Chapter 13,14: D. E. Comer.
1 Multi-Protocol Label Switching (MPLS). 2 MPLS Overview A forwarding scheme designed to speed up IP packet forwarding (RFC 3031) Idea: use a fixed length.
Multiservice Switch Architecture. Scope Discuss only distributed architecture Focus on data path functions.
1 Multiprotocol Label Switching. 2 “ ” It was designed to provide a unified data-carrying service for both circuit-based clients and packet-switching.
Multiprotocol Label Switching (MPLS) References: Juniper white papers on MPLS and DiffServ at: white_papers/
Multi-protocol Label Switching Jiang Wu Computer Science Seminar 5400.
Measuring Control Plane Latency in SDN-enabled Switches Keqiang He, Junaid Khalid, Aaron Gember-Jacobson, Sourav Das, Chaithan Prakash, Aditya Akella,
MPLS Forwarder Preliminary 1 Outline MPLS Overview MPLS Overview MPLS MRD MPLS Data Path HLD 48K MPLS Fwder HLD IPE MPLS Fwder HLD Issues Summary.
Israel Cidon Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN N ETWORKING 1 Hardware.
Router Architecture Overview
Advance Computer Networking L-8 Routers Acknowledgments: Lecture slides are from the graduate level Computer Networks course thought by Srinivasan Seshan.
CSE 6392 Multiservice Switching Architecture Hao Che Woolf Hall 208 2:00pm – 3:20pm, Tuesday & Thursday.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #14 Shivkumar Kalyanaraman: GOOGLE: “Shiv RPI”
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
Labelcast Protocol Presented by Wang Hui 80th IETF, March 2011 draft-sunzhigang-sam-labelcast-01.
CS 4396 Computer Networks Lab Router Architectures.
MPLS Some notations: LSP: Label Switched Path
High-Speed Policy-Based Packet Forwarding Using Efficient Multi-dimensional Range Matching Lakshman and Stiliadis ACM SIGCOMM 98.
Hao Che/University of Texas at Arlington 1CSIIR and IOC 1 st Annual Workshop – March 14-15, 2005 Oak Ridge National Lab. Building Robust, flexible, Scalable.
OpenFlow MPLS and the Open Source Label Switched Router Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan,
Multiple Protocol Support: Multiprotocol Level Switching.
Introduction to Networks v5.1 Chapter 6: Network Layer.
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
Multi-protocol Label Switching
Fabric: A Retrospective on Evolving SDN Presented by: Tarek Elgamal.
MPLS Introduction How MPLS Works ?? MPLS - The Motivation MPLS Application MPLS Advantages Conclusion.
Multi-protocol Label Switching (MPLS) RFC 3031 MPLS provides new capabilities: QoS support Traffic engineering VPN Multiprotocol support.
Graciela Perera Department of Computer Science and Information Systems Slide 1 of 18 INTRODUCTION NETWORKING CONCEPTS AND ADMINISTRATION CSIS 3723 Graciela.
InterVLAN Routing 1. InterVLAN Routing 2. Multilayer Switching.
Requirements for LER Forwarding of IPv4 Option Packets
B-TECH PROJECT MID-SEM PRESENTATION 2011
Chapter 6: Network Layer
Addressing: Router Design
Chapter 4: Network Layer
What’s “Inside” a Router?
CS 31006: Computer Networks – The Routers
Advance Computer Networking
Packet Switch Architectures
Chapter 4 Network Layer Computer Networking: A Top Down Approach 5th edition. Jim Kurose, Keith Ross Addison-Wesley, April Network Layer.
1 Multi-Protocol Label Switching (MPLS). 2 MPLS Overview A forwarding scheme designed to speed up IP packet forwarding (RFC 3031) Idea: use a fixed length.
Project proposal: Questions to answer
Chapter 4: Network Layer
Packet Switch Architectures
Presentation transcript:

Che 1 Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING Network Processor Programming Hao Che Department of Computer Science and Engineering University of Texas at Arlington USA

Che 2 Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING Two New Challenges in Router Design 1.Providing circuit switch like high availability: 5 9s (i.e., %) uptime Focused on control card high availability: number one R&D research expenditure reported for year 2002Focused on control card high availability: number one R&D research expenditure reported for year 2002 Two solutions (2002): Nonstop Forwarding (Cisco, Juniper, etc.) and Nonstop Routing (Alcatel, Avici, etc.)Two solutions (2002): Nonstop Forwarding (Cisco, Juniper, etc.) and Nonstop Routing (Alcatel, Avici, etc.) Largely failed to deal with software failures which constitute more than 60% failure situationsLargely failed to deal with software failures which constitute more than 60% failure situations A research area the networking research community may play an important roleA research area the networking research community may play an important role This talk will focus on the second challenge

Che 3 Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING Two New Challenges in Router Design 2. Network Processor Programming: A key differentiator of vendor solutions Traditional routers were built based on: General purpose micro-processors: low speed General purpose micro-processors: low speed Purposely built ASICs: limited programmability Purposely built ASICs: limited programmability Network Processor: a new species of microprocessor optimized for packet processing. The best of the two worlds Fully programmable Fully programmable Multi-gigabit processing speed Multi-gigabit processing speed Programming network processors and managing their resources pose new challenges

Che 4 Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING Applications RFC1812 Compliant IP Packet ProcessingRFC1812 Compliant IP Packet Processing L2/L3 header processingL2/L3 header processing IP forwarding table lookupIP forwarding table lookup Access control listAccess control list TTL updateTTL update Checksum updateChecksum update L2 encapsulationL2 encapsulation Packet fragmentation/reassemblyPacket fragmentation/reassembly IP Options field parsingIP Options field parsing ICMP packet processingICMP packet processing Advanced IP Packet ProcessingAdvanced IP Packet Processing MPLS: FEC to tunnel mapping, label popping/pushing, label swappingMPLS: FEC to tunnel mapping, label popping/pushing, label swapping DiffServ: traffic conditioning including metering, policing, marking/remarkingDiffServ: traffic conditioning including metering, policing, marking/remarking Policy/firewall filteirngPolicy/firewall filteirng L3 VPNL3 VPN NATNAT ATM/FR interworkingATM/FR interworking

Che 5 Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING Applications Challenging ApplicationsChallenging Applications IPSecIPSec Flow classificationFlow classification H323/SIP/dynamic NATH323/SIP/dynamic NAT MPLS pseudo-wire and L2 VPNMPLS pseudo-wire and L2 VPN Active networkingActive networking A daunting, ever growing list of applications to be processed within 40ns at OC-192 POS line rate!

Che 6 Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING Network Processor: what’s inside? Micro-engines (MEs) can be configured to work in pipeline and/or parallelMicro-engines (MEs) can be configured to work in pipeline and/or parallel Each ME can be configured to support multiple number of threadsEach ME can be configured to support multiple number of threads Thread execution may be scheduled in various waysThread execution may be scheduled in various ways All the MEs share the same external resourcesAll the MEs share the same external resources

Che 7 Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING System Level View NIC Control Card Cell / Packet Switch Fabric Routing Engine Network Processor MPLS Control QoS/DiffServ IP/MPLS/DiffServ Fast Data Path: ingress NIC/NPU  egress NIC/NPU Fast Data Path: ingress NIC/NPU  egress NIC/NPU Global Slow Data Path: ingress NIC/NPU  Control Card  egress NIC/NPU Global Slow Data Path: ingress NIC/NPU  Control Card  egress NIC/NPU

Che 8 Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING Card Level View Source: “Network Processors and Coprocessors for Broadband Network Applications,” T. A. Chu, ACORN Networks Local Slow Data Path: NPU  Local CPU  NPU  Switch Fabric Local Slow Data Path: NPU  Local CPU  NPU  Switch Fabric

Che 9 Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING Important Issues 1.Mapping applications to specific network processor configurations Existing research focuses on mapping one or a few data path flows to a specific configuration, mostly based on cycle-accurate simulation. In practice, however, a network processor may have to process a mixture of a good number of data path flowsExisting research focuses on mapping one or a few data path flows to a specific configuration, mostly based on cycle-accurate simulation. In practice, however, a network processor may have to process a mixture of a good number of data path flows A systematic approach is needed. We areA systematic approach is needed. We are building a model to capture the important critical data path functions for various data path flowsbuilding a model to capture the important critical data path functions for various data path flows building a library of modeled data path flowsbuilding a library of modeled data path flows building a generic NP modelbuilding a generic NP model developing a simulation tool to allow fast performance analysis of various mappingsdeveloping a simulation tool to allow fast performance analysis of various mappings

Che 10 Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING Important Issues 2.Mapping applications to various router components: Existing research solely focuses on mapping applications to an isolated NPU and lacks of system level viewExisting research solely focuses on mapping applications to an isolated NPU and lacks of system level view Mapping applications to NPU should be an integral part of system level architecture design: E.g., running ARP locally in each NIC  L2 encapsulation in egress NPU  IP forwarding/policy table lookup in egress  outgoing packet loss in egress NPU if the thread scheduler has given higher priority to ingress packetsMapping applications to NPU should be an integral part of system level architecture design: E.g., running ARP locally in each NIC  L2 encapsulation in egress NPU  IP forwarding/policy table lookup in egress  outgoing packet loss in egress NPU if the thread scheduler has given higher priority to ingress packets Need a system level frameworkNeed a system level framework

Che 11 Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING Important Issues 3. Resource contention: database update vs database access 3. Resource contention: database update vs database access Due to the fact that all MEs share the same external memory resources, the traditional approach, i.e., locking the memory for database update, can significantly impact the data path processing performance. E.g., locking TCAM for per rule update can lead to the loss of hundreds of packets at OC-192 line rateDue to the fact that all MEs share the same external memory resources, the traditional approach, i.e., locking the memory for database update, can significantly impact the data path processing performance. E.g., locking TCAM for per rule update can lead to the loss of hundreds of packets at OC-192 line rate We designed a general TCAM database update algorithm, which allows zero impact on TCAM lookup, without lockingWe designed a general TCAM database update algorithm, which allows zero impact on TCAM lookup, without locking

Che 12 Ne X tworking’03 June 23-25,2003, Chania, Crete, Greece The First COST-IST(EU)-NSF(USA) Workshop on EXCHANGES & TRENDS IN NETWORKING Thanks!!! FYI: If interested, please visit: for recent papers we wrote on issues related to TCAM coprocessor resource management. Please also stay tuned for more results on NPU/router design issues. for recent papers we wrote on issues related to TCAM coprocessor resource management. Please also stay tuned for more results on NPU/router design issues.