OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: K. Bergman and V. Chan
  • Vol. 2, Iss. 12 — Dec. 1, 2010
  • pp: 1010–1021

Lightpath Reconfiguration in WDM Networks

Fernando Solano and Michał Pióro  »View Author Affiliations

Journal of Optical Communications and Networking, Vol. 2, Issue 12, pp. 1010-1021 (2010)

View Full Text Article

Enhanced HTML    Acrobat PDF (666 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools



Lightpath reconfiguration is a networking task that can be performed in order to improve resource utilization. The lightpath reconfiguration problem becomes nontrivial when a new set of lightpaths requires the release of resources previously seized by the (working) lightpaths currently in place, but, in order to ensure continuity of the traffic flow, the working lightpaths cannot be torn down before the new ones are set up. Under this condition the reconfiguration can fall into a deadlock state, and deadlocks can only be solved by temporary disruption of some connections. At this point, traffic disruptions are necessary, and network operators must compensate customers with penalty fees for the service disruption. In this paper we focus on minimizing the number of simultaneously disrupted connections at any time during the reconfiguration process. In this paper, we propose a mixed-integer program (MIP) model, an exact algorithm, and a heuristic for solving the problem considering our objective.

© 2010 Optical Society of America

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:
Research Papers

Original Manuscript: February 18, 2010
Revised Manuscript: September 2, 2010
Manuscript Accepted: September 15, 2010
Published: November 15, 2010

Fernando Solano and Michał Pióro, "Lightpath Reconfiguration in WDM Networks," J. Opt. Commun. Netw. 2, 1010-1021 (2010)

Sort:  Author  |  Year  |  Journal  |  Reset  


  1. A. Farrel, J.-P. Vaseur, J. Ash, “A Path Computation Element (PCE)-Based Architecture,” IETF, RFC 4655, Aug. 2006.
  2. ITU-T, “Architecture for the Automatically Switched Optical Network (ASON),” ITU-T Recommendation G.8080/Y.1304, 2001.
  3. E. Mannie, “Generalized Multi-Protocol Label Switching (GMPLS) Architecture,” IETF, RFC 3945, Oct. 2004.
  4. Y. Lee, J.-L. Le Roux, D. King, E. Oki, “Path Computation Element Communication Protocol (PCEP) Requirements and Protocol Extensions in Support of Global Concurrent Optimization,” IETF, Internet Draft, July 2008, draft-lee-pce-global-concurrent-optimization-04.
  5. M. Saad, Z.-Q. Luo, “Reconfiguration with no service disruption in multifiber WDM networks,” J. Lightwave Technol., vol. 23, no. 10, pp. 3092–3104, Oct. 2005. [CrossRef]
  6. A. Gencata, B. Mukherjee, “Virtual-topology adaptation for WDM mesh networks under dynamic traffic,” IEEE/ACM Trans. Netw., vol. 11, no. 2, pp. 236–247, Apr. 2003. [CrossRef]
  7. N. Jose, A. Somani, “Connection rerouting/network reconfiguration,” in IEEE Design of Reliable Communication Networks (DRCN), Banff, Canada, 2003, pp. 23–30.
  8. D. Coudert, S. Pérennes, Q.-C. Pham, J.-S. Sereni, “Rerouting requests in WDM networks,” in AlgoTel’05, Presqu’le de Giens, France, 2005, pp. 17–20.
  9. D. Coudert, D. Mazauric, “Network reconfiguration using cops-and-robber games,” INRIA, Research Report RR-6694, 2008.
  10. N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, N. Nisse, “Tradeoffs in process strategy games with application in the WDM reconfiguration problem,” in 5th Int. Conf. on Fun With Algorithms (FUN), Italy, 2010.
  11. D. Coudert, F. Huc, D. Mazauric, N. Nisse, J.-S. Sereni, “Reconfiguration of the routing in WDM networks with two classes of services,” in ONDM 2009, Braunschweig, Germany, 2009.
  12. D. Banerjee, B. Mukherjee, “Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study,” IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 598–607, Oct. 2000. [CrossRef]
  13. H. Zang, J. Jue, B. Mukherjeee, “A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks,” Opt. Networks Mag., vol. 1, no. 1, pp. 47–60, Jan. 2000.
  14. K. Zhu, B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 122–133, Jan. 2002. [CrossRef]
  15. E. Modiano, P. J. Lin, “Traffic grooming in WDM networks,” IEEE Commun. Mag., vol. 39, no. 7, pp. 124–129, July 2001. [CrossRef]
  16. C. Xin, C. Qiao, S. Dixit, “Traffic grooming in mesh WDM optical networks—performance analysis,” IEEE J. Sel. Areas Commun., vol. 22, no. 9, pp. 1658–1669, Nov. 2004. [CrossRef]
  17. F. Solano, L. Caro, J. de Oliveira, R. Fabregat, J. Marzo, “G+: enhanced traffic grooming in WDM mesh networks using lighttours,” IEEE J. Sel. Areas Commun., vol. 25, no. 5, pp. 1034–1047, June 2007. [CrossRef]
  18. F. Solano, “Analyzing two different objectives of the WDM lightpath reconfiguration problem,” in IEEE GLOBECOM 2009, Honolulu, HI, 2009.
  19. H.-M. Lin, J.-Y. Jou, “Computing minimum feedback vertex sets by contraction operations and its applications on CAD,” in IEEE Int. Conf. on Computer Design (ICCD), Austin, TX, 1999, pp. 364–369.
  20. M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). W. H. Freeman, 1979.
  21. M. Pioro, D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers, 2004.

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.

Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited