"I Can’t Get No Satisfaction": Helping Autonomous Systems Identify Their Unsatisfied Inter-domain Interests
Wed, 02/10/2016 - 18:26 by Stefano Vissicchio
Abstract
Given the distributed and business-driven nature of the Internet, economic interests of Autonomous Systems (ASes) may be incompatible. Previous works studied specific effects of incompatible interests, especially BGP policy conflicts leading to routing and forwarding anomalies. In this paper, we rather focus on the effects of incompatible interests that do not trigger such anomalies. We take the perspective of a single AS: We show that incompatible interests can have a tangible impact on its business, and provide a classification of its unsatisfied interests. Since incompatible interests cannot be solved automatically, our effort is directed to support network managers in their business decisions. Hence, we describe algorithms to identify and assess their impact, as well as a prototype of a warning system aimed at signaling the most relevant unsatisfied interests. We evaluate our prototype on real data from two operational networks. In addition to illustrate the potential of our system, our evaluation shows that unsatisfied interest are relatively frequent and likely affect a significant amount of traffic in practice.
- Authors
- Juan Camilo Cardona, Stefano Vissicchio, Paolo Lucente and Pierre Francois
- Source
IEEE Transactions on Network and System Management (TNSM) , 13(1):43-57, March 2016.
- Full text
-
(1.41 MB) - Cite it
- BibTex
- Copyright
- 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.