OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editor: Keren Bergman
  • Vol. 8, Iss. 5 — May. 1, 2009
  • pp: 454–461

Minimizing transceivers in optical path networks

Prashant Iyer, Rudra Dutta, and Carla D. Savage  »View Author Affiliations


Journal of Optical Networking, Vol. 8, Issue 5, pp. 454-461 (2009)
http://dx.doi.org/10.1364/JON.8.000454


View Full Text Article

Acrobat PDF (174 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

The problem of routing traffic on multihop clear optical channels and deciding the virtual topology of optical channels to form on a physical network of fibers to minimize the cost of electronic switching equipment has become known as traffic grooming in optical networks. Traffic grooming is recognized as an important research area, because the joint opto-electric routing problem is a hard one, yet necessary because of the large cost of pure electronic switching. This problem has been shown to be NP-complete (nondeterminstic polynomial complete) even for very simple practical topologies such as a path network. In previous work, we have shown that at least the subproblem of routing traffic on a given virtual topology to minimize electronic switching (NP-hard for path networks with arbitrary traffic matrices) becomes polynomial when the traffic on the path is restricted to be egress traffic, that is, all traffic requests are destined for a single egress node. In that work, the objective was to minimize the raw OEO (opto-electro-optic) metric (number of bits electronically switched per second) totaled over all network nodes. Of late, it has become clear that electronic switching equipment cost is best counted in quantized units, e.g., in the number of transceiver interfaces at network nodes. In this paper, we consider the traffic grooming problem in unidirectional, WDM path networks with the goal of minimizing the number of transceivers. We conclusively show that the problem is NP-hard, even under the restriction of the egress traffic model. In the case of egress traffic, we give a simple heuristic that will never be worse than twice the optimal.

© 2009 Optical Society of America

OCIS Codes
(060.4250) Fiber optics and optical communications : Networks
(060.4510) Fiber optics and optical communications : Optical communications

ToC Category:
Research Papers

History
Original Manuscript: September 19, 2008
Revised Manuscript: February 9, 2009
Manuscript Accepted: March 11, 2009
Published: April 10, 2009

Citation
Prashant Iyer, Rudra Dutta, and Carla D. Savage, "Minimizing transceivers in optical path networks," J. Opt. Netw. 8, 454-461 (2009)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jon-8-5-454

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited