Resilient Traffic Engineering in a Transit-Edge Separated Internet Routing

The significant growth in the global Internet traffic and routing table size requires solutions to address Internet scalability and resiliency. A number of proposals have considered moving away from the flat legacy Internet routing to a two-level hierarchical routing, separating edge networks from transit carrier networks. In this paper, we study the extended inter-domain traffic engineering capabilities arising in a transit-edge separated Internet routing, focusing on those multi-homed edge networks (e.g., small ISPs, content providers, large corporations) that aim at increasing their Internet resiliency experience. We model using game theory the interaction between distant independent edge networks exchanging large traffic volumes, with the goal of seeking efficient edge-to-edge load-balancing routing solutions. The proposed traffic engineering framework relies on a non-cooperative potential game, built upon path prepending- and path diversity- dependent costs, that indicates efficient equilibrium solution for the edge-to-edge load-balancing coordination problem. Simulations on real instances show that, in comparison with the alternative multipath BGP and normal LISP, we can achieve significantly higher resiliency and stability. In particular, our simulation for an illustrating case shows four-times more stable multipath routing solutions with a five-times larger path diversity.