Scipediacontent: Scipediacontent moved page Draft Content 936189553 to Rougier et al 2016a

2021-02-02T04:28:22Z

Scipediacontent moved page Draft Content 936189553 to Rougier et al 2016a

Scipediacontent: Created page with " == Abstract == International audience; Inter-domain Traffic Engineering for multi-homed networks faces a scalability challenge, as the size of BGP routing table continue to..."

2021-02-02T04:28:18Z

Created page with " == Abstract == International audience; Inter-domain Traffic Engineering for multi-homed networks faces a scalability challenge, as the size of BGP routing table continue to..."

New page

== Abstract ==

International audience; Inter-domain Traffic Engineering for multi-homed networks faces a scalability challenge, as the size of BGP routing table continue to grow. In this context, the choice of the best path must be made potentially for each destination prefix, requiring all available paths to be characterized (e.g., through measurements) and compared with each other.Fortunately, it is well-known that a few number of prefixes could carry a dominant part of the traffic. As a natural consequence, to engineer a majority of traffic only a handful of prefixes need to be managed. Yet, traffic characteristics of a given prefix can vary greatly over time, which requires us to predict most significant prefixes in the near future. Moreover, little is known on the traffic dynamism at this aggregation level and sophisticated prediction methods won’t scale in such context.In this paper, we study the relationship between prefix volume, stability, and predictability, based on recent traffic traces from nine different networks.Three simple and resource-efficient methods to se- lect the prefixes associated with the most important foreseeable traffic volume are then proposed. Such proposed methods are capable of select sets of prefixes with both excellent representativeness (volume cover- age) and stability in time, for which the best routes are identified. The analysis carried out confirms the potential benefits of a route decision engine.

== Original document ==

The different versions of the original document can be found in:

* [http://arxiv.org/abs/1511.08344 http://arxiv.org/abs/1511.08344]

* [http://arxiv.org/pdf/1511.08344 http://arxiv.org/pdf/1511.08344]

* [https://hal.telecom-paris.fr/hal-02287278 https://hal.telecom-paris.fr/hal-02287278]

* [http://xplorestaging.ieee.org/ielx7/7499631/7502779/07502827.pdf?arnumber=7502827 http://xplorestaging.ieee.org/ielx7/7499631/7502779/07502827.pdf?arnumber=7502827],
: [http://dx.doi.org/10.1109/noms.2016.7502827 http://dx.doi.org/10.1109/noms.2016.7502827]

* [https://dblp.uni-trier.de/db/journals/corr/corr1511.html#ShaoIRDV15 https://dblp.uni-trier.de/db/journals/corr/corr1511.html#ShaoIRDV15],
: [https://arxiv.org/pdf/1511.08344 https://arxiv.org/pdf/1511.08344],
: [https://arxiv.org/abs/1511.08344 https://arxiv.org/abs/1511.08344],
: [https://academic.microsoft.com/#/detail/2963147009 https://academic.microsoft.com/#/detail/2963147009]

← Older revision	Revision as of 04:28, 2 February 2021
(No difference)

Rougier et al 2016a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 936189553 to Rougier et al 2016a

Scipediacontent: Created page with " == Abstract == International audience; Inter-domain Traffic Engineering for multi-homed networks faces a scalability challenge, as the size of BGP routing table continue to..."