OSA's Digital Library

Optics Express

Optics Express

  • Editor: C. Martijn de Sterke
  • Vol. 20, Iss. 2 — Jan. 16, 2012
  • pp: 1798–1804

Dynamic on-demand defragmentation in flexible bandwidth elastic optical networks

Yawei Yin, Ke Wen, David J. Geisler, Ruiting Liu, and S. J. B. Yoo  »View Author Affiliations

Optics Express, Vol. 20, Issue 2, pp. 1798-1804 (2012)

View Full Text Article

Enhanced HTML    Acrobat PDF (1436 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools



While flexible bandwidth elastic optical networking is a promising direction for future networks, the spectral fragmentation problem in such a network inevitably raises the blocking probability and significantly degrades network performance. This paper addresses the spectral defragmentation problem using an auxiliary graph based approach, which transforms the problem into a matter of finding the maximum independent set (MIS) in the constructed auxiliary graph. The enabling technologies and defragmentation-capable node architectures, together with heuristic defragmentation algorithms are proposed and evaluated. Simulation results show that the proposed min-cost defragmentation algorithms can significantly reduce the blocking probability of incoming requests in a spectrally fragmented flexible bandwidth optical network, while substantially minimizing the number of disrupted connections.

© 2012 OSA

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

ToC Category:
Backbone and Core Networks

Original Manuscript: October 10, 2011
Manuscript Accepted: November 1, 2011
Published: January 12, 2012

Virtual Issues
European Conference on Optical Communication 2011 (2011) Optics Express

Yawei Yin, Ke Wen, David J. Geisler, Ruiting Liu, and S. J. B. Yoo, "Dynamic on-demand defragmentation in flexible bandwidth elastic optical networks," Opt. Express 20, 1798-1804 (2012)

Sort:  Author  |  Year  |  Journal  |  Reset  


  1. 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.47(11), 66–73 (2009). [CrossRef]
  2. D. J. Geisler, R. Proietti, Y. Yin, R. P. Scott, X. Cai, N. K. Fontaine, L. Paraschis, O. Gerstel, and S. J. B. Yoo, “The First Testbed Demonstration of a Flexible Bandwidth Network with a Real-Time Adaptive Control Plane,” in ECOC 2011, 37th European Conference and Exhibition on Optical Communication(Geneva, Switzerland, 2011), p. Th.13.K.12.
  3. A. N. Patel, P. N. Ji, J. P. Jue, and W. Ting, “Defragmentation of transparent Flexible optical WDM (FWDM) networks,” in Optical Fiber Communication Conference 2011 (Los Angeles, CA, 2011), pp. 1–3.
  4. S. J. B. Yoo, “Wavelength conversion technologies for WDM network applications,” J. Lightwave Technol.14(6), 955–966 (1996). [CrossRef]
  5. T. A. Feo, M. G. C. Resende, and S. H. Smith, “A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set,” Oper. Res.42(5), 860–878 (1994). [CrossRef]
  6. M. Halldórsson and J. Radhakrishnan, “Greed is good: approximating independent sets in sparse and bounded-degree graphs,” in Proceedings of the twenty-sixth annual ACM symposium on Theory of computing(1994), pp. 439–448.
  7. A. Sharieh and W. A. Rawagepfeh, “An algorithm for finding maximum independent set in a graph,” Eur. J. Sci. Res.23, 586–596 (2008).
  8. R. M. Karp and A. Wigderson, “A fast parallel algorithm for the maximum independent set problem,” in Proceedings of the sixteenth annual ACM symposium on Theory of computing(1984).
  9. D. J. Geisler, Y. Yin, K. Wen, N. K. Fontaine, R. P. Scott, S. Chang, and S. J. B. Yoo, IEEE, “Demonstration of Spectral Defragmentation in Flexible Bandwidth Optical Networking by FWM,” accepted for publication in IEEE Photonics Technology Letters (2011).

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.


Fig. 1 Fig. 2 Fig. 3
Fig. 4 Fig. 5

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited