S. Baroni, P. Bayvel, “Wavelength requirements in arbitrarily connected wavelength-routed optical networks,” J. Lightwave Technol., vol 15, pp. 242–251, 1997.

[CrossRef]

M. Stoer, F. Wagner, “A simple min-cut algorithm,” J. ACM, vol. 44, pp. 585–591, 1997.

[CrossRef]

I. Chlamtac, A. Ganz, G. Karmi, “Lightpath communications: an approach to high-bandwidth optical WANs,” IEEE Trans. Commun., vol. 40, pp. 1171–1182, 1992.

[CrossRef]

C. Rose, “Mean internodal distance in regular and random multihop networks,” IEEE Trans. Commun., vol. 40, pp. 1310–1318, 1992.

[CrossRef]

M. Fiedler, “Algebraic connectivity of graphs,” Czech. Math. J., vol. 23, pp. 298–305, 1973.

S. Baroni, P. Bayvel, “Wavelength requirements in arbitrarily connected wavelength-routed optical networks,” J. Lightwave Technol., vol 15, pp. 242–251, 1997.

[CrossRef]

S. Baroni, P. Bayvel, “Wavelength requirements in arbitrarily connected wavelength-routed optical networks,” J. Lightwave Technol., vol 15, pp. 242–251, 1997.

[CrossRef]

D. O’Brien, B. Châtelain, F. Gagnon, C. Tremblay, M. P. Bélanger, É. Bernier, “A dual metaheuristic solution for the min-RWA problem,” in Optical Fiber Communication Conf. and Exposition and Nat. Fiber Optic Engineers Conf., OSA Technical Digest (CD), Washington, DC: Optical Society of America, 2008, paper JThA80.

D. O’Brien, B. Châtelain, F. Gagnon, C. Tremblay, M. P. Bélanger, É. Bernier, “A dual metaheuristic solution for the min-RWA problem,” in Optical Fiber Communication Conf. and Exposition and Nat. Fiber Optic Engineers Conf., OSA Technical Digest (CD), Washington, DC: Optical Society of America, 2008, paper JThA80.

D. O’Brien, B. Châtelain, F. Gagnon, C. Tremblay, M. P. Bélanger, É. Bernier, “A dual metaheuristic solution for the min-RWA problem,” in Optical Fiber Communication Conf. and Exposition and Nat. Fiber Optic Engineers Conf., OSA Technical Digest (CD), Washington, DC: Optical Society of America, 2008, paper JThA80.

I. Chlamtac, A. Ganz, G. Karmi, “Lightpath communications: an approach to high-bandwidth optical WANs,” IEEE Trans. Commun., vol. 40, pp. 1171–1182, 1992.

[CrossRef]

A. S. Rodionov, H. Choo, “On generating random network structures: connected graphs,” in Information Networking, vol. 3090of Lecture Notes in Computer Science, Berlin, Germany: Springer, 2004, pp. 483–491

C. Fenger, E. Limal, U. Gliese, C. J. Mahon, “Statistical study of the correlation between topology and wavelength usage in optical networks with and without conversion,” in Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks, vol. 1815of Lecture Notes in Computer Science, Berlin, Germany: Springer, 2002, pp. 168–175.

[CrossRef]

M. Fiedler, “Algebraic connectivity of graphs,” Czech. Math. J., vol. 23, pp. 298–305, 1973.

D. O’Brien, B. Châtelain, F. Gagnon, C. Tremblay, M. P. Bélanger, É. Bernier, “A dual metaheuristic solution for the min-RWA problem,” in Optical Fiber Communication Conf. and Exposition and Nat. Fiber Optic Engineers Conf., OSA Technical Digest (CD), Washington, DC: Optical Society of America, 2008, paper JThA80.

I. Chlamtac, A. Ganz, G. Karmi, “Lightpath communications: an approach to high-bandwidth optical WANs,” IEEE Trans. Commun., vol. 40, pp. 1171–1182, 1992.

[CrossRef]

C. Fenger, E. Limal, U. Gliese, C. J. Mahon, “Statistical study of the correlation between topology and wavelength usage in optical networks with and without conversion,” in Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks, vol. 1815of Lecture Notes in Computer Science, Berlin, Germany: Springer, 2002, pp. 168–175.

[CrossRef]

I. Chlamtac, A. Ganz, G. Karmi, “Lightpath communications: an approach to high-bandwidth optical WANs,” IEEE Trans. Commun., vol. 40, pp. 1171–1182, 1992.

[CrossRef]

C. Fenger, E. Limal, U. Gliese, C. J. Mahon, “Statistical study of the correlation between topology and wavelength usage in optical networks with and without conversion,” in Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks, vol. 1815of Lecture Notes in Computer Science, Berlin, Germany: Springer, 2002, pp. 168–175.

[CrossRef]

C. Fenger, E. Limal, U. Gliese, C. J. Mahon, “Statistical study of the correlation between topology and wavelength usage in optical networks with and without conversion,” in Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks, vol. 1815of Lecture Notes in Computer Science, Berlin, Germany: Springer, 2002, pp. 168–175.

[CrossRef]

D. O’Brien, B. Châtelain, F. Gagnon, C. Tremblay, M. P. Bélanger, É. Bernier, “A dual metaheuristic solution for the min-RWA problem,” in Optical Fiber Communication Conf. and Exposition and Nat. Fiber Optic Engineers Conf., OSA Technical Digest (CD), Washington, DC: Optical Society of America, 2008, paper JThA80.

A. S. Rodionov, H. Choo, “On generating random network structures: connected graphs,” in Information Networking, vol. 3090of Lecture Notes in Computer Science, Berlin, Germany: Springer, 2004, pp. 483–491

C. Rose, “Mean internodal distance in regular and random multihop networks,” IEEE Trans. Commun., vol. 40, pp. 1310–1318, 1992.

[CrossRef]

M. Stoer, F. Wagner, “A simple min-cut algorithm,” J. ACM, vol. 44, pp. 585–591, 1997.

[CrossRef]

D. O’Brien, B. Châtelain, F. Gagnon, C. Tremblay, M. P. Bélanger, É. Bernier, “A dual metaheuristic solution for the min-RWA problem,” in Optical Fiber Communication Conf. and Exposition and Nat. Fiber Optic Engineers Conf., OSA Technical Digest (CD), Washington, DC: Optical Society of America, 2008, paper JThA80.

M. Stoer, F. Wagner, “A simple min-cut algorithm,” J. ACM, vol. 44, pp. 585–591, 1997.

[CrossRef]

M. Fiedler, “Algebraic connectivity of graphs,” Czech. Math. J., vol. 23, pp. 298–305, 1973.

C. Rose, “Mean internodal distance in regular and random multihop networks,” IEEE Trans. Commun., vol. 40, pp. 1310–1318, 1992.

[CrossRef]

I. Chlamtac, A. Ganz, G. Karmi, “Lightpath communications: an approach to high-bandwidth optical WANs,” IEEE Trans. Commun., vol. 40, pp. 1171–1182, 1992.

[CrossRef]

M. Stoer, F. Wagner, “A simple min-cut algorithm,” J. ACM, vol. 44, pp. 585–591, 1997.

[CrossRef]

S. Baroni, P. Bayvel, “Wavelength requirements in arbitrarily connected wavelength-routed optical networks,” J. Lightwave Technol., vol 15, pp. 242–251, 1997.

[CrossRef]

C. Fenger, E. Limal, U. Gliese, C. J. Mahon, “Statistical study of the correlation between topology and wavelength usage in optical networks with and without conversion,” in Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks, vol. 1815of Lecture Notes in Computer Science, Berlin, Germany: Springer, 2002, pp. 168–175.

[CrossRef]

D. O’Brien, B. Châtelain, F. Gagnon, C. Tremblay, M. P. Bélanger, É. Bernier, “A dual metaheuristic solution for the min-RWA problem,” in Optical Fiber Communication Conf. and Exposition and Nat. Fiber Optic Engineers Conf., OSA Technical Digest (CD), Washington, DC: Optical Society of America, 2008, paper JThA80.

A. S. Rodionov, H. Choo, “On generating random network structures: connected graphs,” in Information Networking, vol. 3090of Lecture Notes in Computer Science, Berlin, Germany: Springer, 2004, pp. 483–491