augustus a ccn router for programmable networks
play

Augustus: a CCN router for programmable networks ACM ICN 2016, Kyoto - PowerPoint PPT Presentation

Augustus: a CCN router for programmable networks ACM ICN 2016, Kyoto Davide Kirchner 1 , Raihana Ferdous 2 , Renato Lo Cigno 3 , Leonardo Maccari 3 , Massimo Gallo 4 , Diego Perino 5 , and Lorenzo Saino 6 September 27, 2016 1 Google


  1. Augustus: a CCN router for programmable networks ACM ICN 2016, Kyoto Davide Kirchner 1 ∗ , Raihana Ferdous 2 ∗ , Renato Lo Cigno 3 , Leonardo Maccari 3 , Massimo Gallo 4 , Diego Perino 5 ∗ , and Lorenzo Saino 6 September 27, 2016 1 Google Inc., Dublin, Ireland; 2 Create-Net, Trento, Italy; 3 DISI – University of Trento, Italy 4 Bell Labs – Nokia, Paris, France; 5 Telefonica Research, Spain; 6 Fastly, London, UK ∗ This work was done while D. Kirchner and R. Ferdous were at the University of Trento, and D. Perino and L. Saino at Bell Labs.

  2. Outline 1. Introduction 2. The Augustus CCN router 3. Performance evaluation 4. Conclusions and lessons learned 2

  3. Introduction

  4. Objectives The main goal is to explore the possibilities offered by modern general-purpose hardware in the context of information-centric networking: • Implement a CCN data plane forwarder fully in software • Run on a commodity x86 64 machine • Performance-oriented, open-source and extensible • Analyze the performance in a worst-case scenario 4

  5. Objectives The main goal is to explore the possibilities offered by modern general-purpose hardware in the context of information-centric networking: • Implement a CCN data plane forwarder fully in software • Run on a commodity x86 64 machine • Performance-oriented, open-source and extensible • Analyze the performance in a worst-case scenario Why software router? Flexibility: • Quicker development/deployment cycle and (re)configuration • Hardware can be dynamically allocated to network functions Tools • Off-the-shelf high-performance hardware • High-speed packet I/O libraries [Int, Riz12] • Software routing frameworks built on top [BSM15, KJL + 15] 4

  6. Forwarding flow • Focus on the Content Centric Networing approach [JST + 09] A • Interests hold full content name • Similar to CCNx (vs NDN) • CS and PIT: exact match R1 • Longest-prefix match at FIB eth0 Example: get /com/updates/sw/v4.2.5.tar.gz R2 eth1 eth2 Router R2 : Forwarding information base (FIB) B R3 /com/updates eth0 Pending Interest Table (PIT) C Content Store (CS) 5

  7. Forwarding flow • Focus on the Content Centric Networing approach [JST + 09] A • Interests hold full content name • Similar to CCNx (vs NDN) • CS and PIT: exact match R1 • Longest-prefix match at FIB eth0 Example: get /com/updates/sw/v4.2.5.tar.gz R2 eth1 eth2 Router R2 : Forwarding information base (FIB) B R3 /com/updates eth0 Pending Interest Table (PIT) /com/updates/sw/v4.2.5.tar.gz { eth1 } C Content Store (CS) 5

  8. Forwarding flow • Focus on the Content Centric Networing approach [JST + 09] A • Interests hold full content name • Similar to CCNx (vs NDN) • CS and PIT: exact match R1 • Longest-prefix match at FIB eth0 Example: get /com/updates/sw/v4.2.5.tar.gz R2 eth1 eth2 Router R2 : Forwarding information base (FIB) B R3 /com/updates eth0 Pending Interest Table (PIT) C Content Store (CS) (data. . . ) /com/updates/sw/v4.2.5.tar.gz 5

  9. Forwarding flow • Focus on the Content Centric Networing approach [JST + 09] A • Interests hold full content name • Similar to CCNx (vs NDN) • CS and PIT: exact match R1 • Longest-prefix match at FIB eth0 Example: get /com/updates/sw/v4.2.5.tar.gz R2 eth1 eth2 Router R2 : Forwarding information base (FIB) B R3 /com/updates eth0 Pending Interest Table (PIT) C Content Store (CS) (data. . . ) /com/updates/sw/v4.2.5.tar.gz 5

  10. The Augustus CCN router

  11. Design principles • Exploit parallelism at all possible levels: • Hardware multi-queue at NIC • DRAM memory channels • Multiple cores on chip • Multiple NUMA sockets • Data structures designed to match the x86 cache system • Shared read-only FIB, duplicated in all NUMA sockets • Sharded, thread-private CS and PIT • Exploit NIC’s Receive Side Scaling capabilities to dispatch incoming packets to threads • Zero-copy packet processing • Based on DPDK for fast packet I/O [Int] • Explored two trade-offs: max performance or more flexibility 7

  12. Design - standalone Low-level standalone C implementation: • Based on low-level optimized APIs • Pushes the platform to its limits • Architecture based on Caesar [PVL + 14] 8

  13. Design - modular FromDPDKDevice(n) I = Interest Packet 0 0 1 2 D = Data Packet InputMux Input port output port 0 0 • Based on (Fast)Click Check ICNHeader [KMC + 00, BSM15] 2 1 0 D I • Easy to extend, experiment 0 1 with ICN_CS 0 1 D (hit) • Same optimized data structures I(miss) 0 0 0 0 ICN_FIB ICN_PIT 1 • Can be deployed aside other 1 D(hit) 2 2 0 1 routing components I(hit) I(miss) Discard 0 OutputDemux 0 1 2 ToDPDKDevice(n) 9

  14. Performance evaluation

  15. Experimental setup • Two twin machines, each with two 10Gbps Ethernet ports • Measurements expressed in data packets per second • Work in slight overload conditions Worst-case assumptions: • Every interest packet has a unique name: no CS hits, no PIT aggregation • Minimal-sized packets, to stress the forwarding engine Augustus router eth1 eth0 interest interest data data Interest generator Echo server Traffic generator and sink 11

  16. Threads and core mapping Threads are pinned to processing cores Test servers: 2 sockets × 8 cores × 2 (hyperthreading) 0 L1 I L1 I 1 CPU CPU L2 L2 16 17 L1 D L1 D 2 L1 I 3 L1 I CPU L2 CPU L2 18 19 L1 D L1 D 4 L1 I L1 I 5 CPU CPU L2 L2 20 21 L1 D L1 D 6 L1 I L1 I 7 CPU CPU L2 L2 22 23 L1 D L1 D L3 L3 8 L1 I L1 I 9 CPU L2 CPU L2 24 L1 D 25 L1 D 10 L1 I L1 I 11 CPU CPU L2 L2 26 L1 D 27 L1 D 12 L1 I L1 I 13 CPU L2 CPU L2 28 29 L1 D L1 D 14 L1 I L1 I 15 CPU L2 CPU L2 30 L1 D 31 L1 D 12

  17. Threads and core mapping Threads are pinned to processing cores Test servers: 2 sockets × 8 cores × 2 (hyperthreading) 0 L1 I L1 I 1 CPU CPU L2 L2 16 17 L1 D L1 D 2 L1 I 3 L1 I CPU L2 CPU L2 18 19 L1 D L1 D 4 L1 I L1 I 5 CPU CPU L2 L2 20 21 L1 D L1 D 6 L1 I L1 I 7 CPU CPU L2 L2 22 23 L1 D L1 D L3 L3 8 L1 I L1 I 9 CPU L2 CPU L2 24 L1 D 25 L1 D 10 L1 I L1 I 11 CPU CPU L2 L2 26 L1 D 27 L1 D 12 L1 I L1 I 13 CPU L2 CPU L2 28 29 L1 D L1 D 14 L1 I L1 I 15 CPU L2 CPU L2 30 L1 D 31 L1 D 12

  18. Threads and core mapping Threads are pinned to processing cores Test servers: 2 sockets × 8 cores × 2 (hyperthreading) 0 L1 I L1 I 1 CPU CPU L2 L2 16 17 L1 D L1 D 2 L1 I 3 L1 I CPU L2 CPU L2 18 19 L1 D L1 D 4 L1 I L1 I 5 CPU CPU L2 L2 20 21 L1 D L1 D 6 L1 I L1 I 7 CPU CPU L2 L2 22 23 L1 D L1 D L3 L3 8 L1 I L1 I 9 CPU L2 CPU L2 24 L1 D 25 L1 D 10 L1 I L1 I 11 CPU CPU L2 L2 26 L1 D 27 L1 D 12 L1 I L1 I 13 CPU L2 CPU L2 28 29 L1 D L1 D 14 L1 I L1 I 15 CPU L2 CPU L2 30 L1 D 31 L1 D 12

  19. Threads and core mapping Threads are pinned to processing cores Test servers: 2 sockets × 8 cores × 2 (hyperthreading) 0 L1 I L1 I 1 CPU CPU L2 L2 16 17 L1 D L1 D 2 L1 I 3 L1 I CPU L2 CPU L2 18 19 L1 D L1 D 4 L1 I L1 I 5 CPU CPU L2 L2 20 21 L1 D L1 D 6 L1 I L1 I 7 CPU CPU L2 L2 22 23 L1 D L1 D L3 L3 8 L1 I L1 I 9 CPU L2 CPU L2 24 L1 D 25 L1 D 10 L1 I L1 I 11 CPU CPU L2 L2 26 L1 D 27 L1 D 12 L1 I L1 I 13 CPU L2 CPU L2 28 29 L1 D L1 D 14 L1 I L1 I 15 CPU L2 CPU L2 30 L1 D 31 L1 D 12

  20. Threads and core mapping Threads are pinned to processing cores Test servers: 2 sockets × 8 cores × 2 (hyperthreading) 0 L1 I L1 I 1 CPU CPU L2 L2 16 17 L1 D L1 D 2 L1 I 3 L1 I CPU L2 CPU L2 18 19 L1 D L1 D 4 L1 I L1 I 5 CPU CPU L2 L2 20 21 L1 D L1 D 6 L1 I L1 I 7 CPU CPU L2 L2 22 23 L1 D L1 D L3 L3 8 L1 I L1 I 9 CPU L2 CPU L2 24 L1 D 25 L1 D 10 L1 I L1 I 11 CPU CPU L2 L2 26 L1 D 27 L1 D 12 L1 I L1 I 13 CPU L2 CPU L2 28 29 L1 D L1 D 14 L1 I L1 I 15 CPU L2 CPU L2 30 L1 D 31 L1 D 12

  21. Threads and core mapping Threads are pinned to processing cores Test servers: 2 sockets × 8 cores × 2 (hyperthreading) 0 L1 I L1 I 1 CPU CPU L2 L2 16 17 L1 D L1 D 2 L1 I 3 L1 I CPU L2 CPU L2 18 19 L1 D L1 D 4 L1 I L1 I 5 CPU CPU L2 L2 20 21 L1 D L1 D 6 L1 I L1 I 7 CPU CPU L2 L2 22 23 L1 D L1 D L3 L3 8 L1 I L1 I 9 CPU L2 CPU L2 24 L1 D 25 L1 D 10 L1 I L1 I 11 CPU CPU L2 L2 26 L1 D 27 L1 D 12 L1 I L1 I 13 CPU L2 CPU L2 28 29 L1 D L1 D 14 L1 I L1 I 15 CPU L2 CPU L2 30 L1 D 31 L1 D 12

  22. Threads and core mapping Threads are pinned to processing cores Test servers: 2 sockets × 8 cores × 2 (hyperthreading) 0 L1 I L1 I 1 CPU CPU L2 L2 16 17 L1 D L1 D 2 L1 I 3 L1 I CPU L2 CPU L2 18 19 L1 D L1 D 4 L1 I L1 I 5 CPU CPU L2 L2 20 21 L1 D L1 D 6 L1 I L1 I 7 CPU CPU L2 L2 22 23 L1 D L1 D L3 L3 8 L1 I L1 I 9 CPU L2 CPU L2 24 L1 D 25 L1 D 10 L1 I L1 I 11 CPU CPU L2 L2 26 L1 D 27 L1 D 12 L1 I L1 I 13 CPU L2 CPU L2 28 29 L1 D L1 D 14 L1 I L1 I 15 CPU L2 CPU L2 30 L1 D 31 L1 D 12

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend