interdomain routing policies in the internet: inference and

UNIVERSITÀ DEGLI STUDI ROMA TREDipartimento di Informatica e Automazione

Interdomain Routing Policiesin the Internet:

Inference and AnalysisInference and Analysis

Massimo Rimondini

Defense of the PhD in

Computer Science and Engineering

Mar 16th, 2007

Interdomain Routing

ISPAutonomous Systems

BGP

LANWAN

BGP

Internet

Routing Policies

2

1

22

1

Why Routing Policies?

Routing dynamics

Routing consistency

Oscillation prevention

Debugging

Interdomain topology discovery

Inference of commercial relationships

Traffic engineering

Interplay of routing policies

Directions

Debugging

Traffic engineering

Interconnection strategies

Interplay of routing policies

Emulation of computer networks

??


Interdomain Topology Discovery

CAIDA SkitterB. Huffaker, D. Plummer, D. Moore, kc claffy. Topology Discovery by Active Probing. Proc. SAINT ’02kc claffy. Internet Measurement and Data Analysis: Topology, Workload, Performance and Routing Statistics. NAE Workshop, 1999

University of Washington Rocketfuel

State of the Art

University of Washington RocketfuelN. Spring, R. Mahajan, D. Wetherall, T. Anderson. Measuring ISP Topologies with Rocketfuel. IEEE/ACM Trans. on Networking, 2004N. Spring, R. Mahajan, T. Anderson. Quantifying the Causes of Path Inflation. Proc. ACM SIGCOMM 2003R. Mahajan, N. Spring, D. Wetherall, T. Anderson. Inferring Link Weights using End-to-End Measurements. Proc. IMW ’02

University of Oregon Route Views

State of the Art

AS level

Router level

AS level

BGP Probing

2

5

93

520

C

9520

2

4

7

8

61

0 0

20

520

C

C

00

BGP Probing

2

5

93 C

30{12}

530{12}

9530{12}

2

4

7

8

61

0

C

C

0{12}0{12}0{12}

530{12}

BGP Probing: Contributions

Probing primitivesAS-set stuffing

Withdrawal observation

Exploration algorithm

Experimentation on the IPv4/IPv6 InternetExperimentation on the IPv4/IPv6 Internet

Route flap dampening analysis

PublicationsTechnical report

ISCC 2006

Journal (pending acceptance)

BGP Probing: Results

MethodIPv6 IPv4

ASes Links ASes Links

Stable state 32 31 24 23

Withdrawal 94 (2.9×) 211 (6.8×) 28 (1.2×) 49 (2.1×)97 (3×) 222 (7.2×) 29 (1.2×) 55 (2.4×)Level-by-level 97 (3×) 222 (7.2×) 29 (1.2×) 55 (2.4×)

ProtocolInduced by W on global (I)

Withdrawal graph (W)

I only W only

IPv6 312 158 (51%) 175 21 (13%)

IPv6 334 168 (50%) 189 23 (14%)

IPv6 302 154 (51%) 174 26 (17%)

IPv4 241 61 (25%) 181 1 (2%)

IRR Data Extraction

Internet Routing Registry

assignment of Internet resources (IP addresses, AS numbers)

routing policiesrouting policies

Volunteered updates

inconsistent registrations

out of date information

IRR Data Extraction

aut-num: AS137import: from AS20965 action pref=100;

from AS1299 action pref=100;import: from AS20965 action pref=100;

from AS1299 action pref=100;

Routing Policy Specification Language

from AS1299 action pref=100;accept ANY

[...]export: to AS1299 announce AS-GARR[...]changed: [email protected] 20000830source: RIPE

from AS1299 action pref=100;accept ANY

export: to AS1299 announce AS-GARR

IRR Data Extraction

aut-num: ASX5import: { from ASX2:AS-Z2 accept 100.0.0.0/8;

} refine {from ASX1 ASX2 accept 100.1.0.0/16;

Routing Policy Specification Language

ASX1 ASX2} refine {

ASX2:AS-Z2

from ASX1 ASX2 accept 100.1.0.0/16;} except {

from ASX3 accept 100.1.1.0/24;}export: to ASX1:PRNG-Y1

to ASX1:AS-Z1 except ASX9announce 100.1.1.0/24

mp-export: to ASX11 at 2001::1 announce 2001::/48default: to ASX12 action pref=10default: to ASX13 100.1.1.1 at 100.1.1.2

ASX1 ASX2

