GMPLS Label Space Minimization through Hypergraph Layouts - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2012

GMPLS Label Space Minimization through Hypergraph Layouts


All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any optical-electrical-optical conversions. In this paper, 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.
Fichier principal
Vignette du fichier
tcs_sent.pdf (548.63 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00706260 , version 1 (09-06-2012)



Jean-Claude Bermond, David Coudert, Joanna Moulierac, Stéphane Pérennes, Ignasi Sau, et al.. GMPLS Label Space Minimization through Hypergraph Layouts. Theoretical Computer Science, 2012, 444, pp.3-16. ⟨10.1016/j.tcs.2012.01.033⟩. ⟨hal-00706260⟩
317 View
130 Download



Gmail Mastodon Facebook X LinkedIn More