SlideShare a Scribd company logo
Traffic Dynamics  at a Commercial Backbone POP Nina Taft Sprint ATL Co-authors: Supratik Bhattacharyya, Jorjeta Jetcheva, Christophe Diot
Outline  Part 1: what are the traffic demands between pairs of POPs? How stable is this demand? Part 2: what are the paths taken by those demands? Are link utilizations levels similar throughout the backbone? Part 3: is there a better way to spread the traffic across paths? Can we divert some traffic to lightly loaded paths?
The Sprint IPMon Project Passive monitoring Capture header (44 bytes) from every packet full TCP/IP headers, no http information Use GPS time stamping - allows accurate correlating of packets on different links Day long traces Simultaneously monitor multiple links and sites. Collect routing information along with packet traces. Traces archived for future use
IP Backbone : POP-to-POP view POP fanout: one row of POP-to-POP traffic matrix OC-48 OC-12 OC-192
POP-to-POP Traffic Matrix Measure traffic over different timescales Divide traffic per destination prefix, protocol, etc. For every ingress POP : Identify total traffic to each egress POP Further analyze this traffic City A City B City C City A City B City C
The Mapping Problem What is the egress POP for a packet  entering  a given ingress POP?
Monitored links at a single POP Core Core Core Publicpeer 2 web host ISP Public peer 1 Date : Aug 9, 2000 Access Access Access Access
Traffic Fanout: POP level granularity
Fanout: web host links
Time-of-Day for POP level granularity
Day-Night Variation : Webhost #1 % reduction at night between 20-50% depending upon access link
Summary so far ... Wide disparity in “traffic demands” among egress POPs  POPs can be roughly categorized as : small, medium, large; and they maintain their rank during the day. Traffic is heterogeneous in space yet stable in time. 20-50% reduction at night
Outline  Part 1: what are the traffic demands between pairs of POPs? How stable is this demand? Part 2: what are the paths taken by those demands? Are link utilizations levels similar throughout the backbone? Part 3: is there a better way to spread the traffic across paths? Can we divert some traffic to lightly loaded paths?
Paths used by traffic demands Our Observations (summary) routing policies concentrate traffic on a few paths: between two POPs, all the traffic uses either the same route, or 1 or 2 routes the ISIS weights are changed very infrequently (once a month), so routing is fairly static there are many underutilized routes
Is backbone traffic balanced?
Part 3 : Can we divert some traffic to lightly loaded paths? Approach: to improve load balancing by rerouting only a few flows scalable Which flows? Heavy hitters. How identify heavy hitters:  Consider: destination prefix-based flows at fixed prefix lengths: 8 and 16 BGP table entries (variable prefix length)
Streams based on destination prefix Stream : all packets in a group with same /8 destination address prefix Traffic grouped by egress POPs Ingress : Webhost Link Similar results for /16 and bgp table prefixes
Stability of prefix-based streams R i (n) = the rank of flow  i  at time slot  n    i,n,k = | R i (n) - R i (n+k) | each time slot Stability of prefix rank
Conclusions We have used our data to build components of traffic matrices for traffic engineering Heterogeneous traffic fanout from POP Current routing practices lead to many underutilized links and paths thus, there is a lot of room for improved load balancing techniques. Load-balancing using flows selected via destination-prefixes is a simple and promising criterion
Ongoing Work Intra-domain Routing : Choosing ISIS link weights Multi-path routing Flow Characterization at the network prefix level Inference techniques for building POP-to-POP traffic matices

More Related Content

PDF
BGP-papaer
PDF
Fuessler wkmh03
PPTX
Routing papers in ccn
PDF
Enrich multi-channel P2P VoD streaming based on dynamic replication strategy
DOC
CYPcorridor_Paper
DOCX
Cognitive radio aware transport protocol for mobile ad hoc networks
PDF
High- Throughput CAM Based On Search and Shift Mechanism
BGP-papaer
Fuessler wkmh03
Routing papers in ccn
Enrich multi-channel P2P VoD streaming based on dynamic replication strategy
CYPcorridor_Paper
Cognitive radio aware transport protocol for mobile ad hoc networks
High- Throughput CAM Based On Search and Shift Mechanism

What's hot (18)

