, 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
, Existence of (v,{5,w???},1)-PBDs, Discrete Mathematics, vol.279, issue.1-3, pp.279-61, 2004.
DOI : 10.1016/S0012-365X(03)00262-0
, Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3, Networks, vol.8, issue.2, pp.41-83, 2003.
DOI : 10.1002/net.10061
URL : https://hal.archives-ouvertes.fr/inria-00071959
, Traffic grooming in unidirectional WDM ring networks using design theory, IEEE International Conference on Communications, 2003. ICC '03., 2003.
DOI : 10.1109/ICC.2003.1204621
URL : https://hal.archives-ouvertes.fr/inria-00429174
, Traffic grooming in unidirectional WDM ring networks: The all-to-all unitary case, The 7th IFIP Working Conference on Optical Network Design & Modelling, pp.1135-1153, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00429175
, Decomposition of complete graphs into isomorphic subgraphs with five vertices, Ars Combin, vol.10, pp.211-254, 1980.
, Graph decompositions and G-designs, 5th British Combinatorial Conference, pp.53-72, 1975.
, Further results on the construction of mutually orthogonal Latin squares and the falsity of Euler's conjecture, Canad, J. Math, vol.12, pp.189-203, 1960.
, 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
, Wavelength add-drop multiplexing and minimizing SONET ADMs, Discrete Math, pp.141-156, 2003.
DOI : 10.1016/s0012-365x(02)00465-x
URL : http://doi.org/10.1016/s0012-365x(02)00465-x
, Minimizing drop cost for SONET
DOI : 10.1002/1097-0037(200103)37:2<107::aid-net6>3.0.co;2-a
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.3208
, A survey of virtual topology design algorithms for wavelength routed optical networks, Optical Networks, vol.1, pp.73-89, 2000.
, On optimal traffic grooming in WDM rings, IEEE J. Selected Areas Commun, vol.20, pp.1-12, 2002.
, Traffic grooming in WDM networks: past and future, IEEE Network, vol.16, issue.6, pp.46-56, 2002.
DOI : 10.1109/MNET.2002.1081765
, Group divisible designs with block size four and group type g u m 1 for small g, Discrete Math, pp.285-97, 2004.
, A survey on resolvable group divisible designs with block size four, Discrete Math, pp.225-245, 2004.
, Asymptotic results on the existence of 4-RGDDs and uniform 5-GDDs, Journal of Combinatorial Designs, vol.5, issue.3
DOI : 10.1002/jcd.20020
, On group-divisible designs with block size four and group-type g u m 1, Designs, Codes and Cryptography, vol.27, issue.1/2, pp.5-24, 2002.
DOI : 10.1023/A:1016512717269
, On group-divisible designs with block size four and group-type 6 u m 1 , Discrete Math, pp.247-265, 2004.
, Group-divisible designs with block size four and grouptype g u m 1 with m as large or as small as possible, J. Combin. Theory Ser. A, pp.98-357, 2002.
, HGDDs with block size four, Discrete Math, pp.267-276, 2004.
, 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
, 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
, The SONET edge-partition problem, Networks, vol.46, issue.1, pp.41-54, 2003.
DOI : 10.1002/net.10054
, Optimal traffic grooming for wavelength-division-multiplexing rings with all-to-all uniform traffic, OSA J. Optical Networks, vol.1, pp.32-42, 2002.
, Traffic grooming in WDM ring networks: A linear programming solution, OSA J. Optical Networks, vol.1, pp.397-408, 2002.
, Small group-divisible designs with block size four, Journal of Statistical Planning and Inference, vol.58, issue.1, pp.58-111, 1997.
DOI : 10.1016/S0378-3758(96)00064-X
, Decompositions of Edge-Colored Complete Graphs, Journal of Combinatorial Theory, Series A, vol.89, issue.2, pp.149-200, 2000.
DOI : 10.1006/jcta.1999.3005
, Traffic grooming in WDM networks, IEEE Communications Magazine, vol.39, issue.7, pp.124-129, 2001.
DOI : 10.1109/35.933446
, Group-divisible designs with block size k having k +1 groups, for k =4, 5, Journal of Combinatorial Designs, vol.22, issue.5, pp.363-386, 2000.
DOI : 10.1002/1520-6610(2000)8:5<363::AID-JCD6>3.0.CO;2-C
, Survivable traffic grooming in WDM networks, in Broad Band Optical Fiber Communications Technology, pp.17-45, 2001.
, Determination of a packing number, Ars Combin, vol.3, pp.89-114, 1977.
, Grooming of arbitrary traffic in SONET/WDM BLSRs, IEEE J. Selected Areas Commun, vol.18, pp.1995-2003, 2000.
, 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
, Decomposition of complete graphs into subgraphs isomorphic to a given graph, Congr. Numer, pp.647-659, 1976.
, Wavelength assignment to minimize the number of SONET ADMs in WDM rings, IEEE International Conference on Communications, 2002.
, 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