HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

GMPLS Label Space Minimization through Hypergraph Layouts

Jean-Claude Bermond 1 David Coudert 1 Joanna Moulierac 1 Stéphane Pérennes 1 Fernando Solano Donado 2
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any optical-electrical-optical conversions. In this report, we study the problem of routing a set of requests in AOLS networks using GMPLS technology, with the aim of minimizing the number of labels required to ensure the forwarding. We first formalize the problem by associating to each routing strategy a logical hypergraph, called a hypergraph layout, whose hyperarcs are dipaths of the physical graph, called tunnels in GMPLS terminology. We define a cost function for the hypergraph layout, depending on its total length plus its total hop count. Minimizing the cost of the design of an AOLS network can then be expressed as finding a minimum cost hypergraph layout. We prove hardness results for the problem, namely for general directed networks we prove that it is NP-hard to find a C log n-approximation, where C is a positive constant and n is the number of nodes of the network. For symmetric directed networks, we prove that the problem is APX-hard. These hardness results hold even if the traffic instance is a partial broadcast. On the other hand, we provide approximation algorithms, in particular an O(log n)-approximation for symmetric directed networks. Finally, we focus on the case where the physical network is a directed path, providing a polynomial-time dynamic programming algorithm for a fixed number k of sources running in O(n^{k+2}) time.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

Contributor : Joanna Moulierac Connect in order to contact the contributor
Submitted on : Tuesday, October 27, 2009 - 12:39:26 PM
Last modification on : Friday, February 4, 2022 - 3:19:01 AM
Long-term archiving on: : Tuesday, October 16, 2012 - 12:45:57 PM


Files produced by the author(s)


  • HAL Id : inria-00426681, version 1



Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Fernando Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. [Research Report] RR-7071, INRIA. 2009. ⟨inria-00426681⟩



Record views


Files downloads