Scalable BGP prefix selection for effective inter-domain traffic engineering
| Autor: | Wenqin Shao, Jean-Louis Rougier, Luigi Iannone, Mateusz Viste, Francois Devienne |
|---|---|
| Přispěvatelé: | Réseaux, Mobilité et Services (RMS), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), Télécom ParisTech, HAL, TelecomParis |
| Rok vydání: | 2016 |
| Předmět: |
Networking and Internet Architecture (cs.NI)
FOS: Computer and information sciences [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI] Inter-domain business.industry Computer science Volume (computing) 020206 networking & telecommunications Context (language use) 02 engineering and technology Computer Science - Networking and Internet Architecture Prefix [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] Traffic engineering Path (graph theory) Scalability Border Gateway Protocol 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing business Computer network |
| Zdroj: | NOMS IEEE/IFIP Network Operations and Management Symposium (NOMS'16) IEEE/IFIP Network Operations and Management Symposium (NOMS'16), Apr 2016, Istanbul, Turkey |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|