Graph problems arising from wavelengthrouting in all-optical networks, IEEE Workshop on Optics and Computer Science, 1997. ,
URL : https://hal.archives-ouvertes.fr/inria-00073523
Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3, Networks, vol.8, issue.2 ,
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
Decomposition of complete graphs into isomorphic subgraphs with five vertices, Ars Combinatoria, pp.211-254, 1980. ,
Graph decompositions and g-designs, 5th British Combinatorial conference, Congressus Numerantium 15 Utilitas math. Pub, pp.53-72, 1975. ,
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
The CRC handbook of Combinatorial designs, 1996. ,
DOI : 10.1201/9781420049954
Wavelength add-drop multiplexing for minimizing SONET ADMs, Discrete Applied Mathematics ,
DOI : 10.1016/s0012-365x(02)00465-x
URL : http://doi.org/10.1016/s0012-365x(02)00465-x
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
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, issue.1, pp.73-89, 2000. ,
On optimal traffic grooming in WDM rings, Journal of Selected Areas in Communications, vol.20, issue.1, pp.1-12, 2002. ,
Traffic grooming in WDM networks: past and future, IEEE Network, vol.16, issue.6, 2002. ,
DOI : 10.1109/MNET.2002.1081765
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
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. ,
Traffic grooming in WDM networks with multi-layer switches, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333), 2002. ,
DOI : 10.1109/ICC.2002.997370
Traffic grooming in WDM networks, IEEE Communications Magazine, vol.39, issue.7, pp.124-129, 2001. ,
DOI : 10.1109/35.933446
Survivable traffic grooming in WDM networks, Broad band optical fiber communications technology ? BBOFCT, pp.17-45, 2001. ,
Decomposition of Km,n(Km,n???) into cycles (circuits) of length 2k, Journal of Combinatorial Theory, Series B, vol.30, issue.1, pp.75-81, 1981. ,
DOI : 10.1016/0095-8956(81)90093-9
Grooming of arbitrary traffic in SONET/WDM BLSRs, Journal of Selected Areas in Communications, vol.18, issue.10, pp.1995-2003, 2000. ,
Improved approches for cost-effective traffic grooming in WDM ring networks: Ilp formulations and single-hop and multihop connections, IEEE/OSA Journal of Lightwave Technology, issue.11, pp.191645-1653, 2001. ,
Decomposition of complete graphs inot subgraphs isomorphic to a given graph, Congressus numerantium, vol.15, pp.647-659, 1976. ,
Wavelength assignment to minimize the number of SONET ADMs in WDM rings, IEEE ICC, 2002. ,
On scheduling all-to-all personalized connection and cost-effective designs in WDM rings, IEEE/ACM Transactions on Networking, vol.7, issue.3, pp.435-445, 1996. ,
DOI : 10.1109/90.779215
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