O. Amini, S. Pérennes, and I. Sau, Hardness and approximation of traffic grooming, Theoretical Computer Science, vol.410, issue.38-40, pp.3751-3760, 2009.
DOI : 10.1016/j.tcs.2009.04.028
URL : https://hal.archives-ouvertes.fr/inria-00158341

B. Beauquier, J. C. Bermond, L. Gargano, P. Hell, S. Pérennes et al., Graph prob- 613 lems arising from wavelength-routing in all-optical networks, IEEE Workshop Optics Comput Sci, vol.614, pp.1-12, 1997.

J. C. Bermond, L. Braud, and D. Coudert, Traffic grooming on the path, Theoret Comput Sci, vol.384, pp.616-139, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00070363

J. C. Bermond, C. Colbourn, D. Coudert, G. Ge, A. Ling et al., = 6, SIAM Journal on Discrete Mathematics, vol.19, issue.2, pp.523-542, 2005.
DOI : 10.1137/S0895480104444314

J. C. Bermond, M. Cosnard, D. Coudert, and S. Pérennes, Optimal solution of the maximum all re- 622 quest path grooming problem, Advanced Int Conference Telecommunications (AICT), pp.1-6, 2006.

J. C. Bermond and D. Coudert, Traffic grooming in unidirectional WDM ring networks using design theory, IEEE International Conference on Communications, 2003. ICC '03., pp.1402-1406, 2003.
DOI : 10.1109/ICC.2003.1204621
URL : https://hal.archives-ouvertes.fr/inria-00429174

J. C. Bermond and D. Coudert, The CRC Handbook of Combinatorial Designs

J. C. Bermond, D. Coudert, X. Muñoz, and I. Sau, Traffic grooming in bidirectional WDM ring 630 networks, IEEE-LEOS ICTON / COST 293 GRAAL, vol.3, pp.19-22, 2006.

J. C. Bermond, D. Coudert, and M. L. Yu, On DRC-covering of K n by cycles, J Combinatorial, vol.632, issue.11, pp.100-112, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00072288

R. Berry and E. Modiano, Reducing electronic multiplexing costs in SONET/WDM rings with 634 dynamically changing traffic, IEEE J Selected Areas in Commun, pp.633-1961, 2000.

]. A. Chiu and E. Modiano, Traffic grooming algorithms for reducing electronic multiplexing costs in 636 WDM ring networks, IEEE/OSA J Lightwave Technology, vol.18, pp.635-637, 2000.

T. Y. Chow, P. J. Lin-]-t, P. J. Chow, and . Lin, The ring grooming problem, The CRC Handbook of Combinatorial Designs, pp.637-638, 2004.
DOI : 10.1002/net.20029

]. C. Colbourn, H. L. Fu, G. Ge, A. C. Ling, and H. C. Lu, Minimizing SONET ADMs in unidirec- 642 tional WDM rings with grooming ratio seven, SIAM J Discr Math, vol.42, issue.23, pp.641-657, 2006.

C. J. Colbourn, G. Ge, and A. C. Ling, Optical grooming with grooming ratio eight, Discrete Applied Mathematics, vol.157, issue.13, pp.2763-2772, 2009.
DOI : 10.1016/j.dam.2009.03.019

C. J. Colbourn and A. C. Ling, Graph decompositions with application to wavelength add-drop 646 multiplexing for minimizing SONET ADMs, pp.261-141, 2003.

]. C. Colbourn and P. J. Wan, Minimizing drop cost for SONET/WDM networks with 1 8 wavelength 648 requirements, pp.107-116, 2001.

R. Dutta and G. Rouskas, A survey of virtual topology design algorithms for wavelength routed 650 optical networks, pp.73-89, 2000.

R. Dutta and G. Rouskas, On optimal traffic grooming in WDM rings, ACM Sigmetrics, pp.651-164, 2001.

R. Dutta and G. Rouskas, Traffic grooming in WDM networks: past and future, IEEE Network, vol.16, issue.6, pp.654-700, 2002.
DOI : 10.1109/MNET.2002.1081765

]. O. Gerstel, P. Lin, and G. Sasaki, Wavelength assignment in a WDM ring to minimize cost of 656 embedded sonet rings, IEEE INFOCOM, pp.655-94, 1998.

]. O. Gerstel, P. Lin, and G. Sasaki, Combined WDM and SONET network design, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320), pp.657-734, 1999.
DOI : 10.1109/INFCOM.1999.751460
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.6212

]. O. Gerstel, R. Ramaswami, and G. Sasaki, Cost effective traffic grooming in WDM rings, IEEE, vol.660, pp.659-69, 1998.

J. Hu, Traffic grooming in WDM ring networks: A linear programming solution, OSA J Optical, vol.662, issue.1, pp.397-408, 2002.

P. J. Li and . Wan, Select line speeds for single-hub SONET, WDM ring networks, pp.663-664

E. Modiano and P. Lin, Traffic grooming in WDM networks, IEEE Communications Magazine, vol.39, issue.7, pp.124-129, 2001.
DOI : 10.1109/35.933446

X. Muñoz and I. Sau, Traffic grooming in unidirectional WDM rings with bounded-degree request 671 graph, 34th Int Workshop Graph-Theoretic Concepts in, of Lecture 672 Notes in Computer Science, pp.300-311, 2008.

P. J. Wan-]-p, G. Wan, L. Calinescu, O. Liu, and . Frieder, Multichannel optical networks: Network theory and applications Grooming of arbitrary traffic in SONET, pp.675-677, 1999.

]. R. Wilson, Decomposition of complete graphs into subgraphs isomorphic to a given graph, Congress numerantium, vol.680, issue.15, pp.679-647, 1976.

K. Zhu and B. Mukherjee, A review of traffic grooming in WDM optical networks: Architectures 682 and challenges, pp.55-64, 2003.