Assigning AS relationships to satisfy the Gao-Rexford conditions

  • Authors:

  • Luca Cittadini;Giuseppe Di Battista;Thomas Erlebach;Maurizio Patrignani;Massimo Rimondini

  • Affiliations:

  • Dept. of Computer Science and Automation, Roma Tre University, Italy;Dept. of Computer Science and Automation, Roma Tre University, Italy;Dept. of Computer Science, University of Leicester, UK;Dept. of Computer Science and Automation, Roma Tre University, Italy;Dept. of Computer Science and Automation, Roma Tre University, Italy

  • Venue:
  • ICNP '10 Proceedings of the The 18th IEEE International Conference on Network Protocols
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Compliance with the Gao-Rexford conditions [1] is perhaps the most realistic explanation of Internet routing stability, although BGP is renowned to be prone to oscillations. Informally, the Gao-Rexford conditions assume that (i) the business relationships between Internet Service Providers (ISPs) yield a hierarchy, (ii) each ISP behaves in a rational way, i.e., it does not offer transit to other ISPs for free, and (iii) each ISP ranks routes through customers better than routes through providers and peers.