Optimal link weights for IP-based networks supporting hose-model VPNs

  • Authors:
  • Jian Chu;Chin-Tau Lea

  • Affiliations:
  • Electrical and Computer Engineering Department, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong;Electrical and Computer Engineering Department, Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

From traffic engineering point of view, hose-model VPNs are much easier to use for customers than pipe-model VPNs. In this paper we explore the optimal weight setting to support hose-model VPN traffic in an IP-based hop-by-hop routing network. We try to answer the following questions: 1) What is the maximum amount of hose-model VPN traffic with bandwidth guarantees that can be admitted to an IP-based hop-by-hop routing network (as opposed to an MPLS-based network), and 2) what is the optimal link weight setting that can achieve that? We first present a mixed-integer programming formulation to compute the optimal link weights that can maximize the ingress and egress VPN traffic admissible to a hop-by-hop routing network. We also present a heuristic algorithm for solving the link weight searching problem for large networks. We show simulation results to demonstrate the effectiveness of the search algorithm.