A unified approach to approximation algorithms for bottleneck problems
Journal of the ACM (JACM)
How to allocate network centers
Journal of Algorithms
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Cost-effective traffic grooming in WDM rings
IEEE/ACM Transactions on Networking (TON)
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)
Hierarchical traffic grooming in large-scale wdm networks
Hierarchical traffic grooming in large-scale wdm networks
Grooming of arbitrary traffic in SONET/WDM BLSRs
IEEE Journal on Selected Areas in Communications
On optimal traffic grooming in WDM rings
IEEE Journal on Selected Areas in Communications
Traffic grooming in an optical WDM mesh network
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
Multi-layer MPLS network design: The impact of statistical multiplexing
Computer Networks: The International Journal of Computer and Telecommunications Networking
WDM network traffic grooming using clusters
HONET'09 Proceedings of the 6th international conference on High capacity optical networks and enabling technologies
Approximation algorithms for many-to-many traffic grooming in WDM mesh networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Effect of sparse grooming on power consumption of optical networks
Proceedings of the 1st Workshop on Green Computing
Design and provisioning of WDM networks with many-to-many traffic grooming
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for many-to-many traffic grooming in optical WDM networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any but trivial network topologies. In this work, we present an effective and efficient hierarchical traffic grooming framework for WDM networks of general topology, with the objective of minimizing the total number of electronic ports. At the first level of hierarchy, we decompose the network into clusters and designate one node in each cluster as the hub for grooming traffic. At the second level, the hubs form another cluster for grooming intercluster traffic. We view each (first-or second-level) cluster as a virtual star, and we present an efficient near-optimal algorithm for determining the logical topology of lightpaths to carry the traffic within each cluster. Routing and wavelength assignment is then performed directly on the underlying physical topology. We demonstrate the effectiveness of our approach by applying it to two networks of realistic size, a 32-node, 53-link topology and a 47-node, 96-link network. Comparisons to lower bounds indicate that hierarchical grooming is efficient in its use of the network resources of interest, namely, electronic ports and wavelengths. In addition to scaling to large network sizes, our hierarchical approach also facilitates the control and management of multigranular networks.