S. Sankaranarayanan, S. Subramaniam, H. Choi, and H.-A. Choi, “Survivable traffic grooming in WDM optical networks,” J. Commun. Network 9, 93-104 (2007).

J.-C. Bermond, C. J. Colbourn, A. Ling, and M.-L. Yu, “Grooming in unidirectional rings: k4−e designs,” Discrete Math. 284, 57-62 (2004).

[CrossRef]

K. Zhu and B. Mukherjee, “A review of traffic grooming in WDM optical networks: architectures and challenges,” Opt. Networks Mag. 4(2), 55-64 (2003).

N. Brauner, Y. Crama, G. Finke, P. Lemaire, and C. Wynants, “Approximation algorithms for the design of SDH/SONET networks,” RAIRO Oper. Res. 37, 235-247 (2003).

O. Goldschmidt, D. S. Hochbaum, A. Levin, and E. V. Olinick, “The SONET edge-partition problem,” Networks 41, 13-23 (2003).

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

E. Modiano and P. Lin, “Traffic grooming in WDM networks,” IEEE Commun. Mag. 39(7), 124-129 (2001).

[CrossRef]

S. L. Hakimi and O. Kariv, “On a generalization of edge-coloring in graphs,” J. Graph Theory 10, 139-154 (1986).

[CrossRef]

I. Holyer, “The NP-completeness of some edge-partition problems,” SIAM J. Comput. 10, 713-717 (1981).

[CrossRef]

J.-C. Bermond, C. J. Colbourn, A. Ling, and M.-L. Yu, “Grooming in unidirectional rings: k4−e designs,” Discrete Math. 284, 57-62 (2004).

[CrossRef]

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

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

J.-C. Bermond and D. Coudert, “Traffic grooming in unidirectional WDM ring networks using design theory,” in IEEE International Conference on Communications (IEEE, 2003), pp. 1995-2003.

N. Brauner, Y. Crama, G. Finke, P. Lemaire, and C. Wynants, “Approximation algorithms for the design of SDH/SONET networks,” RAIRO Oper. Res. 37, 235-247 (2003).

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

S. Sankaranarayanan, S. Subramaniam, H. Choi, and H.-A. Choi, “Survivable traffic grooming in WDM optical networks,” J. Commun. Network 9, 93-104 (2007).

S. Sankaranarayanan, S. Subramaniam, H. Choi, and H.-A. Choi, “Survivable traffic grooming in WDM optical networks,” J. Commun. Network 9, 93-104 (2007).

J.-C. Bermond, C. J. Colbourn, A. Ling, and M.-L. Yu, “Grooming in unidirectional rings: k4−e designs,” Discrete Math. 284, 57-62 (2004).

[CrossRef]

T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms (McGraw-Hill, 1990).

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

J.-C. Bermond and D. Coudert, “Traffic grooming in unidirectional WDM ring networks using design theory,” in IEEE International Conference on Communications (IEEE, 2003), pp. 1995-2003.

N. Brauner, Y. Crama, G. Finke, P. Lemaire, and C. Wynants, “Approximation algorithms for the design of SDH/SONET networks,” RAIRO Oper. Res. 37, 235-247 (2003).

R. Dutta and G. N. Rouskas, “Traffic grooming in WDM networks: past and future,” IEEE Network 16(6), 46-56 (2002).

N. Brauner, Y. Crama, G. Finke, P. Lemaire, and C. Wynants, “Approximation algorithms for the design of SDH/SONET networks,” RAIRO Oper. Res. 37, 235-247 (2003).

S. Fiorini and R. J. Wilson, Edge-colourings of Graphs, Vol. 16 of Research Notes in Mathematics (Pitman, 1977).

H. N. Gabow, “An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems,” in Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (Association for Computing Machinery, 1983), pp. 448-456.

O. Gerstel, P. Lin, and G. Sasaki, “Combined WDM and SONET network design,” in INFOCOM '99 Eighteenth Annual Joint Conference of the IEEE Communications Societies (IEEE, 1999), pp. 734-743.

O. Goldschmidt, D. S. Hochbaum, A. Levin, and E. V. Olinick, “The SONET edge-partition problem,” Networks 41, 13-23 (2003).

