A Node Clustering Algorithm for the CANON Architecture

In this article, we present an algorithm for clustering a mesh network implementing the Clustering Architecture of Nodes in Optical Networks (CANON). In order to evaluate the impact of the resulting clustering solutions on actual network efficiency, specific cost criteria are used.

[1]  Scott Klasky,et al.  Distributed Grooming in Multi-Domain IP/MPLS-DWDM Networks , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[2]  Mengke Li,et al.  A generic autonomous clustering-based heterogeneous waveband switching architecture in WDM networks , 2006, 2006 Optical Fiber Communication Conference and the National Fiber Optic Engineers Conference.

[3]  A. Stavdas,et al.  Efficient traffic grooming through node clustering , 2012, OFC/NFOEC.

[4]  Lei Guo,et al.  Multi-domain grooming algorithm based on hierarchical integrated multi-granularity auxiliary graph in optical mesh networks , 2011, Photonic Network Communications.

[5]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[6]  Rudra Dutta,et al.  Clustering Methods for Hierarchical Traffic Grooming in Large-Scale Mesh WDM Networks , 2010, IEEE/OSA Journal of Optical Communications and Networking.

[7]  George N. Rouskas,et al.  Clustering for Hierarchical Traffic Grooming in Large Scale Mesh WDM Networks , 2007, ONDM.