With the deployment of MPLS over a core IP backbone, it is possible for a service provider to built Virtual Private Networks (VPNs) supporting various classes of services with QoS guarantees. Efficiently mapping the logical layout of multiple VPNs over a service provider network is an important and challenging traffic engineering procedure. The use of sink-tree (multipoint-to-point) routing paths in a MPLS network makes the VPN design problem different from traditional design approaches where a full-mesh of point-to-point paths is often the choice. The clear benefits of using sink-tree paths are the reduction in the number of label switch paths and bandwidth saving due to larger granularities of bandwidth aggregation within the network. In this paper, the design of multiple VPNs over MPLS, using sink-tree routing, is formulated as a mixed integer programming problem to simultaneously find VPNs logical topologies and their dimensions to carry multi-service, multi-hour VPNs traffic from various customers. Such a problem formulation yields an NP-hard complexity. Here, we propose a heuristic aiming to scale the VPN design problem by choosing a small-but-good candidate set of feasible sink-tree paths to solve the optimization problem over. Numerical results are given showing the advantages of the proposed approach.

Original document

The different versions of the original document can be found in:


DOIS: 10.1109/milcom.2002.1180447 10.1109/glocom.2002.1189021

Back to Top

Document information

Published on 01/01/2003

Volume 2003, 2003
DOI: 10.1109/milcom.2002.1180447
Licence: CC BY-NC-SA license

Document Score


Views 0
Recommendations 0

Share this document


claim authorship

Are you one of the authors of this document?