Y. Wang and Q.-P. Gu, “Grooming of symmetric traffic in unidirectional SONET/WDM rings,” in IEEE International Conference on Communications (IEEE, 2006), pp. 2407-2414.

Y. Wang and Q.-P. Gu, “Efficient algorithms for traffic grooming in SONET/WDM networks,” in International Conference on Parallel Processing (IEEE, 2006), pp. 355-364.

S. L. Hakimi and O. Kariv, “On a generalization of edge-coloring in graphs,” J. Graph Theory 10, 139-154 (1986).

[CrossRef]

O. Goldschmidt, D. S. Hochbaum, A. Levin, and E. V. Olinick, “The SONET edge-partition problem,” Networks 41, 13-23 (2003).

I. Holyer, “The NP-completeness of some edge-partition problems,” SIAM J. Comput. 10, 713-717 (1981).

[CrossRef]

S. L. Hakimi and O. Kariv, “On a generalization of edge-coloring in graphs,” J. Graph Theory 10, 139-154 (1986).

[CrossRef]

T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms (McGraw-Hill, 1990).

N. Brauner, Y. Crama, G. Finke, P. Lemaire, and C. Wynants, “Approximation algorithms for the design of SDH/SONET networks,” RAIRO Oper. Res. 37, 235-247 (2003).

O. Goldschmidt, D. S. Hochbaum, A. Levin, and E. V. Olinick, “The SONET edge-partition problem,” Networks 41, 13-23 (2003).

E. Modiano and P. Lin, “Traffic grooming in WDM networks,” IEEE Commun. Mag. 39(7), 124-129 (2001).

[CrossRef]

O. Gerstel, P. Lin, and G. Sasaki, “Combined WDM and SONET network design,” in INFOCOM '99 Eighteenth Annual Joint Conference of the IEEE Communications Societies (IEEE, 1999), pp. 734-743.

J.-C. Bermond, C. J. Colbourn, A. Ling, and M.-L. Yu, “Grooming in unidirectional rings: k4−e designs,” Discrete Math. 284, 57-62 (2004).

[CrossRef]

K. Zhu and B. Mukherjee, “A review of traffic grooming in WDM optical networks: architectures and challenges,” Opt. Networks Mag. 4(2), 55-64 (2003).

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

O. Goldschmidt, D. S. Hochbaum, A. Levin, and E. V. Olinick, “The SONET edge-partition problem,” Networks 41, 13-23 (2003).

X. Zhang and C. Qiao, “An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings,” IEEE/ACM Trans. Netw. 8, 608-617 (2000).

[CrossRef]

T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms (McGraw-Hill, 1990).

R. Dutta and G. N. Rouskas, “Traffic grooming in WDM networks: past and future,” IEEE Network 16(6), 46-56 (2002).

S. Sankaranarayanan, S. Subramaniam, H. Choi, and H.-A. Choi, “Survivable traffic grooming in WDM optical networks,” J. Commun. Network 9, 93-104 (2007).

O. Gerstel, P. Lin, and G. Sasaki, “Combined WDM and SONET network design,” in INFOCOM '99 Eighteenth Annual Joint Conference of the IEEE Communications Societies (IEEE, 1999), pp. 734-743.

