Works (7)

Updated: July 5th, 2023 15:51

2008 journal article

On Hierarchical Traffic Grooming in WDM Networks

IEEE-ACM TRANSACTIONS ON NETWORKING, 16(5), 1226–1238.

By: B. Chen*, G. Rouskas n & R. Dutta n

Contributors: B. Chen*, R. Dutta n & G. Rouskas n

author keywords: Hierarchical traffic grooming; K-center; optical networks; wavelength division multiplexing (WDM)
TL;DR: Comparisons to lower bounds indicate that hierarchical grooming is efficient in its use of the network resources of interest, namely, electronic ports and wavelengths. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries, ORCID
Added: August 6, 2018

2006 journal article

Traffic grooming in WDM ring networks to minimize the maximum electronic port cost.

Optical Switching and Networking, 2(1), 1–18.

By: B. Chen, G. Rouskas & R. Dutta

Source: NC State University Libraries
Added: August 6, 2018

2005 chapter

Applying clustering techniques to general topology traffic grooming

In Proceedings of IEEE / Create-net broadnets 2005 (pp. 308–314). Piscataway, N.J.: IEEE.

By: B. Chen, G. Rouskas & R. Dutta

Source: NC State University Libraries
Added: August 6, 2018

2005 chapter

On the application of k-center algorithms in heirarchical traffic grooming

In Proceedings of the Second International IEEE/Create-net workshop on traffic grooming (pp. 167–176). Los Alamitos, CA: IEEE Computer Society.

By: B. Chen, R. Dutta & G. Rouskas

Source: NC State University Libraries
Added: August 6, 2018

2004 chapter

Traffic grooming in WDM ring networks with the min-max objective

In 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 (Vol. 3042, pp. 174–185). Berlin; New York: Springer.

By: B. Chen, G. Rouskas & R. Dutta

Source: NC State University Libraries
Added: August 6, 2018

conference paper

A framework for hierarchical traffic grooming in WDM networks of general topology

Chen, B. S., Rouskas, G. N., & Dutta, R. 2nd International Conference on Broadband Networks (Broadnets 2005), 167-.

By: B. Chen, G. Rouskas & R. Dutta

Source: NC State University Libraries
Added: August 6, 2018

conference paper

On the application of k-center algorithms to hierarchical traffic grooming

Chen, B. S., Dutta, R., & Rouskas, G. N. 2nd International Conference on Broadband Networks (Broadnets 2005), 295-.

By: B. Chen, R. Dutta & G. Rouskas

Source: NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.