DOC
Performance evaluation of gsm handover traffic in a gprsgsm network
PDF
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...
PDF
Traffic Dynamics in Virtual Routing Multi Topology System
PDF
Ijarcet vol-2-issue-7-2351-2356
PDF
Traffic Engineering in Software Defined Networking SDN
PDF
QoS based Admission Control using Multipath Scheduler for IP over Satellite N...
DOC
A neighbor coverage based probabilistic rebroadcast for reducing routing over...
PDF
Fundamental limits of cdf based scheduling throughput, fairness, and feedback...
PDF
From System Logs to System Optimization with the Power of Data Science and Ma...
PDF
Caching strategies for on demand routing protocols for wireless ad hoc network
DOCX
Ip routing
PDF
Experimental evaluation of scalability and reliability of a feedback based up...
PDF
Uwicore vtc07 effect of channel-quality indicator delay on hsdpa performance
PDF
A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc ...
PDF
A way of managing data center networks
PDF
A survey on mac strategies for cognitive radio networks
PDF
Link Prediction And Link Establishment Based On Network Nodes Life Time In Mo...
PDF
Creating a Hydrological Network for the Yukon Territory
Performance evaluation of gsm handover traffic in a gprsgsm network
Cost Effective Routing Protocols Based on Two Hop Neighborhood Information (2...
Traffic Dynamics in Virtual Routing Multi Topology System
Ijarcet vol-2-issue-7-2351-2356
Traffic Engineering in Software Defined Networking SDN
QoS based Admission Control using Multipath Scheduler for IP over Satellite N...
A neighbor coverage based probabilistic rebroadcast for reducing routing over...
Fundamental limits of cdf based scheduling throughput, fairness, and feedback...
From System Logs to System Optimization with the Power of Data Science and Ma...
Caching strategies for on demand routing protocols for wireless ad hoc network
Ip routing
Experimental evaluation of scalability and reliability of a feedback based up...
Uwicore vtc07 effect of channel-quality indicator delay on hsdpa performance
A Novel Rebroadcast Technique for Reducing Routing Overhead In Mobile Ad Hoc ...
A way of managing data center networks
A survey on mac strategies for cognitive radio networks
Link Prediction And Link Establishment Based On Network Nodes Life Time In Mo...
Creating a Hydrological Network for the Yukon Territory
Ad

Viewers also liked (20)

PPTX
Motion
PDF
6. balance laws jan 2013
PPT
fluid mechanics
PPTX
Conservation Laws
PPT
Application of Fluid Dynamics In Traffic Management
PPTX
A Macroscopic Dynamic model integrated into Dynamic Traffic Assignment: advan...
DOCX
Project Full
PDF
Değişim Dinamikleri
PPT
Basic differential equations in fluid mechanics
DOCX
Traffic congestion
PPSX
Ch 04 MATLAB Applications in Chemical Engineering_陳奇中教授教學投影片
PDF
IMPORTANCE OF MATHEMATICS IN ENGINEERING
PPT
Physics Presentation
PPTX
Traffic Flow Fundamentals
PPTX
Fluid mechanics
PPTX
First order linear differential equation
PPTX
Traffic Volume Studies
PPT
02 first order differential equations
PPTX
Ode powerpoint presentation1
PPTX
Conservation of natural resources.ppt
Motion
6. balance laws jan 2013
fluid mechanics
Conservation Laws
Application of Fluid Dynamics In Traffic Management
A Macroscopic Dynamic model integrated into Dynamic Traffic Assignment: advan...
Project Full
Değişim Dinamikleri
Basic differential equations in fluid mechanics
Traffic congestion
Ch 04 MATLAB Applications in Chemical Engineering_陳奇中教授教學投影片
IMPORTANCE OF MATHEMATICS IN ENGINEERING
Physics Presentation
Traffic Flow Fundamentals
Fluid mechanics
First order linear differential equation
Traffic Volume Studies
02 first order differential equations
Ode powerpoint presentation1
Conservation of natural resources.ppt
Ad

Similar to (Powerpoint slides) (20)

PPT
Carrier Strategies for Backbone Traffic Engineering and QoS
PDF
ISP Network Design workshops how to design networks
PDF
Traffic Profiles and Management for Support of Community Networks
PPTX
Routing, Network Performance, and Role of Analytics
PDF
Traffic analysis for Planning, Peering and Security by Julie Liu
PDF
1-Isp-Network-Design-1
PDF
Lec 4 and_5
PPT
How Internet Works
PDF
【EPN Seminar Nov.10. 2015】 パネルディスカッション その2: BGP Peering Engineering Automatio...
PPT
Unit i packet switching networks
PDF
PLNOG14: Waltzing on that gentle trade‐off between internet routes and FIB sp...
PPTX
Network Critical - Value Prop
PDF
BGP Peering Strategy and Data
PPTX
Chapter04
PDF
Tutorial: Network State Awareness Troubleshooting
PPTX
BGP Traffic Engineering / Routing Optimisation
PPT
Troubleshooting TCP/IP
PDF
RIPE 80: Buffers and Protocols
PDF
Traffic Matrices and its measurement
PDF
PLNOG 3: John Evans - Best Practices in Network Planning
Carrier Strategies for Backbone Traffic Engineering and QoS
ISP Network Design workshops how to design networks
Traffic Profiles and Management for Support of Community Networks
Routing, Network Performance, and Role of Analytics
Traffic analysis for Planning, Peering and Security by Julie Liu
1-Isp-Network-Design-1
Lec 4 and_5
How Internet Works
【EPN Seminar Nov.10. 2015】 パネルディスカッション その2: BGP Peering Engineering Automatio...
Unit i packet switching networks
PLNOG14: Waltzing on that gentle trade‐off between internet routes and FIB sp...
Network Critical - Value Prop
BGP Peering Strategy and Data
Chapter04
Tutorial: Network State Awareness Troubleshooting
BGP Traffic Engineering / Routing Optimisation
Troubleshooting TCP/IP
RIPE 80: Buffers and Protocols
Traffic Matrices and its measurement
PLNOG 3: John Evans - Best Practices in Network Planning

More from webhostingguy (20)

PPT
File Upload
PDF
Running and Developing Tests with the Apache::Test Framework
PDF
MySQL and memcached Guide
PPT
Novell® iChain® 2.3
PDF
Load-balancing web servers Load-balancing web servers
PDF
SQL Server 2008 Consolidation
PDF
What is mod_perl?
PDF
What is mod_perl?
PDF
Master Service Agreement
PPT
PPT
PHP and MySQL PHP Written as a set of CGI binaries in C in ...
PDF
Dell Reference Architecture Guide Deploying Microsoft® SQL ...
PPT
Managing Diverse IT Infrastructure
PPT
Web design for business.ppt
PPS
IT Power Management Strategy
PPS
Excel and SQL Quick Tricks for Merchandisers
PPT
OLUG_xen.ppt
PPT
Parallels Hosting Products
PPT
Microsoft PowerPoint presentation 2.175 Mb
PDF
Reseller's Guide
File Upload
Running and Developing Tests with the Apache::Test Framework
MySQL and memcached Guide
Novell® iChain® 2.3
Load-balancing web servers Load-balancing web servers
SQL Server 2008 Consolidation
What is mod_perl?
What is mod_perl?
Master Service Agreement
PHP and MySQL PHP Written as a set of CGI binaries in C in ...
Dell Reference Architecture Guide Deploying Microsoft® SQL ...
Managing Diverse IT Infrastructure
Web design for business.ppt
IT Power Management Strategy
Excel and SQL Quick Tricks for Merchandisers
OLUG_xen.ppt
Parallels Hosting Products
Microsoft PowerPoint presentation 2.175 Mb
Reseller's Guide

(Powerpoint slides)

  • 1. Traffic Dynamics at a Commercial Backbone POP Nina Taft Sprint ATL Co-authors: Supratik Bhattacharyya, Jorjeta Jetcheva, Christophe Diot
  • 2. Outline Part 1: what are the traffic demands between pairs of POPs? How stable is this demand? Part 2: what are the paths taken by those demands? Are link utilizations levels similar throughout the backbone? Part 3: is there a better way to spread the traffic across paths? Can we divert some traffic to lightly loaded paths?
  • 3. The Sprint IPMon Project Passive monitoring Capture header (44 bytes) from every packet full TCP/IP headers, no http information Use GPS time stamping - allows accurate correlating of packets on different links Day long traces Simultaneously monitor multiple links and sites. Collect routing information along with packet traces. Traces archived for future use
  • 4. IP Backbone : POP-to-POP view POP fanout: one row of POP-to-POP traffic matrix OC-48 OC-12 OC-192
  • 5. POP-to-POP Traffic Matrix Measure traffic over different timescales Divide traffic per destination prefix, protocol, etc. For every ingress POP : Identify total traffic to each egress POP Further analyze this traffic City A City B City C City A City B City C
  • 6. The Mapping Problem What is the egress POP for a packet entering a given ingress POP?
  • 7. Monitored links at a single POP Core Core Core Publicpeer 2 web host ISP Public peer 1 Date : Aug 9, 2000 Access Access Access Access
  • 8. Traffic Fanout: POP level granularity
  • 10. Time-of-Day for POP level granularity
  • 11. Day-Night Variation : Webhost #1 % reduction at night between 20-50% depending upon access link
  • 12. Summary so far ... Wide disparity in “traffic demands” among egress POPs POPs can be roughly categorized as : small, medium, large; and they maintain their rank during the day. Traffic is heterogeneous in space yet stable in time. 20-50% reduction at night
  • 13. Outline Part 1: what are the traffic demands between pairs of POPs? How stable is this demand? Part 2: what are the paths taken by those demands? Are link utilizations levels similar throughout the backbone? Part 3: is there a better way to spread the traffic across paths? Can we divert some traffic to lightly loaded paths?
  • 14. Paths used by traffic demands Our Observations (summary) routing policies concentrate traffic on a few paths: between two POPs, all the traffic uses either the same route, or 1 or 2 routes the ISIS weights are changed very infrequently (once a month), so routing is fairly static there are many underutilized routes
  • 15. Is backbone traffic balanced?
  • 16. Part 3 : Can we divert some traffic to lightly loaded paths? Approach: to improve load balancing by rerouting only a few flows scalable Which flows? Heavy hitters. How identify heavy hitters: Consider: destination prefix-based flows at fixed prefix lengths: 8 and 16 BGP table entries (variable prefix length)
  • 17. Streams based on destination prefix Stream : all packets in a group with same /8 destination address prefix Traffic grouped by egress POPs Ingress : Webhost Link Similar results for /16 and bgp table prefixes
  • 18. Stability of prefix-based streams R i (n) = the rank of flow i at time slot n  i,n,k = | R i (n) - R i (n+k) | each time slot Stability of prefix rank
  • 19. Conclusions We have used our data to build components of traffic matrices for traffic engineering Heterogeneous traffic fanout from POP Current routing practices lead to many underutilized links and paths thus, there is a lot of room for improved load balancing techniques. Load-balancing using flows selected via destination-prefixes is a simple and promising criterion
  • 20. Ongoing Work Intra-domain Routing : Choosing ISIS link weights Multi-path routing Flow Characterization at the network prefix level Inference techniques for building POP-to-POP traffic matices

Editor's Notes

  • #4: . Because its passive monitoring it is transparent to the network. Our GPS timestamps are accurate within 5 microseconds
  • #5: Link speeds are included just to show diversity of backbone. The fanout from a particular POP represents one row of a POP-to-POP traffic matrix
  • #6: There are many things one could put in the traffic matrix. Usually it represents an average volume, but that volume has an associated time scale (measurement interval) and a traffic granularity. What goes in the matrix depends upon what you want to do with it. Our measurements are averaged over one day, and represent average bandwidth (total bandwidth between cities - i.e. no subdivision into prefixes, etc.)
  • #7: This is a multistep process. The BGP table gives you a next hop node outside the Sprint network. Use recursive lookups in the BGP table to find last Sprint node. The need to map Sprint node to a POP. Needed to use a combination of methods (name parsing, BGP_community_ID, etc) The goal is to convert the BGP table to one which gives the egress POP (rather than a next hop node) for a given prefix.
  • #8: The arrows indicate the links monitored. We used day long traces this shows the structure of a POP: *peers connect into core routers, clients connect to access routers, inner core surrounded by access routers, etc.
  • #9: Shows total demand from ingress to each egress POP – egress POPs can be categorized roughly as large (>35), medium(10-15) and small (<5). Matches intuition: (1) big pops in east and west coasts because that’s where international trunks terminate & that’s where population concentrated. (2) variation high depending upon # and type, of customers and servers. Thus expect inter-POP flows to be highly variable. However, what if we want to build prediction techniques – if we add a new link, does the type of link matter? Is POP granularity too coarse?
  • #10: Looking at this we see the fanout is similar except for 2 POPs. Natural to ask what the distribution of the fanout is, so can compare. This also shows some load balancing behavior.
  • #11: Large POP most volatile, medium POP slow steady decline, small POP stable. They maintain their ordering (large,medium,small) throughout the day. At night this is blurred. Verified for other combinations of POPs. Hard to find busy hour. There is increase at night sometime. Different POPs behave differently. Can’t have one single model for a POP.
  • #12: With the exception of 1 or 2 egress POPs, the percentage reduction at night is quite similar among POPs. This plot is for one access link. Averaging across all egress POPs, get about 40% overall reduction at night. The other links show between 20-50% reduction at night. This is less than we expected. It is important to know that there is less and less traffic reduction at night time.
  • #13: Time of day behavior for a POP should be separated into different components, one for each type of access link.
  • #16: The combination of everything we have seen up to now: routing on a few paths, existance of underutilized paths, low utilization levels on large numbers of links, diverse traffic demands - ALL this means that one can do a better job load balancing (i.e., there is much room for improvement in today’s systems).
  • #18: Rank streams in decreasing order of traffic volume has implications for traffic engineering. Load balance the elephants during the day. Helps scalability if only have to engineer the network tightly for elephants and can do loose control for mice. Can’t use this info for load balancing, unless ordering remains stable throughout the day. (lead to next slide) these types of results have been seen before (the type of plot, and this data for network prefixes). What’s new here is showing that this property exists for specific fixed prefix lengths too.
  • #19: This graph means that 70% of the time a flow will not change its rank by more than 5 (for example). 70% of streams in the top 10%, stay in the top 10%. 70% of those in the bottom half, stay in the bottom half. The point here is to show that elephants tend to stay elephants. This data is probably from the new york pop (#12)