P2P and P2MP TE-LSPs packing algorithms for MPLS networks

Two packing algorithms for traffic-engineered label-switched paths (TE-LSP) are proposed in order to efficiently accommodate point-to-point (P2P) and point-to-multipoint (P2MP) TE-LSPs in a multi-protocol label switching (MPLS) network. Computer simulation results show that these algorithms calculate more efficient routes and accommodate more LSPs than a traditional routing algorithm, namely the interior gateway protocol (IGP). The proposed algorithms are heuristic; they consider the residual bandwidth of each link in the network and the number of hops from the ingress node to the egress node(s). They are applicable to IP-VPN designs that require large numbers of P2P and P2MP TE between pairs of provider edges (PEs)