O. Amini, S. Pérennes, and I. Sau, Hardness of approximating the traffic grooming problem, 9` eme Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, pp.45-48, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00176960

J. Bermond, L. Braud, and D. Coudert, Traffic grooming on the path, Theoretical Computer Science, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00070363

J. Bermond and S. Ceroi, Minimizing SONET ADMs in unidirectional WDM ring with grooming ratio 3. Networks, pp.83-86, 2003.

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 and D. Coudert, Traffic grooming in unidirectional WDM ring networks using design theory, IEEE International Conference on Communications, 2003. ICC '03., pp.7-10, 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 Grooming C.J. Colbourn and J.H, vol.4227, pp.493-496, 2006.

J. Bermond, D. Coudert, and X. Muñoz, Traffic grooming in unidirectional WDM ring networks: the all-to-all unitary case, The 7th IFIP Working Conference on Optical Network Design & Modelling ? ONDM'03, pp.1135-1153, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00429175

J. Bermond, C. Huang, A. Rosa, and D. Sotteau, Decomposition of complete graphs into isomorphic subgraphs with five vertices, Ars Combinatoria, pp.211-254, 1980.

J. Bermond and D. Sotteau, Graph decompositions and G-designs, 5th British Combinatorial conference, Congressus Numerantium 15 Utilitas math. Pub, pp.53-72, 1975.

A. L. Chiu and E. H. 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

R. Dutta and N. Rouskas, On optimal traffic grooming in WDM rings, IEEE Journal of Selected Areas in Communications, vol.20, issue.1, pp.1-12, 2002.

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

M. Flammini, L. M. Shalom, and S. Zaks, Approximating the traffic grooming problem, 16th Annual International Conference on Algortihms and Computation (ISAAC), 2005.

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, R. Ramaswani, and G. Sasaki, Cost-effective traffic grooming in WDM rings, IEEE/ACM Transactions on Networking, vol.8, issue.5, pp.618-630, 2000.
DOI : 10.1109/90.879348

O. Goldschmidt, D. Hochbaum, A. Levin, and E. Olinick, The SONET edge-partition problem, Networks, vol.46, issue.1, pp.13-23, 2003.
DOI : 10.1002/net.10054

J. Hu, Optimal traffic grooming for wavelength-division-multiplexing rings with all-to-all uniform traffic, OSA Journal of Optical Networks, vol.1, issue.1, pp.32-42, 2002.

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.

S. Huang, R. Dutta, and G. N. Rouskas, Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms, IEEE Journal on Selected Areas in Communications, vol.24, issue.4, pp.66-82, 2006.
DOI : 10.1109/JSAC.2006.1613773

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

M. Shalom, W. Unger, and S. Zaks, On the Complexity of the Traffic Grooming Problem in Optical Networks, 4th International Conference on Fun With Algorithms, Castiglioncello (LI), 2007.
DOI : 10.1007/978-3-540-72914-3_23

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

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.

J. Wang, W. Cho, V. Vemuri, and B. Mukherjee, Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multihop connections, Journal of Lightwave Technology, vol.19, issue.11, pp.1645-1653, 2001.
DOI : 10.1109/50.964064

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

X. Yuan and A. Fulay, Wavelength assignment to minimize the number of SONET ADMs in WDM rings, IEEE ICC, 2002.

X. Zhang and C. Qiao, An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings, IEEE/ACM Transactions on Networking, vol.8, issue.5, pp.608-617, 2000.
DOI : 10.1109/90.879347

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