OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: K. Bergman and O. Gerstel
  • Vol. 4, Iss. 11 — Nov. 1, 2012
  • pp: 906–917

Towards Elastic and Fine-Granular Bandwidth Allocation in Spectrum-Sliced Optical Networks

Yang Wang, Xiaojun Cao, Qian Hu, and Yi Pan  »View Author Affiliations

Journal of Optical Communications and Networking, Vol. 4, Issue 11, pp. 906-917 (2012)

View Full Text Article

Enhanced HTML    Acrobat PDF (639 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools



To overcome the inefficiency of the rigid frequency allocation in traditional wavelength division multiplexing (WDM) networks, the idea of slicing the optical spectrum for elastic and flexible bandwidth allocation has attracted significant interest recently. The resulting network, namely, the spectrum-sliced elastic optical path (SLICE) network, can facilitate both the super-wavelength and sub-wavelength traffic accommodation by allocating an appropriate number of sub-carriers. Compared to traditional wavelength routed WDM networks (WRNs), SLICE networks have the advantages of higher spectrum efficiency (through the elimination of spectrum gaps or guard-bands when possible) and better signal quality (by overcoming various impairments), thanks to the orthogonal frequency division multiplexing technology. To accommodate traffic demands in SLICE networks, the process of routing and spectrum allocation (RSA) has to be employed, which is different from and more challenging than the traditional routing and wavelength assignment problem in WRNs. In this work, we comprehensively study the RSA problem assuming the presence of known static or off-line traffic. We formally define the static RSA problem and show the NP-hardness of the optimal RSA problem. Integer linear programing models are then formulated to achieve different optimization goals in SLICE networks. We further analyze the lower/upper bound of the spectrum resources (i.e., sub-carriers) in SLICE networks with uniform traffic demands. To efficiently resolve the RSA problem in a large-scale network, we also propose two efficient algorithms, namely, the shortest path with maximum spectrum reuse algorithm, and the balanced load spectrum allocation algorithm, to minimize the required number of sub-carriers in a SLICE network. Our results show that the proposed algorithms can match the analysis and approximate the optimal solutions from the integer linear programing model.

© 2012 OSA

OCIS Codes
(350.0350) Other areas of optics : Other areas of optics
(350.4600) Other areas of optics : Optical engineering

ToC Category:
Regular Papers

Original Manuscript: July 20, 2012
Revised Manuscript: September 2, 2012
Manuscript Accepted: September 2, 2012
Published: October 31, 2012

Yang Wang, Xiaojun Cao, Qian Hu, and Yi Pan, "Towards Elastic and Fine-Granular Bandwidth Allocation in Spectrum-Sliced Optical Networks," J. Opt. Commun. Netw. 4, 906-917 (2012)

Sort:  Author  |  Year  |  Journal  |  Reset  


  1. R. Ramaswami, K. N. Sivarajan, and G. Sasaki, Optical Networks: A Practical Perspective. Morgan Kaufmann, 2009.
  2. B. Mukherjee, Optical Communication Networks. Springer-Verlag, New York, 2006.
  3. Y. K. Chen, Y. Baeyens, R. Hamm, G. Georgiou, C.-T. Liu, R. Kopf, J.-M. Kuo, Y. Yang, H. Maynard, N. Weimann, C. Chen, A. Tate, J. Frackoviak, M. Melendes, and R. Reyes, “Applications of compound semiconductors in high data rate optical fiber communications,” in Proc. of the Int. Conf. on Compound Semiconductor Manufacturing Technology, 2001.
  4. M. Jinno, H. Takara, and B. Kozichi, “Dynamic optical mesh networks: Drivers, challenges, and solutions for the future,” in Proc. of ECOC, 2009, pp. 1–5.
  5. M. Jinno, H. Takara, B. Kozichi, Y. Tsukishima, and Y. Sone, “Spectrum-efficient and scalable elastic optical path network: Architecture, benefits, and enabling technologies,” IEEE Commun. Mag., vol. 47, pp. 66–73, 2009. [CrossRef]
  6. M. Jinno, H. Takara, and B. Kozichi, “Filtering characteristics of highly-spectrum efficient spectrum-sliced elastic optical path (SLICE) network,” in Proc. of OFC, 2009, JWa43.
  7. M. Jinno, B. Kozichi, 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]
  8. Y. Wang, X. Cao, and Y. Pan, “A study of the routing and spectrum allocation problem in the spectrum-sliced elastic optical path networks,” in Proc. of IEEE INFOCOM, 2011, pp. 1–9.
  9. I. Chlamtac, A. Ganz, and G. Karmi, “Lightpath communications: An approach to high bandwidth optical WAN’s,” IEEE Trans. Commun., vol. 40, no. 7, pp. 1171–1182, 1992. [CrossRef]
  10. N. Nagatsu, Y. Hamazumi, and K. Sato, “Optical path accommodation on designs applicable to large scale networks,” IEICE Trans. Commun., vol. E78-B, pp. 597–607, 1995.
  11. M. A. S. Subramaniam and A. K. Somani, “All-optical networks with sparse wavelength conversion,” IEEE/ACM Trans. Netw., vol. 4, pp. 544–547, 1996. [CrossRef]
  12. S. Baroni and P. Bayvel, “Wavelength requirements in arbitrarily connected wavelength-routed optical networks,” J. Lightwave Technol., vol. 15, pp. 242–251, 1997. [CrossRef]
  13. S. Baroni, “Routing and wavelength allocation in WDM optical networks,” Ph.D. Thesis, Department of Electronic and Electrical Engineering, University College London, 1998.
  14. O. Gerstel, G. Sasaki, S. Kutten, and R. Ramaswami, “Worst-case analysis of dynamic wavelength allocation in optical networks,” IEEE Trans. Netw., vol. 7, pp. 833–845, 1999. [CrossRef]
  15. H. Zang, J. Jue, and B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, pp. 47–60, Jan.2000.
  16. X. Cao, V. Anand, Y. Xiong, and C. Qiao, “A study of waveband switching with multi-layer multi-granular optical cross-connects,” IEEE J. Sel. Areas Commun., vol. 21, no. 7, pp. 1081–1095, Sept.2003. [CrossRef]
  17. R. Izmailov, S. Ganguly, V. Kleptsyn, and A. Varsou, “Non-uniform waveband hierarchy in hybrid optical networks,” in Proc. of IEEE INFOCOM, 2003, vol. II.
  18. L. Chen, P. Saengudomlert, and E. Modiano, “Uniform vs. non-uniform band switching in WDM networks,” in Broadband Networks, 2005, pp. 204–213.
  19. K. Christodoulopoulos, I. Tomkos, and E. Varvarigos, “Routing and spectrum allocation in OFDM-based optical networks with elastic bandwidth allocation,” in Proc. of IEEE GLOBECOM, 2010, pp. 1–6.
  20. M. Klinkowski and K. Walkowiak, “Routing and spectrum assignment in spectrum sliced elastic optical path network,” IEEE Commun. Lett., vol. 15, no. 8, pp. 884–886, Aug.2011. [CrossRef]
  21. Y. Sone, A. Watanabe, W. Imajuku, Y. Tsukishima, B. Kozicki, H. Takara, and M. Jinno, “Highly survivable restoration scheme employing optical bandwidth squeezing in spectrum-sliced elastic optical path SLICE network,” in Proc. of OFC, 2009, pp. 1–3.
  22. M. Jinno, Y. Tsukishima, H. Takara, B. Kozichi, Y. Sone, and T. Sakano, “Virtualized optical network (VON) for future Internet and applications,” IEICE Trans. Commun. Mag., vol. E93-B, pp. 470–477, 2010. [CrossRef]
  23. W. Shieh, H. Bao, and Y. Tang, “Coherent optical OFDM: Theory and design,” Opt. Express, vol. 16, pp. 841–859, 2008. [CrossRef] [PubMed]
  24. R. Ryf, Y. Su, L. Moller, S. Chandrasekhar, X. Liu, D. T. Neilson, and C. R. Giles, “Wavelength blocking filter with flexible data rates and channel spacing,” J. Lightwave Technol., vol. 23, pp. 54–61, 2005. [CrossRef]
  25. G. Baxter, S. Frisken, D. Abakoumov, H. Zhou, I. Clarke, A. Bartos, and S. Poole, “Highly programmable wavelength selective switch based on liquid crystal on silicon switching elements,” in Proc. of OFC, 2006, OTuF.
  26. D. J. A. Welsh and M. B. Powell, “An upper bound for the chromatic number of a graph and its application to timetabling problems,” Comput. J., vol. 10, pp. 85–86, 1967. [CrossRef]
  27. R. L. Brooks and W. T. Tutte, “On colouring the nodes of a network,” Proc. Cambridge Philos. Soc., vol. 37, pp. 194–197, 1941. [CrossRef]
  28. J. Yen, “Finding the k shortest loopless paths in a network,” Manage. Sci., vol. 17, no. 11, pp. 712–716, 1971. [CrossRef]
  29. ILOG CPLEX [Online]. Available: http://www.ilog.com/.

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