DYNAMICS OF PREFIX USAGE AT AN EDGE ROUTER Kaustubh Gadkari, Dan Massey and Christos Papadopoulos 1.

Slides:



Advertisements
Similar presentations
Multihoming and Multi-path Routing
Advertisements

Routing System Stability draft-dimitri-grow-rss-01.txt IETF71 - Philadelphia.
Offloading Routing Complexity to the Cloud(s) Hasan T. Karaoglu, Murat Yuksel University of Nevada, Reno ICC13, Budapest June, 2013.
1 End-to-End Routing Behavior in the Internet Internet Routing Instability Presented by Carlos Flores Gaurav Jain May 31st CS 6390 Advanced Computer.
1 Scalability is King. 2 Internet: Scalability Rules Scalability is : a critical factor in every decision Ease of deployment and interconnection The intelligence.
Dynamic Routing Scalable Infrastructure Workshop, AfNOG2008.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
What should you Cache? A Global Analysis on YouTube Related Video Caching Dilip Kumar Krishnappa, Michael Zink and Carsten Griwodz NOSSDAV 2013.
Forwarding Redundancy in Opportunistic Mobile Networks: Investigation and Elimination Wei Gao 1, Qinghua Li 2 and Guohong Cao 3 1 The University of Tennessee,
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.
1 Finding a Needle in a Haystack: Pinpointing Significant BGP Routing Changes in an IP Network Jian Wu (University of Michigan) Z. Morley Mao (University.
Efficient IP-Address Lookup with a Shared Forwarding Table for Multiple Virtual Routers Author: Jing Fu, Jennifer Rexford Publisher: ACM CoNEXT 2008 Presenter:
CSEE W4140 Networking Laboratory Lecture 4: IP Routing (RIP) Jong Yul Kim
CSEE W4140 Networking Laboratory Lecture 4: IP Routing (RIP) Jong Yul Kim
1 Deriving Traffic Demands for Operational IP Networks: Methodology and Experience Anja Feldmann*, Albert Greenberg, Carsten Lund, Nick Reingold, Jennifer.
Dynamics of Hot-Potato Routing in IP Networks Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
Mutually Controlled Routing with Independent ISPs Offense Gary Bramwell Zhaosheng Zhu.
Measurement in the Internet. Outline Internet topology Bandwidth estimation Tomography Workload characterization Routing dynamics.
048866: Packet Switch Architectures Dr. Isaac Keslassy Electrical Engineering, Technion Introduction.
Impact of BGP Dynamics on Intra-Domain Traffic Patterns in the Sprint IP Backbone Sharad Agarwal, Chen-Nee Chuah, Supratik Bhattacharyya, Christophe Diot.
RD-CSY /09 Distance Vector Routing Protocols.
On Multi-Path Routing Aditya Akella 03/25/02. What is Multi-Path Routing?  Dynamically route traffic Multiple paths to a destination Path taken dependant.
Hash, Don’t Cache: Fast Packet Forwarding for Enterprise Edge Routers Minlan Yu Princeton University Joint work with Jennifer.
Better by a HAIR: Hardware-Amenable Internet Routing Brent Mochizuki University of Illinois at Urbana-Champaign Joint work with: Firat Kiyak (Illinois)
Routing Protocols and CIDR BSAD 146 Dave Novak Sources: Network+ Guide to Networks, Dean 2013.
FIB Aggregation Zartash Uzmi draft-uzmi-smalta-01 (with Ahsan Tariq and Paul Francis)
CRIO: Scaling IP Routing with the Core Router-Integrated Overlay Xinyang (Joy) Zhang Paul Francis Jia Wang Kaoru Yoshida.
Network Sensitivity to Hot-Potato Disruptions Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
I-4 routing scalability Taekyoung Kwon Some slides are from Geoff Huston, Michalis Faloutsos, Paul Barford, Jim Kurose, Paul Francis, and Jennifer Rexford.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Redundancy, Symmetry and Load Balancing Presented by Sagi Shporer.
By Sylvia Ratnasamy, Andrey Ermolinskiy, Scott Shenker Presented by Fei Jia Revisiting IP Multicast.
How Secure are Secure Inter- Domain Routing Protocols? SIGCOMM 2010 Presenter: kcir.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
Wire Speed Packet Classification Without TCAMs ACM SIGMETRICS 2007 Qunfeng Dong (University of Wisconsin-Madison) Suman Banerjee (University of Wisconsin-Madison)
David Wetherall Professor of Computer Science & Engineering Introduction to Computer Networks Hierarchical Routing (§5.2.6)
Inter-Domain Routing Trends Geoff Huston APNIC March 2007.
Routing Policies in Named Data Networking Steve DiBenedetto Christos Papadopoulos Dan Massey.
BGP topics to be discussed in the next few weeks: –Excessive route update –Routing instability –BGP policy issues –BGP route slow convergence problem –Interaction.
Vytautas Valancius, Nick Feamster, Akihiro Nakao, and Jennifer Rexford.
A Measurement Study on the Impact of Routing Events on End-to-End Internet Path Performance Feng Wang 1, Zhuoqing Morley Mao 2 Jia Wang 3, Lixin Gao 1,
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Inter-domain routing Some slides used with.
On Understanding of Transient Interdomain Routing Failures Feng Wang, Lixin Gao, Jia Wang, and Jian Qiu Department of Electrical and Computer Engineering.
April 4th, 2002George Wai Wong1 Deriving IP Traffic Demands for an ISP Backbone Network Prepared for EECE565 – Data Communications.
1 Quantifying Path Exploration in the Internet Ricardo Oliveira, Rafit Izhak-Ratzin, Lixia Zhang, UCLA Beichuan Zhang, UArizona Dan Pei, AT&T Labs -- Research.
1 A Framework for Measuring and Predicting the Impact of Routing Changes Ying Zhang Z. Morley Mao Jia Wang.
CCNA 2 Week 6 Routing Protocols. Copyright © 2005 University of Bolton Topics Static Routing Dynamic Routing Routing Protocols Overview.
Distance Vector Routing Protocols Dynamic Routing.
On Improving the Efficiency and Manageability of NotVia Ang Li †, Pierre Francois ‡, and Xiaowei Yang † † UCIrvine ‡ Université catholique de Louvain CoNext.
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
Routing Metrics and Protocols for Wireless Mesh Networks Speaker : 吳靖緯 MA0G0101.
Computer Networks22-1 Network Layer Delivery, Forwarding, and Routing.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—1-1 Course Introduction.
7/11/0666th IETF1 QoS Enhancements to BGP in Support of Multiple Classes of Service Andreas Terzis Computer Science Department Johns Hopkins University.
Investigating the Prefix-level Characteristics A Case Study in an IPv6 Network Department of Computer Science and Information Engineering, National Cheng.
1 On the Aggregatability of Router Forwarding Tables Author: Xin Zhao, Yaoqing Liu, Lan Wang and Beichuan Zhang Publisher: IEEE INFOCOM 2010 Presenter:
Shrinking and Controlling Routing Table Size Xinyang (Joy) Zhang Paul Francis Jia Wang Kaoru Yoshida.
1 Monitoring: from research to operations Christophe Diot and the IP Sprintlabs ipmon.sprintlabs.com.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
Introduction to OSPF Campus Networking Workshop These materials are licensed under the Creative Commons Attribution-Noncommercial 3.0 Unported license.
Working at a Small-to-Medium Business or ISP – Chapter 6
Jian Wu (University of Michigan)
Evolution Towards Global Routing Scalability
COMP 3270 Computer Networks
Working at a Small-to-Medium Business or ISP – Chapter 6
Cours BGP-MPLS-IPV6-QOS
Improving the Freshness of NDN Forwarding States
Working at a Small-to-Medium Business or ISP – Chapter 6
COMP/ELEC 429/556 Introduction to Computer Networks
Presentation transcript:

DYNAMICS OF PREFIX USAGE AT AN EDGE ROUTER Kaustubh Gadkari, Dan Massey and Christos Papadopoulos 1

Outline 2  Introduction – BGP  RIB and FIB growth  Motivation  Methodology  Results  Conclusions and future work

Outline 3  Introduction – BGP  RIB and FIB growth  Motivation  Methodology  Results  Conclusions and future work

Inter-Domain Routing 4 CSU /16, /18 … Google /16, … BGP

BGP Tables 5 Router Memory Routing Table (RIB) Routing Table (RIB) Routing Updates Forwarding Table (FIB) Forwarding Table (FIB) Line Card (Prefix, Path) Forwarding Table (FIB) Forwarding Table (FIB) Forwarding Table (FIB) Forwarding Table (FIB) (Prefix, Outgoing Interface, Next Hop)

Outline 6  Introduction – BGP  RIB and FIB growth  Motivation  Methodology  Results  Conclusions and future work

Table Growth  The size of the global routing is growing rapidly.  Increasing routing table size requires more memory on routers.  Operators are forced into faster upgrade cycles. 7

Implications of Table Growth 8  RIB size affects FIB size.  FIB scaling is arguably more important.  FIBs stored on line card memory, which is smaller and more expensive than main memory.

Outline 9  Introduction – BGP  RIB and FIB growth  Motivation  Methodology  Results  Conclusions and future work

Motivation 10  Some current research focuses on scaling the FIB by storing partial forwarding information.  But how to choose prefixes in a reduced FIBs?  Prefixes receiving most packets should probably be in the table.  But are there better criteria to define a dominant set?  How does it behave?

Motivation (contd.) 11  Previous work focused on prefix popularity over days or weeks.  Tradeoff that prefers ease of selection.  Optimum prefix selection is a hard problem.  Factors: traffic volume, activity patterns and interplay of traffic dynamics  This work: understand prefix dynamics better.

Outline 12  Introduction – BGP  RIB and FIB growth  Motivation  Methodology  Results  Conclusions and future work

Methodology 13  Monitor links to two tier-1 provider links (1Gb/s each) at a regional ISP.  Dataset: two simultaneous 24-hour packet traces from these links.  Use outgoing packets only.

Old Metric: Global Rank  Rank prefixes according to number of packets during the full 24-hour trace.  This is the prefix’s global rank.  Plot number of prefixes that account for a given fraction of packets. 14  Results corroborate previous studies.

Measuring Prefix Dynamics 15  Split traffic trace into small intervals (5 min).  Rank prefixes in each interval according to number of packets.  We call this the prefix’s interval rank.

New Metrics 16  Duty cycle  Fraction of the total number of intervals in which the prefix receives at least one packet.  Mean rank difference  Variation of a prefix’s interval rank from its global rank.

Outline 17  Introduction – BGP  RIB and FIB growth  Motivation  Methodology  Results  Conclusions and future work

Duty Cycle 18  Measure of prefix’s activity. High duty cycle, high traffic Low duty cycle, low traffic ~200 prefixes ~56,000 prefixes ~56,000 prefixes High duty cycle, low traffic ~24,000 prefixes ~24,000 prefixes Low duty cycle, high traffic ~10 prefixes Global Prefix Rank

Duty Cycle Observations 19  Popular prefixes have high duty cycles.  Always get packets.  Several popular prefixes have a duty cycle of > 90%.

Mean Rank Difference 20  Measure of prefix’s “busy-ness”. Stable Prefixes Less than 1% of all prefixes, 40% of all packets Less than 1% of all prefixes, 40% of all packets Generally Popular Prefixes 5% of all prefixes, 55% of all packets Generally Unpopular Prefixes 60% of all prefixes, 5% of all traffic Global Prefix Rank

Outline 21  Introduction – BGP  RIB and FIB growth  Motivation  Methodology  Results  Conclusions and future work

Conclusions 22  Understanding dynamic behavior of FIB prefixes is important for reduced-FIB designs.  Proposed two new metrics: Duty cycle and mean rank difference  We corroborated previous work showing set of dominant prefixes is small.  New metrics characterize the dominant set better, which is generally active and busy.  Majority of the prefixes have very low activity opening up caching opportunities.  Results encouraging in terms of developing reduced FIB designs.

Future Work 23  Investigate prefix dynamics at other ISPs.  Investigate prefix dynamics at different intervals.  Develop a design for efficient forwarding using a reduced FIB.