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. 9 — Sep. 1, 2013
  • pp: 980–993

Minimized Spectrum Resource Consumption With Rescaled Failure Probability Constraint in Flexible Bandwidth Optical Networks

Jie Zhang, Bowen Chen, Yongli Zhao, Haining Chen, Wei Zhang, Xin Li, Jason P. Jue, Shanguo Huang, and Wanyi Gu  »View Author Affiliations


Journal of Optical Communications and Networking, Vol. 5, Issue 9, pp. 980-993 (2013)
http://dx.doi.org/10.1364/JOCN.5.000980


View Full Text Article

Enhanced HTML    Acrobat PDF (1431 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

We investigate the problem of minimizing spectrum resource consumption for a set of connection requests in a flexible bandwidth optical network under the constraint that the failure probability of each connection must be below a specified threshold. To optimize the total frequency slots consumed, three schemes are proposed and evaluated: the rescaled failure-probability-aware algorithm (RFPA), the traffic cognition algorithm with rescaled failure probability (RFPTC), and an integer linear programming (ILP) model. We also introduce two traditional Dijkstra’s algorithms with load balancing and spectrum assignment by first fit and traffic cognition (FF_DB and TC_DB) to compare with the proposed three schemes. For static traffic in a small network, the total frequency slots consumed by the RFPA and RFPTC algorithms will approach that of the optimal ILP solution as K increases, as well as the average hops (AH). Furthermore, the average rescaled failure probabilities (RFPs) of the RFPA and RFPTC algorithms are much better than those of the ILP solutions. In addition, similarly, the results of the heuristic algorithms, FF_DB, TC_DB, RFPA, and RFPTC, in the large network have the same characteristics as in the small network. For dynamic traffic in a large network, the RFPTC algorithm reduces blocking probability and makes the best use of spectrum resources compared with the other schemes, which also reflects that discontinuous spectrum fragmentation is greatly reduced by the traffic cognition method. However, both RFPTC and RFPA result in much higher average RFP but perform fewer AH compared to TC_DB and FF_DB.

© 2013 Optical Society of America

OCIS Codes
(060.4250) Fiber optics and optical communications : Networks
(060.4251) Fiber optics and optical communications : Networks, assignment and routing algorithms
(060.4257) Fiber optics and optical communications : Networks, network survivability
(060.4261) Fiber optics and optical communications : Networks, protection and restoration

ToC Category:
Research Papers

History
Original Manuscript: February 26, 2013
Revised Manuscript: July 6, 2013
Manuscript Accepted: July 8, 2013
Published: August 14, 2013

Citation
Jie Zhang, Bowen Chen, Yongli Zhao, Haining Chen, Wei Zhang, Xin Li, Jason P. Jue, Shanguo Huang, and Wanyi Gu, "Minimized Spectrum Resource Consumption With Rescaled Failure Probability Constraint in Flexible Bandwidth Optical Networks," J. Opt. Commun. Netw. 5, 980-993 (2013)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-5-9-980

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