The steiner problem with edge lengths 1 and 2,
Information Processing Letters
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Optimal layouts on a chain ATM network
Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Directed virtual path layouts in ATM networks
Theoretical Computer Science - Special issue: Distributed computing
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
Creating multipoint-to-point LSPs for traffic engineering
IEEE Communications Magazine
Minimization of label usage in (G)MPLS networks
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
GMPLS label space minimization through hypergraph layouts
Theoretical Computer Science
| Hi-index | 0.00 |
All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) 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 whose hyperarcs are dipaths of the physical graph, called tunnels in GMPLS terminology. Such a hypergraph is called a hypergraph layout, to which we assign a cost function given by its physical length plus the total number of hops traveled by the traffic. 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 logn-approximation, where C is a 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 is the traffic instance is a partial broadcast. On the other hand, we provide an $\mathcal{O}(\log n)$-approximation algorithm to the problem for a general symmetric network. Finally, we focus on the case where the physical network is a path, providing a polynomial-time dynamic programming algorithm for a bounded number of sources, thus extending the algorithm given in [1] for a single source.