On the relevance of on-line traffic engineering

Electrical Engineering, Mathematics and Computer Scienc

On the relationship between the algebraic connectivity and graph's robustness to node and link failures

Electrical Engineering, Mathematics and Computer Scienc

Investigating the Imprecision of IP Block-Based Geolocation

Electrical Engineering, Mathematics and Computer Scienc

BGP Route Propagation between Neighboring Domains

Electrical Engineering, Mathematics and Computer Scienc

On the relationships between topological metrics in real-world networks

Electrical Engineering, Mathematics and Computer Scienc

Conception de réseau iBGP

BGP is used today by all Autonomous Systems (AS) in the Internet. Inside each AS, iBGP sessions distribute the external routes among the routers. In large ASs, relying on a fullmesh of iBGP sessions between routers is not scalable, so route-reflection is commonly used. The scalability of route-reflection compared to an iBGP full-mesh comes at the cost of opacity in the choice of best routes by the routers inside the AS. This opacity induces problems like suboptimal route choices in terms of IGP cost, deflection and forwarding loops. In this work, we propose a solution to design iBGP route-reflection topologies which lead to the same routing as with an iBGP full-mesh and having a minimal number of iBGP sessions. Moreover we compute a robust topology even if a single node or link failure occurs. We apply our methodology on the network of a tier-1 ISP. Twice as many iBGP sessions are required to ensure robustness to single IGP failure. The number of required iBGP sessions in our robust topology is however not much larger than in the current iBGP topology used in the tier-1 ISP network.Network Architectures and ServicesElectrical Engineering, Mathematics and Computer Scienc

Modeling Internet Topology Dynamics

Despite the large number of papers on network topology modeling and inference, there still exists ambiguity about the real nature of the Internet AS and router level topology. While recent findings have illustrated the inaccuracies in maps inferred from BGP peering and traceroute measurements, existing topology models still produce static topologies, using simplistic assumptions about power law observations and preferential attachment. Today, topology generators are tightly bound to the observed data used to validate them. Given that the actual properties of the Internet topology are not known, topology generators should strive to reproduce the variability that characterizes the evolution of the Internet topology over time. Future topology generators should be able to express the variations in local connectivity that makes today’s Internet: peering relationships, internal AS topology and routing policies each changing over time due to failures, maintenance, upgrades and business strategies of the network. Topology generators should capture those dimensions, by allowing a certain level of randomness in the outcome, rather than enforcing structural assumptions as the truths about Internet’s evolving structure, which may never be discovered.Network Architectures and ServicesElectrical Engineering, Mathematics and Computer Scienc