Generalized Multipath Load Sharing Using Vectorized Routing Model - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Generalized Multipath Load Sharing Using Vectorized Routing Model

Kunpeng Liu
  • Function : Author
Bijan Jabbari
  • Function : Author
Stefano Secci

Abstract

In this paper, we present a generalized multipath load sharing framework for Internet. Under the hypothesis that edge networks are fully independent in establishing Internet routing policies, we use game theory and a vectorized utility function to solve the Internet multipath routing problem. We first briefly review the existing techniques that apply game theory to improve the Internet routing resiliency. We propose a vectorized routing cost model to consider multiple routing metrics in the network setting, along with a universal refinement method to quantify the profile performance and predict the behavior of the vectorized routing game. Based on the universal refinement method as well as a linear traffic distribution algorithm, we define a generalized multipath load sharing framework to improve the routing resiliency in traffic exchange between two distant edge networks. Running simulations with real measured Internet metrics, we find that the proposed generalized edge-to-edge multipath load sharing framework is able to offer far more resilient solutions than legacy and alternative protocols such as standard BGP and BGP with LISP-based traffic engineering.
No file

Dates and versions

hal-01216148 , version 1 (15-10-2015)

Identifiers

Cite

Kunpeng Liu, Bijan Jabbari, Stefano Secci. Generalized Multipath Load Sharing Using Vectorized Routing Model. IEEE Global Communications Conference (IEEE GLOBECOM 2013), Dec 2013, Atlanta, GA, United States. pp.1507-1512, ⟨10.1109/GLOCOM.2013.6831287⟩. ⟨hal-01216148⟩
57 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More