A. K. Somani, “Survivable traffic grooming in WDM networks,” in Proceedings of the International Conference on Broad-Band Optical Fibre Communication Technology (BBOFCT'01) (2001), pp. 17-45.

S. Sankaranarayanan, S. Subramaniam, H. Choi, and H.-A. Choi, “Survivable traffic grooming in WDM optical networks,” J. Commun. Network 9, 93-104 (2007).

Y. Wang and Q.-P. Gu, “Efficient algorithms for traffic grooming in SONET/WDM networks,” in International Conference on Parallel Processing (IEEE, 2006), pp. 355-364.

Y. Wang and Q.-P. Gu, “Grooming of symmetric traffic in unidirectional SONET/WDM rings,” in IEEE International Conference on Communications (IEEE, 2006), pp. 2407-2414.

D. B. West, Introduction to Graph Theory (Prentice Hall, 1996).

S. Fiorini and R. J. Wilson, Edge-colourings of Graphs, Vol. 16 of Research Notes in Mathematics (Pitman, 1977).

N. Brauner, Y. Crama, G. Finke, P. Lemaire, and C. Wynants, “Approximation algorithms for the design of SDH/SONET networks,” RAIRO Oper. Res. 37, 235-247 (2003).

J.-C. Bermond, C. J. Colbourn, A. Ling, and M.-L. Yu, “Grooming in unidirectional rings: k4−e designs,” Discrete Math. 284, 57-62 (2004).

[CrossRef]

X. Zhang and C. Qiao, “An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings,” IEEE/ACM Trans. Netw. 8, 608-617 (2000).

[CrossRef]

K. Zhu and B. Mukherjee, “A review of traffic grooming in WDM optical networks: architectures and challenges,” Opt. Networks Mag. 4(2), 55-64 (2003).

J.-C. Bermond, C. J. Colbourn, A. Ling, and M.-L. Yu, “Grooming in unidirectional rings: k4−e designs,” Discrete Math. 284, 57-62 (2004).

[CrossRef]

E. Modiano and P. Lin, “Traffic grooming in WDM networks,” IEEE Commun. Mag. 39(7), 124-129 (2001).

[CrossRef]

R. Dutta and G. N. Rouskas, “Traffic grooming in WDM networks: past and future,” IEEE Network 16(6), 46-56 (2002).

X. Zhang and C. Qiao, “An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings,” IEEE/ACM Trans. Netw. 8, 608-617 (2000).

[CrossRef]

S. Sankaranarayanan, S. Subramaniam, H. Choi, and H.-A. Choi, “Survivable traffic grooming in WDM optical networks,” J. Commun. Network 9, 93-104 (2007).

S. L. Hakimi and O. Kariv, “On a generalization of edge-coloring in graphs,” J. Graph Theory 10, 139-154 (1986).

[CrossRef]

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

O. Goldschmidt, D. S. Hochbaum, A. Levin, and E. V. Olinick, “The SONET edge-partition problem,” Networks 41, 13-23 (2003).

K. Zhu and B. Mukherjee, “A review of traffic grooming in WDM optical networks: architectures and challenges,” Opt. Networks Mag. 4(2), 55-64 (2003).

N. Brauner, Y. Crama, G. Finke, P. Lemaire, and C. Wynants, “Approximation algorithms for the design of SDH/SONET networks,” RAIRO Oper. Res. 37, 235-247 (2003).

I. Holyer, “The NP-completeness of some edge-partition problems,” SIAM J. Comput. 10, 713-717 (1981).

[CrossRef]

S. Fiorini and R. J. Wilson, Edge-colourings of Graphs, Vol. 16 of Research Notes in Mathematics (Pitman, 1977).

T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms (McGraw-Hill, 1990).

Y. Wang and Q.-P. Gu, “Grooming of symmetric traffic in unidirectional SONET/WDM rings,” in IEEE International Conference on Communications (IEEE, 2006), pp. 2407-2414.

Y. Wang and Q.-P. Gu, “Efficient algorithms for traffic grooming in SONET/WDM networks,” in International Conference on Parallel Processing (IEEE, 2006), pp. 355-364.

O. Gerstel, P. Lin, and G. Sasaki, “Combined WDM and SONET network design,” in INFOCOM '99 Eighteenth Annual Joint Conference of the IEEE Communications Societies (IEEE, 1999), pp. 734-743.

J.-C. Bermond and D. Coudert, “Traffic grooming in unidirectional WDM ring networks using design theory,” in IEEE International Conference on Communications (IEEE, 2003), pp. 1995-2003.

A. K. Somani, “Survivable traffic grooming in WDM networks,” in Proceedings of the International Conference on Broad-Band Optical Fibre Communication Technology (BBOFCT'01) (2001), pp. 17-45.

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

D. B. West, Introduction to Graph Theory (Prentice Hall, 1996).

H. N. Gabow, “An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems,” in Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (Association for Computing Machinery, 1983), pp. 448-456.