GMPLS label space minimization through hypergraph layouts

DOI10.1016/J.TCS.2012.01.033MaRDI QIDQ442249zbMATH OpenOpenAlexFDO

Authors Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, Fernando Solano Donado

Publication date 10 August 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.01.033

zbMATH Keywords

dynamic programmingapproximation algorithmsoptical networksGMPLShypergraph layoutlabel stacking

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Hypergraphs (05C65) Network design and communication in computer systems (68M10)

Recommendations

• Designing hypergraph layouts to GMPLS routing strategies
• Routing and label space reduction in label switching networks
• Path layout on tree networks: bounds in different label switching models
• Structural Information and Communication Complexity
• Approximating the Traffic Grooming Problem in Tree and Star Networks

Cites work

• scientific article; zbMATH DE number 1003253 (Why is no real title available?)
• scientific article; zbMATH DE number 1303557 (Why is no real title available?)
• scientific article; zbMATH DE number 1330032 (Why is no real title available?)
• scientific article; zbMATH DE number 1559563 (Why is no real title available?)
• A threshold of ln n for approximating set cover
• Biconnectivity approximations and graph carvings
• Depth-First Search and Linear Graph Algorithms
• Designing hypergraph layouts to GMPLS routing strategies
• Directed virtual path layouts in ATM networks
• GMPLS label space minimization through hypergraph layouts
• Optimal layouts on a chain ATM network
• The Steiner problem with edge lengths 1 and 2
• Traveling with a Pez Dispenser (or, Routing Issues in MPLS)

Cited in

(3)

• Designing hypergraph layouts to GMPLS routing strategies
• Routing and label space reduction in label switching networks
• GMPLS label space minimization through hypergraph layouts

This page was built for publication: GMPLS label space minimization through hypergraph layouts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442249)