Prashant Iyer

Works (2)

Updated: July 5th, 2023 15:54

2009 journal article

Minimizing transceivers in optical path networks

JOURNAL OF OPTICAL NETWORKING, 8(5), 454–461.

By: P. Iyer n, R. Dutta n  & C. Savage n 

TL;DR: The traffic grooming problem in unidirectional, WDM path networks is considered with the goal of minimizing the number of transceivers and it is conclusively shown that the problem is NP-hard, even under the restriction of the egress traffic model. (via Semantic Scholar)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

2007 journal article

Complexity of path traffic grooming

JOURNAL OF OPTICAL NETWORKING, 6(11), 1270–1281.

By: P. Iyer n, R. Dutta n  & C. Savage n 

TL;DR: The borderline between tractability and intractability is explored by considering grooming in unidirectional path networks in which all traffic requests are destined for a single egress node and it is shown that at least the problem of routing traffic on a given virtual topology to minimize electronic switching becomes polynomial on the egress model. (via Semantic Scholar)
Sources: Web Of Science, 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© (2025) 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.