Clustering Algorithms
A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
Application of Threshold Partitioning of Sparse Matrices to Markov Chains
IPDS '96 Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96)
On optimal traffic grooming in WDM rings
IEEE Journal on Selected Areas in Communications
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
IEEE Journal on Selected Areas in Communications - Part Supplement
Traffic grooming in WDM networks: past and future
IEEE Network: The Magazine of Global Internetworking
Dynamic resource allocation with service guarantees over large scale optical networks
IEEE Communications Letters
| Hi-index | 0.00 |
We present a clustering algorithm for hierarchical traffic grooming in large WDM networks. In hierarchical grooming, the network is decomposed into clusters, and one hub node in each cluster is responsible for grooming traffic from and to the cluster. Hierarchical grooming scales to large network sizes and facilitates the control and management of traffic and network resources. Yet determining the size and composition of clusters so as to yield good grooming solutions is a challenging task. We identify the grooming-specific factors affecting the selection of clusters, and we develop a parameterized clustering algorithm that can achieve a desired tradeoff among various goals.