This paper presents a tool for MPLS network dimensioning that allows for multi-hour dimensioning of networks supporting simultaneously peer-to-peer and client-server services. The dimensioning model is able to take into account several LSP attributes: degree of survivability (link disjoint and node disjoint cases), maximum hop count, usable colours and preferred routes. The dimensioning problem is a combined capacity design and routing problem where the LSP sets are calculated in order to minimise the network operational costs. This problem is formulated as an integer programming problem, which is solved through an heuristic based on Lagrangean relaxation with sub-gradient optimisation. The network design tool, named PTPlan MPLS, includes a graphical interface for an easy introduction and edition of the network parameters. Results show that the tool can design networks of realistic size in seconds using a standard PC platform.
[1]
Vijay Srinivasan,et al.
RSVP-TE: Extensions to RSVP for LSP Tunnels
,
2001,
RFC.
[2]
O. Aboul-Magd.
Constraint-Based LSP Setup using LDP
,
2001
.
[3]
Deep Medhi.
Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks
,
1995,
TNET.
[4]
S. Choudhury,et al.
Two methods for minimum cost synthesis of link-disjoint, hop-limited Virtual Paths in ATM networks
,
1999
.
[5]
ATM Network Dimensioning for Mixed Symmetrical and Asymmetrical Services with Dynamic Reconfiguration in a Multi-Network Provider Environment
,
2002
.
[6]
Wai Sum Lai.
Capacity engineering of IP-based networks with MPLS
,
2001,
SPIE Optics East.
[7]
Ramesh Bhandari.
Optimal diverse routing in telecommunication fiber networks
,
1994,
Proceedings of INFOCOM '94 Conference on Computer Communications.
[8]
Ram Dantu,et al.
Constraint-Based LSP Setup using LDP
,
2002,
RFC.
[9]
Philip Wolfe,et al.
Validation of subgradient optimization
,
1974,
Math. Program..
[10]
Anwar Elwalid,et al.
A Framework for Internet Traffic Engineering
,
2001
.