AS alliance: cooperatively improving resilience of intra-alliance communication

  • Authors:
  • Yuichiro Hei;Akihiro Nakao;Toru Hasegawa;Tomohiko Ogishi;Shu Yamamoto

  • Affiliations:
  • KDDI R&D Laboratories, Inc.;The University of Tokyo and NICT;KDDI R&D Laboratories, Inc.;KDDI R&D Laboratories, Inc.;NICT

  • Venue:
  • CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

The current interdomain routing protocol, BGP, is not resilient to a path failure due to its single-path and slowly-converging route calculation. This paper proposes a novel approach to improve the resilience of the interdomain communication by enabling a set of ASes to form an alliance for themselves. The alliance members cooperatively discover a set of disjoint paths using not only the best routes advertised via BGP but also the ones unadvertised. Since such a set of disjoint paths are unlikely to share a link or an AS failure, a member AS can provide a pair of the other members with a transit to circumvent the failure. We evaluate how many disjoint paths we could discover from both advertised and hidden (unadvertised) routes by analyzing publicly available BGP route data. Our feasibility study indicates that an alliance of ASes can establish a set of disjoint paths between arbitrary pair of its alliance members to improve the resilience of interdomain routing among the members.