ASX1:AS-Z1 except ASX9

} except {

ASX1:PRNG-Y1

mp-export: to ASX11 at 2001::1 announce 2001::/48

IRR Data Extraction

aut-num: AS24336as-name: DIGITALBANK-JPdescr: d-b net Backboneimport: from AS17685

accept ANYexport: to AS17685

announce AS24336admin-c: DM210-JP

aut-num: AS24336as-name: DIGITALBANK-JPdescr: DIGITALBANK, Inc.,

Regional ISP in Japancountry: JPimport: from AS17685

action pref=100; accept ANYimport: from AS7682

export: to AS17685announce AS24336

import: from AS17685accept ANY

import: from AS17685action pref=100; accept ANY

import: from AS7682

AS24336 AS24336

admin-c: DM210-JPtech-c: DM211-JPnotify: [email protected]: MAINT-AS24336changed: [email protected]

20050220source: RADB




admin-c: DM210-APtech-c: DM211-APnotify: [email protected]: MAINT-JP-DIGITALBANKmnt-by: MAINT-JP-DIGITALBANKchanged: [email protected]

20050210source: APNIC




RADB

APNIC

20050220

20050210

IRR Data Extraction: Contribs

A methodology to extract BGPlinks from the IRR

A classification of the linksinto confidence levels

An on-line serviceAn on-line serviceExtracted links

Statistics about the health of the IRR

Collaboration with the RIPE NCC


ACM SIGCOMM MineNet 2006

IRR Data Extraction: Results

APNIC ARIN RADB RIPE VERIO

APNIC 2688 1 423 19 113

ARIN 1 463 37 7 14

RADB 423 37 2037 50 45

RIPE 19 7 50 11238 23RIPE 19 7 50 11238 23

VERIO 113 14 45 23 310

This work 236663

RIPE RRCC 108521

[mahadevan06] (RIPE only) 56949

[zhang05] (RIPE) 70222

[siganos04] 127498


Inference ofCommercial Relationships

N

WE

Commercial Relationships

2

5

93 C

2

4

7

8

61

0

C

C

Commercial Relationships

2 3

0

Provider

Customer

Core

PeerPeer

1

4 5

8

7

C

C C

CustomerPeerPeer

9

6

4 5

State of the Art

X. Dimitropoulos, D. Krioukov, B. Huffaker, kcclaffy, G. Riley. Inferring AS Relationships: DeadEnd or Lively Beginning? LNCS, 2005G. Di Battista, M. Patrignani, M. Pizzonia. Computingthe Types of the Relationships between AutonomousSystems. Proc. IEEE INFOCOM ’03T. Erlebach, A. Hall, T. Schank. ClassifyingCustomer-Provider Relationships in the Internet. Proc. • SAT based

• combinedapproach

• SAT based• heuristics

T. Erlebach, A. Hall, T. Schank. ClassifyingCustomer-Provider Relationships in the Internet. Proc.CCN ’02L. Subramanian, S. Agarwal, J. Rexford, R. H. Katz. Characterizing the Internet Hierarchy from Multiple Vantage Points. Proc. IEEE INFOCOM ’02L. Gao. On Inferring Autonomous System Relationships in the Internet. IEEE/ACM Transactions on Networking, 2001Z. Ge, D. R. Figueiredo, S. Jaiswal, L. Gao. On the Hierarchical Structure of the Logical Internet Graph. Proc. SPIE ITCom ’01L. Gao. On Inferring Autonomous System Relationships in the Internet. Proc. IEEE Global Internet Symposium ’00

• policies• degree based

• hierarchy

• combinatorialformulation

• vantage points

• SAT based• apx algorithms

Validation

Validation

Inferencealgorithms

Data set(AS paths)Comparative

validation

Algorithmindependencereport

Stabilityreport

Validation: Contributions

Methodology

Set of measures

Software suite

Validation of [sark02]Validation of [sark02]against [dpp03]

Publications

IPS 2004

Commercial Relationships:Results

Algorithm independence(% consistent assignments on same data set)

>90%

Stability 10Stability(% consistent assignments over consecutive data sets)

[dpp03]: between 95% and 99%

[sark02]: between 96% and 99%

# changes

# edges

10

100


Traffic EngineeringN

W

S

Traffic Engineering

31

2

0000

3

000

1

State of the Art

R. K. C. Chang, M. Lo. Inbound Traffic Engineeringfor Multihomed ASes Using AS Path Prepending. Proc.NOMS ’04B. Quoitin, C. Pelsser, L. Swinnen, O. Bonaventure,S. Uhlig. Interdomain Traffic Engineering with BGP. IEEE Communications Magazine, 2003N. Feamster, J. Borkenhagen, J. Rexford. Guidelines for Interdomain Traffic Engineering. ACM SIGCOMM Computer Communication N. Feamster, J. Borkenhagen, J. Rexford. Guidelines for Interdomain Traffic Engineering. ACM SIGCOMM Computer Communication Review, 2003B. Quoitin, S. Uhlig, C. Pelsser, O. Bonaventure. Internet Traffic Engineering Techniques. TR, 2002L. Swinnen, S. Tandel, S. Uhlig, B. Quoitin, O. Bonaventure. An Evaluation of BGP-based Traffic Engineering Techniques. TR, 2002D. Awduche, A. Chiu, A. Elwalid, I. Widjaja, and X. Xiao. Overview and Principles of Internet Traffic Engineering. RFC 3272, 2002.L. Gao, F. Wang. The Extent of AS Path Inflation by Routing Policies. Proc. IEEE Global Internet Symposium ’02H. Tangmunarunkit, R. Govindan, S. Shenker, D. Estrin. The Impact of Routing Policy on Internet Paths. Proc. IEEE INFOCOM ’01

guidelines

observation

Seeking for Optimal Prepending

ILP formulation

Different objective functions

Multiple prefixes

Tie break

X3

0

1 2

Tie break

Computational geometryui

X

prepending on ui

Traffic Engineering: Contribs

Two formal models

Avoid trial-and-error

“Pluggable” requirements

Algorithmic optimizationAlgorithmic optimization

Publications

IPS MoMe 2005


Interplay of Routing PoliciesW

E

S

Policy Probing

N. T. Spring. Efficient Discoveryof Network Topology andRouting Policy in the Internet.PhD Thesis U. Washington. 2004PhD Thesis U. Washington. 2004

F. Wang, L. Gao. Inferring and Characterizing Internet Routing Policies. ACM SIGCOMM IM ’03

See commercial relationships

Policy Probing

0

21

4 5

0{1,3,5,6,7,9}

6

3

0{1,6,7}

10C

C

C

87

4 5

7 4 1 0

10 8 4 1 0

9 6 3 07 4 2 0

...

10 9 5 3 0 ?

6

9

!10 9 5 2 0

10 8 4 2 0

10 8 4 2 0

Policy Probing: Contributions

Path feasibility determination

Path preference comparison

Experiments on the IPv4/IPv6InternetInternet

Stability

J. L. Sobrinho. Network Routing with PathVector Protocols: Theory and Applications.Proc. ACM SIGCOMM ’03T. G. Griffin, F. Bruce Shepherd, G. Wilfong.The Stable Paths Problem and Interdomain Routing.IEEE/ACM Transactions on Networking, 2002L. Gao, T. G. Griffin, J. Rexford. Inherently Safe Backup L. Gao, T. G. Griffin, J. Rexford. Inherently Safe Backup Routing with BGP. Proc. IEEE INFOCOM ’01T. Griffin, G. T. Wilfong. A Safe Path Vector Protocol. Proc. IEEE INFOCOM ’00K. Varadhan, R. Govindan, D. Estrin. Persistent Route Oscillations in Inter-domain Routing. Elsevier Computer Networks, 2000L. Gao, J. Rexford. Stable Internet Routing without Global Coordination. Proc. ACM SIGMETRICS ’00T. G. Griffin, F. B. Shepherd, G. Wilfong. Policy Disputes in Path-Vector Protocols. Proc. ICNP ’99)

