Implications of the topological properties of Internet traffic on traffic engineering
Sun, 04/01/2007 - 01:54 by Damien Leroy
Abstract
In this paper we study the behavior of Internet traffic on the ASlevel
topology and discuss its implications on interdomain traffic
engineering. We rely on two notable interdomain traffic traces, the
first is one month long and the other is one day long. This study
shows that interdomain paths are stable for a large majority of the
traffic from a routing viewpoint. We show that the aggregation of
the traffic occurring on the AS-level graph is essentially limited to
direct peers, with almost no aggregation occurring at larger AS hop
distances. Furthermore, only part of the AS paths of the AS-level
topology that see a lot of traffic are stable, when considering their
presence among the largest AS paths on a hourly basis. Relying
on the largest AS paths in traffic over a time window to capture the
traffic over the next time interval discloses the important variability
of the traffic seen by the largest AS paths in traffic. Interdomain
traffic engineering is hence due to be difficult because of the limited
traffic aggregation on the AS-level topology and the important
topological variability of the traffic for a significant percentage of
the total traffic.
- Authors
- S. Uhlig, V. Magnin, O. Bonaventure, C. Rapier and L. Deri
- Source
19th ACM Symposium on Applied Computing, Special Track on Computer Networks , March 2004.
- Full text
-
(224.63 KB) - 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.