GMPLS label space minimization through hypergraph layouts
DOI10.1016/J.TCS.2012.01.033zbMATH Open1243.68024OpenAlexW2156456181MaRDI QIDQ442249FDOQ442249
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
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
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)
Cites Work
- A threshold of ln n for approximating set cover
- Depth-First Search and Linear Graph Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Biconnectivity approximations and graph carvings
- Title not available (Why is that?)
- The Steiner problem with edge lengths 1 and 2
- Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
- Optimal layouts on a chain ATM network
- Directed virtual path layouts in ATM networks
- Designing hypergraph layouts to GMPLS routing strategies
- GMPLS label space minimization through hypergraph layouts
Cited In (3)
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)
