1 On the Aggregatability of Router Forwarding Tables Author: Xin Zhao, Yaoqing Liu, Lan Wang and Beichuan Zhang Publisher: IEEE INFOCOM 2010 Presenter:

Slides:



Advertisements
Similar presentations
An Internet Without IP Minaxi Gupta Computer Science Dept. Indiana University, Bloomington.
Advertisements

IEEE CCW 08 New Network Architectures: Why Bother? Paul Francis Cornell.
Quality-of-Service Routing in IP Networks Donna Ghosh, Venkatesh Sarangan, and Raj Acharya IEEE TRANSACTIONS ON MULTIMEDIA JUNE 2001.
August 17, 2000 Hot Interconnects 8 Devavrat Shah and Pankaj Gupta
Dynamic Routing Overview 1.
Exploiting Graphics Processors for High- performance IP Lookup in Software Routers Author: Jin Zhao, Xinya Zhang, Xin Wang, Yangdong Deng, Xiaoming Fu.
Dynamic Routing Scalable Infrastructure Workshop, AfNOG2008.
An Efficient IP Address Lookup Algorithm Using a Priority Trie Authors: Hyesook Lim and Ju Hyoung Mun Presenter: Yi-Sheng, Lin ( 林意勝 ) Date: Mar. 11, 2008.
1 Author: Ioannis Sourdis, Sri Harsha Katamaneni Publisher: IEEE ASAP,2011 Presenter: Jia-Wei Yo Date: 2011/11/16 Longest prefix Match and Updates in Range.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada ISP-Friendly Peer Matching without ISP Collaboration Mohamed Hefeeda (Joint.
Making Routers Last Longer with ViAggre Hitesh Ballani, Paul Francis, Tuan Cao and Jia Wang Cornell University and AT&T Labs- Research Presented by Gregory.
DYNAMICS OF PREFIX USAGE AT AN EDGE ROUTER Kaustubh Gadkari, Dan Massey and Christos Papadopoulos 1.
IP Address Lookup for Internet Routers Using Balanced Binary Search with Prefix Vector Author: Hyesook Lim, Hyeong-gee Kim, Changhoon Publisher: IEEE TRANSACTIONS.
1 On Constructing Efficient Shared Decision Trees for Multiple Packet Filters Author: Bo Zhang T. S. Eugene Ng Publisher: IEEE INFOCOM 2010 Presenter:
Efficient IP-Address Lookup with a Shared Forwarding Table for Multiple Virtual Routers Author: Jing Fu, Jennifer Rexford Publisher: ACM CoNEXT 2008 Presenter:
Scalable IPv6 Lookup/Update Design for High-Throughput Routers Authors: Chung-Ho Chen, Chao-Hsien Hsu, Chen -Chieh Wang Presenter: Yi-Sheng, Lin ( 林意勝.
Internet Routing (COS 598A) Today: BGP Routing Table Size Jennifer Rexford Tuesdays/Thursdays 11:00am-12:20pm.
SAVE: Source Address Validity Enforcement Protocol Jun Li, Jelena Mirković, Mengqiu Wang, Peter Reiher and Lixia Zhang UCLA Computer Science Dept 10/04/2001.
CS335 Networking & Network Administration Tuesday, May 18, 2010.
1 A Fast IP Lookup Scheme for Longest-Matching Prefix Authors: Lih-Chyau Wuu, Shou-Yu Pin Reporter: Chen-Nien Tsai.
A a secure peering. RIB table dump by attributes in order to save space. References 1. RouteViews, 2. RIPE,
Announcements List Lab is still under construction Next session we will have paper discussion, assign papers,
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Hash, Don’t Cache: Fast Packet Forwarding for Enterprise Edge Routers Minlan Yu Princeton University Joint work with Jennifer.
CS 6401 Efficient Addressing Outline Addressing Subnetting Supernetting.
Better by a HAIR: Hardware-Amenable Internet Routing Brent Mochizuki University of Illinois at Urbana-Champaign Joint work with: Firat Kiyak (Illinois)
UCSC 1 Aman ShaikhICNP 2003 An Efficient Algorithm for OSPF Subnet Aggregation ICNP 2003 Aman Shaikh Dongmei Wang, Guangzhi Li, Jennifer Yates, Charles.
FAR: A Fault-avoidance Routing Method for Data Center Networks with Regular Topology Bin Liu, ZTE.
FIB Aggregation Zartash Uzmi draft-uzmi-smalta-01 (with Ahsan Tariq and Paul Francis)
1 Route Table Partitioning and Load Balancing for Parallel Searching with TCAMs Department of Computer Science and Information Engineering National Cheng.
CRIO: Scaling IP Routing with the Core Router-Integrated Overlay Xinyang (Joy) Zhang Paul Francis Jia Wang Kaoru Yoshida.
I-4 routing scalability Taekyoung Kwon Some slides are from Geoff Huston, Michalis Faloutsos, Paul Barford, Jim Kurose, Paul Francis, and Jennifer Rexford.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Authors: Yi Wang, Tian Pan, Zhian Mi, Huichen Dai, Xiaoyu Guo, Ting Zhang, Bin Liu, and Qunfeng Dong Publisher: INFOCOM 2013 mini Presenter: Chai-Yi Chu.
Scalable Name Lookup in NDN Using Effective Name Component Encoding
Efficient Addressing Outline Addressing Subnetting Supernetting CS 640.
Fast Packet Classification Using Bloom filters Authors: Sarang Dharmapurikar, Haoyu Song, Jonathan Turner, and John Lockwood Publisher: ANCS 2006 Present:
David Wetherall Professor of Computer Science & Engineering Introduction to Computer Networks Hierarchical Routing (§5.2.6)
1 TaCo: Semantic Equivalence of IP Prefix Tables Author: Ahsan Tariq, Sana Jawad and Zartash Afzal Uzmi Publisher: IEEE ICCCN 2011 Presenter: Li-Hsien,
1 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.
A Firewall for Routers: Protecting Against Routing Misbehavior1 June 26, A Firewall for Routers: Protecting Against Routing Misbehavior Jia Wang.
Vytautas Valancius, Nick Feamster, Akihiro Nakao, and Jennifer Rexford.
EECB 473 DATA NETWORK ARCHITECTURE AND ELECTRONICS PREPARED BY JEHANA ERMY JAMALUDDIN Basic Packet Processing: Algorithms and Data Structures.
Content-oriented Networking Platform: A Focus on DDoS Countermeasure ( In incremental deployment perspective) Authors: Junho Suh, Hoon-gyu Choi, Wonjun.
A Light-Weight Distributed Scheme for Detecting IP Prefix Hijacks in Real-Time Lusheng Ji†, Joint work with Changxi Zheng‡, Dan Pei†, Jia Wang†, Paul Francis‡
1 Evolution Towards Global Routing Scalability draft-zhang-evolution-01 Varun Khare Beichuan Zhang
PARALLEL-SEARCH TRIE- BASED SCHEME FOR FAST IP LOOKUP Author: Roberto Rojas-Cessa, Lakshmi Ramesh, Ziqian Dong, Lin Cai Nirwan Ansari Publisher: IEEE GLOBECOM.
Eliminating Packet Loss Caused by BGP Convergence Nate Kushman Srikanth Kandula, Dina Katabi, and Bruce Maggs.
High-Speed Policy-Based Packet Forwarding Using Efficient Multi-dimensional Range Matching Lakshman and Stiliadis ACM SIGCOMM 98.
On Improving the Efficiency and Manageability of NotVia Ang Li †, Pierre Francois ‡, and Xiaowei Yang † † UCIrvine ‡ Université catholique de Louvain CoNext.
Author: Haoyu Song, Murali Kodialam, Fang Hao and T.V. Lakshman Publisher/Conf. : IEEE International Conference on Network Protocols (ICNP), 2009 Speaker:
Toward Reliable and Efficient Reporting in Wireless Sensor Networks Authors: Fatma Bouabdallah Nizar Bouabdallah Raouf Boutaba.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
1 IP Routing table compaction and sampling schemes to enhance TCAM cache performance Author: Ruirui Guo, Jose G. Delgado-Frias Publisher: Journal of Systems.
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Loop-Free Updates of Forwarding Tables Author : Jing Fu, Peter Sjödin and Gunnar Karlsson Publisher : IEEE Transactions on Network and Service Management.
Delivery and Forwarding Chapter 18 COMP 3270 Computer Networks Computing Science Thompson Rivers University.
Congestion Avoidance with Incremental Filter Aggregation in Content-Based Routing Networks Mingwen Chen 1, Songlin Hu 1, Vinod Muthusamy 2, Hans-Arno Jacobsen.
Atrium Router Project Proposal Subhas Mondal, Manoj Nair, Subhash Singh.
BUFFALO: Bloom Filter Forwarding Architecture for Large Organizations Minlan Yu Princeton University Joint work with Alex Fabrikant,
Exploiting Graphics Processors for High-performance IP Lookup in Software Routers Jin Zhao, Xinya Zhang, Xin Wang, Yangdong Deng, Xiaoming Fu IEEE INFOCOM.
Authors: Jiang Xie, Ian F. Akyildiz
Evolution Towards Global Routing Scalability
IP Routers – internal view
Toward Advocacy-Free Evaluation of Packet Classification Algorithms
SCOPE: Scalable Consistency in Structured P2P Systems
Statistical Optimal Hash-based Longest Prefix Match
A Trie Merging Approach with Incremental Updates for Virtual Routers
Towards TCAM-based Scalable Virtual Routers
Presentation transcript:

1 On the Aggregatability of Router Forwarding Tables Author: Xin Zhao, Yaoqing Liu, Lan Wang and Beichuan Zhang Publisher: IEEE INFOCOM 2010 Presenter: Li-Hsien, Hsu Data: 9/28/2011

I. Introduction Two types of tables used by routers: RIB(Routing Information Base) for routing FIB(Forwarding Information Base) for forwarding FIB is derived from RIB. FIB usually uses high performance memory, which is more expensive and more difficult to scale. Therefore, their size is a more immediate concern to ISPs and vendors. 2

I. Introduction 3 Routing Scalability Problem RIB growth => FIB growth FIB growth: A high priority concern (From: bgp.potaroo.net)

FIB Aggregation(FA) What is FA? Within one router, combines multiple RIB entries with the same next hop into one. FA pros and cons − Purely local no change to routing protocol − No impact on packet forwarding − Compatible with other proposed routing scalability solution(IPv6) − But extra CPU processing time 4

Forwarding Correctness Strong forwarding correctness − Longest match before/after aggregation ends up with the same for all prefixes Weak forwarding correctness − Prefixes with Non-NULL nexthops, the same − Prefixes with NULL nexthops, might routable after aggregation − extra routable space 5

FIB Aggregation Techniques & Algorithm Filled nodes are extra routable space introduced by the aggregation. 4A, 4B. 6

Updates Handling Full aggregation per update is costly Significant computation overhead Three approaches to handle routing changes to keep computation overhead low: Operators choose an appropriate level of aggregation. Incrementally update the aggregated FIB Minimize computation, not the table size Re-run full FIB aggregation periodically The trigger can be a timer, a threshold on FIB size, and/or current router CPU load 7

Evaluation Data Source − BGP routing tables and updates from RouteView Project Evaluation Platform and implementation − Commodity PC, single thread process − Algorithms implemented in C without optimization 8

Table Size after FA 9 RouteViews Oregon tables on Each level reduces FIB size more. Level-1 30%~50%, Level-4 60%~90%

Table Size Over Time Median of table size ratio, 2001~2008 An overall slightly decreasing trend(, suggesting that the FIB has become more amenable to aggregation over the years.) 10

What does the ratio mean? If Level-4 applied, router deployed in 2000 can still be used today

Computation Time Computing time only takes tens to several hundreds milliseconds 12

Updates Process Among all the updates, 2,914,020 of them cause changes to unaggregated FIB. 13 ABA/BCB/CDD/7,254,478

Periodical Re-Aggregation With threshold 150,000, on average the FIB needs to be re-aggregated every 5 days 14

Conclusion The table size can be reduced by 30-70%, which translates to 2-8 years extra router lifetime The computation overhead is small and can be controlled by incremental update handling plus periodic re-aggregation. 15

Reference