Quantifying ASes Multiconnectivity using Multicast Information

Mon, 08/03/2009 - 15:22 by Benoit Donnet • Categories:


Redundant connectivity (or multiconnectivity) between autonomous systems (ASes) is important for interdomain traffic engineering and fast recovery in case of failures. However, the redundancy of ASes peering links has not been quantitatively studied, mainly due to the difficulty of obtaining relevant data.

In this paper, we show that the mrinfo multicast monitoring tool can provide useful data about the Internet topology and such links in particular. Our analysis relies on more than four years of daily queries to about ten thousand routers divided in more than two hundred ASes. We demonstrate that peering links between ASes are frequently redundant. In particular, our analysis shows that more than half of the studied ASes pairs are connected through multiple physical links. We then refine our analysis by considering the different types of ASes (Tier-1, Transit, Stub) and their business relationship (peer-to-peer, customer-to-provider, provider-to-customer). A particular result of our analysis is that roughly 75% of the peer-to-peer relationships between adjacent Tier-1 ASes are redundant.

Pascal Mérindol, Virginie Van den Schrieck, Benoit Donnet, Olivier Bonaventure and Jean-Jacques Pansiot
Proc. ACM USENIX Internet Measurement Conference (IMC), pages 370-376, November 2009.
Full text
pdf   (683.78 KB)
Cite it
See here

IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice: Copyright 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.

Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.