Inferring%20Autonomous%20System%20Relationships%20in%20the%20Internet%20Lixin%20Gao%20Dept.%20of%20Electrical%20and%20Computer%20Engineering%20University%20of%20Massachusetts,%20Amherst%20http://www-unix.ecs.umass.edu/~lgao - PowerPoint PPT Presentation

About This Presentation
Title:

Inferring%20Autonomous%20System%20Relationships%20in%20the%20Internet%20Lixin%20Gao%20Dept.%20of%20Electrical%20and%20Computer%20Engineering%20University%20of%20Massachusetts,%20Amherst%20http://www-unix.ecs.umass.edu/~lgao

Description:

Basic Algorithms. Heuristics: Top provider has largest degree ... Our heuristic algorithm is based on routing entry pattern derived from policy rules ... – PowerPoint PPT presentation

Number of Views:126
Avg rating:3.0/5.0

less

Transcript and Presenter's Notes

Title: Inferring%20Autonomous%20System%20Relationships%20in%20the%20Internet%20Lixin%20Gao%20Dept.%20of%20Electrical%20and%20Computer%20Engineering%20University%20of%20Massachusetts,%20Amherst%20http://www-unix.ecs.umass.edu/~lgao


1
Inferring Autonomous System Relationships in the
InternetLixin GaoDept. of Electrical and
Computer EngineeringUniversity of Massachusetts,
Amhersthttp//www-unix.ecs.umass.edu/lgao
2
Outline
  • Internet Architecture and Routing
  • AS Relationships
  • Heuristic Algorithms
  • Experimental Results

3
AS Commercial Relationships
  • Provider-customer
  • customer pays its provider for transit services
  • Peer-peer
  • exchange traffic between customers
  • no money exchange
  • Sibling-sibling
  • have mutual transit agreement
  • merging ISPs, Internet connection backup

4
Route Propagation Policy
  • Constrained by contractual commercial agreements
    between administrative domains

Regional ISP B
Regional ISP A
University C
e.g., An AS does not provide transit services
between its providers
5
Why Infer AS Relationships?
  • Crucial part of Internet structure
  • Connectivity does not imply reachability
  • Connectivity alone can not fully characterize
    structural properties of Internet
  • No registry of AS relationships
  • Many ISPs are not willing to reveal their
    relationships to others in IRR
  • Relationships are evolving hard to be up-to-date

6
Applications of AS Relationships
  • Construct distance map
  • Place proxy or mirror site servers
  • Potentially avoid route divergence
  • Help ISPs or domain administrators to achieve
    load balancing and congestion avoidance
  • Help ISPs or companies to plan for future
    contractual agreements
  • Help ISPs to reduce effect of misconfiguration
    and to debug router configuration files

7
AS Relationship Graph
8
Route Propagation Rule
  • An AS or a set of ASes with sibling relationship
    does not provide transit services between any two
    of its providers and peers
  • BGP routing table entries have certain patterns

9
Routing Table Entry
704
702
701
1849
1
10
Routing Table Entry Patterns
11
Heuristic Algorithms
  • Infer provider-customer and sibling-sibling
  • basic
  • refined
  • Infer peer-peer
  • final

12
Basic Algorithms
  • Heuristics
  • Top provider has largest degree
  • Based on patterns on BGP routing table entries
  • Consecutive AS pairs on the left of top provider
    are customer-to-provider or sibling-sibling edges
  • Consecutive AS pairs on the right of top provider
    are provider-to-customer or sibling-sibling edges

13
Initialize Consecutive AS Pair Relationship
uj
uj1
u2
un-1
Maximum degree AS
u1
un
14
uj
uj1
u2
un-1
u1
un
15
ub
ua
uc
uj
uj1
ud
u2
un-1
u1
un
16
ub
ua
uc
ud
u2
u1
17
ub
ua
Assign relationship to AS pairs
uc
uj
uj1
ud
u2
un-1
Sibling-siblingu1,u2 1
u1
un
18
Refined Algorithm
  • Bogus Routing Entries
  • Each routing table entry votes on AS
    relationships
  • Ignore sibling-to-sibling relationship concluded
    by only one entry

19
Inferring Peer-Peer Relationships
  • Peer-peer edge is between top provider and one of
    its neighbors only
  • Heuristics
  • peer-to-peer edge is between top provider and its
    higher degree neighbor
  • degrees of two peers do not differ significantly
  • lt R times

20
Final Algorithm
uj
uj1
uj-1
un-2
degreeuj-1 lt degreeuj1
u2
un-1
u1
un
21
Final Algorithm
uj
uj1
uj-1
un-2
degreeuj / degreeuj1 lt R and degreeuj /
degreeuj1 gt 1/R
u2
un-1
u1
un
22
Experimental Verification
  • Routing table from Route Views
  • Connected to 22 ISPs at 24 locations
  • Daily routing table dump
  • Routing table from 3 days
  • 1999/9/27, 2000/1/2, 2000/3/9
  • 1 million routing entries

23
Inference Results
24
Verification of Inferred Relationships by ATT
Comparing inference results from Basic and
Final(R ) with ATT internal information
8
25
Verification of Inferred Relationships by ATT
Comparing inference results from Refined and
Final(R ) with ATT internal information
8
26
Verification of Inferred Relationships by ATT
Comparing inference results from Basic and
Final(R60) with ATT internal information
27
WHOIS Lookup Service
  • Supplies name and address of company that owns an
    AS
  • AS pair might have sibling-sibling relation if
  • belong to the same company or two merging
    companies
  • belong to two small companies located closeby

28
Verification by WHOIS lookup Service
  • Confirm 101 of 186 inferred sibling-sibling
    relationships (gt 50)
  • Some unconfirmed sibling-sibling relationships
    might be due to
  • WHOIS service is not up to date
  • Not enough information
  • Bogus Routes
  • Router configuration typo 7018 3561 7057 7075
    7057
  • Misconfiguration of small ISPs1239 11116 701
    7018
  • ...

29
Conclusions and Further Work
  • AS relationships are inherent aspect of Internet
    architecture
  • Our heuristic algorithm is based on routing entry
    pattern derived from policy rules
  • Verification
  • ATT (99)
  • Whois services (gt50)
  • Further Work
  • Policy effect on AS path length
  • AS relationship evolution
Write a Comment
User Comments (0)
About PowerShow.com