Advertising Aggregated Routes

• A problem with advertising aggregated routes

• • The path information is obscured
  • The hop distance is obscured

• The solution is to divide the path into a sequence and a set

• • The sequence contains the ordered list of AS’s
  • • Used to estimate hop distance
  • The set contains an unordered list of aggregated routes
  • • Used in conjunction with the sequence to detect loops

• Route aggregation can be performed recursively to further reduce the number of routing entries