OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: K. Bergman and O. Gerstel
  • Vol. 5, Iss. 11 — Nov. 1, 2013
  • pp: 1215–1226

Cost-Optimized Reservation and Routing for Scheduled Traffic in Optical Networks

Hui Ding, Pan Yi, and Byrav Ramamurthy  »View Author Affiliations


Journal of Optical Communications and Networking, Vol. 5, Issue 11, pp. 1215-1226 (2013)
http://dx.doi.org/10.1364/JOCN.5.001215


View Full Text Article

Enhanced HTML    Acrobat PDF (867 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

Connection requests for data-intensive applications can require a specific start time and end time/duration when they are submitted. With the additional time domain information, cost-efficient connections can be established. In this paper, we propose two capital expenditure (CapEx) optimized approaches: the multilayer (ML) approach and a transponder/regenerator reuse (TRR) approach. Integer linear programming (ILP) is used to formulate the routing, wavelength assignment, and regenerator/multiplexer placement problem in a complex multilayer optical network to provide lower bounds for the optimized CapEx value. Due to the time and space complexity of ILP when it deals with large networks and traffic demands, we also propose a greedy heuristic and a tabu-search (TS) heuristic to solve the same problem in a less time- and resource-consuming manner. Finally, we compare the results in terms of computing time and optimized CapEx value across the ILP, greedy heuristic, and TS heuristic methods with the ML approaches for the Internet2 topology and a six-node ring topology. The performance of all three methods with the TRR approach is also tested with the same input traffic, which is composed of a mix of 10, 40, and 100 Gbps demands. The results show 30%–40% less CapEx when comparing ML with TRR. Further, our TS heuristic performs better than the greedy heuristic, and it can achieve near-optimal results compared to the ILPs.

© 2013 Optical Society of America

OCIS Codes
(060.4510) Fiber optics and optical communications : Optical communications
(060.4251) Fiber optics and optical communications : Networks, assignment and routing algorithms
(060.4256) Fiber optics and optical communications : Networks, network optimization

ToC Category:
Research Papers

History
Original Manuscript: May 1, 2013
Revised Manuscript: July 27, 2013
Manuscript Accepted: August 16, 2013
Published: October 23, 2013

Citation
Hui Ding, Pan Yi, and Byrav Ramamurthy, "Cost-Optimized Reservation and Routing for Scheduled Traffic in Optical Networks," J. Opt. Commun. Netw. 5, 1215-1226 (2013)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-5-11-1215

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

You do not have subscription access to this journal. Figure files 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