Traffic Routing Through Off-Line LSP Creation
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
Label space reduction in MPLS networks: how much can a single stacked label do?
IEEE/ACM Transactions on Networking (TON)
MPLS Label Stacking on the Line Network
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Routing in all-optical label switched-based networks with small label spaces
ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
Minimization of label usage in (G)MPLS networks
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Designing hypergraph layouts to GMPLS routing strategies
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
GMPLS label space minimization through hypergraph layouts
Theoretical Computer Science
| Hi-index | 0.25 |
Traffic engineering enhances an ISP's capability to manage and utilize its resources effectively. MPLS has emerged as an efficient packet forwarding tool that gives a significant boost to the traffic engineering capabilities of an ISP. A fundamental problem in MPLS is to reduce label space usage by label switched paths while meeting the requirements of the flows traversing the network. Using multipoint-to-point LSP trees has been proposed as one of the techniques to reduce label space usage. We look at the problem of creating multipoint-to-point LSPs given a set of precomputed point-to-point LSPs. We propose a heuristic for multipoint-to-point LSP creation and show its effectiveness.