Efficient inter-domain traffic engineering with transit-edge hierarchical routing |
| |
| Authors: | Stefano Secci Kunpen Liu Bijan Jabbari |
| |
| Affiliation: | 1. University Pierre and Marie Curie, LIP6, 4 place Jussieu, 75005 Paris, France;2. George Mason University, Fairfax, VA 22030-4444, USA;1. Institute of Electrical Engineering, Yanshan University, Qinhuangdao 066004, PR China;2. Department of Manufacturing Engineering and Engineering Management, City University of Hong Kong, Hong Kong;3. School of Electronic and Electric Engineering, University of Shanghai Jiaotong, Shanghai, PR China;1. LIA, University of Avignon, 339, chemin des Meinajaries, Avignon, France;2. CREATE-NET Via alla Cascata 56/D, Povo, Trento, Italy;3. EECS Dept., UC Berkeley, CA 94720, United States;1. UPMC Sorbonne Universités, Paris, France;2. University of Thessaly & CERTH-ITI, Greece;1. College of Computer Science and Technology, Zhejiang University, Hangzhou, China;2. College of Electrical Engineering, Zhejiang University, Hangzhou, China;3. College of Computer Science, Hangzhou Dianzi University, Hangzhou, China;1. University of Padua, Department of Information Engineering, Via Gradenigo 6/b, 35131 Padova, Italy;2. University of Padua, Department of Information Engineering and Human Inspired Technology Research Center, Via Luzzatti 4, 35122 Padua, Italy |
| |
| Abstract: | The relentless growth of Internet, which has resulted in the increase of routing table sizes, requires consideration and new direction to address Internet scalability and resiliency. A possible direction is to move away from the flat legacy Internet routing to hierarchical routing, and introduce two-level hierarchical routing between edge networks and across transit networks. In this way, there is also an opportunity to separate the routing locator from the terminal identifier, to better manage IP mobility and mitigate important routing security issues. In this paper, we study the extended traffic engineering capabilities arising in a transit-edge hierarchical routing, focusing on those multi-homed edge networks (e.g., Cloud/content providers) that aim at increasing their Internet resiliency experience. We model the interaction between distant independent edge networks exchanging large traffic volumes using game theory, with the goal of seeking efficient edge-to-edge load-balancing solutions. The proposed traffic engineering framework relies on a non-cooperative potential game, built upon locator and path ranking costs, that indicates efficient equilibrium solution for the edge-to-edge load-balancing coordination problem. Simulations on real instances show that in comparison to the available standard protocols such as BGP and LISP, we can achieve a much higher degree of resiliency and stability.1 |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
