A performance evaluation of BGP‐based traffic engineering

Quoitin, Bruno; Pelsser, Cristel; Bonaventure, Olivier; Uhlig, Steve

doi:10.1002/nem.559

Cited by 33 publications

(23 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One promising means of doing this would be to make use of BGP [24] information to guide probing. We are collaborating with Bruno Quoitin to incorporate his C-BGP simulator [25] into our studies.…”

Section: Resultsmentioning

confidence: 99%

Improved Algorithms for Network Topology Discovery

Donnet

Friedman

Crovella

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Topology discovery systems are starting to be introduced in the form of easily and widely deployed software. However, little consideration has been given as to how to perform large-scale topology discovery efficiently and in a network-friendly manner. In prior work, we have described how large numbers of traceroute monitors can coordinate their efforts to map the network while reducing their impact on routers and end-systems. The key is for them to share information regarding the paths they have explored. However, such sharing introduces considerable communication overhead. Here, we show how to improve the communication scaling properties through the use of Bloom filters to encode a probing stop set. Also, any system in which every monitor traces routes towards every destination has inherent scaling problems. W e propose capping the number of monitors per destination, and dividing the monitors into clusters, each cluster focusing on a different destination list.

show abstract

Section: Resultsmentioning

confidence: 99%

Improved Algorithms for Network Topology Discovery

Donnet

Friedman

Crovella

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…As a consequence, paths are often of the same length, and do not suffice to select the best path. It has been shown that between 40% and 50% of routes in core and large transit ASes are selected using tie-breaking rules of the BGP decision process [24]. In our model with one router per AS, the only tie-breaking rule used in this case is to prefer routes learned from the router with the lowest router address.…”

Section: Impact Of Bgp On Path Diversitymentioning

confidence: 99%

Leveraging Network Performances with IPv6 Multihoming and Multiple Provider-Dependent Aggregatable Prefixes

Launois

Quoitin

Bonaventure

2005

Quality of Service in Multiservice IP Networks

Self Cite

View full text Add to dashboard Cite

Abstract. Multihoming, the practice of connecting to multiple providers, is becoming highly popular. Due to the growth of the BGP routing tables in the Internet, IPv6 multihoming is required to preserve the scalability of the interdomain routing system. A proposed method is to assign multiple provider-dependent aggregatable (PA) IPv6 prefixes to each site, instead of a single provider-independent (PI) prefix. We show that the use of multiple PA prefixes not only allows route aggregation but also can be used to reduce end-to-end delays by leveraging the Internet path diversity. We quantify the gain in path diversity, and show that a dualhomed stub AS that uses multiple PA prefixes has already a better Internet path diversity than any multihomed stub AS that uses a single PI prefix, whatever its number of providers. The benefits provided by the use of IPv6 multihoming with multiple PA prefixes are an opportunity to develop the support for quality of service and traffic engineering.

show abstract

“…Note that ASPP is not the only method to do the inbound traffic engineering [12] [13]. The other method is to rely on selective advertisements and announce different route advertisements on different links.…”

Section: B Comparison With Other Inbound Traffic Engineering Methodsmentioning

confidence: 99%