@article{chen_rouskas_dutta_2008, title={On Hierarchical Traffic Grooming in WDM Networks}, volume={16}, ISSN={["1558-2566"]}, DOI={10.1109/TNET.2007.906655}, abstractNote={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.}, number={5}, journal={IEEE-ACM TRANSACTIONS ON NETWORKING}, author={Chen, Bensong and Rouskas, George N. and Dutta, Rudra}, year={2008}, month={Oct}, pages={1226–1238} }
 @article{chen_rouskas_dutta_2006, title={Traffic grooming in WDM ring networks to minimize the maximum electronic port cost.}, volume={2}, number={1}, journal={Optical Switching and Networking}, author={Chen, B. and Rouskas, G. and Dutta, R.}, year={2006}, pages={1–18} }
 @inbook{chen_rouskas_dutta_2005, title={Applying clustering techniques to general topology traffic grooming}, ISBN={0780392779}, booktitle={Proceedings of IEEE / Create-net broadnets 2005}, publisher={Piscataway, N.J.: IEEE}, author={Chen, B. and Rouskas, G. and Dutta, R.}, year={2005}, pages={308–314} }
 @inbook{chen_dutta_rouskas_2005, title={On the application of k-center algorithms in heirarchical traffic grooming}, ISBN={0780392779}, booktitle={Proceedings of the Second International IEEE/Create-net workshop on traffic grooming}, publisher={Los Alamitos, CA: IEEE Computer Society}, author={Chen, B. and Dutta, R. and Rouskas, G.}, year={2005}, pages={167–176} }
 @inbook{chen_rouskas_dutta_2004, title={Traffic grooming in WDM ring networks with the min-max objective}, volume={3042}, ISBN={3540219595}, booktitle={Networking 2004: Networking technologies, services, and protocols: Performance of computer and communication networks, mobile and wireless commuication: Third International IFIP-TC6 Networking Conference, Athens, Greece, May 9-14, 2004 ; Proceedings}, publisher={Berlin; New York: Springer}, author={Chen, B. S. and Rouskas, G. N. and Dutta, R.}, year={2004}, pages={174–185} }
 @inproceedings{chen_rouskas_dutta, title={A framework for hierarchical traffic grooming in WDM networks of general topology}, booktitle={2nd International Conference on Broadband Networks (Broadnets 2005)}, author={Chen, B. S. and Rouskas, G. N. and Dutta, R.}, pages={167-} }
 @inproceedings{chen_dutta_rouskas, title={On the application of k-center algorithms to hierarchical traffic grooming}, booktitle={2nd International Conference on Broadband Networks (Broadnets 2005)}, author={Chen, B. S. and Dutta, R. and Rouskas, G. N.}, pages={295-} }