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
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
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
Approximation algorithms
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Directed virtual path layouts in ATM networks
Theoretical Computer Science - Special issue: Distributed computing
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
SIAM Journal on 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
Designing hypergraph layouts to GMPLS routing strategies
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Creating multipoint-to-point LSPs for traffic engineering
IEEE Communications Magazine
| Hi-index | 5.23 |
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 Clogn-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(logn)-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.