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


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. M. Jinno, H. Takara, B. Kozicki, Y. Tsukishima, T. Yoshimatsu, T. Kobayashi, Y. Miyamoto, K. Yonenaga, A. Takada, and O. Ishida, “Demonstration of novel spectrum-efficient elastic optical path network with per-channel variable capacity of 40  Gb/s to over 400  Gb/s,” in Proc. European Conf. on Optical Communication, Belgium, 2008.
  2. M. Jinno, H. Takara, and B. Kozicki, “Concept and enabling technologies of spectrum-sliced elastic optical path network (SLICE),” in Communications and Photonics Conf. and Expo., Shanghai, China, 2009.
  3. M. Jinno, H. Takara, B. Kozicki, Y. Tsukishima, Y. Sone, and S. Matsuoka, “Spectrum-efficient and scalable elastic optical path network: Architecture, benefits, and enabling technologies,” IEEE Commun. Mag., vol.  47, pp. 66–73, 2009. [CrossRef]
  4. M. Jinno, B. Kozicki, H. Takara, A. Watanabe, Y. Sone, T. Tanaka, and A. Hirano, “Distance-adaptive spectrum resource allocation in spectrum-sliced elastic optical path network,” IEEE Commun. Mag., vol.  48, pp. 138–145, 2010. [CrossRef]
  5. T. Takagi, H. Hasegawa, K. Sato, T. Tanaka, B. Kozicki, Y. Sone, and M. Jinno, “Algorithms for maximizing spectral efficiency in elastic optical path networks that adopt distance adaptive modulation,” in Proc. European Conf. on Optical Communication, Turin, Italy, 2010.
  6. Y. Wang, X. Cao, and Y. Pan, “A study of the routing and allocation in spectrum-sliced elastic optical path networks,” in Proc. INFOCOM (IEEE), Shanghai, China, 2011, pp. 1503–1511.
  7. K. Christodoulopoulos, I. Tomkos, and E. Varvarigos, “Dynamic bandwidth allocation in flexible OFDM-based networks,” in Optical Fiber Communication Conf. and the Nat. Fiber Optic Engineers Conf. (OFC/NFOEC), Los Angeles, 2011.
  8. K. Christodoulopoulos, I. Tomkos, and E. Varvarigos, “Elastic bandwidth allocation in flexible OFDM-based optical networks,” J. Lightwave Technol., vol.  29, pp. 1354–1366, 2011. [CrossRef]
  9. B. Chen, J. Zhang, Y. Zhao, C. Lv, W. Zhang, S. Huang, X. Zhang, and W. Gu, “Multi-link failure restoration with dynamic load balancing in spectrum-elastic optical path networks,” Opt. Fiber Technol., vol.  18, no. 1, pp. 21–28, 2012. [CrossRef]
  10. A. N. Patel, P. N. Ji, J. P. Jue, and T. Wang, “Routing, wavelength assignment, and spectrum allocation algorithms in transparent flexible optical WDM networks,” Opt. Switching Netw., vol.  9, no. 3, pp. 191–204, 2012. [CrossRef]
  11. X. Wan, N. Hua, and X. Zheng, “Dynamic routing and spectrum assignment in spectrum-flexible transparent optical networks,” J. Opt. Commun. Netw., vol.  4, no. 8, pp. 603–613, 2012. [CrossRef]
  12. A. N. Patel, P. N. Ji, J. P. Jue, and T. Wang, “Defragmentation of transparent flexible optical WDM (FWDM) networks,” in Optical Fiber Communication Conf. and the Nat. Fiber Optic Engineers Conf. (OFC/NFOEC), Los Angeles, 2011.
  13. D. J. Geisler, Y. Yin, K. Wen, N. K. Fontaine, R. P. Scott, S. Chang, and S. J. B. Yoo, “Demonstration of spectral defragmentation in flexible bandwidth optical networking by FWM,” IEEE Photon. Technol. Lett., vol.  23, no. 24, pp. 1893–1895, 2011. [CrossRef]
  14. Y. Yin, K. Wen, D. J. Geisler, R. Liu, and S. J. B. Yoo, “Dynamic on-demand defragmentation in flexible bandwidth elastic optical networks,” Opt. Express, vol.  20, no. 2, pp. 1798–1804, 2012. [CrossRef]
  15. F. Cugini, M. Secondini, N. Sambo, G. Bottari, G. Bruno, P. Iovanna, and P. Castoldi, “Push–pull technique for defragmentation in flexible optical networks,” in Optical Fiber Communication Conf. and the Nat. Fiber Optic Engineers Conf. (OFC/NFOEC), Los Angeles, 2012.
  16. W. Xi, K. Inwoong, Z. Qiong, P. Paparao, and S. Motoyoshi, “A hitless defragmentation method for self-optimizing flexible grid optical networks,” in Optical Fiber Communication Conf. and the Nat. Fiber Optic Engineers Conf. (OFC/NFOEC), Los Angeles, 2012.
  17. X. Yu, J. Zhang, Y. Zhao, T. Peng, Y. Bai, D. Wang, and X. Lin, “Compactness based defragmentation in flexible bandwidth optical networks,” in Optical Fiber Communication Conf. and the Nat. Fiber Optic Engineers Conf. (OFC/NFOEC), Los Angeles, 2012.
  18. Y. Wang, J. Zhang, Y. Zhao, J. Zhang, J. Zhao, X. Wang, and W. Gu, “Dynamic spectral defragmentation based on path connectivity in flexible bandwidth networks,” in Proc. European Conf. on Optical Communication, Amsterdam, 2012.
  19. B. Chen, J. Zhang, Y. Zhao, H. Chen, S. Huang, W. Gu, and J. P. Jue, “Minimized spectral resource consumption with rescaled failure probability constraint in flexible bandwidth optical networks,” in Optical Fiber Communication Conf. and the Nat. Fiber Optic Engineers Conf. (OFC/NFOEC), Anaheim, CA, 2013.
  20. B. Chen, J. Zhang, Y. Zhao, J. Liu, S. Huang, W. Gu, and J. P. Jue, “Spectrum block consumption for shared-path protection with joint failure probability in flexible bandwidth optical networks,” in Optical Fiber Communication Conf. and the Nat. Fiber Optic Engineers Conf. (OFC/NFOEC), Anaheim, CA, 2013.
  21. H. W. Lee, E. Modiano, and K. Lee, “Diverse routing in networks with probabilistic failures,” IEEE/ACM Trans. Netw., vol.  18, no. 6, pp. 1895–1907, 2010. [CrossRef]
  22. Q. She, X. Huang, and J. P. Jue, “Maximum survivability under multiple failures,” in Optical Fiber Communication Conf. (OFC), Anaheim, CA, 2006.
  23. Q. She, X. Huang, and J. P. Jue, “Maximum survivability using two disjoint paths under multiple failures in mesh networks,” in Proc. Global Communications Conf. (GLOBECOM), San Fransisco, CA, 2006.
  24. Q. She, X. Huang, and J. P. Jue, “How reliable can two-path protection be?” IEEE/ACM Trans. Netw., vol.  18, no. 3, pp. 922–933, 2010. [CrossRef]
  25. J. Zhang, K. Zhu, H. Zang, N. S. Matloff, and B. Mukherjee, “Availability-aware provisioning strategies for differentiated protection services in wavelength-convertible WDM mesh networks,” IEEE/ACM Trans. Netw., vol.  15, no. 5, pp. 1177–1190, 2007. [CrossRef]
  26. M. Xia, M. Tornatore, C. U. Martel, and B. Mukherjee, “Risk-aware provisioning for optical WDM mesh networks,” IEEE/ACM Trans. Netw., vol.  19, no. 3, pp. 921–931, 2011. [CrossRef]
  27. W. Cui, I. Stoica, and R. H. Katz, “Backup path allocation based on a correlated link failure probability model in overlay networks,” in Proc. Int. Conf. on Network Protocols (ICNP), Paris, 2002.
  28. X. Jun, C. You, X. Chang, and Y. Yang, “A novel shared-link protection algorithm with correlated link failure probability for dual-link failure,” Photon. Netw. Commun., vol.  19, no. 1, pp. 74–80, 2010. [CrossRef]
  29. J. Zhang, C. Lv, Y. Zhao, B. Chen, X. Li, and W. Gu, “A novel shared-path protection algorithm with correlated risk against multiple failures in flexible bandwidth optical networks,” Opt. Fiber Technol., vol.  18, no. 6, pp. 532–540, 2012. [CrossRef]

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited