J.-C. Bermond, C. J. Colbourn, L. Gionfriddo, G. Quattrocchi, I. Sau, “Drop cost and wavelength optimal two-period grooming with ratio 4,” SIAM J. Discrete Mathematics, vol. 24, pp. 400–419, 2010.

[CrossRef]

W. Yao, B. Ramamurthy, “Rerouting schemes for dynamic traffic grooming in optical WDM networks,” Comput. Netw., vol. 52, pp. 1891–1904, 2008.

[CrossRef]

Y. Wang, Q.-P. Gu, “Maximum throughput traffic grooming in optical networks,” J. Opt. Netw., vol. 7, pp. 895–904, 2008.

[CrossRef]

C. J. Colbourn, G. Quattrocchi, V. R. Syrotiuk, “Grooming for two-period optical networks,” Networks, vol. 58, pp. 307–324, 2008.

[CrossRef]

P. Adams, D. Bryant, M. Buchanan, “A survey on the existence of G-designs,” J. Comb. Designs, vol. 16, pp. 373–410, 2008.

[CrossRef]

P. Dukes, A. C. H. Ling, “Asymptotic existence of resolvable graph designs,” Can. Math. Bull., vol. 50, no. 4, pp. 504–518, 2007.

[CrossRef]

P. Prathombutr, J. Stach, E. K. Park, “An algorithm for traffic grooming in WDM optical mesh networks with multiple objectives,” Telecommun. Syst., vol. 28, no. 3,4, pp. 369–386, 2005.

[CrossRef]

N. Srinivas, C. S. R. Murthy, “Throughput maximization in traffic grooming in WDM mesh networks,” J. High Speed Networks, vol. 13, pp. 139–154, 2004.

J.-C. Bermond, C. J. Colbourn, A. C. H. Ling, M. L. Yu, “Grooming in unidirectional rings: K4−e designs,” Discrete Math., vol. 284, pp. 67–72, 2004.

[CrossRef]

J.-C. Bermond, S. Ceroi, “Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3,” Networks, vol. 41, pp. 83–86, 2003.

[CrossRef]

O. Goldschmidt, D. Hochbaum, A. Levin, E. Olinick, “The SONET edge-partition problem,” Networks, vol. 41, pp. 13–23, 2003.

[CrossRef]

J. Hu, “Optimal traffic grooming for wavelength-division-multiplexing rings with all-to-all uniform traffic,” J. Opt. Netw., vol. 1, no. 1, pp. 32–42, 2002.

R. Dutta, N. Rouskas, “Traffic grooming in WDM networks: past and future,” IEEE Network, vol. 16, no. 6, pp. 46–56, 2002.

[CrossRef]

K. Zhu, B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 122–133, 2002.

[CrossRef]

E. Modiano, P. Lin, “Traffic grooming in WDM networks,” IEEE Commun. Mag., vol. 39, no. 7, pp. 124–129, 2001.

[CrossRef]

R. Berry, E. Modiano, “Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic,” IEEE J. Sel. Areas Commun., vol. 18, pp. 1961–1971, 2000.

[CrossRef]

L. D. Andersen, A. J. W. Hilton, E. Mendelsohn, “Embedding partial Steiner triple systems,” Proc. London Math. Soc., vol. 41, no. 3, pp. 557–576, 1980.

[CrossRef]

D. de Werra, “Equitable colorations of graphs,” Rev. Fr. Inform. Rech. Oper., vol. 5, no. 3, pp. 3–8, 1971.

P. Adams, D. Bryant, M. Buchanan, “A survey on the existence of G-designs,” J. Comb. Designs, vol. 16, pp. 373–410, 2008.

[CrossRef]

L. D. Andersen, A. J. W. Hilton, E. Mendelsohn, “Embedding partial Steiner triple systems,” Proc. London Math. Soc., vol. 41, no. 3, pp. 557–576, 1980.

[CrossRef]

J.-C. Bermond, C. J. Colbourn, L. Gionfriddo, G. Quattrocchi, I. Sau, “Drop cost and wavelength optimal two-period grooming with ratio 4,” SIAM J. Discrete Mathematics, vol. 24, pp. 400–419, 2010.

[CrossRef]

J.-C. Bermond, C. J. Colbourn, A. C. H. Ling, M. L. Yu, “Grooming in unidirectional rings: K4−e designs,” Discrete Math., vol. 284, pp. 67–72, 2004.

[CrossRef]

J.-C. Bermond, S. Ceroi, “Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3,” Networks, vol. 41, pp. 83–86, 2003.

[CrossRef]

J.-C. Bermond, D. Coudert, X. Muñoz, “Traffic grooming in unidirectional WDM ring networks: the all-to-all unitary case,” in ONDM’03: 7th IFIP Working Conf. on Optical Network Design and Modelling, 2003, pp. 1135–1153.

J.-C. Bermond, D. Coudert, “Traffic grooming in unidirectional WDM ring networks using design theory,” in IEEE Conf. on Communication (ICC’03), Los Alamitos, CA, 2003, vol. 2, pp. 1402–1406.

R. Berry, E. Modiano, “Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic,” IEEE J. Sel. Areas Commun., vol. 18, pp. 1961–1971, 2000.

[CrossRef]

P. Adams, D. Bryant, M. Buchanan, “A survey on the existence of G-designs,” J. Comb. Designs, vol. 16, pp. 373–410, 2008.

[CrossRef]

P. Adams, D. Bryant, M. Buchanan, “A survey on the existence of G-designs,” J. Comb. Designs, vol. 16, pp. 373–410, 2008.

[CrossRef]

J.-C. Bermond, S. Ceroi, “Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3,” Networks, vol. 41, pp. 83–86, 2003.

[CrossRef]

J.-C. Bermond, C. J. Colbourn, L. Gionfriddo, G. Quattrocchi, I. Sau, “Drop cost and wavelength optimal two-period grooming with ratio 4,” SIAM J. Discrete Mathematics, vol. 24, pp. 400–419, 2010.

[CrossRef]

C. J. Colbourn, G. Quattrocchi, V. R. Syrotiuk, “Grooming for two-period optical networks,” Networks, vol. 58, pp. 307–324, 2008.

[CrossRef]

J.-C. Bermond, C. J. Colbourn, A. C. H. Ling, M. L. Yu, “Grooming in unidirectional rings: K4−e designs,” Discrete Math., vol. 284, pp. 67–72, 2004.

[CrossRef]

C. J. Colbourn, G. Ge, A. C. H. Ling, “Optimal grooming with grooming ratio nine,” Discrete Math., to be published.

C. J. Colbourn, A. Rosa, Triple Systems. Oxford: Oxford U. Press, 1999.

N. S. C. Correia, M. C. R. Medeiros, “Traffic grooming applied to network protection: throughput and grooming port cost analysis,” in Proc. of the 7th Int. Conf. on Transparent Optical Networks (ICTON’05), 2005, pp. 389–393.

J.-C. Bermond, D. Coudert, “Traffic grooming in unidirectional WDM ring networks using design theory,” in IEEE Conf. on Communication (ICC’03), Los Alamitos, CA, 2003, vol. 2, pp. 1402–1406.

J.-C. Bermond, D. Coudert, X. Muñoz, “Traffic grooming in unidirectional WDM ring networks: the all-to-all unitary case,” in ONDM’03: 7th IFIP Working Conf. on Optical Network Design and Modelling, 2003, pp. 1135–1153.

D. de Werra, “Equitable colorations of graphs,” Rev. Fr. Inform. Rech. Oper., vol. 5, no. 3, pp. 3–8, 1971.

P. Dukes, A. C. H. Ling, “Asymptotic existence of resolvable graph designs,” Can. Math. Bull., vol. 50, no. 4, pp. 504–518, 2007.

[CrossRef]

R. Dutta, N. Rouskas, “Traffic grooming in WDM networks: past and future,” IEEE Network, vol. 16, no. 6, pp. 46–56, 2002.

[CrossRef]

C. J. Colbourn, G. Ge, A. C. H. Ling, “Optimal grooming with grooming ratio nine,” Discrete Math., to be published.

J.-C. Bermond, C. J. Colbourn, L. Gionfriddo, G. Quattrocchi, I. Sau, “Drop cost and wavelength optimal two-period grooming with ratio 4,” SIAM J. Discrete Mathematics, vol. 24, pp. 400–419, 2010.

[CrossRef]

O. Goldschmidt, D. Hochbaum, A. Levin, E. Olinick, “The SONET edge-partition problem,” Networks, vol. 41, pp. 13–23, 2003.

[CrossRef]

L. D. Andersen, A. J. W. Hilton, E. Mendelsohn, “Embedding partial Steiner triple systems,” Proc. London Math. Soc., vol. 41, no. 3, pp. 557–576, 1980.

[CrossRef]

O. Goldschmidt, D. Hochbaum, A. Levin, E. Olinick, “The SONET edge-partition problem,” Networks, vol. 41, pp. 13–23, 2003.

[CrossRef]

O. Goldschmidt, D. Hochbaum, A. Levin, E. Olinick, “The SONET edge-partition problem,” Networks, vol. 41, pp. 13–23, 2003.

[CrossRef]

E. Modiano, P. Lin, “Traffic grooming in WDM networks,” IEEE Commun. Mag., vol. 39, no. 7, pp. 124–129, 2001.

[CrossRef]

P. Dukes, A. C. H. Ling, “Asymptotic existence of resolvable graph designs,” Can. Math. Bull., vol. 50, no. 4, pp. 504–518, 2007.

[CrossRef]

J.-C. Bermond, C. J. Colbourn, A. C. H. Ling, M. L. Yu, “Grooming in unidirectional rings: K4−e designs,” Discrete Math., vol. 284, pp. 67–72, 2004.

[CrossRef]

C. J. Colbourn, G. Ge, A. C. H. Ling, “Optimal grooming with grooming ratio nine,” Discrete Math., to be published.

N. S. C. Correia, M. C. R. Medeiros, “Traffic grooming applied to network protection: throughput and grooming port cost analysis,” in Proc. of the 7th Int. Conf. on Transparent Optical Networks (ICTON’05), 2005, pp. 389–393.

L. D. Andersen, A. J. W. Hilton, E. Mendelsohn, “Embedding partial Steiner triple systems,” Proc. London Math. Soc., vol. 41, no. 3, pp. 557–576, 1980.

[CrossRef]

E. Modiano, P. Lin, “Traffic grooming in WDM networks,” IEEE Commun. Mag., vol. 39, no. 7, pp. 124–129, 2001.

[CrossRef]

R. Berry, E. Modiano, “Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic,” IEEE J. Sel. Areas Commun., vol. 18, pp. 1961–1971, 2000.

[CrossRef]

K. Zhu, B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 122–133, 2002.

[CrossRef]

J.-C. Bermond, D. Coudert, X. Muñoz, “Traffic grooming in unidirectional WDM ring networks: the all-to-all unitary case,” in ONDM’03: 7th IFIP Working Conf. on Optical Network Design and Modelling, 2003, pp. 1135–1153.

N. Srinivas, C. S. R. Murthy, “Throughput maximization in traffic grooming in WDM mesh networks,” J. High Speed Networks, vol. 13, pp. 139–154, 2004.

O. Goldschmidt, D. Hochbaum, A. Levin, E. Olinick, “The SONET edge-partition problem,” Networks, vol. 41, pp. 13–23, 2003.

[CrossRef]

P. Prathombutr, J. Stach, E. K. Park, “An algorithm for traffic grooming in WDM optical mesh networks with multiple objectives,” Telecommun. Syst., vol. 28, no. 3,4, pp. 369–386, 2005.

