Your SlideShare is downloading. ×
CCNxCon2012: Session 4: Caesar:  a Content Router for High Speed Forwarding
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×

Introducing the official SlideShare app

Stunning, full-screen experience for iPhone and Android

Text the download link to your phone

Standard text messaging rates apply

CCNxCon2012: Session 4: Caesar: a Content Router for High Speed Forwarding

529
views

Published on

Caesar: a Content Router for High Speed Forwarding …

Caesar: a Content Router for High Speed Forwarding
Matteo Varvello, Diego Perino, Jairo Esteban (Bell Labs, Alcatel-Lucent)


0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
529
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
11
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. Caesar: a Content Routerfor High Speed ForwardingMatteo Varvello, Diego Perino, Jairo EstebanBell Labs, Alcatel-LucentCCNxCon2012, September 13th,2012, Sophia Antipolis COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 2. Forwarding Information BaseFIB performs component-wise longest prefix matching Interest names -  e.g. ccnx://BellLabs/ICN/talks/reality.avi/chunk0 (B=5 components)•  Hardware-based approaches (TCAM)•  Software-based solution -  Multi-bit tries -  Bloom filter SRAM Bloom filters DRAM RLDRAM Prefix hash-table COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 3. AGENDARationaleDesignEvaluationWhat s next? 3 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 4. RationaleLongest Prefix Match (LPM) should be as much independent aspossible from the length of content names Number of components, and character per componentDistribute the forwarding table across line cards to maximize size 4 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 5. Design – LPM – Distributed Bloom Filters (DLB-BFs) IPv6 Lookups using Distributed and Load Balanced Bloom Filters for 100Gbps Core Router Line Cards. Haoyu Song, Fang Hao, Murali S. Kodialam, T. V. Lakshman INFOCOM 2009 5 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 6. Design – LPM – Distributed Bloom Filters (DLB-BFs) K DLB-BFs independently of the prefix length Map each content prefix to K bits, independently of the number ofcharacters per component Perform B*K hash functions in parallel Dimension system for high Bmax*K (hardware limits) Avoid slow LPM for long content names via prefix expansion 6 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 7. Design – Distributed Packet Processing h(comp1)modN 7 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 8. Results – Single Line cardXilinx Virtex-6 and NetFPGA 40G board ; Bmax=128, T=64 8 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 9. Results – Whole Router 9 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 10. What s next? 10 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 11. Questions? 11 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 12. Forwarding Information BaseFIB performs component-wise longest prefix matching Interest names -  e.g. ccnx://BellLabs/ICN/talks/reality.avi/chunk0 (B=5 components)Hardware-based approaches (TCAM)Software-based solution-  Multi-bit tries-  Bloom filter SRAM Bloom filters DRAM RLDRAM Prefix hash-table 12 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 13. 66Mps = half of the LPM operation rate performed today by each line card of a core router10 Milion prefixes=2% of today sglobally unique and routablehostnames 13 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 14. Numerical Evaluation Reference design is Xilinx Virtex-6 and NetFPGA 40G board On-chip memory 34Mbit with up to 1,064 2-port SRAM blocks (32Kbit) Off-chip memory 216Mbits SRAM 2.3Gbit RLDRAM We divide the 1,064 2-port SRAM blocks across 8 DLBBFs Each DLB-BF is composed by 64 SRAM blocks (64Kbit) A 2-port SRAM block stores the LT We generate 128x8=1,024 hash functions Bmax=128,T=64 14 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 15. Design – Linecard Details If(B>Bmax) Prefix Expansionh(comp1)modN ;h=CRC-64 15 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 16. ConclusionsFIB design is a challenge for Information-Centric NetworkingWe design Caesar, a Content Router for High SpeedforwardingDistributed packet processingLPM implemented with distributed Bloom filtersOn-going and future workHardware implementationExtension to software router 16 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 17. Named Data Networking – Content Router •  CS (Content Store) is the same as buffer memory of an IP router but can 1 store a Data packet after it has been forwarded (caching). •  PIT (Pending Interest table) keeps track of forwarded Interests. Only one entry per similar requests is kept. •  FIB (Forwarding Information Base) is used to forward Interest packets toward potential sources using LPM lookup. A Reality Check for Content Centric Networking. Diego Perino and Matteo Varvello ICN2010 (Also published in CCR, October 2011) 17 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.
  • 18. Forwarding Information BaseFIB performs component-wise longest prefix matching Interest names -  e.g. ccnx://BellLabs/ICN/talks/reality.avi/chunk0 (B=5 components)•  Hardware-based approaches (TCAM)•  Software-based solution -  Multi-bit tries -  Bloom filter SRAM Bloom filters DRAM RLDRAM Prefix hash-table 18 COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED.