O. Amini, S. Pérennes, and I. Sau, Hardness and Approximation of Traffic Grooming, Theoretical Computer Science, vol.410, pp.38-403751, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00158341

B. Beauquier, J. Bermond, L. Gargano, P. Hell, S. Pérennes et al., Graph problems arising from wavelength-routing in all-optical networks, IEEE Workshop on Optics and Computer Science, 1997.
URL : https://hal.archives-ouvertes.fr/inria-00073523

J. Bermond, L. Braud, and D. Coudert, Traffic grooming on the path, Theoretical Computer Science, vol.384, issue.2-3, pp.139-151, 2007.
DOI : 10.1016/j.tcs.2007.04.028

URL : https://hal.archives-ouvertes.fr/inria-00070363

J. 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. Bermond, C. Colbourn, A. Ling, and M. Yu, Grooming in unidirectional rings : K 4 ? e designs. Discrete Mathematics, Lindner's Volume, pp.1-357, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00505518

J. Bermond, M. Cosnard, D. Coudert, and S. Pérennes, Optimal Solution of the Maximum All Request Path Grooming Problem, Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'06), 2006.
DOI : 10.1109/AICT-ICIW.2006.144

URL : https://hal.archives-ouvertes.fr/inria-00070381

J. 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. Bermond and D. Coudert, The CRC Handbook of Combinatorial Designs, Discrete Mathematics and Its Applications C.J. Colbourn and J.H, vol.42, pp.493-496, 2006.

J. Bermond, D. Coudert, and M. Yu, On DRC-covering of Kn by cycles, Journal of Combinatorial Designs, vol.13, issue.2, pp.100-112, 2003.
DOI : 10.1002/jcd.10040

URL : https://hal.archives-ouvertes.fr/inria-00429205

R. Berry and E. Modiano, Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic, IEEE Journal on Selected Areas in Communications, vol.18, issue.10, pp.1961-1971, 2000.
DOI : 10.1109/49.887916

A. Chiu and E. Modiano, Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks, Journal of Lightwave Technology, vol.18, issue.1, pp.2-12, 2000.
DOI : 10.1109/50.818901

T. Y. Chow and P. J. Lin, The ring grooming problem, Networks, vol.8, issue.3, pp.194-202, 2004.
DOI : 10.1002/net.20029

C. J. Colbourn, H. Fu, G. Ge, A. C. Ling, and H. Lu, Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming Ratio Seven, SIAM Journal on Discrete Mathematics, vol.23, issue.1, pp.109-122, 2008.
DOI : 10.1137/070709141

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 multiplexing for minimizing SONET ADMs, Discrete Mathematics, vol.261, issue.1-3, pp.141-156, 2003.
DOI : 10.1016/S0012-365X(02)00465-X

C. J. Colbourn and P. Wan, Minimizing drop cost for SONET/WDM networks with ? wavelength requirements, Networks, vol.17, issue.2, pp.107-116, 2001.
DOI : 10.1002/1097-0037(200103)37:2<107::AID-NET6>3.0.CO;2-A

R. Dutta and G. Rouskas, On Optimal Traffic Grooming in WDM Rings, Proceedings of ACM Sigmetrics/Performance, pp.164-174, 2001.

R. Dutta and N. Rouskas, A survey of virtual topology design algorithms for wavelength routed optical networks, Optical Networks, vol.1, issue.1, pp.73-89, 2000.

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

O. Gerstel, P. Lin, and G. Sasaki, Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98CH36169), pp.94-101, 1998.
DOI : 10.1109/INFCOM.1998.659642

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.734-743, 1999.
DOI : 10.1109/INFCOM.1999.751460

O. Gerstel, R. Ramaswami, and G. Sasaki, Cost Effective Traffic Grooming in WDM Rings, INFOCOM, pp.69-77, 1998.

J. Hu, Traffic Grooming in WDM Ring Networks : A Linear Programming Solution, OSA Journal of Optical Networks, vol.1, issue.11, pp.397-408, 2002.

X. Li and P. Wan, Select line speeds for single-hub SONET/WDM ring networks, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record, pp.495-499, 2000.
DOI : 10.1109/ICC.2000.853368

Z. Li and I. Sau, Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph, 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2009.
DOI : 10.1007/978-3-642-11409-0_22

URL : https://hal.archives-ouvertes.fr/hal-00795411

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 Graph, 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.300-311, 2008.
DOI : 10.1109/50.964064

A. Somani, Survivable traffic grooming in WDM networks, Broad band optical fiber communications technology -BBOFCT, pp.17-45, 2001.

P. Wan, Multichannel Optical Networks : Network Theory and Applications, 1999.
DOI : 10.1007/978-1-4615-5317-5

P. Wan, G. Calinescu, L. Liu, and O. Frieder, Grooming of arbitrary traffic in SONET/WDM BLSRs, IEEE Journal of Selected Areas in Communications, vol.18, issue.10, pp.1995-2003, 2000.

R. Wilson, Decomposition of complete graphs into subgraphs isomorphic to a given graph, Congressus numerantium, vol.15, pp.647-659, 1976.

K. Zhu and B. Mukherjee, A review of traffic grooming in WDM optical networks : Architectures and challenges, Optical Networks, vol.4, issue.2, pp.55-64, 2003.

I. Unité-de-recherche-inria-sophia and . Antipolis, route des Lucioles -BP 93 -06902 Sophia Antipolis Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4, 2004.

I. Unité-de-recherche and . Lorraine, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt, Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399