Stability

13010 1

21020

32030

0

2 3

Stability: Contributions

Event timings

Two kinds of stability

strict stability

forwarding stabilityforwarding stability

Properties

Transitions & reachability


Emulation of Computer Networks

State of the Art

Royal Institute of Technology, Sweden

University of ZagrebIMUNES - An Integrated Multiprotocol Network University of ZagrebMultiprotocol Network Emulator / Simulator

Technical University of Madrid

UMLMON - Virtualization with User Mode Linux Gerd Stolpmann

Netkit The poor man's system to experiment computer networking

Easy to install and use

Lightweight

Easy setup of complex experiences

Compact all-in-one virtual labsblah blah Compact all-in-one virtual labs

Corpus of ready-to-use labs & teaching material

blah blah blah...

Contributions

Improved user interfaceStability

Functionalities

Usability

Improved labs

2.4- Very improved ltools:

2.0 Beta- Netkit now consists of three separate pieces: a "core", a filesystem, and a

F2.0 Beta- Virtual machines boot messages have been deeply cleaned up.

Improved labsSelf tests

Lecture slides


Nearly submitted paper

Overall contributions

Interdomain topologydiscovery

Commercial relationships

Traffic engineering

To Do

complexity & effectivenessof algorithmsnetwork measurementsvalidate other algorithmsTraffic engineering

Policy discovery

Stability

Emulation

network measurementsvalidate other algorithmsdescribe the space of solutionshierarchybounds on complexitycase studygame theoryefficiencyaccuracy

upgrade of networking toolsnew featuresnew & improved labsintegration with other products

locate stable statessystem characterization

Thankyou!you!

interdomain routing policies in the internet: inference and

Documents