On multi-exit routings and AS relationships Riad Mazloum , Marc-Olivier Buob 1 , Jordan Aug´ e 1 , Bruno Baynat 1 , Timur Friedman 1 and Dario Rossi 2 1 UPMC, France first.last@lip6.fr 2 Telecom ParisTech, France dario.rossi@enst.fr February 06th, 2013 –ISMA 2013 AIMS 5 On multi-exit routings and AS relationships 1
Internet routing example On multi-exit routings and AS relationships 2
Internet routing example On multi-exit routings and AS relationships 3
Surprising observations On multi-exit routings and AS relationships 4
BGP route with higher LP On multi-exit routings and AS relationships 5
A route has a higher LP On multi-exit routings and AS relationships 6
Single next-hop AS On multi-exit routings and AS relationships 7
Multi next-hop ASes On multi-exit routings and AS relationships 8
Equal LP for all next-hop ASes On multi-exit routings and AS relationships 9
Observed ME = ⇒ equal LP for next-hop ASes Observed ME = ⇒ equal LP (ME) ME ( AS 1 , p ) = { AS 2 , AS 3 } = ⇒ LP AS 1 ( AS 2 ) = LP AS 1 ( AS 3 ) On multi-exit routings and AS relationships 10
Implementation of AS economical policies Observed ME = ⇒ equal LP (ME) ME ( AS 1 , p ) = { AS 2 , AS 3 } = ⇒ LP AS 1 ( AS 2 ) = LP AS 1 ( AS 3 ) Implementation of AS economical policies (POLICY) client > peer > provider On multi-exit routings and AS relationships 11
Implementation of AS economical policies Observed ME = ⇒ equal LP (ME) ME ( AS 1 , p ) = { AS 2 , AS 3 } = ⇒ LP AS 1 ( AS 2 ) = LP AS 1 ( AS 3 ) Implementation of AS economical policies (POLICY) client > peer > provider = ⇒ LP ( client ) > LP ( peer ) > LP ( provider ) On multi-exit routings and AS relationships 11
(ME) + (POLICY) Observed ME = ⇒ equal LP (ME) ME ( AS 1 , p ) = { AS 2 , AS 3 } = ⇒ LP AS 1 ( AS 2 ) = LP AS 1 ( AS 3 ) Implementation of AS economical policies (POLICY) client > peer > provider = ⇒ LP ( client ) > LP ( peer ) > LP ( provider ) (ME) + (POLICY) ME ( AS 1 , p ) = { AS 2 , AS 3 } = ⇒ same type of relationship between AS 1 and AS 2 , AS 3 On multi-exit routings and AS relationships 12
Does it work? (ME) + (POLICY) ME ( AS 1 , p ) = { AS 2 , AS 3 } = ⇒ same type of relationship between AS 1 and AS 2 , AS 3 On multi-exit routings and AS relationships 13
Does it work? (ME) + (POLICY) ME ( AS 1 , p ) = { AS 2 , AS 3 } = ⇒ same type of relationship between AS 1 and AS 2 , AS 3 Check with CAIDA’s inference dataset • Get types of relations of cases such between AS 1 and AS 2 , AS 3 from CAIDA’s inference dataset • Check whether all of the next-hop ASes have the same relationship On multi-exit routings and AS relationships 13
Does it work? (ME) + (POLICY) ME ( AS 1 , p ) = { AS 2 , AS 3 } = ⇒ same type of relationship between AS 1 and AS 2 , AS 3 Check with CAIDA’s inference dataset • Get types of relations of cases such between AS 1 and AS 2 , AS 3 from CAIDA’s inference dataset • Check whether all of the next-hop ASes have the same relationship • About 70% matching 30% mismatching On multi-exit routings and AS relationships 13
Multi-exit occurrences and relationship matching Percentage of mathcnig between multi-exit nex-hop relationships and CAIDA inference 100 Percentage of matching 80 60 40 20 0 2 3 4 5 6 7 8 9 10 11 12 13 # next-hop ASes Occurences of multi-exit routing 1e+06 Total number of multi-exits 100000 # occurences of ME 10000 1000 100 10 1 2 3 4 5 6 7 8 9 10 11 12 13 # next-hop ASes On multi-exit routings and AS relationships 14
Data Multi-exit discovery: • BGP: BGPmon, Colorado State University project 1 1 http://bgpmon.netsec.colostate.edu/ 2 http://www.top-hat.info/ 3 http://www.team-cymru.org/Services/ip-to-asn.html 4 http://www.caida.org/data/active/as-relationships/ On multi-exit routings and AS relationships 15
Data Multi-exit discovery: • BGP: BGPmon, Colorado State University project 1 • traceroute: TDMI/TopHat, UPMC project 2 • IP/AS aliasing: Team Cymru IP to AS mapping service 3 1 http://bgpmon.netsec.colostate.edu/ 2 http://www.top-hat.info/ 3 http://www.team-cymru.org/Services/ip-to-asn.html 4 http://www.caida.org/data/active/as-relationships/ On multi-exit routings and AS relationships 15
Data Multi-exit discovery: • BGP: BGPmon, Colorado State University project 1 • traceroute: TDMI/TopHat, UPMC project 2 • IP/AS aliasing: Team Cymru IP to AS mapping service 3 AS relationships: • CAIDA AS relationship inference database 4 Our data is available on request. 1 http://bgpmon.netsec.colostate.edu/ 2 http://www.top-hat.info/ 3 http://www.team-cymru.org/Services/ip-to-asn.html 4 http://www.caida.org/data/active/as-relationships/ On multi-exit routings and AS relationships 15
Discussion Observed ME = ⇒ equal LP (ME) ME ( AS 1 , p ) = { AS 2 , AS 3 } = ⇒ LP AS 1 ( AS 2 ) = LP AS 1 ( AS 3 ) Implementation of AS economical policies (POLICY) client > peer > provider = ⇒ LP ( client ) > LP ( peer ) > LP ( provider ) Check with CAIDA’s inference dataset • Get types of relations of cases such between AS 1 and AS 2 , AS 3 from CAIDA’s inference dataset • Check whether all of the next-hop ASes have the same relationship On multi-exit routings and AS relationships 16
Discussion Observed ME = ⇒ equal LP (ME) ME ( AS 1 , p ) = { AS 2 , AS 3 } = ⇒ LP AS 1 ( AS 2 ) = LP AS 1 ( AS 3 ) Implementation of AS economical policies (POLICY) client > peer > provider = ⇒ LP ( client ) > LP ( peer ) > LP ( provider ) Check with CAIDA’s inference dataset • Get types of relations of cases such between AS 1 and AS 2 , AS 3 from CAIDA’s inference dataset • Check whether all of the next-hop ASes have the same relationship On multi-exit routings and AS relationships 17
Discussion Observed ME = ⇒ equal LP (ME) ME ( AS 1 , p ) = { AS 2 , AS 3 } = ⇒ LP AS 1 ( AS 2 ) = LP AS 1 ( AS 3 ) Implementation of AS economical policies (POLICY) client > peer > provider = ⇒ LP ( client ) > LP ( peer ) > LP ( provider ) Check with CAIDA’s inference dataset • Get types of relations of cases such between AS 1 and AS 2 , AS 3 from CAIDA’s inference dataset • Check whether all of the next-hop ASes have the same relationship On multi-exit routings and AS relationships 18
Have another ideas? • Feedback about the problem and the analysis process • Get confirmation about the results (we don’t have a ground truth of AS relationships) • Possible collaborations On multi-exit routings and AS relationships 19
Reserved slides... On multi-exit routings and AS relationships 20
BGP and IP overlap On multi-exit routings and AS relationships 21
Multi-exit routing, BGP and IP results On multi-exit routings and AS relationships 22
TopHat interconnection On multi-exit routings and AS relationships 23
On multi-exit routings and AS relationships 24
On multi-exit routings and AS relationships 25
On multi-exit routings and AS relationships 26
On multi-exit routings and AS relationships 27
Recommend
More recommend