[CrossRef]

P. Prathombutr, J. Stach, E. K. Park, “An algorithm for traffic grooming in WDM optical mesh networks with multiple objectives,” Telecommun. Syst., vol. 28, no. 3,4, pp. 369–386, 2005.

[CrossRef]

J.-C. Bermond, C. J. Colbourn, L. Gionfriddo, G. Quattrocchi, I. Sau, “Drop cost and wavelength optimal two-period grooming with ratio 4,” SIAM J. Discrete Mathematics, vol. 24, pp. 400–419, 2010.

[CrossRef]

C. J. Colbourn, G. Quattrocchi, V. R. Syrotiuk, “Grooming for two-period optical networks,” Networks, vol. 58, pp. 307–324, 2008.

[CrossRef]

W. Yao, B. Ramamurthy, “Rerouting schemes for dynamic traffic grooming in optical WDM networks,” Comput. Netw., vol. 52, pp. 1891–1904, 2008.

[CrossRef]

C. J. Colbourn, A. Rosa, Triple Systems. Oxford: Oxford U. Press, 1999.

R. Dutta, N. Rouskas, “Traffic grooming in WDM networks: past and future,” IEEE Network, vol. 16, no. 6, pp. 46–56, 2002.

[CrossRef]

J.-C. Bermond, C. J. Colbourn, L. Gionfriddo, G. Quattrocchi, I. Sau, “Drop cost and wavelength optimal two-period grooming with ratio 4,” SIAM J. Discrete Mathematics, vol. 24, pp. 400–419, 2010.

[CrossRef]

N. Srinivas, C. S. R. Murthy, “Throughput maximization in traffic grooming in WDM mesh networks,” J. High Speed Networks, vol. 13, pp. 139–154, 2004.

P. Prathombutr, J. Stach, E. K. Park, “An algorithm for traffic grooming in WDM optical mesh networks with multiple objectives,” Telecommun. Syst., vol. 28, no. 3,4, pp. 369–386, 2005.

[CrossRef]

C. J. Colbourn, G. Quattrocchi, V. R. Syrotiuk, “Grooming for two-period optical networks,” Networks, vol. 58, pp. 307–324, 2008.

[CrossRef]

P. J. Wan, Multichannel Optical Networks. Norwell, MA: Kluwer Academic, 2000.

W. Yao, B. Ramamurthy, “Rerouting schemes for dynamic traffic grooming in optical WDM networks,” Comput. Netw., vol. 52, pp. 1891–1904, 2008.

[CrossRef]

E. B. Yavorskii, “Representations of directed graphs and ψ-transformations,” in Theoretical and Applied Questions of Differential Equations and Algebra, A. N. Sharkovskii, Ed. Naukova Dumka, 1978, pp. 247–250.

J.-C. Bermond, C. J. Colbourn, A. C. H. Ling, M. L. Yu, “Grooming in unidirectional rings: K4−e designs,” Discrete Math., vol. 284, pp. 67–72, 2004.

[CrossRef]

K. Zhu, B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 122–133, 2002.

[CrossRef]

P. Dukes, A. C. H. Ling, “Asymptotic existence of resolvable graph designs,” Can. Math. Bull., vol. 50, no. 4, pp. 504–518, 2007.

[CrossRef]

W. Yao, B. Ramamurthy, “Rerouting schemes for dynamic traffic grooming in optical WDM networks,” Comput. Netw., vol. 52, pp. 1891–1904, 2008.

[CrossRef]

J.-C. Bermond, C. J. Colbourn, A. C. H. Ling, M. L. Yu, “Grooming in unidirectional rings: K4−e designs,” Discrete Math., vol. 284, pp. 67–72, 2004.

[CrossRef]

C. J. Colbourn, G. Ge, A. C. H. Ling, “Optimal grooming with grooming ratio nine,” Discrete Math., to be published.

E. Modiano, P. Lin, “Traffic grooming in WDM networks,” IEEE Commun. Mag., vol. 39, no. 7, pp. 124–129, 2001.

[CrossRef]

R. Berry, E. Modiano, “Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic,” IEEE J. Sel. Areas Commun., vol. 18, pp. 1961–1971, 2000.

[CrossRef]

K. Zhu, B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 122–133, 2002.

[CrossRef]

R. Dutta, N. Rouskas, “Traffic grooming in WDM networks: past and future,” IEEE Network, vol. 16, no. 6, pp. 46–56, 2002.

[CrossRef]

P. Adams, D. Bryant, M. Buchanan, “A survey on the existence of G-designs,” J. Comb. Designs, vol. 16, pp. 373–410, 2008.

[CrossRef]

N. Srinivas, C. S. R. Murthy, “Throughput maximization in traffic grooming in WDM mesh networks,” J. High Speed Networks, vol. 13, pp. 139–154, 2004.

Y. Wang, Q.-P. Gu, “Maximum throughput traffic grooming in optical networks,” J. Opt. Netw., vol. 7, pp. 895–904, 2008.

[CrossRef]

J. Hu, “Optimal traffic grooming for wavelength-division-multiplexing rings with all-to-all uniform traffic,” J. Opt. Netw., vol. 1, no. 1, pp. 32–42, 2002.

C. J. Colbourn, G. Quattrocchi, V. R. Syrotiuk, “Grooming for two-period optical networks,” Networks, vol. 58, pp. 307–324, 2008.

[CrossRef]

O. Goldschmidt, D. Hochbaum, A. Levin, E. Olinick, “The SONET edge-partition problem,” Networks, vol. 41, pp. 13–23, 2003.

[CrossRef]

J.-C. Bermond, S. Ceroi, “Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3,” Networks, vol. 41, pp. 83–86, 2003.

[CrossRef]

L. D. Andersen, A. J. W. Hilton, E. Mendelsohn, “Embedding partial Steiner triple systems,” Proc. London Math. Soc., vol. 41, no. 3, pp. 557–576, 1980.

[CrossRef]

D. de Werra, “Equitable colorations of graphs,” Rev. Fr. Inform. Rech. Oper., vol. 5, no. 3, pp. 3–8, 1971.

J.-C. Bermond, C. J. Colbourn, L. Gionfriddo, G. Quattrocchi, I. Sau, “Drop cost and wavelength optimal two-period grooming with ratio 4,” SIAM J. Discrete Mathematics, vol. 24, pp. 400–419, 2010.

[CrossRef]

P. Prathombutr, J. Stach, E. K. Park, “An algorithm for traffic grooming in WDM optical mesh networks with multiple objectives,” Telecommun. Syst., vol. 28, no. 3,4, pp. 369–386, 2005.

[CrossRef]

E. B. Yavorskii, “Representations of directed graphs and ψ-transformations,” in Theoretical and Applied Questions of Differential Equations and Algebra, A. N. Sharkovskii, Ed. Naukova Dumka, 1978, pp. 247–250.

C. J. Colbourn, A. Rosa, Triple Systems. Oxford: Oxford U. Press, 1999.

N. S. C. Correia, M. C. R. Medeiros, “Traffic grooming applied to network protection: throughput and grooming port cost analysis,” in Proc. of the 7th Int. Conf. on Transparent Optical Networks (ICTON’05), 2005, pp. 389–393.

P. J. Wan, Multichannel Optical Networks. Norwell, MA: Kluwer Academic, 2000.

J.-C. Bermond, D. Coudert, “Traffic grooming in unidirectional WDM ring networks using design theory,” in IEEE Conf. on Communication (ICC’03), Los Alamitos, CA, 2003, vol. 2, pp. 1402–1406.

J.-C. Bermond, D. Coudert, X. Muñoz, “Traffic grooming in unidirectional WDM ring networks: the all-to-all unitary case,” in ONDM’03: 7th IFIP Working Conf. on Optical Network Design and Modelling, 2003, pp. 1135–1153.