Haut de page.

LARECO

LARECO -- LAbel REduction for P2MP and MP2MP COmmunications

The purpose of LARECO is to study the problem of reducing the label space (i.e. overall number of labels) used for the establishment of Point-to-Point, Point-to-MultiPoint, MultiPoint-to-Point and MultiPoint-to-MultiPoint communications in GMPLS and All-Optical Label Swapping (AOLS) networks. In such networks, labels are used by the nodes to decide the next hop of each packet and thus involve some processing resources and time. The cost of AOLS increases with the number of used labels, since a special optical device is needed for each recognized label on every node. Therefore, reducing the label space allows to reduce the overall equipment needed in the nodes.

Our main objective is to establish complexity results, design exact and approximate algorithms, and develop efficient heuristic algorithms. To reach these objectives, we will share the expertize of Mascotte on traffic grooming, multicast aggregation, and various combinatorial optimization tools, with the expertize of our partner from University of Girona on GMPLS and AOLS networks, tunneling technics, and label reduction for P2P and MP2P communications.

People involved

The two teams involved in LARECO are the following:

Agenda

Results obtained during LARECO

  1. [1] Designing Hypergraph Layouts to GMPLS Routing Strategies . J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, I. Sau, and F. Solano Donado.
    SIROCCO 2009. [PDF]
  2. [2] MPLS label stacking on the line network. J-C. Bermond, D. Coudert, J. Moulierac, S. Perennes, H. Rivano, I. Sau, and F. Solano Donado.
    IFIP Networking 2009. [PDF]
  3. [3] Routing in All-Optical Label Switched-based Networks with Small Label Spaces. Fernando Solano Donado, Joanna Moulierac.
    IFIP/IEEE ONDM 2009.[PDF]

Related Work

  1. F. Solano, T. K. Stidsen, R. Fabregat, and J.L. Marzo. Label Space Reduction in MPLS Networks: How Much Can A Single Stacked Label Do? IEEE/ACM Transactions on Networking, February 2009.
  2. F. Solano, R. Van Caenegem, D. Colle, J.-L. Marzo, M. Pickavet, R. Fabregat, and P. Demeester. All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching. In IEEE Conference on Computer Communications (Infocom 08), Phoenix, AZ, USA, April 2008.
  3. J-C. Bermond, L. Braud, and D. Coudert. Traffic Grooming on the Path. Theoretical Computer Science, 384(2-3):139-151, 2007.
  4. F. Solano, L.-F. Caro, J. C. de Oliveira, R. Fabregat, and J-L. Marzo. G+: Enhanced Traffic Grooming in WDM Mesh Networks using Lighttours. IEEE Journal on Selected Areas in Communications, 2007
  5. F. Solano, J.-L. Marzo, and R. Fabregat. On Optimal Computation of MPLS Label Binding for MultiPoint-to-Point Connections. IEEE Transactions on Communications, 2007.
  6. O. Amini, S. Pérennes, and I. Sau Valls. Hardness and Approximation of Traffic Grooming. In The 18th International Symposium on Algorithms and Computation (ISAAC 2007), Sendai, Japan, December 2007.
  7. N. Ben Ali, J. Moulierac, B. Belghith, and M. Molnár. mQMA: multi-constrained QoS Multicast Aggregation. In IEEE Globecom, November 2007.
  8. J. Moulierac, A. Guitton, and M. Molnár. On the number of MPLS LSP using Multicast Tree Aggregation. In IEEE Globecom, November 2006.
  9. J-C. Bermond, C. Colbourn, D. Coudert, G. Ge, A. Ling, and X. Muñoz. Traffic Grooming in Unidirectional WDM Rings With Grooming Ratio C=6. SIAM Journal on Discrete Mathematics, 19(2):523-542, 2005.
  10. J-C. Bermond and D. Coudert. Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory. In IEEE ICC, volume 2, Anchorage, Alaska, pages 1402-1406, May 2003.